1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC 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 GNU CC 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 GNU CC; 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. */
38 #define obstack_chunk_alloc xmalloc
39 #define obstack_chunk_free free
41 /* The number of nested classes being processed. If we are not in the
42 scope of any class, this is zero. */
44 int current_class_depth;
46 /* In order to deal with nested classes, we keep a stack of classes.
47 The topmost entry is the innermost class, and is the entry at index
48 CURRENT_CLASS_DEPTH */
50 typedef struct class_stack_node {
51 /* The name of the class. */
54 /* The _TYPE node for the class. */
57 /* The access specifier pending for new declarations in the scope of
61 /* If were defining TYPE, the names used in this class. */
62 splay_tree names_used;
63 }* class_stack_node_t;
65 typedef struct vtbl_init_data_s
67 /* The base for which we're building initializers. */
69 /* The binfo for the most-derived type. */
71 /* The negative-index vtable initializers built up so far. These
72 are in order from least negative index to most negative index. */
74 /* The last (i.e., most negative entry in INITS. */
76 /* The binfo for the virtual base for which we're building
77 vcall offset initializers. */
79 /* The functions in vbase for which we have already provided vcall
82 /* The vtable index of the next vcall or vbase offset. */
84 /* Nonzero if we are building the initializer for the primary
87 /* Nonzero if we are building the initializer for a construction
92 /* The stack itself. This is an dynamically resized array. The
93 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
94 static int current_class_stack_size;
95 static class_stack_node_t current_class_stack;
97 /* An array of all local classes present in this translation unit, in
99 varray_type local_classes;
101 static tree get_vfield_name PARAMS ((tree));
102 static void finish_struct_anon PARAMS ((tree));
103 static tree build_vbase_pointer PARAMS ((tree, tree));
104 static tree build_vtable_entry PARAMS ((tree, tree, tree, int));
105 static tree get_vtable_name PARAMS ((tree));
106 static tree get_derived_offset PARAMS ((tree, tree));
107 static tree get_basefndecls PARAMS ((tree, tree));
108 static int build_primary_vtable PARAMS ((tree, tree));
109 static int build_secondary_vtable PARAMS ((tree, tree));
110 static tree dfs_finish_vtbls PARAMS ((tree, void *));
111 static tree dfs_accumulate_vtbl_inits PARAMS ((tree, tree, tree, tree,
113 static void finish_vtbls PARAMS ((tree));
114 static void modify_vtable_entry PARAMS ((tree, tree, tree, tree, tree *));
115 static void add_virtual_function PARAMS ((tree *, tree *, int *, tree, tree));
116 static tree delete_duplicate_fields_1 PARAMS ((tree, tree));
117 static void delete_duplicate_fields PARAMS ((tree));
118 static void finish_struct_bits PARAMS ((tree));
119 static int alter_access PARAMS ((tree, tree, tree));
120 static void handle_using_decl PARAMS ((tree, tree));
121 static int same_signature_p PARAMS ((tree, tree));
122 static int strictly_overrides PARAMS ((tree, tree));
123 static void mark_overriders PARAMS ((tree, tree));
124 static void check_for_override PARAMS ((tree, tree));
125 static tree dfs_modify_vtables PARAMS ((tree, void *));
126 static tree modify_all_vtables PARAMS ((tree, int *, tree));
127 static void determine_primary_base PARAMS ((tree, int *));
128 static void finish_struct_methods PARAMS ((tree));
129 static void maybe_warn_about_overly_private_class PARAMS ((tree));
130 static int field_decl_cmp PARAMS ((const tree *, const tree *));
131 static int method_name_cmp PARAMS ((const tree *, const tree *));
132 static tree add_implicitly_declared_members PARAMS ((tree, int, int, int));
133 static tree fixed_type_or_null PARAMS ((tree, int *));
134 static tree resolve_address_of_overloaded_function PARAMS ((tree, tree, int,
136 static void build_vtable_entry_ref PARAMS ((tree, tree, tree));
137 static tree build_vtbl_initializer PARAMS ((tree, tree, tree, tree, int *));
138 static int count_fields PARAMS ((tree));
139 static int add_fields_to_vec PARAMS ((tree, tree, int));
140 static void check_bitfield_decl PARAMS ((tree));
141 static void check_field_decl PARAMS ((tree, tree, int *, int *, int *, int *));
142 static void check_field_decls PARAMS ((tree, tree *, int *, int *, int *,
144 static void build_base_field PARAMS ((record_layout_info, tree, int *,
145 unsigned int *, varray_type *));
146 static varray_type build_base_fields PARAMS ((record_layout_info, int *));
147 static tree build_vbase_pointer_fields PARAMS ((record_layout_info, int *));
148 static tree build_vtbl_or_vbase_field PARAMS ((tree, tree, tree, tree, tree,
150 static void check_methods PARAMS ((tree));
151 static void remove_zero_width_bit_fields PARAMS ((tree));
152 static void check_bases PARAMS ((tree, int *, int *, int *));
153 static void check_bases_and_members PARAMS ((tree, int *));
154 static tree create_vtable_ptr PARAMS ((tree, int *, int *, tree *, tree *));
155 static void layout_class_type PARAMS ((tree, int *, int *, tree *, tree *));
156 static void fixup_pending_inline PARAMS ((struct pending_inline *));
157 static void fixup_inline_methods PARAMS ((tree));
158 static void set_primary_base PARAMS ((tree, tree, int *));
159 static void propagate_binfo_offsets PARAMS ((tree, tree));
160 static void layout_virtual_bases PARAMS ((tree, varray_type *));
161 static tree dfs_set_offset_for_unshared_vbases PARAMS ((tree, void *));
162 static void build_vbase_offset_vtbl_entries PARAMS ((tree, vtbl_init_data *));
163 static void add_vcall_offset_vtbl_entries_r PARAMS ((tree, vtbl_init_data *));
164 static void add_vcall_offset_vtbl_entries_1 PARAMS ((tree, vtbl_init_data *));
165 static void build_vcall_offset_vtbl_entries PARAMS ((tree, vtbl_init_data *));
166 static void layout_vtable_decl PARAMS ((tree, int));
167 static tree dfs_find_final_overrider PARAMS ((tree, void *));
168 static tree find_final_overrider PARAMS ((tree, tree, tree));
169 static int make_new_vtable PARAMS ((tree, tree));
170 static void dump_class_hierarchy_r PARAMS ((tree, tree, int));
171 extern void dump_class_hierarchy PARAMS ((tree));
172 static tree build_vtable PARAMS ((tree, tree, tree));
173 static void initialize_vtable PARAMS ((tree, tree));
174 static void initialize_array PARAMS ((tree, tree));
175 static void layout_nonempty_base_or_field PARAMS ((record_layout_info,
178 static tree dfs_record_base_offsets PARAMS ((tree, void *));
179 static void record_base_offsets PARAMS ((tree, varray_type *));
180 static tree dfs_search_base_offsets PARAMS ((tree, void *));
181 static int layout_conflict_p PARAMS ((tree, varray_type));
182 static unsigned HOST_WIDE_INT end_of_class PARAMS ((tree, int));
183 static void layout_empty_base PARAMS ((tree, tree, varray_type));
184 static void accumulate_vtbl_inits PARAMS ((tree, tree, tree, tree, tree));
185 static void set_vindex PARAMS ((tree, tree, int *));
186 static void build_rtti_vtbl_entries PARAMS ((tree, tree, vtbl_init_data *));
187 static void build_vcall_and_vbase_vtbl_entries PARAMS ((tree,
189 static tree dfs_mark_primary_bases PARAMS ((tree, void *));
190 static void mark_primary_bases PARAMS ((tree));
191 static void clone_constructors_and_destructors PARAMS ((tree));
192 static tree build_clone PARAMS ((tree, tree));
193 static void update_vtable_entry_for_fn PARAMS ((tree, tree, tree, tree *));
194 static tree copy_virtuals PARAMS ((tree));
195 static void build_ctor_vtbl_group PARAMS ((tree, tree));
196 static void build_vtt PARAMS ((tree));
197 static tree *build_vtt_inits PARAMS ((tree, tree, int, tree *, tree *));
198 static tree dfs_build_secondary_vptr_vtt_inits PARAMS ((tree, void *));
199 static tree dfs_fixup_binfo_vtbls PARAMS ((tree, void *));
200 static tree get_matching_base PARAMS ((tree, tree));
201 static tree dfs_get_primary_binfo PARAMS ((tree, void*));
203 /* Variables shared between class.c and call.c. */
205 #ifdef GATHER_STATISTICS
207 int n_vtable_entries = 0;
208 int n_vtable_searches = 0;
209 int n_vtable_elems = 0;
210 int n_convert_harshness = 0;
211 int n_compute_conversion_costs = 0;
212 int n_build_method_call = 0;
213 int n_inner_fields_searched = 0;
216 /* Virtual base class layout. */
218 /* Returns a list of virtual base class pointers as a chain of
222 build_vbase_pointer_fields (rli, empty_p)
223 record_layout_info rli;
226 /* Chain to hold all the new FIELD_DECLs which point at virtual
229 tree vbase_decls = NULL_TREE;
230 tree binfos = TYPE_BINFO_BASETYPES (rec);
231 int n_baseclasses = CLASSTYPE_N_BASECLASSES (rec);
235 /* Under the new ABI, there are no vbase pointers in the object.
236 Instead, the offsets are stored in the vtable. */
237 if (vbase_offsets_in_vtable_p ())
240 /* Loop over the baseclasses, adding vbase pointers as needed. */
241 for (i = 0; i < n_baseclasses; i++)
243 register tree base_binfo = TREE_VEC_ELT (binfos, i);
244 register tree basetype = BINFO_TYPE (base_binfo);
246 if (!COMPLETE_TYPE_P (basetype))
247 /* This error is now reported in xref_tag, thus giving better
248 location information. */
251 /* All basetypes are recorded in the association list of the
254 if (TREE_VIA_VIRTUAL (base_binfo))
259 /* The offset for a virtual base class is only used in computing
260 virtual function tables and for initializing virtual base
261 pointers. It is built once `get_vbase_types' is called. */
263 /* If this basetype can come from another vbase pointer
264 without an additional indirection, we will share
265 that pointer. If an indirection is involved, we
266 make our own pointer. */
267 for (j = 0; j < n_baseclasses; j++)
269 tree other_base_binfo = TREE_VEC_ELT (binfos, j);
270 if (! TREE_VIA_VIRTUAL (other_base_binfo)
271 && binfo_for_vbase (basetype, BINFO_TYPE (other_base_binfo)))
274 FORMAT_VBASE_NAME (name, basetype);
275 decl = build_vtbl_or_vbase_field (get_identifier (name),
276 get_identifier (VTABLE_BASE),
277 build_pointer_type (basetype),
281 BINFO_VPTR_FIELD (base_binfo) = decl;
282 TREE_CHAIN (decl) = vbase_decls;
283 place_field (rli, decl);
288 /* The space this decl occupies has already been accounted for. */
296 /* Returns a pointer to the virtual base class of EXP that has the
297 indicated TYPE. EXP is of class type, not a pointer type. */
300 build_vbase_pointer (exp, type)
303 if (vbase_offsets_in_vtable_p ())
308 /* Find the shared copy of TYPE; that's where the vtable offset
310 vbase = binfo_for_vbase (type, TREE_TYPE (exp));
311 /* Find the virtual function table pointer. */
312 vbase_ptr = build_vfield_ref (exp, TREE_TYPE (exp));
313 /* Compute the location where the offset will lie. */
314 vbase_ptr = build (PLUS_EXPR,
315 TREE_TYPE (vbase_ptr),
317 BINFO_VPTR_FIELD (vbase));
318 vbase_ptr = build1 (NOP_EXPR,
319 build_pointer_type (ptrdiff_type_node),
321 /* Add the contents of this location to EXP. */
322 return build (PLUS_EXPR,
323 build_pointer_type (type),
324 build_unary_op (ADDR_EXPR, exp, /*noconvert=*/0),
325 build1 (INDIRECT_REF, ptrdiff_type_node, vbase_ptr));
330 FORMAT_VBASE_NAME (name, type);
331 return build_component_ref (exp, get_identifier (name), NULL_TREE, 0);
335 /* Build multi-level access to EXPR using hierarchy path PATH.
336 CODE is PLUS_EXPR if we are going with the grain,
337 and MINUS_EXPR if we are not (in which case, we cannot traverse
338 virtual baseclass links).
340 TYPE is the type we want this path to have on exit.
342 NONNULL is non-zero if we know (for any reason) that EXPR is
343 not, in fact, zero. */
346 build_vbase_path (code, type, expr, path, nonnull)
348 tree type, expr, path;
351 register int changed = 0;
352 tree last = NULL_TREE, last_virtual = NULL_TREE;
354 tree null_expr = 0, nonnull_expr;
356 tree offset = integer_zero_node;
358 if (BINFO_INHERITANCE_CHAIN (path) == NULL_TREE)
359 return build1 (NOP_EXPR, type, expr);
361 /* We could do better if we had additional logic to convert back to the
362 unconverted type (the static type of the complete object), and then
363 convert back to the type we want. Until that is done, we only optimize
364 if the complete type is the same type as expr has. */
365 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
367 if (!fixed_type_p && TREE_SIDE_EFFECTS (expr))
368 expr = save_expr (expr);
371 path = reverse_path (path);
373 basetype = BINFO_TYPE (path);
377 if (TREE_VIA_VIRTUAL (TREE_VALUE (path)))
379 last_virtual = BINFO_TYPE (TREE_VALUE (path));
380 if (code == PLUS_EXPR)
382 changed = ! fixed_type_p;
388 /* We already check for ambiguous things in the caller, just
392 tree binfo = get_binfo (last, TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (nonnull_expr))), 0);
393 nonnull_expr = convert_pointer_to_real (binfo, nonnull_expr);
395 ind = build_indirect_ref (nonnull_expr, NULL_PTR);
396 nonnull_expr = build_vbase_pointer (ind, last_virtual);
398 && TREE_CODE (type) == POINTER_TYPE
399 && null_expr == NULL_TREE)
401 null_expr = build1 (NOP_EXPR, build_pointer_type (last_virtual), integer_zero_node);
402 expr = build (COND_EXPR, build_pointer_type (last_virtual),
403 build (EQ_EXPR, boolean_type_node, expr,
405 null_expr, nonnull_expr);
408 /* else we'll figure out the offset below. */
410 /* Happens in the case of parse errors. */
411 if (nonnull_expr == error_mark_node)
412 return error_mark_node;
416 cp_error ("cannot cast up from virtual baseclass `%T'",
418 return error_mark_node;
421 last = TREE_VALUE (path);
422 path = TREE_CHAIN (path);
424 /* LAST is now the last basetype assoc on the path. */
426 /* A pointer to a virtual base member of a non-null object
427 is non-null. Therefore, we only need to test for zeroness once.
428 Make EXPR the canonical expression to deal with here. */
431 TREE_OPERAND (expr, 2) = nonnull_expr;
432 TREE_TYPE (expr) = TREE_TYPE (TREE_OPERAND (expr, 1))
433 = TREE_TYPE (nonnull_expr);
438 /* If we go through any virtual base pointers, make sure that
439 casts to BASETYPE from the last virtual base class use
440 the right value for BASETYPE. */
443 tree intype = TREE_TYPE (TREE_TYPE (expr));
445 if (TYPE_MAIN_VARIANT (intype) != BINFO_TYPE (last))
447 = BINFO_OFFSET (get_binfo (last, TYPE_MAIN_VARIANT (intype), 0));
450 offset = BINFO_OFFSET (last);
452 if (! integer_zerop (offset))
454 /* Bash types to make the backend happy. */
455 offset = cp_convert (type, offset);
457 /* If expr might be 0, we need to preserve that zeroness. */
461 TREE_TYPE (null_expr) = type;
463 null_expr = build1 (NOP_EXPR, type, integer_zero_node);
464 if (TREE_SIDE_EFFECTS (expr))
465 expr = save_expr (expr);
467 return build (COND_EXPR, type,
468 build (EQ_EXPR, boolean_type_node, expr, integer_zero_node),
470 build (code, type, expr, offset));
472 else return build (code, type, expr, offset);
475 /* Cannot change the TREE_TYPE of a NOP_EXPR here, since it may
476 be used multiple times in initialization of multiple inheritance. */
479 TREE_TYPE (expr) = type;
483 return build1 (NOP_EXPR, type, expr);
487 /* Virtual function things. */
489 /* We want to give the assembler the vtable identifier as well as
490 the offset to the function pointer. So we generate
492 __asm__ __volatile__ (".vtable_entry %c0, %c1"
493 : : "s"(&class_vtable),
494 "i"((long)&vtbl[idx].pfn - (long)&vtbl[0])); */
497 build_vtable_entry_ref (basetype, vtbl, idx)
498 tree basetype, vtbl, idx;
500 static char asm_stmt[] = ".vtable_entry %c0, %c1";
503 s = build_unary_op (ADDR_EXPR,
504 get_vtbl_decl_for_binfo (TYPE_BINFO (basetype)),
506 s = build_tree_list (build_string (1, "s"), s);
508 i = build_array_ref (vtbl, idx);
509 if (!flag_vtable_thunks)
510 i = build_component_ref (i, pfn_identifier, vtable_entry_type, 0);
511 i = build_c_cast (ptrdiff_type_node, build_unary_op (ADDR_EXPR, i, 0));
512 i2 = build_array_ref (vtbl, build_int_2(0,0));
513 i2 = build_c_cast (ptrdiff_type_node, build_unary_op (ADDR_EXPR, i2, 0));
514 i = cp_build_binary_op (MINUS_EXPR, i, i2);
515 i = build_tree_list (build_string (1, "i"), i);
517 finish_asm_stmt (ridpointers[RID_VOLATILE],
518 build_string (sizeof(asm_stmt)-1, asm_stmt),
519 NULL_TREE, chainon (s, i), NULL_TREE);
522 /* Given an object INSTANCE, return an expression which yields the
523 virtual function vtable element corresponding to INDEX. There are
524 many special cases for INSTANCE which we take care of here, mainly
525 to avoid creating extra tree nodes when we don't have to. */
528 build_vtbl_ref (instance, idx)
532 tree basetype = TREE_TYPE (instance);
534 if (TREE_CODE (basetype) == REFERENCE_TYPE)
535 basetype = TREE_TYPE (basetype);
537 if (instance == current_class_ref)
538 vtbl = build_vfield_ref (instance, basetype);
543 /* Try to figure out what a reference refers to, and
544 access its virtual function table directly. */
545 tree ref = NULL_TREE;
547 if (TREE_CODE (instance) == INDIRECT_REF
548 && TREE_CODE (TREE_TYPE (TREE_OPERAND (instance, 0))) == REFERENCE_TYPE)
549 ref = TREE_OPERAND (instance, 0);
550 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
553 if (ref && TREE_CODE (ref) == VAR_DECL
554 && DECL_INITIAL (ref))
556 tree init = DECL_INITIAL (ref);
558 while (TREE_CODE (init) == NOP_EXPR
559 || TREE_CODE (init) == NON_LVALUE_EXPR)
560 init = TREE_OPERAND (init, 0);
561 if (TREE_CODE (init) == ADDR_EXPR)
563 init = TREE_OPERAND (init, 0);
564 if (IS_AGGR_TYPE (TREE_TYPE (init))
565 && (TREE_CODE (init) == PARM_DECL
566 || TREE_CODE (init) == VAR_DECL))
572 if (IS_AGGR_TYPE (TREE_TYPE (instance))
573 && (TREE_CODE (instance) == RESULT_DECL
574 || TREE_CODE (instance) == PARM_DECL
575 || TREE_CODE (instance) == VAR_DECL))
577 vtbl = TYPE_BINFO_VTABLE (basetype);
578 /* Knowing the dynamic type of INSTANCE we can easily obtain
579 the correct vtable entry. In the new ABI, we resolve
580 this back to be in terms of the primary vtable. */
581 if (TREE_CODE (vtbl) == PLUS_EXPR)
583 idx = fold (build (PLUS_EXPR,
586 build (EXACT_DIV_EXPR,
588 TREE_OPERAND (vtbl, 1),
589 TYPE_SIZE_UNIT (vtable_entry_type))));
590 vtbl = get_vtbl_decl_for_binfo (TYPE_BINFO (basetype));
594 vtbl = build_vfield_ref (instance, basetype);
597 assemble_external (vtbl);
600 build_vtable_entry_ref (basetype, vtbl, idx);
602 aref = build_array_ref (vtbl, idx);
607 /* Given an object INSTANCE, return an expression which yields the
608 virtual function corresponding to INDEX. There are many special
609 cases for INSTANCE which we take care of here, mainly to avoid
610 creating extra tree nodes when we don't have to. */
613 build_vfn_ref (ptr_to_instptr, instance, idx)
614 tree *ptr_to_instptr, instance;
617 tree aref = build_vtbl_ref (instance, idx);
619 /* When using thunks, there is no extra delta, and we get the pfn
621 if (flag_vtable_thunks)
626 /* Save the intermediate result in a SAVE_EXPR so we don't have to
627 compute each component of the virtual function pointer twice. */
628 if (TREE_CODE (aref) == INDIRECT_REF)
629 TREE_OPERAND (aref, 0) = save_expr (TREE_OPERAND (aref, 0));
632 = build (PLUS_EXPR, TREE_TYPE (*ptr_to_instptr),
634 cp_convert (ptrdiff_type_node,
635 build_component_ref (aref, delta_identifier, NULL_TREE, 0)));
638 return build_component_ref (aref, pfn_identifier, NULL_TREE, 0);
641 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
642 for the given TYPE. */
645 get_vtable_name (type)
649 return mangle_vtbl_for_type (type);
651 return build_overload_with_type (get_identifier (VTABLE_NAME_PREFIX),
655 /* Return an IDENTIFIER_NODE for the name of the virtual table table
663 return mangle_vtt_for_type (type);
665 return build_overload_with_type (get_identifier (VTT_NAME_PREFIX),
669 /* Return the offset to the main vtable for a given base BINFO. */
672 get_vfield_offset (binfo)
676 size_binop (PLUS_EXPR, byte_position (TYPE_VFIELD (BINFO_TYPE (binfo))),
677 BINFO_OFFSET (binfo));
680 /* Get the offset to the start of the original binfo that we derived
681 this binfo from. If we find TYPE first, return the offset only
682 that far. The shortened search is useful because the this pointer
683 on method calling is expected to point to a DECL_CONTEXT (fndecl)
684 object, and not a baseclass of it. */
687 get_derived_offset (binfo, type)
690 tree offset1 = get_vfield_offset (TYPE_BINFO (BINFO_TYPE (binfo)));
693 while (!same_type_p (BINFO_TYPE (binfo), type))
694 binfo = get_primary_binfo (binfo);
696 offset2 = get_vfield_offset (TYPE_BINFO (BINFO_TYPE (binfo)));
697 return size_binop (MINUS_EXPR, offset1, offset2);
700 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
701 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
702 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
705 build_vtable (class_type, name, vtable_type)
712 decl = build_lang_decl (VAR_DECL, name, vtable_type);
713 DECL_CONTEXT (decl) = class_type;
714 DECL_ARTIFICIAL (decl) = 1;
715 TREE_STATIC (decl) = 1;
716 #ifndef WRITABLE_VTABLES
717 /* Make them READONLY by default. (mrs) */
718 TREE_READONLY (decl) = 1;
720 DECL_VIRTUAL_P (decl) = 1;
721 import_export_vtable (decl, class_type, 0);
726 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
727 or even complete. If this does not exist, create it. If COMPLETE is
728 non-zero, then complete the definition of it -- that will render it
729 impossible to actually build the vtable, but is useful to get at those
730 which are known to exist in the runtime. */
733 get_vtable_decl (type, complete)
737 tree name = get_vtable_name (type);
738 tree decl = IDENTIFIER_GLOBAL_VALUE (name);
742 my_friendly_assert (TREE_CODE (decl) == VAR_DECL
743 && DECL_VIRTUAL_P (decl), 20000118);
747 decl = build_vtable (type, name, void_type_node);
748 decl = pushdecl_top_level (decl);
749 my_friendly_assert (IDENTIFIER_GLOBAL_VALUE (name) == decl,
752 /* At one time the vtable info was grabbed 2 words at a time. This
753 fails on sparc unless you have 8-byte alignment. (tiemann) */
754 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
759 DECL_EXTERNAL (decl) = 1;
760 cp_finish_decl (decl, NULL_TREE, NULL_TREE, 0);
766 /* Returns a copy of the BINFO_VIRTUALS list in BINFO. The
767 BV_VCALL_INDEX for each entry is cleared. */
770 copy_virtuals (binfo)
776 copies = copy_list (BINFO_VIRTUALS (binfo));
777 for (t = copies; t; t = TREE_CHAIN (t))
779 BV_VCALL_INDEX (t) = NULL_TREE;
780 BV_USE_VCALL_INDEX_P (t) = 0;
781 BV_GENERATE_THUNK_WITH_VTABLE_P (t) = 0;
787 /* Build the primary virtual function table for TYPE. If BINFO is
788 non-NULL, build the vtable starting with the initial approximation
789 that it is the same as the one which is the head of the association
790 list. Returns a non-zero value if a new vtable is actually
794 build_primary_vtable (binfo, type)
800 decl = get_vtable_decl (type, /*complete=*/0);
804 if (BINFO_NEW_VTABLE_MARKED (binfo, type))
805 /* We have already created a vtable for this base, so there's
806 no need to do it again. */
809 virtuals = copy_virtuals (binfo);
810 TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo));
811 DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl));
812 DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl));
816 my_friendly_assert (TREE_CODE (TREE_TYPE (decl)) == VOID_TYPE,
818 virtuals = NULL_TREE;
821 #ifdef GATHER_STATISTICS
823 n_vtable_elems += list_length (virtuals);
826 /* Initialize the association list for this type, based
827 on our first approximation. */
828 TYPE_BINFO_VTABLE (type) = decl;
829 TYPE_BINFO_VIRTUALS (type) = virtuals;
830 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type), type);
834 /* Give TYPE a new virtual function table which is initialized
835 with a skeleton-copy of its original initialization. The only
836 entry that changes is the `delta' entry, so we can really
837 share a lot of structure.
839 FOR_TYPE is the derived type which caused this table to
842 BINFO is the type association which provided TYPE for FOR_TYPE.
844 The order in which vtables are built (by calling this function) for
845 an object must remain the same, otherwise a binary incompatibility
849 build_secondary_vtable (binfo, for_type)
850 tree binfo, for_type;
853 tree orig_decl = BINFO_VTABLE (binfo);
866 if (TREE_VIA_VIRTUAL (binfo))
867 my_friendly_assert (binfo == binfo_for_vbase (BINFO_TYPE (binfo),
871 if (BINFO_NEW_VTABLE_MARKED (binfo, current_class_type))
872 /* We already created a vtable for this base. There's no need to
876 /* Remember that we've created a vtable for this BINFO, so that we
877 don't try to do so again. */
878 SET_BINFO_NEW_VTABLE_MARKED (binfo, current_class_type);
880 /* Make fresh virtual list, so we can smash it later. */
881 BINFO_VIRTUALS (binfo) = copy_virtuals (binfo);
883 if (TREE_VIA_VIRTUAL (binfo))
885 tree binfo1 = binfo_for_vbase (BINFO_TYPE (binfo), for_type);
887 /* XXX - This should never happen, if it does, the caller should
888 ensure that the binfo is from for_type's binfos, not from any
889 base type's. We can remove all this code after a while. */
891 warning ("internal inconsistency: binfo offset error for rtti");
893 offset = BINFO_OFFSET (binfo1);
896 offset = BINFO_OFFSET (binfo);
898 /* In the new ABI, secondary vtables are laid out as part of the
899 same structure as the primary vtable. */
900 if (merge_primary_and_secondary_vtables_p ())
902 BINFO_VTABLE (binfo) = NULL_TREE;
906 /* Create the declaration for the secondary vtable. */
907 basetype = TYPE_MAIN_VARIANT (BINFO_TYPE (binfo));
908 buf2 = TYPE_ASSEMBLER_NAME_STRING (basetype);
909 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1;
911 /* We know that the vtable that we are going to create doesn't exist
912 yet in the global namespace, and when we finish, it will be
913 pushed into the global namespace. In complex MI hierarchies, we
914 have to loop while the name we are thinking of adding is globally
915 defined, adding more name components to the vtable name as we
916 loop, until the name is unique. This is because in complex MI
917 cases, we might have the same base more than once. This means
918 that the order in which this function is called for vtables must
919 remain the same, otherwise binary compatibility can be
924 char *buf1 = (char *) alloca (TYPE_ASSEMBLER_NAME_LENGTH (for_type)
928 sprintf (buf1, "%s%c%s", TYPE_ASSEMBLER_NAME_STRING (for_type), joiner,
930 buf = (char *) alloca (strlen (VTABLE_NAME_PREFIX) + strlen (buf1) + 1);
931 sprintf (buf, "%s%s", VTABLE_NAME_PREFIX, buf1);
932 name = get_identifier (buf);
934 /* If this name doesn't clash, then we can use it, otherwise
935 we add more to the name until it is unique. */
937 if (! IDENTIFIER_GLOBAL_VALUE (name))
940 /* Set values for next loop through, if the name isn't unique. */
942 path = BINFO_INHERITANCE_CHAIN (path);
944 /* We better not run out of stuff to make it unique. */
945 my_friendly_assert (path != NULL_TREE, 368);
947 basetype = TYPE_MAIN_VARIANT (BINFO_TYPE (path));
949 if (for_type == basetype)
951 /* If we run out of basetypes in the path, we have already
952 found created a vtable with that name before, we now
953 resort to tacking on _%d to distinguish them. */
955 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1 + i + 1 + 3;
956 buf1 = (char *) alloca (i);
958 sprintf (buf1, "%s%c%s%c%d",
959 TYPE_ASSEMBLER_NAME_STRING (basetype), joiner,
961 buf = (char *) alloca (strlen (VTABLE_NAME_PREFIX)
962 + strlen (buf1) + 1);
963 sprintf (buf, "%s%s", VTABLE_NAME_PREFIX, buf1);
964 name = get_identifier (buf);
966 /* If this name doesn't clash, then we can use it,
967 otherwise we add something different to the name until
969 } while (++j <= 999 && IDENTIFIER_GLOBAL_VALUE (name));
971 /* Hey, they really like MI don't they? Increase the 3
972 above to 6, and the 999 to 999999. :-) */
973 my_friendly_assert (j <= 999, 369);
978 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1 + i;
979 new_buf2 = (char *) alloca (i);
980 sprintf (new_buf2, "%s%c%s",
981 TYPE_ASSEMBLER_NAME_STRING (basetype), joiner, buf2);
985 new_decl = build_vtable (for_type, name, TREE_TYPE (orig_decl));
986 DECL_ALIGN (new_decl) = DECL_ALIGN (orig_decl);
987 DECL_USER_ALIGN (new_decl) = DECL_USER_ALIGN (orig_decl);
988 BINFO_VTABLE (binfo) = pushdecl_top_level (new_decl);
990 #ifdef GATHER_STATISTICS
992 n_vtable_elems += list_length (BINFO_VIRTUALS (binfo));
998 /* Create a new vtable for BINFO which is the hierarchy dominated by
1002 make_new_vtable (t, binfo)
1006 if (binfo == TYPE_BINFO (t))
1007 /* In this case, it is *type*'s vtable we are modifying. We start
1008 with the approximation that it's vtable is that of the
1009 immediate base class. */
1010 return build_primary_vtable (TYPE_BINFO (DECL_CONTEXT (TYPE_VFIELD (t))),
1013 /* This is our very own copy of `basetype' to play with. Later,
1014 we will fill in all the virtual functions that override the
1015 virtual functions in these base classes which are not defined
1016 by the current type. */
1017 return build_secondary_vtable (binfo, t);
1020 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
1021 (which is in the hierarchy dominated by T) list FNDECL as its
1022 BV_FN. DELTA is the required constant adjustment from the `this'
1023 pointer where the vtable entry appears to the `this' required when
1024 the function is actually called. */
1027 modify_vtable_entry (t, binfo, fndecl, delta, virtuals)
1038 if (fndecl != BV_FN (v)
1039 || !tree_int_cst_equal (delta, BV_DELTA (v)))
1043 /* We need a new vtable for BINFO. */
1044 if (make_new_vtable (t, binfo))
1046 /* If we really did make a new vtable, we also made a copy
1047 of the BINFO_VIRTUALS list. Now, we have to find the
1048 corresponding entry in that list. */
1049 *virtuals = BINFO_VIRTUALS (binfo);
1050 while (BV_FN (*virtuals) != BV_FN (v))
1051 *virtuals = TREE_CHAIN (*virtuals);
1055 base_fndecl = BV_FN (v);
1056 BV_DELTA (v) = delta;
1057 BV_VCALL_INDEX (v) = NULL_TREE;
1060 /* Now assign virtual dispatch information, if unset. We can
1061 dispatch this, through any overridden base function. */
1062 if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
1064 DECL_VINDEX (fndecl) = DECL_VINDEX (base_fndecl);
1065 DECL_VIRTUAL_CONTEXT (fndecl) = DECL_VIRTUAL_CONTEXT (base_fndecl);
1070 /* Return the index (in the virtual function table) of the first
1071 virtual function. */
1074 first_vfun_index (t)
1077 /* Under the old ABI, the offset-to-top and RTTI entries are at
1078 indices zero and one; under the new ABI, the first virtual
1079 function is at index zero. */
1080 if (!CLASSTYPE_COM_INTERFACE (t) && !flag_new_abi)
1081 return flag_vtable_thunks ? 2 : 1;
1086 /* Set DECL_VINDEX for DECL. VINDEX_P is the number of virtual
1087 functions present in the vtable so far. */
1090 set_vindex (t, decl, vfuns_p)
1097 vindex = (*vfuns_p)++;
1098 vindex += first_vfun_index (t);
1099 DECL_VINDEX (decl) = build_shared_int_cst (vindex);
1102 /* Add a virtual function to all the appropriate vtables for the class
1103 T. DECL_VINDEX(X) should be error_mark_node, if we want to
1104 allocate a new slot in our table. If it is error_mark_node, we
1105 know that no other function from another vtable is overridden by X.
1106 VFUNS_P keeps track of how many virtuals there are in our
1107 main vtable for the type, and we build upon the NEW_VIRTUALS list
1111 add_virtual_function (new_virtuals_p, overridden_virtuals_p,
1113 tree *new_virtuals_p;
1114 tree *overridden_virtuals_p;
1117 tree t; /* Structure type. */
1121 /* If this function doesn't override anything from a base class, we
1122 can just assign it a new DECL_VINDEX now. Otherwise, if it does
1123 override something, we keep it around and assign its DECL_VINDEX
1124 later, in modify_all_vtables. */
1125 if (TREE_CODE (DECL_VINDEX (fndecl)) == INTEGER_CST)
1126 /* We've already dealt with this function. */
1129 new_virtual = make_node (TREE_LIST);
1130 BV_FN (new_virtual) = fndecl;
1131 BV_DELTA (new_virtual) = integer_zero_node;
1133 if (DECL_VINDEX (fndecl) == error_mark_node)
1135 /* FNDECL is a new virtual function; it doesn't override any
1136 virtual function in a base class. */
1138 /* We remember that this was the base sub-object for rtti. */
1139 CLASSTYPE_RTTI (t) = t;
1141 /* Now assign virtual dispatch information. */
1142 set_vindex (t, fndecl, vfuns_p);
1143 DECL_VIRTUAL_CONTEXT (fndecl) = t;
1145 /* Save the state we've computed on the NEW_VIRTUALS list. */
1146 TREE_CHAIN (new_virtual) = *new_virtuals_p;
1147 *new_virtuals_p = new_virtual;
1151 /* FNDECL overrides a function from a base class. */
1152 TREE_CHAIN (new_virtual) = *overridden_virtuals_p;
1153 *overridden_virtuals_p = new_virtual;
1157 extern struct obstack *current_obstack;
1159 /* Add method METHOD to class TYPE. If ERROR_P is true, we are adding
1160 the method after the class has already been defined because a
1161 declaration for it was seen. (Even though that is erroneous, we
1162 add the method for improved error recovery.) */
1165 add_method (type, method, error_p)
1170 int using = (DECL_CONTEXT (method) != type);
1175 if (!CLASSTYPE_METHOD_VEC (type))
1176 /* Make a new method vector. We start with 8 entries. We must
1177 allocate at least two (for constructors and destructors), and
1178 we're going to end up with an assignment operator at some point
1181 We could use a TREE_LIST for now, and convert it to a TREE_VEC
1182 in finish_struct, but we would probably waste more memory
1183 making the links in the list than we would by over-allocating
1184 the size of the vector here. Furthermore, we would complicate
1185 all the code that expects this to be a vector. */
1186 CLASSTYPE_METHOD_VEC (type) = make_tree_vec (8);
1188 method_vec = CLASSTYPE_METHOD_VEC (type);
1189 len = TREE_VEC_LENGTH (method_vec);
1191 /* Constructors and destructors go in special slots. */
1192 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method))
1193 slot = CLASSTYPE_CONSTRUCTOR_SLOT;
1194 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
1195 slot = CLASSTYPE_DESTRUCTOR_SLOT;
1198 /* See if we already have an entry with this name. */
1199 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; slot < len; ++slot)
1200 if (!TREE_VEC_ELT (method_vec, slot)
1201 || (DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec,
1203 == DECL_NAME (method)))
1208 /* We need a bigger method vector. */
1212 /* In the non-error case, we are processing a class
1213 definition. Double the size of the vector to give room
1217 /* In the error case, the vector is already complete. We
1218 don't expect many errors, and the rest of the front-end
1219 will get confused if there are empty slots in the vector. */
1223 new_vec = make_tree_vec (new_len);
1224 bcopy ((PTR) &TREE_VEC_ELT (method_vec, 0),
1225 (PTR) &TREE_VEC_ELT (new_vec, 0),
1226 len * sizeof (tree));
1228 method_vec = CLASSTYPE_METHOD_VEC (type) = new_vec;
1231 if (DECL_CONV_FN_P (method) && !TREE_VEC_ELT (method_vec, slot))
1233 /* Type conversion operators have to come before ordinary
1234 methods; add_conversions depends on this to speed up
1235 looking for conversion operators. So, if necessary, we
1236 slide some of the vector elements up. In theory, this
1237 makes this algorithm O(N^2) but we don't expect many
1238 conversion operators. */
1239 for (slot = 2; slot < len; ++slot)
1241 tree fn = TREE_VEC_ELT (method_vec, slot);
1244 /* There are no more entries in the vector, so we
1245 can insert the new conversion operator here. */
1248 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1249 /* We can insert the new function right at the
1254 if (!TREE_VEC_ELT (method_vec, slot))
1255 /* There is nothing in the Ith slot, so we can avoid
1260 /* We know the last slot in the vector is empty
1261 because we know that at this point there's room
1262 for a new function. */
1263 bcopy ((PTR) &TREE_VEC_ELT (method_vec, slot),
1264 (PTR) &TREE_VEC_ELT (method_vec, slot + 1),
1265 (len - slot - 1) * sizeof (tree));
1266 TREE_VEC_ELT (method_vec, slot) = NULL_TREE;
1271 if (template_class_depth (type))
1272 /* TYPE is a template class. Don't issue any errors now; wait
1273 until instantiation time to complain. */
1279 /* Check to see if we've already got this method. */
1280 for (fns = TREE_VEC_ELT (method_vec, slot);
1282 fns = OVL_NEXT (fns))
1284 tree fn = OVL_CURRENT (fns);
1286 if (TREE_CODE (fn) != TREE_CODE (method))
1289 if (TREE_CODE (method) != TEMPLATE_DECL)
1291 /* [over.load] Member function declarations with the
1292 same name and the same parameter types cannot be
1293 overloaded if any of them is a static member
1294 function declaration. */
1295 if ((DECL_STATIC_FUNCTION_P (fn)
1296 != DECL_STATIC_FUNCTION_P (method))
1299 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (fn));
1300 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (method));
1302 if (! DECL_STATIC_FUNCTION_P (fn))
1303 parms1 = TREE_CHAIN (parms1);
1304 if (! DECL_STATIC_FUNCTION_P (method))
1305 parms2 = TREE_CHAIN (parms2);
1307 if (compparms (parms1, parms2))
1310 /* Defer to the local function. */
1313 cp_error ("`%#D' and `%#D' cannot be overloaded",
1318 /* Since this is an ordinary function in a
1319 non-template class, it's mangled name can be used
1320 as a unique identifier. This technique is only
1321 an optimization; we would get the same results if
1322 we just used decls_match here. */
1323 if (DECL_ASSEMBLER_NAME (fn)
1324 != DECL_ASSEMBLER_NAME (method))
1327 else if (!decls_match (fn, method))
1330 /* There has already been a declaration of this method
1331 or member template. */
1332 cp_error_at ("`%D' has already been declared in `%T'",
1335 /* We don't call duplicate_decls here to merge the
1336 declarations because that will confuse things if the
1337 methods have inline definitions. In particular, we
1338 will crash while processing the definitions. */
1343 /* Actually insert the new method. */
1344 TREE_VEC_ELT (method_vec, slot)
1345 = build_overload (method, TREE_VEC_ELT (method_vec, slot));
1347 /* Add the new binding. */
1348 if (!DECL_CONSTRUCTOR_P (method)
1349 && !DECL_DESTRUCTOR_P (method))
1350 push_class_level_binding (DECL_NAME (method),
1351 TREE_VEC_ELT (method_vec, slot));
1354 /* Subroutines of finish_struct. */
1356 /* Look through the list of fields for this struct, deleting
1357 duplicates as we go. This must be recursive to handle
1360 FIELD is the field which may not appear anywhere in FIELDS.
1361 FIELD_PTR, if non-null, is the starting point at which
1362 chained deletions may take place.
1363 The value returned is the first acceptable entry found
1366 Note that anonymous fields which are not of UNION_TYPE are
1367 not duplicates, they are just anonymous fields. This happens
1368 when we have unnamed bitfields, for example. */
1371 delete_duplicate_fields_1 (field, fields)
1376 if (DECL_NAME (field) == 0)
1378 if (! ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1381 for (x = TYPE_FIELDS (TREE_TYPE (field)); x; x = TREE_CHAIN (x))
1382 fields = delete_duplicate_fields_1 (x, fields);
1387 for (x = fields; x; prev = x, x = TREE_CHAIN (x))
1389 if (DECL_NAME (x) == 0)
1391 if (! ANON_AGGR_TYPE_P (TREE_TYPE (x)))
1393 TYPE_FIELDS (TREE_TYPE (x))
1394 = delete_duplicate_fields_1 (field, TYPE_FIELDS (TREE_TYPE (x)));
1395 if (TYPE_FIELDS (TREE_TYPE (x)) == 0)
1398 fields = TREE_CHAIN (fields);
1400 TREE_CHAIN (prev) = TREE_CHAIN (x);
1403 else if (TREE_CODE (field) == USING_DECL)
1404 /* A using declaration may is allowed to appear more than
1405 once. We'll prune these from the field list later, and
1406 handle_using_decl will complain about invalid multiple
1409 else if (DECL_NAME (field) == DECL_NAME (x))
1411 if (TREE_CODE (field) == CONST_DECL
1412 && TREE_CODE (x) == CONST_DECL)
1413 cp_error_at ("duplicate enum value `%D'", x);
1414 else if (TREE_CODE (field) == CONST_DECL
1415 || TREE_CODE (x) == CONST_DECL)
1416 cp_error_at ("duplicate field `%D' (as enum and non-enum)",
1418 else if (DECL_DECLARES_TYPE_P (field)
1419 && DECL_DECLARES_TYPE_P (x))
1421 if (same_type_p (TREE_TYPE (field), TREE_TYPE (x)))
1423 cp_error_at ("duplicate nested type `%D'", x);
1425 else if (DECL_DECLARES_TYPE_P (field)
1426 || DECL_DECLARES_TYPE_P (x))
1428 /* Hide tag decls. */
1429 if ((TREE_CODE (field) == TYPE_DECL
1430 && DECL_ARTIFICIAL (field))
1431 || (TREE_CODE (x) == TYPE_DECL
1432 && DECL_ARTIFICIAL (x)))
1434 cp_error_at ("duplicate field `%D' (as type and non-type)",
1438 cp_error_at ("duplicate member `%D'", x);
1440 fields = TREE_CHAIN (fields);
1442 TREE_CHAIN (prev) = TREE_CHAIN (x);
1450 delete_duplicate_fields (fields)
1454 for (x = fields; x && TREE_CHAIN (x); x = TREE_CHAIN (x))
1455 TREE_CHAIN (x) = delete_duplicate_fields_1 (x, TREE_CHAIN (x));
1458 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1459 legit, otherwise return 0. */
1462 alter_access (t, fdecl, access)
1469 if (!DECL_LANG_SPECIFIC (fdecl))
1470 retrofit_lang_decl (fdecl);
1472 elem = purpose_member (t, DECL_ACCESS (fdecl));
1475 if (TREE_VALUE (elem) != access)
1477 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1478 cp_error_at ("conflicting access specifications for method `%D', ignored", TREE_TYPE (fdecl));
1480 error ("conflicting access specifications for field `%s', ignored",
1481 IDENTIFIER_POINTER (DECL_NAME (fdecl)));
1485 /* They're changing the access to the same thing they changed
1486 it to before. That's OK. */
1492 enforce_access (t, fdecl);
1493 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1499 /* Process the USING_DECL, which is a member of T. */
1502 handle_using_decl (using_decl, t)
1506 tree ctype = DECL_INITIAL (using_decl);
1507 tree name = DECL_NAME (using_decl);
1509 = TREE_PRIVATE (using_decl) ? access_private_node
1510 : TREE_PROTECTED (using_decl) ? access_protected_node
1511 : access_public_node;
1513 tree flist = NULL_TREE;
1516 binfo = binfo_or_else (ctype, t);
1520 if (name == constructor_name (ctype)
1521 || name == constructor_name_full (ctype))
1523 cp_error_at ("using-declaration for constructor", using_decl);
1527 fdecl = lookup_member (binfo, name, 0, 0);
1531 cp_error_at ("no members matching `%D' in `%#T'", using_decl, ctype);
1535 if (BASELINK_P (fdecl))
1536 /* Ignore base type this came from. */
1537 fdecl = TREE_VALUE (fdecl);
1539 old_value = IDENTIFIER_CLASS_VALUE (name);
1542 if (is_overloaded_fn (old_value))
1543 old_value = OVL_CURRENT (old_value);
1545 if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t)
1548 old_value = NULL_TREE;
1551 if (is_overloaded_fn (fdecl))
1556 else if (is_overloaded_fn (old_value))
1559 /* It's OK to use functions from a base when there are functions with
1560 the same name already present in the current class. */;
1563 cp_error ("`%D' invalid in `%#T'", using_decl, t);
1564 cp_error_at (" because of local method `%#D' with same name",
1565 OVL_CURRENT (old_value));
1571 cp_error ("`%D' invalid in `%#T'", using_decl, t);
1572 cp_error_at (" because of local field `%#D' with same name", old_value);
1576 /* Make type T see field decl FDECL with access ACCESS.*/
1578 for (; flist; flist = OVL_NEXT (flist))
1580 add_method (t, OVL_CURRENT (flist), /*error_p=*/0);
1581 alter_access (t, OVL_CURRENT (flist), access);
1584 alter_access (t, fdecl, access);
1587 /* Run through the base clases of T, updating
1588 CANT_HAVE_DEFAULT_CTOR_P, CANT_HAVE_CONST_CTOR_P, and
1589 NO_CONST_ASN_REF_P. Also set flag bits in T based on properties of
1593 check_bases (t, cant_have_default_ctor_p, cant_have_const_ctor_p,
1596 int *cant_have_default_ctor_p;
1597 int *cant_have_const_ctor_p;
1598 int *no_const_asn_ref_p;
1602 int seen_nearly_empty_base_p;
1605 binfos = TYPE_BINFO_BASETYPES (t);
1606 n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1607 seen_nearly_empty_base_p = 0;
1609 /* An aggregate cannot have baseclasses. */
1610 CLASSTYPE_NON_AGGREGATE (t) |= (n_baseclasses != 0);
1612 for (i = 0; i < n_baseclasses; ++i)
1617 /* Figure out what base we're looking at. */
1618 base_binfo = TREE_VEC_ELT (binfos, i);
1619 basetype = TREE_TYPE (base_binfo);
1621 /* If the type of basetype is incomplete, then we already
1622 complained about that fact (and we should have fixed it up as
1624 if (!COMPLETE_TYPE_P (basetype))
1627 /* The base type is of incomplete type. It is
1628 probably best to pretend that it does not
1630 if (i == n_baseclasses-1)
1631 TREE_VEC_ELT (binfos, i) = NULL_TREE;
1632 TREE_VEC_LENGTH (binfos) -= 1;
1634 for (j = i; j+1 < n_baseclasses; j++)
1635 TREE_VEC_ELT (binfos, j) = TREE_VEC_ELT (binfos, j+1);
1639 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1640 here because the case of virtual functions but non-virtual
1641 dtor is handled in finish_struct_1. */
1642 if (warn_ecpp && ! TYPE_POLYMORPHIC_P (basetype)
1643 && TYPE_HAS_DESTRUCTOR (basetype))
1644 cp_warning ("base class `%#T' has a non-virtual destructor",
1647 /* If the base class doesn't have copy constructors or
1648 assignment operators that take const references, then the
1649 derived class cannot have such a member automatically
1651 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1652 *cant_have_const_ctor_p = 1;
1653 if (TYPE_HAS_ASSIGN_REF (basetype)
1654 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1655 *no_const_asn_ref_p = 1;
1656 /* Similarly, if the base class doesn't have a default
1657 constructor, then the derived class won't have an
1658 automatically generated default constructor. */
1659 if (TYPE_HAS_CONSTRUCTOR (basetype)
1660 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype))
1662 *cant_have_default_ctor_p = 1;
1663 if (! TYPE_HAS_CONSTRUCTOR (t))
1664 cp_pedwarn ("base `%T' with only non-default constructor in class without a constructor",
1668 /* If the base class is not empty or nearly empty, then this
1669 class cannot be nearly empty. */
1670 if (!CLASSTYPE_NEARLY_EMPTY_P (basetype) && !is_empty_class (basetype))
1671 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1672 /* And if there is more than one nearly empty base, then the
1673 derived class is not nearly empty either. */
1674 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype)
1675 && seen_nearly_empty_base_p)
1676 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1677 /* If this is the first nearly empty base class, then remember
1679 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1680 seen_nearly_empty_base_p = 1;
1682 /* A lot of properties from the bases also apply to the derived
1684 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1685 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1686 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype);
1687 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
1688 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1689 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1690 TYPE_OVERLOADS_CALL_EXPR (t) |= TYPE_OVERLOADS_CALL_EXPR (basetype);
1691 TYPE_OVERLOADS_ARRAY_REF (t) |= TYPE_OVERLOADS_ARRAY_REF (basetype);
1692 TYPE_OVERLOADS_ARROW (t) |= TYPE_OVERLOADS_ARROW (basetype);
1693 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1695 /* Derived classes can implicitly become COMified if their bases
1697 if (CLASSTYPE_COM_INTERFACE (basetype))
1698 CLASSTYPE_COM_INTERFACE (t) = 1;
1699 else if (i == 0 && CLASSTYPE_COM_INTERFACE (t))
1702 ("COM interface type `%T' with non-COM leftmost base class `%T'",
1704 CLASSTYPE_COM_INTERFACE (t) = 0;
1709 /* Called via dfs_walk from mark_primary_bases. Sets
1710 BINFO_PRIMARY_MARKED_P for BINFO, if appropriate. */
1713 dfs_mark_primary_bases (binfo, data)
1719 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (binfo)))
1722 base_binfo = get_primary_binfo (binfo);
1724 if (TREE_VIA_VIRTUAL (base_binfo))
1730 shared_binfo = binfo_for_vbase (BINFO_TYPE (base_binfo), type);
1732 /* If this virtual base is not already primary somewhere else in
1733 the hiearchy, then we'll be using this copy. */
1734 if (!BINFO_PRIMARY_MARKED_P (shared_binfo))
1736 /* Make sure the CLASSTYPE_VBASECLASSES list contains the
1737 primary copy; it's the one that really exists. */
1738 if (base_binfo != shared_binfo)
1739 TREE_VALUE (purpose_member (BINFO_TYPE (base_binfo),
1740 CLASSTYPE_VBASECLASSES (type)))
1744 base_binfo = NULL_TREE;
1748 BINFO_PRIMARY_BASE_OF (base_binfo) = binfo;
1753 /* Set BINFO_PRIMARY_MARKED_P for all binfos in the hierarchy
1754 dominated by BINFO that are primary bases. */
1757 mark_primary_bases (type)
1762 /* Mark the TYPE_BINFO hierarchy. We need to mark primary bases in
1763 pre-order to deal with primary virtual bases. (The virtual base
1764 would be skipped if it were not marked as primary, and that
1765 requires getting to dfs_mark_primary_bases before
1766 dfs_skip_nonprimary_vbases_unmarkedp has a chance to skip the
1768 dfs_walk_real (TYPE_BINFO (type), dfs_mark_primary_bases, NULL,
1769 dfs_skip_nonprimary_vbases_unmarkedp, type);
1771 /* Now go through the virtual base classes in inheritance graph
1772 order. Any that are not already primary will need to be
1773 allocated in TYPE, and so we need to mark their primary bases. */
1774 for (vbases = TYPE_BINFO (type); vbases; vbases = TREE_CHAIN (vbases))
1778 /* Make sure that only BINFOs appear on this list.
1779 Historically, the TREE_CHAIN was used for other purposes, and
1780 we want to make sure that none of those uses remain. */
1781 my_friendly_assert (TREE_CODE (vbases) == TREE_VEC, 20000402);
1783 if (!TREE_VIA_VIRTUAL (vbases))
1786 vbase = binfo_for_vbase (BINFO_TYPE (vbases), type);
1787 if (BINFO_PRIMARY_MARKED_P (vbase))
1788 /* This virtual base was already included in the hierarchy, so
1789 there's nothing to do here. */
1792 /* Now, walk its bases. */
1793 dfs_walk_real (vbase, dfs_mark_primary_bases, NULL,
1794 dfs_skip_nonprimary_vbases_unmarkedp, type);
1798 /* Make the BINFO the primary base of T. */
1801 set_primary_base (t, binfo, vfuns_p)
1808 CLASSTYPE_PRIMARY_BINFO (t) = binfo;
1809 basetype = BINFO_TYPE (binfo);
1810 TYPE_BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (basetype);
1811 TYPE_BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (basetype);
1812 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1813 CLASSTYPE_RTTI (t) = CLASSTYPE_RTTI (basetype);
1814 *vfuns_p = CLASSTYPE_VSIZE (basetype);
1817 /* Determine the primary class for T. */
1820 determine_primary_base (t, vfuns_p)
1824 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1828 /* If there are no baseclasses, there is certainly no primary base. */
1829 if (n_baseclasses == 0)
1832 type_binfo = TYPE_BINFO (t);
1834 for (i = 0; i < n_baseclasses; i++)
1836 tree base_binfo = BINFO_BASETYPE (type_binfo, i);
1837 tree basetype = BINFO_TYPE (base_binfo);
1839 if (TYPE_CONTAINS_VPTR_P (basetype))
1841 /* Even a virtual baseclass can contain our RTTI
1842 information. But, we prefer a non-virtual polymorphic
1844 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
1845 CLASSTYPE_RTTI (t) = CLASSTYPE_RTTI (basetype);
1847 /* A virtual baseclass can't be the primary base under the
1848 old ABI. And under the new ABI we still prefer a
1849 non-virtual base. */
1850 if (TREE_VIA_VIRTUAL (base_binfo))
1853 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
1855 set_primary_base (t, base_binfo, vfuns_p);
1856 CLASSTYPE_VFIELDS (t) = copy_list (CLASSTYPE_VFIELDS (basetype));
1862 /* Only add unique vfields, and flatten them out as we go. */
1863 for (vfields = CLASSTYPE_VFIELDS (basetype);
1865 vfields = TREE_CHAIN (vfields))
1866 if (VF_BINFO_VALUE (vfields) == NULL_TREE
1867 || ! TREE_VIA_VIRTUAL (VF_BINFO_VALUE (vfields)))
1868 CLASSTYPE_VFIELDS (t)
1869 = tree_cons (base_binfo,
1870 VF_BASETYPE_VALUE (vfields),
1871 CLASSTYPE_VFIELDS (t));
1873 if (!flag_new_abi && *vfuns_p == 0)
1874 set_primary_base (t, base_binfo, vfuns_p);
1879 if (!TYPE_VFIELD (t))
1880 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
1882 /* Mark the indirect primary bases. */
1883 for (vbases = CLASSTYPE_VBASECLASSES (t);
1885 vbases = TREE_CHAIN (vbases))
1887 tree binfo = TREE_VALUE (vbases);
1889 /* See if this virtual base is an indirect primary base. If so,
1890 it must be either a primary base or an indirect primary base
1891 in one of the direct bases. */
1892 for (i = 0; i < n_baseclasses; ++i)
1897 basetype = TYPE_BINFO_BASETYPE (t, i);
1898 for (v = CLASSTYPE_VBASECLASSES (basetype);
1902 tree b = TREE_VALUE (v);
1903 if ((BINFO_PRIMARY_MARKED_P (b)
1904 || BINFO_INDIRECT_PRIMARY_P (b))
1905 && same_type_p (BINFO_TYPE (b), BINFO_TYPE (binfo)))
1907 BINFO_INDIRECT_PRIMARY_P (binfo) = 1;
1912 /* If we've discovered that this virtual base is an indirect
1913 primary base, then we can move on to the next virtual
1915 if (BINFO_INDIRECT_PRIMARY_P (binfo))
1920 /* The new ABI allows for the use of a "nearly-empty" virtual base
1921 class as the primary base class if no non-virtual polymorphic
1922 base can be found. */
1923 if (flag_new_abi && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
1925 /* If not NULL, this is the best primary base candidate we have
1927 tree candidate = NULL_TREE;
1930 /* Loop over the baseclasses. */
1931 for (base_binfo = TYPE_BINFO (t);
1933 base_binfo = TREE_CHAIN (base_binfo))
1935 tree basetype = BINFO_TYPE (base_binfo);
1937 if (TREE_VIA_VIRTUAL (base_binfo)
1938 && CLASSTYPE_NEARLY_EMPTY_P (basetype))
1940 /* If this is not an indirect primary base, then it's
1941 definitely our primary base. */
1942 if (!BINFO_INDIRECT_PRIMARY_P (base_binfo))
1944 candidate = base_binfo;
1947 /* If this was an indirect primary base, it's still our
1948 primary base -- unless there's another nearly-empty
1949 virtual base that isn't an indirect primary base. */
1950 else if (!candidate)
1951 candidate = base_binfo;
1955 /* If we've got a primary base, use it. */
1958 set_primary_base (t, candidate, vfuns_p);
1959 CLASSTYPE_VFIELDS (t)
1960 = copy_list (CLASSTYPE_VFIELDS (BINFO_TYPE (candidate)));
1964 /* Mark the primary base classes at this point. */
1965 mark_primary_bases (t);
1968 /* Set memoizing fields and bits of T (and its variants) for later
1972 finish_struct_bits (t)
1975 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1977 /* Fix up variants (if any). */
1978 tree variants = TYPE_NEXT_VARIANT (t);
1981 /* These fields are in the _TYPE part of the node, not in
1982 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1983 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1984 TYPE_HAS_DESTRUCTOR (variants) = TYPE_HAS_DESTRUCTOR (t);
1985 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1986 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants)
1987 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
1989 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (variants)
1990 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t);
1991 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1992 TYPE_USES_VIRTUAL_BASECLASSES (variants) = TYPE_USES_VIRTUAL_BASECLASSES (t);
1993 /* Copy whatever these are holding today. */
1994 TYPE_MIN_VALUE (variants) = TYPE_MIN_VALUE (t);
1995 TYPE_MAX_VALUE (variants) = TYPE_MAX_VALUE (t);
1996 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1997 TYPE_SIZE (variants) = TYPE_SIZE (t);
1998 TYPE_SIZE_UNIT (variants) = TYPE_SIZE_UNIT (t);
1999 variants = TYPE_NEXT_VARIANT (variants);
2002 if (n_baseclasses && TYPE_POLYMORPHIC_P (t))
2003 /* For a class w/o baseclasses, `finish_struct' has set
2004 CLASS_TYPE_ABSTRACT_VIRTUALS correctly (by
2005 definition). Similarly for a class whose base classes do not
2006 have vtables. When neither of these is true, we might have
2007 removed abstract virtuals (by providing a definition), added
2008 some (by declaring new ones), or redeclared ones from a base
2009 class. We need to recalculate what's really an abstract virtual
2010 at this point (by looking in the vtables). */
2011 get_pure_virtuals (t);
2015 /* Notice whether this class has type conversion functions defined. */
2016 tree binfo = TYPE_BINFO (t);
2017 tree binfos = BINFO_BASETYPES (binfo);
2020 for (i = n_baseclasses-1; i >= 0; i--)
2022 basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
2024 TYPE_HAS_CONVERSION (t) |= TYPE_HAS_CONVERSION (basetype);
2028 /* If this type has a copy constructor, force its mode to be BLKmode, and
2029 force its TREE_ADDRESSABLE bit to be nonzero. This will cause it to
2030 be passed by invisible reference and prevent it from being returned in
2033 Also do this if the class has BLKmode but can still be returned in
2034 registers, since function_cannot_inline_p won't let us inline
2035 functions returning such a type. This affects the HP-PA. */
2036 if (! TYPE_HAS_TRIVIAL_INIT_REF (t)
2037 || (TYPE_MODE (t) == BLKmode && ! aggregate_value_p (t)
2038 && CLASSTYPE_NON_AGGREGATE (t)))
2041 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
2042 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
2044 TYPE_MODE (variants) = BLKmode;
2045 TREE_ADDRESSABLE (variants) = 1;
2050 /* Issue warnings about T having private constructors, but no friends,
2053 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2054 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2055 non-private static member functions. */
2058 maybe_warn_about_overly_private_class (t)
2061 int has_member_fn = 0;
2062 int has_nonprivate_method = 0;
2065 if (!warn_ctor_dtor_privacy
2066 /* If the class has friends, those entities might create and
2067 access instances, so we should not warn. */
2068 || (CLASSTYPE_FRIEND_CLASSES (t)
2069 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
2070 /* We will have warned when the template was declared; there's
2071 no need to warn on every instantiation. */
2072 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2073 /* There's no reason to even consider warning about this
2077 /* We only issue one warning, if more than one applies, because
2078 otherwise, on code like:
2081 // Oops - forgot `public:'
2087 we warn several times about essentially the same problem. */
2089 /* Check to see if all (non-constructor, non-destructor) member
2090 functions are private. (Since there are no friends or
2091 non-private statics, we can't ever call any of the private member
2093 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
2094 /* We're not interested in compiler-generated methods; they don't
2095 provide any way to call private members. */
2096 if (!DECL_ARTIFICIAL (fn))
2098 if (!TREE_PRIVATE (fn))
2100 if (DECL_STATIC_FUNCTION_P (fn))
2101 /* A non-private static member function is just like a
2102 friend; it can create and invoke private member
2103 functions, and be accessed without a class
2107 has_nonprivate_method = 1;
2110 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
2114 if (!has_nonprivate_method && has_member_fn)
2116 /* There are no non-private methods, and there's at least one
2117 private member function that isn't a constructor or
2118 destructor. (If all the private members are
2119 constructors/destructors we want to use the code below that
2120 issues error messages specifically referring to
2121 constructors/destructors.) */
2123 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
2124 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); i++)
2125 if (TREE_VIA_PUBLIC (TREE_VEC_ELT (binfos, i))
2126 || TREE_VIA_PROTECTED (TREE_VEC_ELT (binfos, i)))
2128 has_nonprivate_method = 1;
2131 if (!has_nonprivate_method)
2133 cp_warning ("all member functions in class `%T' are private", t);
2138 /* Even if some of the member functions are non-private, the class
2139 won't be useful for much if all the constructors or destructors
2140 are private: such an object can never be created or destroyed. */
2141 if (TYPE_HAS_DESTRUCTOR (t))
2143 tree dtor = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 1);
2145 if (TREE_PRIVATE (dtor))
2147 cp_warning ("`%#T' only defines a private destructor and has no friends",
2153 if (TYPE_HAS_CONSTRUCTOR (t))
2155 int nonprivate_ctor = 0;
2157 /* If a non-template class does not define a copy
2158 constructor, one is defined for it, enabling it to avoid
2159 this warning. For a template class, this does not
2160 happen, and so we would normally get a warning on:
2162 template <class T> class C { private: C(); };
2164 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
2165 complete non-template or fully instantiated classes have this
2167 if (!TYPE_HAS_INIT_REF (t))
2168 nonprivate_ctor = 1;
2170 for (fn = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 0);
2174 tree ctor = OVL_CURRENT (fn);
2175 /* Ideally, we wouldn't count copy constructors (or, in
2176 fact, any constructor that takes an argument of the
2177 class type as a parameter) because such things cannot
2178 be used to construct an instance of the class unless
2179 you already have one. But, for now at least, we're
2181 if (! TREE_PRIVATE (ctor))
2183 nonprivate_ctor = 1;
2188 if (nonprivate_ctor == 0)
2190 cp_warning ("`%#T' only defines private constructors and has no friends",
2197 /* Function to help qsort sort FIELD_DECLs by name order. */
2200 field_decl_cmp (x, y)
2203 if (DECL_NAME (*x) == DECL_NAME (*y))
2204 /* A nontype is "greater" than a type. */
2205 return DECL_DECLARES_TYPE_P (*y) - DECL_DECLARES_TYPE_P (*x);
2206 if (DECL_NAME (*x) == NULL_TREE)
2208 if (DECL_NAME (*y) == NULL_TREE)
2210 if (DECL_NAME (*x) < DECL_NAME (*y))
2215 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2218 method_name_cmp (m1, m2)
2219 const tree *m1, *m2;
2221 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
2223 if (*m1 == NULL_TREE)
2225 if (*m2 == NULL_TREE)
2227 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
2232 /* Warn about duplicate methods in fn_fields. Also compact method
2233 lists so that lookup can be made faster.
2235 Data Structure: List of method lists. The outer list is a
2236 TREE_LIST, whose TREE_PURPOSE field is the field name and the
2237 TREE_VALUE is the DECL_CHAIN of the FUNCTION_DECLs. TREE_CHAIN
2238 links the entire list of methods for TYPE_METHODS. Friends are
2239 chained in the same way as member functions (? TREE_CHAIN or
2240 DECL_CHAIN), but they live in the TREE_TYPE field of the outer
2241 list. That allows them to be quickly deleted, and requires no
2244 Sort methods that are not special (i.e., constructors, destructors,
2245 and type conversion operators) so that we can find them faster in
2249 finish_struct_methods (t)
2256 if (!TYPE_METHODS (t))
2258 /* Clear these for safety; perhaps some parsing error could set
2259 these incorrectly. */
2260 TYPE_HAS_CONSTRUCTOR (t) = 0;
2261 TYPE_HAS_DESTRUCTOR (t) = 0;
2262 CLASSTYPE_METHOD_VEC (t) = NULL_TREE;
2266 method_vec = CLASSTYPE_METHOD_VEC (t);
2267 my_friendly_assert (method_vec != NULL_TREE, 19991215);
2268 len = TREE_VEC_LENGTH (method_vec);
2270 /* First fill in entry 0 with the constructors, entry 1 with destructors,
2271 and the next few with type conversion operators (if any). */
2272 for (fn_fields = TYPE_METHODS (t); fn_fields;
2273 fn_fields = TREE_CHAIN (fn_fields))
2274 /* Clear out this flag. */
2275 DECL_IN_AGGR_P (fn_fields) = 0;
2277 if (TYPE_HAS_DESTRUCTOR (t) && !CLASSTYPE_DESTRUCTORS (t))
2278 /* We thought there was a destructor, but there wasn't. Some
2279 parse errors cause this anomalous situation. */
2280 TYPE_HAS_DESTRUCTOR (t) = 0;
2282 /* Issue warnings about private constructors and such. If there are
2283 no methods, then some public defaults are generated. */
2284 maybe_warn_about_overly_private_class (t);
2286 /* Now sort the methods. */
2287 while (len > 2 && TREE_VEC_ELT (method_vec, len-1) == NULL_TREE)
2289 TREE_VEC_LENGTH (method_vec) = len;
2291 /* The type conversion ops have to live at the front of the vec, so we
2293 for (slot = 2; slot < len; ++slot)
2295 tree fn = TREE_VEC_ELT (method_vec, slot);
2297 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
2301 qsort (&TREE_VEC_ELT (method_vec, slot), len-slot, sizeof (tree),
2302 (int (*)(const void *, const void *))method_name_cmp);
2305 /* Emit error when a duplicate definition of a type is seen. Patch up. */
2308 duplicate_tag_error (t)
2311 cp_error ("redefinition of `%#T'", t);
2312 cp_error_at ("previous definition here", t);
2314 /* Pretend we haven't defined this type. */
2316 /* All of the component_decl's were TREE_CHAINed together in the parser.
2317 finish_struct_methods walks these chains and assembles all methods with
2318 the same base name into DECL_CHAINs. Now we don't need the parser chains
2319 anymore, so we unravel them. */
2321 /* This used to be in finish_struct, but it turns out that the
2322 TREE_CHAIN is used by dbxout_type_methods and perhaps some other
2324 if (CLASSTYPE_METHOD_VEC (t))
2326 tree method_vec = CLASSTYPE_METHOD_VEC (t);
2327 int i, len = TREE_VEC_LENGTH (method_vec);
2328 for (i = 0; i < len; i++)
2330 tree unchain = TREE_VEC_ELT (method_vec, i);
2331 while (unchain != NULL_TREE)
2333 TREE_CHAIN (OVL_CURRENT (unchain)) = NULL_TREE;
2334 unchain = OVL_NEXT (unchain);
2339 if (TYPE_LANG_SPECIFIC (t))
2341 tree binfo = TYPE_BINFO (t);
2342 int interface_only = CLASSTYPE_INTERFACE_ONLY (t);
2343 int interface_unknown = CLASSTYPE_INTERFACE_UNKNOWN (t);
2344 tree template_info = CLASSTYPE_TEMPLATE_INFO (t);
2345 int use_template = CLASSTYPE_USE_TEMPLATE (t);
2347 bzero ((char *) TYPE_LANG_SPECIFIC (t), sizeof (struct lang_type));
2348 BINFO_BASETYPES(binfo) = NULL_TREE;
2350 TYPE_BINFO (t) = binfo;
2351 CLASSTYPE_INTERFACE_ONLY (t) = interface_only;
2352 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t, interface_unknown);
2353 TYPE_REDEFINED (t) = 1;
2354 CLASSTYPE_TEMPLATE_INFO (t) = template_info;
2355 CLASSTYPE_USE_TEMPLATE (t) = use_template;
2357 TYPE_SIZE (t) = NULL_TREE;
2358 TYPE_MODE (t) = VOIDmode;
2359 TYPE_FIELDS (t) = NULL_TREE;
2360 TYPE_METHODS (t) = NULL_TREE;
2361 TYPE_VFIELD (t) = NULL_TREE;
2362 TYPE_CONTEXT (t) = NULL_TREE;
2363 TYPE_NONCOPIED_PARTS (t) = NULL_TREE;
2366 /* Make the BINFO's vtablehave N entries, including RTTI entries,
2367 vbase and vcall offsets, etc. Set its type and call the backend
2371 layout_vtable_decl (binfo, n)
2379 itype = size_int (n);
2380 atype = build_cplus_array_type (vtable_entry_type,
2381 build_index_type (itype));
2382 layout_type (atype);
2384 /* We may have to grow the vtable. */
2385 vtable = get_vtbl_decl_for_binfo (binfo);
2386 if (!same_type_p (TREE_TYPE (vtable), atype))
2388 TREE_TYPE (vtable) = atype;
2389 DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE;
2390 layout_decl (vtable, 0);
2392 /* At one time the vtable info was grabbed 2 words at a time. This
2393 fails on Sparc unless you have 8-byte alignment. */
2394 DECL_ALIGN (vtable) = MAX (TYPE_ALIGN (double_type_node),
2395 DECL_ALIGN (vtable));
2399 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2400 have the same signature. */
2403 same_signature_p (fndecl, base_fndecl)
2404 tree fndecl, base_fndecl;
2406 /* One destructor overrides another if they are the same kind of
2408 if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl)
2409 && special_function_p (base_fndecl) == special_function_p (fndecl))
2411 /* But a non-destructor never overrides a destructor, nor vice
2412 versa, nor do different kinds of destructors override
2413 one-another. For example, a complete object destructor does not
2414 override a deleting destructor. */
2415 if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl))
2418 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl))
2420 tree types, base_types;
2421 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2422 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
2423 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types)))
2424 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types))))
2425 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
2431 typedef struct find_final_overrider_data_s {
2432 /* The function for which we are trying to find a final overrider. */
2434 /* The base class in which the function was declared. */
2435 tree declaring_base;
2436 /* The most derived class in the hierarchy. */
2437 tree most_derived_type;
2438 /* The final overriding function. */
2440 /* The BINFO for the class in which the final overriding function
2442 tree overriding_base;
2443 } find_final_overrider_data;
2445 /* Called from find_final_overrider via dfs_walk. */
2448 dfs_find_final_overrider (binfo, data)
2452 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
2454 if (same_type_p (BINFO_TYPE (binfo),
2455 BINFO_TYPE (ffod->declaring_base))
2456 && tree_int_cst_equal (BINFO_OFFSET (binfo),
2457 BINFO_OFFSET (ffod->declaring_base)))
2462 /* We haven't found an overrider yet. */
2464 /* We've found a path to the declaring base. Walk down the path
2465 looking for an overrider for FN. */
2466 for (path = reverse_path (binfo);
2468 path = TREE_CHAIN (path))
2470 for (method = TYPE_METHODS (BINFO_TYPE (TREE_VALUE (path)));
2472 method = TREE_CHAIN (method))
2473 if (DECL_VIRTUAL_P (method)
2474 && same_signature_p (method, ffod->fn))
2481 /* If we found an overrider, record the overriding function, and
2482 the base from which it came. */
2487 /* Assume the path is non-virtual. See if there are any
2488 virtual bases from (but not including) the overrider up
2489 to and including the base where the function is
2491 for (base = TREE_CHAIN (path); base; base = TREE_CHAIN (base))
2492 if (TREE_VIA_VIRTUAL (TREE_VALUE (base)))
2494 base = ffod->declaring_base;
2495 while (BINFO_PRIMARY_MARKED_P (base))
2497 BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P (base) = 1;
2498 base = BINFO_INHERITANCE_CHAIN (base);
2500 BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P (base) = 1;
2504 if (ffod->overriding_fn && ffod->overriding_fn != method)
2506 /* We've found a different overrider along a different
2507 path. That can be OK if the new one overrides the
2510 struct S { virtual void f(); };
2511 struct T : public virtual S { virtual void f(); };
2512 struct U : public virtual S, public virtual T {};
2514 Here `T::f' is the final overrider for `S::f'. */
2515 if (strictly_overrides (method, ffod->overriding_fn))
2517 ffod->overriding_fn = method;
2518 ffod->overriding_base = TREE_VALUE (path);
2520 else if (!strictly_overrides (ffod->overriding_fn, method))
2522 cp_error ("no unique final overrider for `%D' in `%T'",
2523 ffod->most_derived_type,
2525 cp_error ("candidates are: `%#D'", ffod->overriding_fn);
2526 cp_error (" `%#D'", method);
2527 return error_mark_node;
2530 else if (ffod->overriding_base
2531 && (!tree_int_cst_equal
2532 (BINFO_OFFSET (TREE_VALUE (path)),
2533 BINFO_OFFSET (ffod->overriding_base))))
2535 /* We've found two instances of the same base that
2536 provide overriders. */
2537 cp_error ("no unique final overrider for `%D' since there two instances of `%T' in `%T'",
2539 BINFO_TYPE (ffod->overriding_base),
2540 ffod->most_derived_type);
2541 return error_mark_node;
2545 ffod->overriding_fn = method;
2546 ffod->overriding_base = TREE_VALUE (path);
2554 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2555 FN and whose TREE_VALUE is the binfo for the base where the
2556 overriding occurs. BINFO (in the hierarchy dominated by T) is the
2557 base object in which FN is declared. */
2560 find_final_overrider (t, binfo, fn)
2565 find_final_overrider_data ffod;
2567 /* Getting this right is a little tricky. This is legal:
2569 struct S { virtual void f (); };
2570 struct T { virtual void f (); };
2571 struct U : public S, public T { };
2573 even though calling `f' in `U' is ambiguous. But,
2575 struct R { virtual void f(); };
2576 struct S : virtual public R { virtual void f (); };
2577 struct T : virtual public R { virtual void f (); };
2578 struct U : public S, public T { };
2580 is not -- there's no way to decide whether to put `S::f' or
2581 `T::f' in the vtable for `R'.
2583 The solution is to look at all paths to BINFO. If we find
2584 different overriders along any two, then there is a problem. */
2586 ffod.declaring_base = binfo;
2587 ffod.most_derived_type = t;
2588 ffod.overriding_fn = NULL_TREE;
2589 ffod.overriding_base = NULL_TREE;
2591 if (dfs_walk (TYPE_BINFO (t),
2592 dfs_find_final_overrider,
2595 return error_mark_node;
2597 return build_tree_list (ffod.overriding_fn, ffod.overriding_base);
2600 /* Update a entry in the vtable for BINFO, which is in the hierarchy
2601 dominated by T. FN has been overridden in BINFO; VIRTUALS points
2602 to the corresponding position in the BINFO_VIRTUALS list. */
2605 update_vtable_entry_for_fn (t, binfo, fn, virtuals)
2615 int generate_thunk_with_vtable_p;
2617 /* Find the function which originally caused this vtable
2618 entry to be present. */
2625 primary_base = get_primary_binfo (b);
2629 for (f = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (primary_base)));
2632 if (same_signature_p (BV_FN (f), fn))
2642 /* Find the final overrider. */
2643 overrider = find_final_overrider (t, b, fn);
2644 if (overrider == error_mark_node)
2647 /* Compute the constant adjustment to the `this' pointer. The
2648 `this' pointer, when this function is called, will point at the
2649 class whose vtable this is. */
2650 delta = size_binop (PLUS_EXPR,
2651 get_derived_offset (binfo,
2652 DECL_VIRTUAL_CONTEXT (fn)),
2653 BINFO_OFFSET (binfo));
2655 /* Assume that we will produce a thunk that convert all the way to
2656 the final overrider, and not to an intermediate virtual base. */
2657 virtual_base = NULL_TREE;
2659 /* Assume that we will always generate thunks with the vtables that
2661 generate_thunk_with_vtable_p = 1;
2663 /* Under the new ABI, we will convert to an intermediate virtual
2664 base first, and then use the vcall offset located there to finish
2670 /* If we find BINFO, then the final overrider is in a class
2671 derived from BINFO, so the thunks can be generated with
2672 the final overrider. */
2674 && same_type_p (BINFO_TYPE (b), BINFO_TYPE (binfo)))
2675 generate_thunk_with_vtable_p = 0;
2677 /* If we find the final overrider, then we can stop
2679 if (same_type_p (BINFO_TYPE (b),
2680 BINFO_TYPE (TREE_VALUE (overrider))))
2683 /* If we find a virtual base, and we haven't yet found the
2684 overrider, then there is a virtual base between the
2685 declaring base and the final overrider. */
2686 if (!virtual_base && TREE_VIA_VIRTUAL (b))
2688 generate_thunk_with_vtable_p = 1;
2692 b = BINFO_INHERITANCE_CHAIN (b);
2696 virtual_base = NULL_TREE;
2699 /* The `this' pointer needs to be adjusted to the nearest virtual
2701 delta = size_diffop (BINFO_OFFSET (virtual_base), delta);
2703 /* The `this' pointer needs to be adjusted from pointing to
2704 BINFO to pointing at the base where the final overrider
2706 delta = size_diffop (BINFO_OFFSET (TREE_VALUE (overrider)), delta);
2708 modify_vtable_entry (t,
2710 TREE_PURPOSE (overrider),
2715 BV_USE_VCALL_INDEX_P (*virtuals) = 1;
2716 if (generate_thunk_with_vtable_p)
2717 BV_GENERATE_THUNK_WITH_VTABLE_P (*virtuals) = 1;
2720 /* Called from modify_all_vtables via dfs_walk. */
2723 dfs_modify_vtables (binfo, data)
2727 if (/* There's no need to modify the vtable for a primary base;
2728 we're not going to use that vtable anyhow. */
2729 !BINFO_PRIMARY_MARKED_P (binfo)
2730 /* Similarly, a base without a vtable needs no modification. */
2731 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2739 /* If we're supporting RTTI then we always need a new vtable to
2740 point to the RTTI information. Under the new ABI we may need
2741 a new vtable to contain vcall and vbase offsets. */
2742 if (flag_rtti || flag_new_abi)
2743 make_new_vtable (t, binfo);
2745 /* Now, go through each of the virtual functions in the virtual
2746 function table for BINFO. Find the final overrider, and
2747 update the BINFO_VIRTUALS list appropriately. */
2748 for (virtuals = BINFO_VIRTUALS (binfo),
2749 old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
2751 virtuals = TREE_CHAIN (virtuals),
2752 old_virtuals = TREE_CHAIN (old_virtuals))
2753 update_vtable_entry_for_fn (t,
2755 BV_FN (old_virtuals),
2759 SET_BINFO_MARKED (binfo);
2764 /* Update all of the primary and secondary vtables for T. Create new
2765 vtables as required, and initialize their RTTI information. Each
2766 of the functions in OVERRIDDEN_VIRTUALS overrides a virtual
2767 function from a base class; find and modify the appropriate entries
2768 to point to the overriding functions. Returns a list, in
2769 declaration order, of the functions that are overridden in this
2770 class, but do not appear in the primary base class vtable, and
2771 which should therefore be appended to the end of the vtable for T. */
2774 modify_all_vtables (t, vfuns_p, overridden_virtuals)
2777 tree overridden_virtuals;
2781 binfo = TYPE_BINFO (t);
2783 /* Update all of the vtables. */
2786 dfs_unmarked_real_bases_queue_p,
2788 dfs_walk (binfo, dfs_unmark, dfs_marked_real_bases_queue_p, t);
2790 /* If we should include overriding functions for secondary vtables
2791 in our primary vtable, add them now. */
2792 if (all_overridden_vfuns_in_vtables_p ())
2794 tree *fnsp = &overridden_virtuals;
2798 tree fn = TREE_VALUE (*fnsp);
2800 if (!BINFO_VIRTUALS (binfo)
2801 || !value_member (fn, BINFO_VIRTUALS (binfo)))
2803 /* Set the vtable index. */
2804 set_vindex (t, fn, vfuns_p);
2805 /* We don't need to convert to a base class when calling
2807 DECL_VIRTUAL_CONTEXT (fn) = t;
2809 /* We don't need to adjust the `this' pointer when
2810 calling this function. */
2811 BV_DELTA (*fnsp) = integer_zero_node;
2812 BV_VCALL_INDEX (*fnsp) = NULL_TREE;
2814 /* This is an overridden function not already in our
2816 fnsp = &TREE_CHAIN (*fnsp);
2819 /* We've already got an entry for this function. Skip
2821 *fnsp = TREE_CHAIN (*fnsp);
2825 overridden_virtuals = NULL_TREE;
2827 return overridden_virtuals;
2830 /* Here, we already know that they match in every respect.
2831 All we have to check is where they had their declarations. */
2834 strictly_overrides (fndecl1, fndecl2)
2835 tree fndecl1, fndecl2;
2837 int distance = get_base_distance (DECL_CONTEXT (fndecl2),
2838 DECL_CONTEXT (fndecl1),
2840 if (distance == -2 || distance > 0)
2845 /* Get the base virtual function declarations in T that are either
2846 overridden or hidden by FNDECL as a list. We set TREE_PURPOSE with
2847 the overrider/hider. */
2850 get_basefndecls (fndecl, t)
2853 tree methods = TYPE_METHODS (t);
2854 tree base_fndecls = NULL_TREE;
2855 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
2856 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2860 if (TREE_CODE (methods) == FUNCTION_DECL
2861 && DECL_VINDEX (methods) != NULL_TREE
2862 && DECL_NAME (fndecl) == DECL_NAME (methods))
2863 base_fndecls = tree_cons (fndecl, methods, base_fndecls);
2865 methods = TREE_CHAIN (methods);
2869 return base_fndecls;
2871 for (i = 0; i < n_baseclasses; i++)
2873 tree base_binfo = TREE_VEC_ELT (binfos, i);
2874 tree basetype = BINFO_TYPE (base_binfo);
2876 base_fndecls = chainon (get_basefndecls (fndecl, basetype),
2880 return base_fndecls;
2883 /* Mark the functions that have been hidden with their overriders.
2884 Since we start out with all functions already marked with a hider,
2885 no need to mark functions that are just hidden.
2887 Subroutine of warn_hidden. */
2890 mark_overriders (fndecl, base_fndecls)
2891 tree fndecl, base_fndecls;
2893 for (; base_fndecls; base_fndecls = TREE_CHAIN (base_fndecls))
2894 if (same_signature_p (fndecl, TREE_VALUE (base_fndecls)))
2895 TREE_PURPOSE (base_fndecls) = fndecl;
2898 /* If this declaration supersedes the declaration of
2899 a method declared virtual in the base class, then
2900 mark this field as being virtual as well. */
2903 check_for_override (decl, ctype)
2906 tree binfos = BINFO_BASETYPES (TYPE_BINFO (ctype));
2907 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2908 int virtualp = DECL_VIRTUAL_P (decl);
2909 int found_overriden_fn = 0;
2911 for (i = 0; i < n_baselinks; i++)
2913 tree base_binfo = TREE_VEC_ELT (binfos, i);
2914 if (TYPE_POLYMORPHIC_P (BINFO_TYPE (base_binfo)))
2916 tree tmp = get_matching_virtual
2917 (base_binfo, decl, DECL_DESTRUCTOR_P (decl));
2919 if (tmp && !found_overriden_fn)
2921 /* If this function overrides some virtual in some base
2922 class, then the function itself is also necessarily
2923 virtual, even if the user didn't explicitly say so. */
2924 DECL_VIRTUAL_P (decl) = 1;
2926 /* The TMP we really want is the one from the deepest
2927 baseclass on this path, taking care not to
2928 duplicate if we have already found it (via another
2929 path to its virtual baseclass. */
2930 if (TREE_CODE (TREE_TYPE (decl)) == FUNCTION_TYPE)
2932 cp_error_at ("`static %#D' cannot be declared", decl);
2933 cp_error_at (" since `virtual %#D' declared in base class",
2939 /* Set DECL_VINDEX to a value that is neither an
2940 INTEGER_CST nor the error_mark_node so that
2941 add_virtual_function will realize this is an
2942 overridden function. */
2944 = tree_cons (tmp, NULL_TREE, DECL_VINDEX (decl));
2946 /* We now know that DECL overrides something,
2947 which is all that is important. But, we must
2948 continue to iterate through all the base-classes
2949 in order to allow get_matching_virtual to check for
2950 various illegal overrides. */
2951 found_overriden_fn = 1;
2957 if (DECL_VINDEX (decl) == NULL_TREE)
2958 DECL_VINDEX (decl) = error_mark_node;
2959 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2963 /* Warn about hidden virtual functions that are not overridden in t.
2964 We know that constructors and destructors don't apply. */
2970 tree method_vec = CLASSTYPE_METHOD_VEC (t);
2971 int n_methods = method_vec ? TREE_VEC_LENGTH (method_vec) : 0;
2974 /* We go through each separately named virtual function. */
2975 for (i = 2; i < n_methods && TREE_VEC_ELT (method_vec, i); ++i)
2977 tree fns = TREE_VEC_ELT (method_vec, i);
2978 tree fndecl = NULL_TREE;
2980 tree base_fndecls = NULL_TREE;
2981 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
2982 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2984 /* First see if we have any virtual functions in this batch. */
2985 for (; fns; fns = OVL_NEXT (fns))
2987 fndecl = OVL_CURRENT (fns);
2988 if (DECL_VINDEX (fndecl))
2992 if (fns == NULL_TREE)
2995 /* First we get a list of all possible functions that might be
2996 hidden from each base class. */
2997 for (i = 0; i < n_baseclasses; i++)
2999 tree base_binfo = TREE_VEC_ELT (binfos, i);
3000 tree basetype = BINFO_TYPE (base_binfo);
3002 base_fndecls = chainon (get_basefndecls (fndecl, basetype),
3006 fns = OVL_NEXT (fns);
3008 /* ...then mark up all the base functions with overriders, preferring
3009 overriders to hiders. */
3011 for (; fns; fns = OVL_NEXT (fns))
3013 fndecl = OVL_CURRENT (fns);
3014 if (DECL_VINDEX (fndecl))
3015 mark_overriders (fndecl, base_fndecls);
3018 /* Now give a warning for all base functions without overriders,
3019 as they are hidden. */
3020 for (; base_fndecls; base_fndecls = TREE_CHAIN (base_fndecls))
3021 if (!same_signature_p (TREE_PURPOSE (base_fndecls),
3022 TREE_VALUE (base_fndecls)))
3024 /* Here we know it is a hider, and no overrider exists. */
3025 cp_warning_at ("`%D' was hidden", TREE_VALUE (base_fndecls));
3026 cp_warning_at (" by `%D'", TREE_PURPOSE (base_fndecls));
3031 /* Check for things that are invalid. There are probably plenty of other
3032 things we should check for also. */
3035 finish_struct_anon (t)
3040 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
3042 if (TREE_STATIC (field))
3044 if (TREE_CODE (field) != FIELD_DECL)
3047 if (DECL_NAME (field) == NULL_TREE
3048 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
3050 tree elt = TYPE_FIELDS (TREE_TYPE (field));
3051 for (; elt; elt = TREE_CHAIN (elt))
3053 if (DECL_ARTIFICIAL (elt))
3056 if (DECL_NAME (elt) == constructor_name (t))
3057 cp_pedwarn_at ("ISO C++ forbids member `%D' with same name as enclosing class",
3060 if (TREE_CODE (elt) != FIELD_DECL)
3062 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
3067 if (TREE_PRIVATE (elt))
3068 cp_pedwarn_at ("private member `%#D' in anonymous union",
3070 else if (TREE_PROTECTED (elt))
3071 cp_pedwarn_at ("protected member `%#D' in anonymous union",
3074 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
3075 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
3081 /* Create default constructors, assignment operators, and so forth for
3082 the type indicated by T, if they are needed.
3083 CANT_HAVE_DEFAULT_CTOR, CANT_HAVE_CONST_CTOR, and
3084 CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, the
3085 class cannot have a default constructor, copy constructor taking a
3086 const reference argument, or an assignment operator taking a const
3087 reference, respectively. If a virtual destructor is created, its
3088 DECL is returned; otherwise the return value is NULL_TREE. */
3091 add_implicitly_declared_members (t, cant_have_default_ctor,
3092 cant_have_const_cctor,
3093 cant_have_const_assignment)
3095 int cant_have_default_ctor;
3096 int cant_have_const_cctor;
3097 int cant_have_const_assignment;
3100 tree implicit_fns = NULL_TREE;
3101 tree virtual_dtor = NULL_TREE;
3105 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) && !TYPE_HAS_DESTRUCTOR (t))
3107 default_fn = implicitly_declare_fn (sfk_destructor, t, /*const_p=*/0);
3108 check_for_override (default_fn, t);
3110 /* If we couldn't make it work, then pretend we didn't need it. */
3111 if (default_fn == void_type_node)
3112 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 0;
3115 TREE_CHAIN (default_fn) = implicit_fns;
3116 implicit_fns = default_fn;
3118 if (DECL_VINDEX (default_fn))
3119 virtual_dtor = default_fn;
3123 /* Any non-implicit destructor is non-trivial. */
3124 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |= TYPE_HAS_DESTRUCTOR (t);
3126 /* Default constructor. */
3127 if (! TYPE_HAS_CONSTRUCTOR (t) && ! cant_have_default_ctor)
3129 default_fn = implicitly_declare_fn (sfk_constructor, t, /*const_p=*/0);
3130 TREE_CHAIN (default_fn) = implicit_fns;
3131 implicit_fns = default_fn;
3134 /* Copy constructor. */
3135 if (! TYPE_HAS_INIT_REF (t) && ! TYPE_FOR_JAVA (t))
3137 /* ARM 12.18: You get either X(X&) or X(const X&), but
3140 = implicitly_declare_fn (sfk_copy_constructor, t,
3141 /*const_p=*/!cant_have_const_cctor);
3142 TREE_CHAIN (default_fn) = implicit_fns;
3143 implicit_fns = default_fn;
3146 /* Assignment operator. */
3147 if (! TYPE_HAS_ASSIGN_REF (t) && ! TYPE_FOR_JAVA (t))
3150 = implicitly_declare_fn (sfk_assignment_operator, t,
3151 /*const_p=*/!cant_have_const_assignment);
3152 TREE_CHAIN (default_fn) = implicit_fns;
3153 implicit_fns = default_fn;
3156 /* Now, hook all of the new functions on to TYPE_METHODS,
3157 and add them to the CLASSTYPE_METHOD_VEC. */
3158 for (f = &implicit_fns; *f; f = &TREE_CHAIN (*f))
3159 add_method (t, *f, /*error_p=*/0);
3160 *f = TYPE_METHODS (t);
3161 TYPE_METHODS (t) = implicit_fns;
3163 return virtual_dtor;
3166 /* Subroutine of finish_struct_1. Recursively count the number of fields
3167 in TYPE, including anonymous union members. */
3170 count_fields (fields)
3175 for (x = fields; x; x = TREE_CHAIN (x))
3177 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
3178 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
3185 /* Subroutine of finish_struct_1. Recursively add all the fields in the
3186 TREE_LIST FIELDS to the TREE_VEC FIELD_VEC, starting at offset IDX. */
3189 add_fields_to_vec (fields, field_vec, idx)
3190 tree fields, field_vec;
3194 for (x = fields; x; x = TREE_CHAIN (x))
3196 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
3197 idx = add_fields_to_vec (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
3199 TREE_VEC_ELT (field_vec, idx++) = x;
3204 /* FIELD is a bit-field. We are finishing the processing for its
3205 enclosing type. Issue any appropriate messages and set appropriate
3209 check_bitfield_decl (field)
3212 tree type = TREE_TYPE (field);
3215 /* Detect invalid bit-field type. */
3216 if (DECL_INITIAL (field)
3217 && ! INTEGRAL_TYPE_P (TREE_TYPE (field)))
3219 cp_error_at ("bit-field `%#D' with non-integral type", field);
3220 w = error_mark_node;
3223 /* Detect and ignore out of range field width. */
3224 if (DECL_INITIAL (field))
3226 w = DECL_INITIAL (field);
3228 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3231 /* detect invalid field size. */
3232 if (TREE_CODE (w) == CONST_DECL)
3233 w = DECL_INITIAL (w);
3235 w = decl_constant_value (w);
3237 if (TREE_CODE (w) != INTEGER_CST)
3239 cp_error_at ("bit-field `%D' width not an integer constant",
3241 w = error_mark_node;
3243 else if (tree_int_cst_sgn (w) < 0)
3245 cp_error_at ("negative width in bit-field `%D'", field);
3246 w = error_mark_node;
3248 else if (integer_zerop (w) && DECL_NAME (field) != 0)
3250 cp_error_at ("zero width for bit-field `%D'", field);
3251 w = error_mark_node;
3253 else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0
3254 && TREE_CODE (type) != ENUMERAL_TYPE
3255 && TREE_CODE (type) != BOOLEAN_TYPE)
3256 cp_warning_at ("width of `%D' exceeds its type", field);
3257 else if (TREE_CODE (type) == ENUMERAL_TYPE
3258 && (0 > compare_tree_int (w,
3259 min_precision (TYPE_MIN_VALUE (type),
3260 TREE_UNSIGNED (type)))
3261 || 0 > compare_tree_int (w,
3263 (TYPE_MAX_VALUE (type),
3264 TREE_UNSIGNED (type)))))
3265 cp_warning_at ("`%D' is too small to hold all values of `%#T'",
3269 /* Remove the bit-field width indicator so that the rest of the
3270 compiler does not treat that value as an initializer. */
3271 DECL_INITIAL (field) = NULL_TREE;
3273 if (w != error_mark_node)
3275 DECL_SIZE (field) = convert (bitsizetype, w);
3276 DECL_BIT_FIELD (field) = 1;
3278 if (integer_zerop (w))
3280 #ifdef EMPTY_FIELD_BOUNDARY
3281 DECL_ALIGN (field) = MAX (DECL_ALIGN (field),
3282 EMPTY_FIELD_BOUNDARY);
3284 #ifdef PCC_BITFIELD_TYPE_MATTERS
3285 if (PCC_BITFIELD_TYPE_MATTERS)
3287 DECL_ALIGN (field) = MAX (DECL_ALIGN (field),
3289 DECL_USER_ALIGN (field) |= TYPE_USER_ALIGN (type);
3296 /* Non-bit-fields are aligned for their type. */
3297 DECL_BIT_FIELD (field) = 0;
3298 CLEAR_DECL_C_BIT_FIELD (field);
3299 DECL_ALIGN (field) = MAX (DECL_ALIGN (field), TYPE_ALIGN (type));
3300 DECL_USER_ALIGN (field) |= TYPE_USER_ALIGN (type);
3304 /* FIELD is a non bit-field. We are finishing the processing for its
3305 enclosing type T. Issue any appropriate messages and set appropriate
3309 check_field_decl (field, t, cant_have_const_ctor,
3310 cant_have_default_ctor, no_const_asn_ref,
3311 any_default_members)
3314 int *cant_have_const_ctor;
3315 int *cant_have_default_ctor;
3316 int *no_const_asn_ref;
3317 int *any_default_members;
3319 tree type = strip_array_types (TREE_TYPE (field));
3321 /* An anonymous union cannot contain any fields which would change
3322 the settings of CANT_HAVE_CONST_CTOR and friends. */
3323 if (ANON_UNION_TYPE_P (type))
3325 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
3326 structs. So, we recurse through their fields here. */
3327 else if (ANON_AGGR_TYPE_P (type))
3331 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
3332 if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
3333 check_field_decl (fields, t, cant_have_const_ctor,
3334 cant_have_default_ctor, no_const_asn_ref,
3335 any_default_members);
3337 /* Check members with class type for constructors, destructors,
3339 else if (CLASS_TYPE_P (type))
3341 /* Never let anything with uninheritable virtuals
3342 make it through without complaint. */
3343 abstract_virtuals_error (field, type);
3345 if (TREE_CODE (t) == UNION_TYPE)
3347 if (TYPE_NEEDS_CONSTRUCTING (type))
3348 cp_error_at ("member `%#D' with constructor not allowed in union",
3350 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3351 cp_error_at ("member `%#D' with destructor not allowed in union",
3353 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
3354 cp_error_at ("member `%#D' with copy assignment operator not allowed in union",
3359 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
3360 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
3361 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type);
3362 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
3363 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
3366 if (!TYPE_HAS_CONST_INIT_REF (type))
3367 *cant_have_const_ctor = 1;
3369 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
3370 *no_const_asn_ref = 1;
3372 if (TYPE_HAS_CONSTRUCTOR (type)
3373 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
3374 *cant_have_default_ctor = 1;
3376 if (DECL_INITIAL (field) != NULL_TREE)
3378 /* `build_class_init_list' does not recognize
3380 if (TREE_CODE (t) == UNION_TYPE && any_default_members != 0)
3381 cp_error_at ("multiple fields in union `%T' initialized");
3382 *any_default_members = 1;
3385 /* Non-bit-fields are aligned for their type, except packed fields
3386 which require only BITS_PER_UNIT alignment. */
3387 DECL_ALIGN (field) = MAX (DECL_ALIGN (field),
3388 (DECL_PACKED (field)
3390 : TYPE_ALIGN (TREE_TYPE (field))));
3391 if (! DECL_PACKED (field))
3392 DECL_USER_ALIGN (field) |= TYPE_USER_ALIGN (TREE_TYPE (field));
3395 /* Check the data members (both static and non-static), class-scoped
3396 typedefs, etc., appearing in the declaration of T. Issue
3397 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3398 declaration order) of access declarations; each TREE_VALUE in this
3399 list is a USING_DECL.
3401 In addition, set the following flags:
3404 The class is empty, i.e., contains no non-static data members.
3406 CANT_HAVE_DEFAULT_CTOR_P
3407 This class cannot have an implicitly generated default
3410 CANT_HAVE_CONST_CTOR_P
3411 This class cannot have an implicitly generated copy constructor
3412 taking a const reference.
3414 CANT_HAVE_CONST_ASN_REF
3415 This class cannot have an implicitly generated assignment
3416 operator taking a const reference.
3418 All of these flags should be initialized before calling this
3421 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3422 fields can be added by adding to this chain. */
3425 check_field_decls (t, access_decls, empty_p,
3426 cant_have_default_ctor_p, cant_have_const_ctor_p,
3431 int *cant_have_default_ctor_p;
3432 int *cant_have_const_ctor_p;
3433 int *no_const_asn_ref_p;
3438 int any_default_members;
3440 /* First, delete any duplicate fields. */
3441 delete_duplicate_fields (TYPE_FIELDS (t));
3443 /* Assume there are no access declarations. */
3444 *access_decls = NULL_TREE;
3445 /* Assume this class has no pointer members. */
3447 /* Assume none of the members of this class have default
3449 any_default_members = 0;
3451 for (field = &TYPE_FIELDS (t); *field; field = next)
3454 tree type = TREE_TYPE (x);
3456 GNU_xref_member (current_class_name, x);
3458 next = &TREE_CHAIN (x);
3460 if (TREE_CODE (x) == FIELD_DECL)
3462 DECL_PACKED (x) |= TYPE_PACKED (t);
3464 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
3465 /* We don't treat zero-width bitfields as making a class
3470 /* The class is non-empty. */
3472 /* The class is not even nearly empty. */
3473 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3477 if (TREE_CODE (x) == USING_DECL)
3479 /* Prune the access declaration from the list of fields. */
3480 *field = TREE_CHAIN (x);
3482 /* Save the access declarations for our caller. */
3483 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
3485 /* Since we've reset *FIELD there's no reason to skip to the
3491 if (TREE_CODE (x) == TYPE_DECL
3492 || TREE_CODE (x) == TEMPLATE_DECL)
3495 /* If we've gotten this far, it's a data member, possibly static,
3496 or an enumerator. */
3498 DECL_CONTEXT (x) = t;
3500 /* ``A local class cannot have static data members.'' ARM 9.4 */
3501 if (current_function_decl && TREE_STATIC (x))
3502 cp_error_at ("field `%D' in local class cannot be static", x);
3504 /* Perform error checking that did not get done in
3506 if (TREE_CODE (type) == FUNCTION_TYPE)
3508 cp_error_at ("field `%D' invalidly declared function type",
3510 type = build_pointer_type (type);
3511 TREE_TYPE (x) = type;
3513 else if (TREE_CODE (type) == METHOD_TYPE)
3515 cp_error_at ("field `%D' invalidly declared method type", x);
3516 type = build_pointer_type (type);
3517 TREE_TYPE (x) = type;
3519 else if (TREE_CODE (type) == OFFSET_TYPE)
3521 cp_error_at ("field `%D' invalidly declared offset type", x);
3522 type = build_pointer_type (type);
3523 TREE_TYPE (x) = type;
3526 if (type == error_mark_node)
3529 /* When this goes into scope, it will be a non-local reference. */
3530 DECL_NONLOCAL (x) = 1;
3532 if (TREE_CODE (x) == CONST_DECL)
3535 if (TREE_CODE (x) == VAR_DECL)
3537 if (TREE_CODE (t) == UNION_TYPE)
3538 /* Unions cannot have static members. */
3539 cp_error_at ("field `%D' declared static in union", x);
3544 /* Now it can only be a FIELD_DECL. */
3546 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
3547 CLASSTYPE_NON_AGGREGATE (t) = 1;
3549 /* If this is of reference type, check if it needs an init.
3550 Also do a little ANSI jig if necessary. */
3551 if (TREE_CODE (type) == REFERENCE_TYPE)
3553 CLASSTYPE_NON_POD_P (t) = 1;
3554 if (DECL_INITIAL (x) == NULL_TREE)
3555 CLASSTYPE_REF_FIELDS_NEED_INIT (t) = 1;
3557 /* ARM $12.6.2: [A member initializer list] (or, for an
3558 aggregate, initialization by a brace-enclosed list) is the
3559 only way to initialize nonstatic const and reference
3561 *cant_have_default_ctor_p = 1;
3562 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3564 if (! TYPE_HAS_CONSTRUCTOR (t) && extra_warnings)
3567 cp_warning_at ("non-static reference `%#D' in class without a constructor", x);
3569 cp_warning_at ("non-static reference in class without a constructor", x);
3573 type = strip_array_types (type);
3575 if (TREE_CODE (type) == POINTER_TYPE)
3578 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
3579 CLASSTYPE_HAS_MUTABLE (t) = 1;
3581 if (! pod_type_p (type)
3582 /* For some reason, pointers to members are POD types themselves,
3583 but are not allowed in POD structs. Silly. */
3584 || TYPE_PTRMEM_P (type) || TYPE_PTRMEMFUNC_P (type))
3585 CLASSTYPE_NON_POD_P (t) = 1;
3587 /* If any field is const, the structure type is pseudo-const. */
3588 if (CP_TYPE_CONST_P (type))
3590 C_TYPE_FIELDS_READONLY (t) = 1;
3591 if (DECL_INITIAL (x) == NULL_TREE)
3592 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) = 1;
3594 /* ARM $12.6.2: [A member initializer list] (or, for an
3595 aggregate, initialization by a brace-enclosed list) is the
3596 only way to initialize nonstatic const and reference
3598 *cant_have_default_ctor_p = 1;
3599 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3601 if (! TYPE_HAS_CONSTRUCTOR (t) && extra_warnings)
3604 cp_warning_at ("non-static const member `%#D' in class without a constructor", x);
3606 cp_warning_at ("non-static const member in class without a constructor", x);
3609 /* A field that is pseudo-const makes the structure likewise. */
3610 else if (IS_AGGR_TYPE (type))
3612 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
3613 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
3614 |= CLASSTYPE_READONLY_FIELDS_NEED_INIT (type);
3617 /* Core issue 80: A nonstatic data member is required to have a
3618 different name from the class iff the class has a
3619 user-defined constructor. */
3620 if (DECL_NAME (x) == constructor_name (t)
3621 && TYPE_HAS_CONSTRUCTOR (t))
3622 cp_pedwarn_at ("field `%#D' with same name as class", x);
3624 /* We set DECL_C_BIT_FIELD in grokbitfield.
3625 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3626 if (DECL_C_BIT_FIELD (x))
3627 check_bitfield_decl (x);
3629 check_field_decl (x, t,
3630 cant_have_const_ctor_p,
3631 cant_have_default_ctor_p,
3633 &any_default_members);
3636 /* Effective C++ rule 11. */
3637 if (has_pointers && warn_ecpp && TYPE_HAS_CONSTRUCTOR (t)
3638 && ! (TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3640 cp_warning ("`%#T' has pointer data members", t);
3642 if (! TYPE_HAS_INIT_REF (t))
3644 cp_warning (" but does not override `%T(const %T&)'", t, t);
3645 if (! TYPE_HAS_ASSIGN_REF (t))
3646 cp_warning (" or `operator=(const %T&)'", t);
3648 else if (! TYPE_HAS_ASSIGN_REF (t))
3649 cp_warning (" but does not override `operator=(const %T&)'", t);
3653 /* Check anonymous struct/anonymous union fields. */
3654 finish_struct_anon (t);
3656 /* We've built up the list of access declarations in reverse order.
3658 *access_decls = nreverse (*access_decls);
3661 /* Return a FIELD_DECL for a pointer-to-virtual-table or
3662 pointer-to-virtual-base. The NAME, ASSEMBLER_NAME, and TYPE of the
3663 field are as indicated. The CLASS_TYPE in which this field occurs
3664 is also indicated. FCONTEXT is the type that is needed for the debug
3665 info output routines. *EMPTY_P is set to a non-zero value by this
3666 function to indicate that a class containing this field is
3670 build_vtbl_or_vbase_field (name, assembler_name, type, class_type, fcontext,
3673 tree assembler_name;
3681 /* This class is non-empty. */
3684 /* Build the FIELD_DECL. */
3685 field = build_decl (FIELD_DECL, name, type);
3686 DECL_ASSEMBLER_NAME (field) = assembler_name;
3687 DECL_VIRTUAL_P (field) = 1;
3688 DECL_ARTIFICIAL (field) = 1;
3689 DECL_FIELD_CONTEXT (field) = class_type;
3690 DECL_FCONTEXT (field) = fcontext;
3691 DECL_ALIGN (field) = TYPE_ALIGN (type);
3692 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (type);
3698 /* Record the type of BINFO in the slot in DATA (which is really a
3699 `varray_type *') corresponding to the BINFO_OFFSET. */
3702 dfs_record_base_offsets (binfo, data)
3707 unsigned HOST_WIDE_INT offset = tree_low_cst (BINFO_OFFSET (binfo), 1);
3709 v = (varray_type *) data;
3710 while (VARRAY_SIZE (*v) <= offset)
3711 VARRAY_GROW (*v, 2 * VARRAY_SIZE (*v));
3712 VARRAY_TREE (*v, offset) = tree_cons (NULL_TREE,
3714 VARRAY_TREE (*v, offset));
3719 /* Add the offset of BINFO and its bases to BASE_OFFSETS. */
3722 record_base_offsets (binfo, base_offsets)
3724 varray_type *base_offsets;
3727 dfs_record_base_offsets,
3732 /* Returns non-NULL if there is already an entry in DATA (which is
3733 really a `varray_type') indicating that an object with the same
3734 type of BINFO is already at the BINFO_OFFSET for BINFO. */
3737 dfs_search_base_offsets (binfo, data)
3741 if (is_empty_class (BINFO_TYPE (binfo)))
3743 varray_type v = (varray_type) data;
3744 /* Find the offset for this BINFO. */
3745 unsigned HOST_WIDE_INT offset = tree_low_cst (BINFO_OFFSET (binfo), 1);
3748 /* If we haven't yet encountered any objects at offsets that
3749 big, then there's no conflict. */
3750 if (VARRAY_SIZE (v) <= offset)
3752 /* Otherwise, go through the objects already allocated at this
3754 for (t = VARRAY_TREE (v, offset); t; t = TREE_CHAIN (t))
3755 if (same_type_p (TREE_VALUE (t), BINFO_TYPE (binfo)))
3762 /* Returns non-zero if there's a conflict between BINFO and a base
3763 already mentioned in BASE_OFFSETS if BINFO is placed at its current
3767 layout_conflict_p (binfo, base_offsets)
3769 varray_type base_offsets;
3771 return dfs_walk (binfo, dfs_search_base_offsets, dfs_skip_vbases,
3772 base_offsets) != NULL_TREE;
3775 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3776 non-static data member of the type indicated by RLI. BINFO is the
3777 binfo corresponding to the base subobject, or, if this is a
3778 non-static data-member, a dummy BINFO for the type of the data
3779 member. BINFO may be NULL if checks to see if the field overlaps
3780 an existing field with the same type are not required. V maps
3781 offsets to types already located at those offsets. This function
3782 determines the position of the DECL. */
3785 layout_nonempty_base_or_field (rli, decl, binfo, v)
3786 record_layout_info rli;
3791 /* Try to place the field. It may take more than one try if we have
3792 a hard time placing the field without putting two objects of the
3793 same type at the same address. */
3797 struct record_layout_info_s old_rli = *rli;
3799 /* Place this field. */
3800 place_field (rli, decl);
3802 /* Now that we know where it wil be placed, update its
3804 offset = byte_position (decl);
3805 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo)))
3806 propagate_binfo_offsets (binfo,
3807 convert (ssizetype, offset));
3809 /* We have to check to see whether or not there is already
3810 something of the same type at the offset we're about to use.
3814 struct T : public S { int i; };
3815 struct U : public S, public T {};
3817 Here, we put S at offset zero in U. Then, we can't put T at
3818 offset zero -- its S component would be at the same address
3819 as the S we already allocated. So, we have to skip ahead.
3820 Since all data members, including those whose type is an
3821 empty class, have non-zero size, any overlap can happen only
3822 with a direct or indirect base-class -- it can't happen with
3824 if (binfo && flag_new_abi && layout_conflict_p (binfo, v))
3826 /* Undo the propagate_binfo_offsets call. */
3827 offset = size_diffop (size_zero_node, offset);
3828 propagate_binfo_offsets (binfo, convert (ssizetype, offset));
3830 /* Strip off the size allocated to this field. That puts us
3831 at the first place we could have put the field with
3832 proper alignment. */
3835 /* Bump up by the alignment required for the type, without
3836 virtual base classes. */
3838 = size_binop (PLUS_EXPR, rli->bitpos,
3839 bitsize_int (CLASSTYPE_ALIGN (BINFO_TYPE (binfo))));
3840 normalize_rli (rli);
3843 /* There was no conflict. We're done laying out this field. */
3848 /* Layout the empty base BINFO. EOC indicates the byte currently just
3849 past the end of the class, and should be correctly aligned for a
3850 class of the type indicated by BINFO; BINFO_OFFSETS gives the
3851 offsets of the other bases allocated so far. */
3854 layout_empty_base (binfo, eoc, binfo_offsets)
3857 varray_type binfo_offsets;
3860 tree basetype = BINFO_TYPE (binfo);
3862 /* This routine should only be used for empty classes. */
3863 my_friendly_assert (is_empty_class (basetype), 20000321);
3864 alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype));
3866 /* This is an empty base class. We first try to put it at offset
3868 if (layout_conflict_p (binfo, binfo_offsets))
3870 /* That didn't work. Now, we move forward from the next
3871 available spot in the class. */
3872 propagate_binfo_offsets (binfo, convert (ssizetype, eoc));
3875 if (!layout_conflict_p (binfo, binfo_offsets))
3876 /* We finally found a spot where there's no overlap. */
3879 /* There's overlap here, too. Bump along to the next spot. */
3880 propagate_binfo_offsets (binfo, alignment);
3885 /* Build a FIELD_DECL for the base given by BINFO in the class
3886 indicated by RLI. If the new object is non-empty, clear *EMPTY_P.
3887 *BASE_ALIGN is a running maximum of the alignments of any base
3891 build_base_field (rli, binfo, empty_p, base_align, v)
3892 record_layout_info rli;
3895 unsigned int *base_align;
3898 tree basetype = BINFO_TYPE (binfo);
3901 if (!COMPLETE_TYPE_P (basetype))
3902 /* This error is now reported in xref_tag, thus giving better
3903 location information. */
3906 decl = build_decl (FIELD_DECL, NULL_TREE, basetype);
3907 DECL_ARTIFICIAL (decl) = 1;
3908 DECL_FIELD_CONTEXT (decl) = rli->t;
3909 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
3910 DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype);
3911 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
3912 DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype);
3916 /* Brain damage for backwards compatibility. For no good
3917 reason, the old basetype layout made every base have at least
3918 as large as the alignment for the bases up to that point,
3919 gratuitously wasting space. So we do the same thing here. */
3920 *base_align = MAX (*base_align, DECL_ALIGN (decl));
3922 = size_binop (MAX_EXPR, DECL_SIZE (decl), bitsize_int (*base_align));
3923 DECL_SIZE_UNIT (decl)
3924 = size_binop (MAX_EXPR, DECL_SIZE_UNIT (decl),
3925 size_int (*base_align / BITS_PER_UNIT));
3928 if (!integer_zerop (DECL_SIZE (decl)))
3930 /* The containing class is non-empty because it has a non-empty
3934 /* Try to place the field. It may take more than one try if we
3935 have a hard time placing the field without putting two
3936 objects of the same type at the same address. */
3937 layout_nonempty_base_or_field (rli, decl, binfo, *v);
3941 unsigned HOST_WIDE_INT eoc;
3943 /* On some platforms (ARM), even empty classes will not be
3945 eoc = tree_low_cst (rli_size_unit_so_far (rli), 0);
3946 eoc = CEIL (eoc, DECL_ALIGN (decl)) * DECL_ALIGN (decl);
3947 layout_empty_base (binfo, size_int (eoc), *v);
3950 /* Check for inaccessible base classes. If the same base class
3951 appears more than once in the hierarchy, but isn't virtual, then
3953 if (get_base_distance (basetype, rli->t, 0, NULL) == -2)
3954 cp_warning ("direct base `%T' inaccessible in `%T' due to ambiguity",
3957 /* Record the offsets of BINFO and its base subobjects. */
3958 record_base_offsets (binfo, v);
3961 /* Layout all of the non-virtual base classes. Returns a map from
3962 offsets to types present at those offsets. */
3965 build_base_fields (rli, empty_p)
3966 record_layout_info rli;
3969 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3972 int n_baseclasses = CLASSTYPE_N_BASECLASSES (rec);
3975 unsigned int base_align = 0;
3977 /* Create the table mapping offsets to empty base classes. */
3978 VARRAY_TREE_INIT (v, 32, "v");
3980 /* Under the new ABI, the primary base class is always allocated
3982 if (flag_new_abi && CLASSTYPE_HAS_PRIMARY_BASE_P (rec))
3983 build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (rec),
3984 empty_p, &base_align, &v);
3986 /* Now allocate the rest of the bases. */
3987 for (i = 0; i < n_baseclasses; ++i)
3991 base_binfo = BINFO_BASETYPE (TYPE_BINFO (rec), i);
3993 /* Under the new ABI, the primary base was already allocated
3994 above, so we don't need to allocate it again here. */
3995 if (flag_new_abi && base_binfo == CLASSTYPE_PRIMARY_BINFO (rec))
3998 /* A primary virtual base class is allocated just like any other
3999 base class, but a non-primary virtual base is allocated
4000 later, in layout_virtual_bases. */
4001 if (TREE_VIA_VIRTUAL (base_binfo)
4002 && !BINFO_PRIMARY_MARKED_P (base_binfo))
4005 build_base_field (rli, base_binfo, empty_p, &base_align, &v);
4011 /* Go through the TYPE_METHODS of T issuing any appropriate
4012 diagnostics, figuring out which methods override which other
4013 methods, and so forth. */
4020 int seen_one_arg_array_delete_p = 0;
4022 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
4024 GNU_xref_member (current_class_name, x);
4026 /* If this was an evil function, don't keep it in class. */
4027 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (x)))
4030 check_for_override (x, t);
4031 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
4032 cp_error_at ("initializer specified for non-virtual method `%D'", x);
4034 /* The name of the field is the original field name
4035 Save this in auxiliary field for later overloading. */
4036 if (DECL_VINDEX (x))
4038 TYPE_POLYMORPHIC_P (t) = 1;
4039 if (DECL_PURE_VIRTUAL_P (x))
4040 CLASSTYPE_PURE_VIRTUALS (t)
4041 = tree_cons (NULL_TREE, x, CLASSTYPE_PURE_VIRTUALS (t));
4044 if (DECL_ARRAY_DELETE_OPERATOR_P (x))
4048 /* When dynamically allocating an array of this type, we
4049 need a "cookie" to record how many elements we allocated,
4050 even if the array elements have no non-trivial
4051 destructor, if the usual array deallocation function
4052 takes a second argument of type size_t. The standard (in
4053 [class.free]) requires that the second argument be set
4055 second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (x)));
4056 /* This is overly conservative, but we must maintain this
4057 behavior for backwards compatibility. */
4058 if (!flag_new_abi && second_parm != void_list_node)
4059 TYPE_VEC_DELETE_TAKES_SIZE (t) = 1;
4060 /* Under the new ABI, we choose only those function that are
4061 explicitly declared as `operator delete[] (void *,
4063 else if (flag_new_abi
4064 && !seen_one_arg_array_delete_p
4066 && TREE_CHAIN (second_parm) == void_list_node
4067 && same_type_p (TREE_VALUE (second_parm), sizetype))
4068 TYPE_VEC_DELETE_TAKES_SIZE (t) = 1;
4069 /* If there's no second parameter, then this is the usual
4070 deallocation function. */
4071 else if (second_parm == void_list_node)
4072 seen_one_arg_array_delete_p = 1;
4077 /* FN is a constructor or destructor. Clone the declaration to create
4078 a specialized in-charge or not-in-charge version, as indicated by
4082 build_clone (fn, name)
4089 /* Copy the function. */
4090 clone = copy_decl (fn);
4091 /* Remember where this function came from. */
4092 DECL_CLONED_FUNCTION (clone) = fn;
4093 /* Reset the function name. */
4094 DECL_NAME (clone) = name;
4095 DECL_ASSEMBLER_NAME (clone) = DECL_NAME (clone);
4096 /* There's no pending inline data for this function. */
4097 DECL_PENDING_INLINE_INFO (clone) = NULL;
4098 DECL_PENDING_INLINE_P (clone) = 0;
4099 /* And it hasn't yet been deferred. */
4100 DECL_DEFERRED_FN (clone) = 0;
4101 /* There's no magic VTT parameter in the clone. */
4102 DECL_VTT_PARM (clone) = NULL_TREE;
4104 /* The base-class destructor is not virtual. */
4105 if (name == base_dtor_identifier)
4107 DECL_VIRTUAL_P (clone) = 0;
4108 if (TREE_CODE (clone) != TEMPLATE_DECL)
4109 DECL_VINDEX (clone) = NULL_TREE;
4112 /* If there was an in-charge parameter, drop it from the function
4114 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
4120 exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
4121 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
4122 parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone));
4123 /* Skip the `this' parameter. */
4124 parmtypes = TREE_CHAIN (parmtypes);
4125 /* Skip the in-charge parameter. */
4126 parmtypes = TREE_CHAIN (parmtypes);
4127 /* If this is subobject constructor or destructor, add the vtt
4129 if (DECL_NEEDS_VTT_PARM_P (clone))
4130 parmtypes = hash_tree_chain (vtt_parm_type, parmtypes);
4132 = build_cplus_method_type (basetype,
4133 TREE_TYPE (TREE_TYPE (clone)),
4136 TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone),
4140 /* Copy the function parameters. But, DECL_ARGUMENTS aren't
4141 function parameters; instead, those are the template parameters. */
4142 if (TREE_CODE (clone) != TEMPLATE_DECL)
4144 DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone));
4145 /* Remove the in-charge parameter. */
4146 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
4148 TREE_CHAIN (DECL_ARGUMENTS (clone))
4149 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone)));
4150 DECL_HAS_IN_CHARGE_PARM_P (clone) = 0;
4153 /* Add the VTT parameter. */
4154 if (DECL_NEEDS_VTT_PARM_P (clone))
4158 parm = build_artificial_parm (vtt_parm_identifier,
4160 TREE_CHAIN (parm) = TREE_CHAIN (DECL_ARGUMENTS (clone));
4161 TREE_CHAIN (DECL_ARGUMENTS (clone)) = parm;
4164 for (parms = DECL_ARGUMENTS (clone); parms; parms = TREE_CHAIN (parms))
4166 DECL_CONTEXT (parms) = clone;
4167 copy_lang_decl (parms);
4171 /* Mangle the function name. */
4172 set_mangled_name_for_decl (clone);
4174 /* Create the RTL for this function. */
4175 DECL_RTL (clone) = NULL_RTX;
4176 rest_of_decl_compilation (clone, NULL, /*top_level=*/1, at_eof);
4178 /* Make it easy to find the CLONE given the FN. */
4179 TREE_CHAIN (clone) = TREE_CHAIN (fn);
4180 TREE_CHAIN (fn) = clone;
4182 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
4183 if (TREE_CODE (clone) == TEMPLATE_DECL)
4187 DECL_TEMPLATE_RESULT (clone)
4188 = build_clone (DECL_TEMPLATE_RESULT (clone), name);
4189 result = DECL_TEMPLATE_RESULT (clone);
4190 DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result));
4191 DECL_TI_TEMPLATE (result) = clone;
4193 else if (DECL_DEFERRED_FN (fn))
4199 /* Produce declarations for all appropriate clones of FN. If
4200 UPDATE_METHOD_VEC_P is non-zero, the clones are added to the
4201 CLASTYPE_METHOD_VEC as well. */
4204 clone_function_decl (fn, update_method_vec_p)
4206 int update_method_vec_p;
4210 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
4212 /* For each constructor, we need two variants: an in-charge version
4213 and a not-in-charge version. */
4214 clone = build_clone (fn, complete_ctor_identifier);
4215 if (update_method_vec_p)
4216 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
4217 clone = build_clone (fn, base_ctor_identifier);
4218 if (update_method_vec_p)
4219 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
4223 my_friendly_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn), 20000411);
4225 /* For each destructor, we need three variants: an in-charge
4226 version, a not-in-charge version, and an in-charge deleting
4227 version. We clone the deleting version first because that
4228 means it will go second on the TYPE_METHODS list -- and that
4229 corresponds to the correct layout order in the virtual
4231 clone = build_clone (fn, deleting_dtor_identifier);
4232 if (update_method_vec_p)
4233 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
4234 clone = build_clone (fn, complete_dtor_identifier);
4235 if (update_method_vec_p)
4236 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
4237 clone = build_clone (fn, base_dtor_identifier);
4238 if (update_method_vec_p)
4239 add_method (DECL_CONTEXT (clone), clone, /*error_p=*/0);
4243 /* For each of the constructors and destructors in T, create an
4244 in-charge and not-in-charge variant. */
4247 clone_constructors_and_destructors (t)
4252 /* We only clone constructors and destructors under the new ABI. */
4256 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4258 if (!CLASSTYPE_METHOD_VEC (t))
4261 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4262 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4263 for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4264 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4267 /* Remove all zero-width bit-fields from T. */
4270 remove_zero_width_bit_fields (t)
4275 fieldsp = &TYPE_FIELDS (t);
4278 if (TREE_CODE (*fieldsp) == FIELD_DECL
4279 && DECL_C_BIT_FIELD (*fieldsp)
4280 && DECL_INITIAL (*fieldsp))
4281 *fieldsp = TREE_CHAIN (*fieldsp);
4283 fieldsp = &TREE_CHAIN (*fieldsp);
4287 /* Check the validity of the bases and members declared in T. Add any
4288 implicitly-generated functions (like copy-constructors and
4289 assignment operators). Compute various flag bits (like
4290 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4291 level: i.e., independently of the ABI in use. */
4294 check_bases_and_members (t, empty_p)
4298 /* Nonzero if we are not allowed to generate a default constructor
4300 int cant_have_default_ctor;
4301 /* Nonzero if the implicitly generated copy constructor should take
4302 a non-const reference argument. */
4303 int cant_have_const_ctor;
4304 /* Nonzero if the the implicitly generated assignment operator
4305 should take a non-const reference argument. */
4306 int no_const_asn_ref;
4309 /* By default, we use const reference arguments and generate default
4311 cant_have_default_ctor = 0;
4312 cant_have_const_ctor = 0;
4313 no_const_asn_ref = 0;
4315 /* Assume that the class is nearly empty; we'll clear this flag if
4316 it turns out not to be nearly empty. */
4317 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
4319 /* Check all the base-classes. */
4320 check_bases (t, &cant_have_default_ctor, &cant_have_const_ctor,
4323 /* Check all the data member declarations. */
4324 check_field_decls (t, &access_decls, empty_p,
4325 &cant_have_default_ctor,
4326 &cant_have_const_ctor,
4329 /* Check all the method declarations. */
4332 /* A nearly-empty class has to be vptr-containing; a nearly empty
4333 class contains just a vptr. */
4334 if (!TYPE_CONTAINS_VPTR_P (t))
4335 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4337 /* Do some bookkeeping that will guide the generation of implicitly
4338 declared member functions. */
4339 TYPE_HAS_COMPLEX_INIT_REF (t)
4340 |= (TYPE_HAS_INIT_REF (t)
4341 || TYPE_USES_VIRTUAL_BASECLASSES (t)
4342 || TYPE_POLYMORPHIC_P (t));
4343 TYPE_NEEDS_CONSTRUCTING (t)
4344 |= (TYPE_HAS_CONSTRUCTOR (t)
4345 || TYPE_USES_VIRTUAL_BASECLASSES (t)
4346 || TYPE_POLYMORPHIC_P (t));
4347 CLASSTYPE_NON_AGGREGATE (t) |= (TYPE_HAS_CONSTRUCTOR (t)
4348 || TYPE_POLYMORPHIC_P (t));
4349 CLASSTYPE_NON_POD_P (t)
4350 |= (CLASSTYPE_NON_AGGREGATE (t) || TYPE_HAS_DESTRUCTOR (t)
4351 || TYPE_HAS_ASSIGN_REF (t));
4352 TYPE_HAS_REAL_ASSIGN_REF (t) |= TYPE_HAS_ASSIGN_REF (t);
4353 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
4354 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_USES_VIRTUAL_BASECLASSES (t);
4356 /* Synthesize any needed methods. Note that methods will be synthesized
4357 for anonymous unions; grok_x_components undoes that. */
4358 add_implicitly_declared_members (t, cant_have_default_ctor,
4359 cant_have_const_ctor,
4362 /* Create the in-charge and not-in-charge variants of constructors
4364 clone_constructors_and_destructors (t);
4366 /* Process the using-declarations. */
4367 for (; access_decls; access_decls = TREE_CHAIN (access_decls))
4368 handle_using_decl (TREE_VALUE (access_decls), t);
4370 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4371 finish_struct_methods (t);
4374 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4375 accordingly. If a new vfield was created (because T doesn't have a
4376 primary base class), then the newly created field is returned. It
4377 is not added to the TYPE_FIELDS list; it is the caller's
4378 responsibility to do that. */
4381 create_vtable_ptr (t, empty_p, vfuns_p,
4382 new_virtuals_p, overridden_virtuals_p)
4386 tree *new_virtuals_p;
4387 tree *overridden_virtuals_p;
4391 /* Loop over the virtual functions, adding them to our various
4393 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
4394 if (DECL_VINDEX (fn)
4395 && !(flag_new_abi && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)))
4396 add_virtual_function (new_virtuals_p, overridden_virtuals_p,
4399 /* If we couldn't find an appropriate base class, create a new field
4400 here. Even if there weren't any new virtual functions, we might need a
4401 new virtual function table if we're supposed to include vptrs in
4402 all classes that need them. */
4403 if (!TYPE_VFIELD (t)
4405 || (TYPE_CONTAINS_VPTR_P (t) && vptrs_present_everywhere_p ())))
4407 /* We build this decl with vtbl_ptr_type_node, which is a
4408 `vtable_entry_type*'. It might seem more precise to use
4409 `vtable_entry_type (*)[N]' where N is the number of firtual
4410 functions. However, that would require the vtable pointer in
4411 base classes to have a different type than the vtable pointer
4412 in derived classes. We could make that happen, but that
4413 still wouldn't solve all the problems. In particular, the
4414 type-based alias analysis code would decide that assignments
4415 to the base class vtable pointer can't alias assignments to
4416 the derived class vtable pointer, since they have different
4417 types. Thus, in an derived class destructor, where the base
4418 class constructor was inlined, we could generate bad code for
4419 setting up the vtable pointer.
4421 Therefore, we use one type for all vtable pointers. We still
4422 use a type-correct type; it's just doesn't indicate the array
4423 bounds. That's better than using `void*' or some such; it's
4424 cleaner, and it let's the alias analysis code know that these
4425 stores cannot alias stores to void*! */
4427 = build_vtbl_or_vbase_field (get_vfield_name (t),
4428 get_identifier (VFIELD_BASE),
4434 if (flag_new_abi && CLASSTYPE_N_BASECLASSES (t))
4435 /* If there were any baseclasses, they can't possibly be at
4436 offset zero any more, because that's where the vtable
4437 pointer is. So, converting to a base class is going to
4439 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t) = 1;
4441 return TYPE_VFIELD (t);
4447 /* Fixup the inline function given by INFO now that the class is
4451 fixup_pending_inline (info)
4452 struct pending_inline *info;
4457 tree fn = info->fndecl;
4459 args = DECL_ARGUMENTS (fn);
4462 DECL_CONTEXT (args) = fn;
4463 args = TREE_CHAIN (args);
4468 /* Fixup the inline methods and friends in TYPE now that TYPE is
4472 fixup_inline_methods (type)
4475 tree method = TYPE_METHODS (type);
4477 if (method && TREE_CODE (method) == TREE_VEC)
4479 if (TREE_VEC_ELT (method, 1))
4480 method = TREE_VEC_ELT (method, 1);
4481 else if (TREE_VEC_ELT (method, 0))
4482 method = TREE_VEC_ELT (method, 0);
4484 method = TREE_VEC_ELT (method, 2);
4487 /* Do inline member functions. */
4488 for (; method; method = TREE_CHAIN (method))
4489 fixup_pending_inline (DECL_PENDING_INLINE_INFO (method));
4492 for (method = CLASSTYPE_INLINE_FRIENDS (type);
4494 method = TREE_CHAIN (method))
4495 fixup_pending_inline (DECL_PENDING_INLINE_INFO (TREE_VALUE (method)));
4496 CLASSTYPE_INLINE_FRIENDS (type) = NULL_TREE;
4499 /* Add OFFSET to all base types of BINFO which is a base in the
4500 hierarchy dominated by T.
4502 OFFSET, which is a type offset, is number of bytes. */
4505 propagate_binfo_offsets (binfo, offset)
4512 /* Update BINFO's offset. */
4513 BINFO_OFFSET (binfo)
4514 = convert (sizetype,
4515 size_binop (PLUS_EXPR,
4516 convert (ssizetype, BINFO_OFFSET (binfo)),
4519 /* Find the primary base class. */
4520 primary_binfo = get_primary_binfo (binfo);
4522 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4524 for (i = -1; i < BINFO_N_BASETYPES (binfo); ++i)
4528 /* On the first through the loop, do the primary base. Because
4529 the primary base need not be an immediate base, we must
4530 handle the primary base specially. */
4536 base_binfo = primary_binfo;
4540 base_binfo = BINFO_BASETYPE (binfo, i);
4541 /* Don't do the primary base twice. */
4542 if (base_binfo == primary_binfo)
4546 /* Skip virtual bases that aren't our primary base. */
4547 if (TREE_VIA_VIRTUAL (base_binfo)
4548 && BINFO_PRIMARY_BASE_OF (base_binfo) != binfo)
4551 propagate_binfo_offsets (base_binfo, offset);
4555 /* Called via dfs_walk from layout_virtual bases. */
4558 dfs_set_offset_for_unshared_vbases (binfo, data)
4562 /* If this is a virtual base, make sure it has the same offset as
4563 the shared copy. If it's a primary base, then we know it's
4565 if (TREE_VIA_VIRTUAL (binfo) && !BINFO_PRIMARY_MARKED_P (binfo))
4567 tree t = (tree) data;
4571 vbase = binfo_for_vbase (BINFO_TYPE (binfo), t);
4572 offset = size_diffop (BINFO_OFFSET (vbase), BINFO_OFFSET (binfo));
4573 propagate_binfo_offsets (binfo, offset);
4579 /* Set BINFO_OFFSET for all of the virtual bases for T. Update
4580 TYPE_ALIGN and TYPE_SIZE for T. BASE_OFFSETS is a varray mapping
4581 offsets to the types at those offsets. */
4584 layout_virtual_bases (t, base_offsets)
4586 varray_type *base_offsets;
4589 unsigned HOST_WIDE_INT dsize;
4590 unsigned HOST_WIDE_INT eoc;
4592 if (CLASSTYPE_N_BASECLASSES (t) == 0)
4595 #ifdef STRUCTURE_SIZE_BOUNDARY
4596 /* Packed structures don't need to have minimum size. */
4597 if (! TYPE_PACKED (t))
4598 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), STRUCTURE_SIZE_BOUNDARY);
4601 /* DSIZE is the size of the class without the virtual bases. */
4602 dsize = tree_low_cst (TYPE_SIZE (t), 1);
4604 /* Make every class have alignment of at least one. */
4605 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), BITS_PER_UNIT);
4607 /* Go through the virtual bases, allocating space for each virtual
4608 base that is not already a primary base class. Under the new
4609 ABI, these are allocated according to a depth-first left-to-right
4610 postorder traversal; in the new ABI, inheritance graph order is
4612 for (vbases = (flag_new_abi
4614 : CLASSTYPE_VBASECLASSES (t));
4616 vbases = TREE_CHAIN (vbases))
4622 if (!TREE_VIA_VIRTUAL (vbases))
4624 vbase = binfo_for_vbase (BINFO_TYPE (vbases), t);
4627 vbase = TREE_VALUE (vbases);
4629 if (!BINFO_PRIMARY_MARKED_P (vbase))
4631 /* This virtual base is not a primary base of any class in the
4632 hierarchy, so we have to add space for it. */
4634 unsigned int desired_align;
4636 basetype = BINFO_TYPE (vbase);
4639 desired_align = CLASSTYPE_ALIGN (basetype);
4641 /* Under the old ABI, virtual bases were aligned as for the
4642 entire base object (including its virtual bases). That's
4643 wasteful, in general. */
4644 desired_align = TYPE_ALIGN (basetype);
4645 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), desired_align);
4647 /* Add padding so that we can put the virtual base class at an
4648 appropriately aligned offset. */
4649 dsize = CEIL (dsize, desired_align) * desired_align;
4651 /* Under the new ABI, we try to squish empty virtual bases in
4652 just like ordinary empty bases. */
4653 if (flag_new_abi && is_empty_class (basetype))
4654 layout_empty_base (vbase,
4655 size_int (CEIL (dsize, BITS_PER_UNIT)),
4661 offset = ssize_int (CEIL (dsize, BITS_PER_UNIT));
4662 offset = size_diffop (offset,
4664 BINFO_OFFSET (vbase)));
4666 /* And compute the offset of the virtual base. */
4667 propagate_binfo_offsets (vbase, offset);
4668 /* Every virtual baseclass takes a least a UNIT, so that
4669 we can take it's address and get something different
4671 dsize += MAX (BITS_PER_UNIT,
4672 tree_low_cst (CLASSTYPE_SIZE (basetype), 0));
4675 /* Keep track of the offsets assigned to this virtual base. */
4676 record_base_offsets (vbase, base_offsets);
4680 /* Now, go through the TYPE_BINFO hierarchy, setting the
4681 BINFO_OFFSETs correctly for all non-primary copies of the virtual
4682 bases and their direct and indirect bases. The ambiguity checks
4683 in get_base_distance depend on the BINFO_OFFSETs being set
4685 dfs_walk (TYPE_BINFO (t), dfs_set_offset_for_unshared_vbases, NULL, t);
4687 /* If we had empty base classes that protruded beyond the end of the
4688 class, we didn't update DSIZE above; we were hoping to overlay
4689 multiple such bases at the same location. */
4690 eoc = end_of_class (t, /*include_virtuals_p=*/1);
4691 if (eoc * BITS_PER_UNIT > dsize)
4692 dsize = (eoc + 1) * BITS_PER_UNIT;
4694 /* Now, make sure that the total size of the type is a multiple of
4696 dsize = CEIL (dsize, TYPE_ALIGN (t)) * TYPE_ALIGN (t);
4697 TYPE_SIZE (t) = bitsize_int (dsize);
4698 TYPE_SIZE_UNIT (t) = convert (sizetype,
4699 size_binop (CEIL_DIV_EXPR, TYPE_SIZE (t),
4700 bitsize_unit_node));
4702 /* Check for ambiguous virtual bases. */
4704 for (vbases = CLASSTYPE_VBASECLASSES (t);
4706 vbases = TREE_CHAIN (vbases))
4708 tree basetype = BINFO_TYPE (TREE_VALUE (vbases));
4709 if (get_base_distance (basetype, t, 0, (tree*)0) == -2)
4710 cp_warning ("virtual base `%T' inaccessible in `%T' due to ambiguity",
4715 /* Returns the offset of the byte just past the end of the base class
4716 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4717 only non-virtual bases are included. */
4719 static unsigned HOST_WIDE_INT
4720 end_of_class (t, include_virtuals_p)
4722 int include_virtuals_p;
4724 unsigned HOST_WIDE_INT result = 0;
4727 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
4731 unsigned HOST_WIDE_INT end_of_base;
4733 base_binfo = BINFO_BASETYPE (TYPE_BINFO (t), i);
4735 if (!include_virtuals_p
4736 && TREE_VIA_VIRTUAL (base_binfo)
4737 && !BINFO_PRIMARY_MARKED_P (base_binfo))
4740 offset = size_binop (PLUS_EXPR,
4741 BINFO_OFFSET (base_binfo),
4742 CLASSTYPE_SIZE_UNIT (BINFO_TYPE (base_binfo)));
4743 end_of_base = tree_low_cst (offset, /*pos=*/1);
4744 if (end_of_base > result)
4745 result = end_of_base;
4751 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4752 BINFO_OFFSETs for all of the base-classes. Position the vtable
4756 layout_class_type (t, empty_p, vfuns_p,
4757 new_virtuals_p, overridden_virtuals_p)
4761 tree *new_virtuals_p;
4762 tree *overridden_virtuals_p;
4764 tree non_static_data_members;
4767 record_layout_info rli;
4769 unsigned HOST_WIDE_INT eoc;
4771 /* Keep track of the first non-static data member. */
4772 non_static_data_members = TYPE_FIELDS (t);
4774 /* Start laying out the record. */
4775 rli = start_record_layout (t);
4777 /* If possible, we reuse the virtual function table pointer from one
4778 of our base classes. */
4779 determine_primary_base (t, vfuns_p);
4781 /* Create a pointer to our virtual function table. */
4782 vptr = create_vtable_ptr (t, empty_p, vfuns_p,
4783 new_virtuals_p, overridden_virtuals_p);
4785 /* Under the new ABI, the vptr is always the first thing in the
4787 if (flag_new_abi && vptr)
4789 TYPE_FIELDS (t) = chainon (vptr, TYPE_FIELDS (t));
4790 place_field (rli, vptr);
4793 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4794 v = build_base_fields (rli, empty_p);
4795 /* Add pointers to all of our virtual base-classes. */
4796 TYPE_FIELDS (t) = chainon (build_vbase_pointer_fields (rli, empty_p),
4799 /* CLASSTYPE_INLINE_FRIENDS is really TYPE_NONCOPIED_PARTS. Thus,
4800 we have to save this before we start modifying
4801 TYPE_NONCOPIED_PARTS. */
4802 fixup_inline_methods (t);
4804 /* Layout the non-static data members. */
4805 for (field = non_static_data_members; field; field = TREE_CHAIN (field))
4811 /* We still pass things that aren't non-static data members to
4812 the back-end, in case it wants to do something with them. */
4813 if (TREE_CODE (field) != FIELD_DECL)
4815 place_field (rli, field);
4819 type = TREE_TYPE (field);
4821 /* If this field is a bit-field whose width is greater than its
4822 type, then there are some special rules for allocating it
4823 under the new ABI. Under the old ABI, there were no special
4824 rules, but the back-end can't handle bitfields longer than a
4825 `long long', so we use the same mechanism. */
4826 if (DECL_C_BIT_FIELD (field)
4828 && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field)))
4830 && 0 < compare_tree_int (DECL_SIZE (field),
4832 (long_long_unsigned_type_node)))))
4834 integer_type_kind itk;
4837 /* We must allocate the bits as if suitably aligned for the
4838 longest integer type that fits in this many bits. type
4839 of the field. Then, we are supposed to use the left over
4840 bits as additional padding. */
4841 for (itk = itk_char; itk != itk_none; ++itk)
4842 if (INT_CST_LT (DECL_SIZE (field),
4843 TYPE_SIZE (integer_types[itk])))
4846 /* ITK now indicates a type that is too large for the
4847 field. We have to back up by one to find the largest
4849 integer_type = integer_types[itk - 1];
4850 padding = size_binop (MINUS_EXPR, DECL_SIZE (field),
4851 TYPE_SIZE (integer_type));
4852 DECL_SIZE (field) = TYPE_SIZE (integer_type);
4853 DECL_ALIGN (field) = TYPE_ALIGN (integer_type);
4854 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type);
4857 padding = NULL_TREE;
4859 /* Create a dummy BINFO corresponding to this field. */
4860 binfo = make_binfo (size_zero_node, type, NULL_TREE, NULL_TREE);
4861 unshare_base_binfos (binfo);
4862 layout_nonempty_base_or_field (rli, field, binfo, v);
4864 /* If we needed additional padding after this field, add it
4870 padding_field = build_decl (FIELD_DECL,
4873 DECL_BIT_FIELD (padding_field) = 1;
4874 DECL_SIZE (padding_field) = padding;
4875 DECL_ALIGN (padding_field) = 1;
4876 DECL_USER_ALIGN (padding_field) = 0;
4877 layout_nonempty_base_or_field (rli, padding_field, NULL_TREE, v);
4881 /* It might be the case that we grew the class to allocate a
4882 zero-sized base class. That won't be reflected in RLI, yet,
4883 because we are willing to overlay multiple bases at the same
4884 offset. However, now we need to make sure that RLI is big enough
4885 to reflect the entire class. */
4886 eoc = end_of_class (t, /*include_virtuals_p=*/0);
4887 if (TREE_CODE (rli_size_unit_so_far (rli)) == INTEGER_CST
4888 && compare_tree_int (rli_size_unit_so_far (rli), eoc) < 0)
4890 /* We don't handle zero-sized base classes specially under the
4891 old ABI, so if we get here, we had better be operating under
4892 the new ABI rules. */
4893 my_friendly_assert (flag_new_abi, 20000321);
4894 rli->offset = size_binop (MAX_EXPR, rli->offset, size_int (eoc + 1));
4895 rli->bitpos = bitsize_zero_node;
4898 /* We make all structures have at least one element, so that they
4899 have non-zero size. In the new ABI, the class may be empty even
4900 if it has basetypes. Therefore, we add the fake field after all
4901 the other fields; if there are already FIELD_DECLs on the list,
4902 their offsets will not be disturbed. */
4907 padding = build_decl (FIELD_DECL, NULL_TREE, char_type_node);
4908 place_field (rli, padding);
4909 TYPE_NONCOPIED_PARTS (t)
4910 = tree_cons (NULL_TREE, padding, TYPE_NONCOPIED_PARTS (t));
4911 TREE_STATIC (TYPE_NONCOPIED_PARTS (t)) = 1;
4914 /* Under the old ABI, the vptr comes at the very end of the
4916 if (!flag_new_abi && vptr)
4918 place_field (rli, vptr);
4919 TYPE_FIELDS (t) = chainon (TYPE_FIELDS (t), vptr);
4922 /* Let the back-end lay out the type. Note that at this point we
4923 have only included non-virtual base-classes; we will lay out the
4924 virtual base classes later. So, the TYPE_SIZE/TYPE_ALIGN after
4925 this call are not necessarily correct; they are just the size and
4926 alignment when no virtual base clases are used. */
4927 finish_record_layout (rli);
4929 /* Delete all zero-width bit-fields from the list of fields. Now
4930 that the type is laid out they are no longer important. */
4931 remove_zero_width_bit_fields (t);
4933 /* Remember the size and alignment of the class before adding
4934 the virtual bases. */
4935 if (*empty_p && flag_new_abi)
4937 CLASSTYPE_SIZE (t) = bitsize_zero_node;
4938 CLASSTYPE_SIZE_UNIT (t) = size_zero_node;
4940 else if (flag_new_abi)
4942 CLASSTYPE_SIZE (t) = TYPE_BINFO_SIZE (t);
4943 CLASSTYPE_SIZE_UNIT (t) = TYPE_BINFO_SIZE_UNIT (t);
4947 CLASSTYPE_SIZE (t) = TYPE_SIZE (t);
4948 CLASSTYPE_SIZE_UNIT (t) = TYPE_SIZE_UNIT (t);
4951 CLASSTYPE_ALIGN (t) = TYPE_ALIGN (t);
4952 CLASSTYPE_USER_ALIGN (t) = TYPE_USER_ALIGN (t);
4954 /* Set the TYPE_DECL for this type to contain the right
4955 value for DECL_OFFSET, so that we can use it as part
4956 of a COMPONENT_REF for multiple inheritance. */
4957 layout_decl (TYPE_MAIN_DECL (t), 0);
4959 /* Now fix up any virtual base class types that we left lying
4960 around. We must get these done before we try to lay out the
4961 virtual function table. As a side-effect, this will remove the
4962 base subobject fields. */
4963 layout_virtual_bases (t, &v);
4969 /* Create a RECORD_TYPE or UNION_TYPE node for a C struct or union declaration
4970 (or C++ class declaration).
4972 For C++, we must handle the building of derived classes.
4973 Also, C++ allows static class members. The way that this is
4974 handled is to keep the field name where it is (as the DECL_NAME
4975 of the field), and place the overloaded decl in the bit position
4976 of the field. layout_record and layout_union will know about this.
4978 More C++ hair: inline functions have text in their
4979 DECL_PENDING_INLINE_INFO nodes which must somehow be parsed into
4980 meaningful tree structure. After the struct has been laid out, set
4981 things up so that this can happen.
4983 And still more: virtual functions. In the case of single inheritance,
4984 when a new virtual function is seen which redefines a virtual function
4985 from the base class, the new virtual function is placed into
4986 the virtual function table at exactly the same address that
4987 it had in the base class. When this is extended to multiple
4988 inheritance, the same thing happens, except that multiple virtual
4989 function tables must be maintained. The first virtual function
4990 table is treated in exactly the same way as in the case of single
4991 inheritance. Additional virtual function tables have different
4992 DELTAs, which tell how to adjust `this' to point to the right thing.
4994 ATTRIBUTES is the set of decl attributes to be applied, if any. */
5002 /* The NEW_VIRTUALS is a TREE_LIST. The TREE_VALUE of each node is
5003 a FUNCTION_DECL. Each of these functions is a virtual function
5004 declared in T that does not override any virtual function from a
5006 tree new_virtuals = NULL_TREE;
5007 /* The OVERRIDDEN_VIRTUALS list is like the NEW_VIRTUALS list,
5008 except that each declaration here overrides the declaration from
5010 tree overridden_virtuals = NULL_TREE;
5015 if (COMPLETE_TYPE_P (t))
5017 if (IS_AGGR_TYPE (t))
5018 cp_error ("redefinition of `%#T'", t);
5020 my_friendly_abort (172);
5025 GNU_xref_decl (current_function_decl, t);
5027 /* If this type was previously laid out as a forward reference,
5028 make sure we lay it out again. */
5029 TYPE_SIZE (t) = NULL_TREE;
5030 CLASSTYPE_GOT_SEMICOLON (t) = 0;
5031 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
5033 CLASSTYPE_RTTI (t) = NULL_TREE;
5035 /* Do end-of-class semantic processing: checking the validity of the
5036 bases and members and add implicitly generated methods. */
5037 check_bases_and_members (t, &empty);
5039 /* Layout the class itself. */
5040 layout_class_type (t, &empty, &vfuns,
5041 &new_virtuals, &overridden_virtuals);
5043 /* Set up the DECL_FIELD_BITPOS of the vfield if we need to, as we
5044 might need to know it for setting up the offsets in the vtable
5045 (or in thunks) below. */
5046 vfield = TYPE_VFIELD (t);
5047 if (vfield != NULL_TREE
5048 && DECL_FIELD_CONTEXT (vfield) != t)
5050 tree binfo = get_binfo (DECL_FIELD_CONTEXT (vfield), t, 0);
5052 vfield = copy_decl (vfield);
5054 DECL_FIELD_CONTEXT (vfield) = t;
5055 DECL_FIELD_OFFSET (vfield)
5056 = size_binop (PLUS_EXPR,
5057 BINFO_OFFSET (binfo),
5058 DECL_FIELD_OFFSET (vfield));
5059 TYPE_VFIELD (t) = vfield;
5063 = modify_all_vtables (t, &vfuns, nreverse (overridden_virtuals));
5065 /* If we created a new vtbl pointer for this class, add it to the
5067 if (TYPE_VFIELD (t) && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5068 CLASSTYPE_VFIELDS (t)
5069 = chainon (CLASSTYPE_VFIELDS (t), build_tree_list (NULL_TREE, t));
5071 /* If necessary, create the primary vtable for this class. */
5073 || overridden_virtuals
5074 || (TYPE_CONTAINS_VPTR_P (t) && vptrs_present_everywhere_p ()))
5076 new_virtuals = nreverse (new_virtuals);
5077 /* We must enter these virtuals into the table. */
5078 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5079 build_primary_vtable (NULL_TREE, t);
5080 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t), t))
5081 /* Here we know enough to change the type of our virtual
5082 function table, but we will wait until later this function. */
5083 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
5085 /* If this type has basetypes with constructors, then those
5086 constructors might clobber the virtual function table. But
5087 they don't if the derived class shares the exact vtable of the base
5090 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t) = 1;
5092 /* If we didn't need a new vtable, see if we should copy one from
5094 else if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5096 tree binfo = CLASSTYPE_PRIMARY_BINFO (t);
5098 /* If this class uses a different vtable than its primary base
5099 then when we will need to initialize our vptr after the base
5100 class constructor runs. */
5101 if (TYPE_BINFO_VTABLE (t) != BINFO_VTABLE (binfo))
5102 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t) = 1;
5105 if (TYPE_CONTAINS_VPTR_P (t))
5107 if (TYPE_BINFO_VTABLE (t))
5108 my_friendly_assert (DECL_VIRTUAL_P (TYPE_BINFO_VTABLE (t)),
5110 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
5111 my_friendly_assert (TYPE_BINFO_VIRTUALS (t) == NULL_TREE,
5114 CLASSTYPE_VSIZE (t) = vfuns;
5115 /* Entries for virtual functions defined in the primary base are
5116 followed by entries for new functions unique to this class. */
5117 TYPE_BINFO_VIRTUALS (t)
5118 = chainon (TYPE_BINFO_VIRTUALS (t), new_virtuals);
5119 /* Finally, add entries for functions that override virtuals
5120 from non-primary bases. */
5121 TYPE_BINFO_VIRTUALS (t)
5122 = chainon (TYPE_BINFO_VIRTUALS (t), overridden_virtuals);
5125 finish_struct_bits (t);
5127 /* Complete the rtl for any static member objects of the type we're
5129 for (x = TYPE_FIELDS (t); x; x = TREE_CHAIN (x))
5131 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
5132 && TREE_TYPE (x) == t)
5134 DECL_MODE (x) = TYPE_MODE (t);
5135 make_decl_rtl (x, NULL, 0);
5139 /* Done with FIELDS...now decide whether to sort these for
5140 faster lookups later.
5142 The C front-end only does this when n_fields > 15. We use
5143 a smaller number because most searches fail (succeeding
5144 ultimately as the search bores through the inheritance
5145 hierarchy), and we want this failure to occur quickly. */
5147 n_fields = count_fields (TYPE_FIELDS (t));
5150 tree field_vec = make_tree_vec (n_fields);
5151 add_fields_to_vec (TYPE_FIELDS (t), field_vec, 0);
5152 qsort (&TREE_VEC_ELT (field_vec, 0), n_fields, sizeof (tree),
5153 (int (*)(const void *, const void *))field_decl_cmp);
5154 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t)))
5155 retrofit_lang_decl (TYPE_MAIN_DECL (t));
5156 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t)) = field_vec;
5159 if (TYPE_HAS_CONSTRUCTOR (t))
5161 tree vfields = CLASSTYPE_VFIELDS (t);
5165 /* Mark the fact that constructor for T
5166 could affect anybody inheriting from T
5167 who wants to initialize vtables for VFIELDS's type. */
5168 if (VF_DERIVED_VALUE (vfields))
5169 TREE_ADDRESSABLE (vfields) = 1;
5170 vfields = TREE_CHAIN (vfields);
5174 /* Make the rtl for any new vtables we have created, and unmark
5175 the base types we marked. */
5177 /* Build the VTT for T. */
5180 if (TYPE_VFIELD (t))
5182 /* In addition to this one, all the other vfields should be listed. */
5183 /* Before that can be done, we have to have FIELD_DECLs for them, and
5184 a place to find them. */
5185 TYPE_NONCOPIED_PARTS (t)
5186 = tree_cons (default_conversion (TYPE_BINFO_VTABLE (t)),
5187 TYPE_VFIELD (t), TYPE_NONCOPIED_PARTS (t));
5189 if (warn_nonvdtor && TYPE_HAS_DESTRUCTOR (t)
5190 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 1)) == NULL_TREE)
5191 cp_warning ("`%#T' has virtual functions but non-virtual destructor",
5195 hack_incomplete_structures (t);
5197 if (warn_overloaded_virtual)
5200 maybe_suppress_debug_info (t);
5202 /* Finish debugging output for this type. */
5203 rest_of_type_compilation (t, ! LOCAL_CLASS_P (t));
5206 /* When T was built up, the member declarations were added in reverse
5207 order. Rearrange them to declaration order. */
5210 unreverse_member_declarations (t)
5217 /* The TYPE_FIELDS, TYPE_METHODS, and CLASSTYPE_TAGS are all in
5218 reverse order. Put them in declaration order now. */
5219 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
5220 CLASSTYPE_TAGS (t) = nreverse (CLASSTYPE_TAGS (t));
5222 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5223 reverse order, so we can't just use nreverse. */
5225 for (x = TYPE_FIELDS (t);
5226 x && TREE_CODE (x) != TYPE_DECL;
5229 next = TREE_CHAIN (x);
5230 TREE_CHAIN (x) = prev;
5235 TREE_CHAIN (TYPE_FIELDS (t)) = x;
5237 TYPE_FIELDS (t) = prev;
5242 finish_struct (t, attributes)
5245 /* Now that we've got all the field declarations, reverse everything
5247 unreverse_member_declarations (t);
5249 cplus_decl_attributes (t, attributes, NULL_TREE);
5251 if (processing_template_decl)
5253 finish_struct_methods (t);
5254 TYPE_SIZE (t) = bitsize_zero_node;
5257 finish_struct_1 (t);
5259 TYPE_BEING_DEFINED (t) = 0;
5261 if (current_class_type)
5264 error ("trying to finish struct, but kicked out due to previous parse errors.");
5266 if (processing_template_decl)
5268 tree scope = current_scope ();
5269 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
5270 add_tree (build_min (TAG_DEFN, t));
5276 /* Return the dynamic type of INSTANCE, if known.
5277 Used to determine whether the virtual function table is needed
5280 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5281 of our knowledge of its type. *NONNULL should be initialized
5282 before this function is called. */
5285 fixed_type_or_null (instance, nonnull)
5289 switch (TREE_CODE (instance))
5292 /* Check that we are not going through a cast of some sort. */
5293 if (TREE_TYPE (instance)
5294 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (instance, 0))))
5295 instance = TREE_OPERAND (instance, 0);
5296 /* fall through... */
5298 /* This is a call to a constructor, hence it's never zero. */
5299 if (TREE_HAS_CONSTRUCTOR (instance))
5303 return TREE_TYPE (instance);
5308 /* This is a call to a constructor, hence it's never zero. */
5309 if (TREE_HAS_CONSTRUCTOR (instance))
5313 return TREE_TYPE (instance);
5315 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
5322 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
5323 /* Propagate nonnull. */
5324 fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
5325 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
5326 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
5331 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
5336 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
5339 return fixed_type_or_null (TREE_OPERAND (instance, 1), nonnull);
5343 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
5344 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
5348 return TREE_TYPE (TREE_TYPE (instance));
5350 /* fall through... */
5353 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
5357 return TREE_TYPE (instance);
5361 if (instance == current_class_ptr
5362 && flag_this_is_variable <= 0)
5364 /* Normally, 'this' must be non-null. */
5365 if (flag_this_is_variable == 0)
5368 /* <0 means we're in a constructor and we know our type. */
5369 if (flag_this_is_variable < 0)
5370 return TREE_TYPE (TREE_TYPE (instance));
5372 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
5373 /* Reference variables should be references to objects. */
5383 /* Return non-zero if the dynamic type of INSTANCE is known, and equivalent
5384 to the static type. We also handle the case where INSTANCE is really
5387 Used to determine whether the virtual function table is needed
5390 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5391 of our knowledge of its type. *NONNULL should be initialized
5392 before this function is called. */
5395 resolves_to_fixed_type_p (instance, nonnull)
5399 tree t = TREE_TYPE (instance);
5400 tree fixed = fixed_type_or_null (instance, nonnull);
5401 if (fixed == NULL_TREE)
5403 if (POINTER_TYPE_P (t))
5405 return same_type_ignoring_top_level_qualifiers_p (t, fixed);
5410 init_class_processing ()
5412 current_class_depth = 0;
5413 current_class_stack_size = 10;
5415 = (class_stack_node_t) xmalloc (current_class_stack_size
5416 * sizeof (struct class_stack_node));
5417 VARRAY_TREE_INIT (local_classes, 8, "local_classes");
5418 ggc_add_tree_varray_root (&local_classes, 1);
5420 access_default_node = build_int_2 (0, 0);
5421 access_public_node = build_int_2 (ak_public, 0);
5422 access_protected_node = build_int_2 (ak_protected, 0);
5423 access_private_node = build_int_2 (ak_private, 0);
5424 access_default_virtual_node = build_int_2 (4, 0);
5425 access_public_virtual_node = build_int_2 (4 | ak_public, 0);
5426 access_protected_virtual_node = build_int_2 (4 | ak_protected, 0);
5427 access_private_virtual_node = build_int_2 (4 | ak_private, 0);
5430 /* Set current scope to NAME. CODE tells us if this is a
5431 STRUCT, UNION, or ENUM environment.
5433 NAME may end up being NULL_TREE if this is an anonymous or
5434 late-bound struct (as in "struct { ... } foo;") */
5436 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE to
5437 appropriate values, found by looking up the type definition of
5440 If MODIFY is 1, we set IDENTIFIER_CLASS_VALUE's of names
5441 which can be seen locally to the class. They are shadowed by
5442 any subsequent local declaration (including parameter names).
5444 If MODIFY is 2, we set IDENTIFIER_CLASS_VALUE's of names
5445 which have static meaning (i.e., static members, static
5446 member functions, enum declarations, etc).
5448 If MODIFY is 3, we set IDENTIFIER_CLASS_VALUE of names
5449 which can be seen locally to the class (as in 1), but
5450 know that we are doing this for declaration purposes
5451 (i.e. friend foo::bar (int)).
5453 So that we may avoid calls to lookup_name, we cache the _TYPE
5454 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5456 For multiple inheritance, we perform a two-pass depth-first search
5457 of the type lattice. The first pass performs a pre-order search,
5458 marking types after the type has had its fields installed in
5459 the appropriate IDENTIFIER_CLASS_VALUE slot. The second pass merely
5460 unmarks the marked types. If a field or member function name
5461 appears in an ambiguous way, the IDENTIFIER_CLASS_VALUE of
5462 that name becomes `error_mark_node'. */
5465 pushclass (type, modify)
5469 type = TYPE_MAIN_VARIANT (type);
5471 /* Make sure there is enough room for the new entry on the stack. */
5472 if (current_class_depth + 1 >= current_class_stack_size)
5474 current_class_stack_size *= 2;
5476 = (class_stack_node_t) xrealloc (current_class_stack,
5477 current_class_stack_size
5478 * sizeof (struct class_stack_node));
5481 /* Insert a new entry on the class stack. */
5482 current_class_stack[current_class_depth].name = current_class_name;
5483 current_class_stack[current_class_depth].type = current_class_type;
5484 current_class_stack[current_class_depth].access = current_access_specifier;
5485 current_class_stack[current_class_depth].names_used = 0;
5486 current_class_depth++;
5488 /* Now set up the new type. */
5489 current_class_name = TYPE_NAME (type);
5490 if (TREE_CODE (current_class_name) == TYPE_DECL)
5491 current_class_name = DECL_NAME (current_class_name);
5492 current_class_type = type;
5494 /* By default, things in classes are private, while things in
5495 structures or unions are public. */
5496 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
5497 ? access_private_node
5498 : access_public_node);
5500 if (previous_class_type != NULL_TREE
5501 && (type != previous_class_type
5502 || !COMPLETE_TYPE_P (previous_class_type))
5503 && current_class_depth == 1)
5505 /* Forcibly remove any old class remnants. */
5506 invalidate_class_lookup_cache ();
5509 /* If we're about to enter a nested class, clear
5510 IDENTIFIER_CLASS_VALUE for the enclosing classes. */
5511 if (modify && current_class_depth > 1)
5512 clear_identifier_class_values ();
5517 if (CLASSTYPE_TEMPLATE_INFO (type))
5518 overload_template_name (type);
5523 if (type != previous_class_type || current_class_depth > 1)
5524 push_class_decls (type);
5529 /* We are re-entering the same class we just left, so we
5530 don't have to search the whole inheritance matrix to find
5531 all the decls to bind again. Instead, we install the
5532 cached class_shadowed list, and walk through it binding
5533 names and setting up IDENTIFIER_TYPE_VALUEs. */
5534 set_class_shadows (previous_class_values);
5535 for (item = previous_class_values; item; item = TREE_CHAIN (item))
5537 tree id = TREE_PURPOSE (item);
5538 tree decl = TREE_TYPE (item);
5540 push_class_binding (id, decl);
5541 if (TREE_CODE (decl) == TYPE_DECL)
5542 set_identifier_type_value (id, TREE_TYPE (decl));
5544 unuse_fields (type);
5547 storetags (CLASSTYPE_TAGS (type));
5551 /* When we exit a toplevel class scope, we save the
5552 IDENTIFIER_CLASS_VALUEs so that we can restore them quickly if we
5553 reenter the class. Here, we've entered some other class, so we
5554 must invalidate our cache. */
5557 invalidate_class_lookup_cache ()
5561 /* This code can be seen as a cache miss. When we've cached a
5562 class' scope's bindings and we can't use them, we need to reset
5563 them. This is it! */
5564 for (t = previous_class_values; t; t = TREE_CHAIN (t))
5565 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
5567 previous_class_type = NULL_TREE;
5570 /* Get out of the current class scope. If we were in a class scope
5571 previously, that is the one popped to. */
5577 /* Since poplevel_class does the popping of class decls nowadays,
5578 this really only frees the obstack used for these decls. */
5581 current_class_depth--;
5582 current_class_name = current_class_stack[current_class_depth].name;
5583 current_class_type = current_class_stack[current_class_depth].type;
5584 current_access_specifier = current_class_stack[current_class_depth].access;
5585 if (current_class_stack[current_class_depth].names_used)
5586 splay_tree_delete (current_class_stack[current_class_depth].names_used);
5589 /* Returns 1 if current_class_type is either T or a nested type of T.
5590 We start looking from 1 because entry 0 is from global scope, and has
5594 currently_open_class (t)
5598 if (t == current_class_type)
5600 for (i = 1; i < current_class_depth; ++i)
5601 if (current_class_stack [i].type == t)
5606 /* If either current_class_type or one of its enclosing classes are derived
5607 from T, return the appropriate type. Used to determine how we found
5608 something via unqualified lookup. */
5611 currently_open_derived_class (t)
5616 if (DERIVED_FROM_P (t, current_class_type))
5617 return current_class_type;
5619 for (i = current_class_depth - 1; i > 0; --i)
5620 if (DERIVED_FROM_P (t, current_class_stack[i].type))
5621 return current_class_stack[i].type;
5626 /* When entering a class scope, all enclosing class scopes' names with
5627 static meaning (static variables, static functions, types and enumerators)
5628 have to be visible. This recursive function calls pushclass for all
5629 enclosing class contexts until global or a local scope is reached.
5630 TYPE is the enclosed class and MODIFY is equivalent with the pushclass
5631 formal of the same name. */
5634 push_nested_class (type, modify)
5640 /* A namespace might be passed in error cases, like A::B:C. */
5641 if (type == NULL_TREE
5642 || type == error_mark_node
5643 || TREE_CODE (type) == NAMESPACE_DECL
5644 || ! IS_AGGR_TYPE (type)
5645 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
5646 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
5649 context = DECL_CONTEXT (TYPE_MAIN_DECL (type));
5651 if (context && CLASS_TYPE_P (context))
5652 push_nested_class (context, 2);
5653 pushclass (type, modify);
5656 /* Undoes a push_nested_class call. MODIFY is passed on to popclass. */
5661 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
5664 if (context && CLASS_TYPE_P (context))
5665 pop_nested_class ();
5668 /* Set global variables CURRENT_LANG_NAME to appropriate value
5669 so that behavior of name-mangling machinery is correct. */
5672 push_lang_context (name)
5675 *current_lang_stack++ = current_lang_name;
5676 if (current_lang_stack - &VARRAY_TREE (current_lang_base, 0)
5677 >= (ptrdiff_t) VARRAY_SIZE (current_lang_base))
5679 size_t old_size = VARRAY_SIZE (current_lang_base);
5681 VARRAY_GROW (current_lang_base, old_size + 10);
5682 current_lang_stack = &VARRAY_TREE (current_lang_base, old_size);
5685 if (name == lang_name_cplusplus)
5687 current_lang_name = name;
5689 else if (name == lang_name_java)
5691 current_lang_name = name;
5692 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5693 (See record_builtin_java_type in decl.c.) However, that causes
5694 incorrect debug entries if these types are actually used.
5695 So we re-enable debug output after extern "Java". */
5696 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0;
5697 DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0;
5698 DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0;
5699 DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0;
5700 DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0;
5701 DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0;
5702 DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0;
5703 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0;
5705 else if (name == lang_name_c)
5707 current_lang_name = name;
5710 error ("language string `\"%s\"' not recognized", IDENTIFIER_POINTER (name));
5713 /* Get out of the current language scope. */
5718 /* Clear the current entry so that garbage collector won't hold on
5720 *current_lang_stack = NULL_TREE;
5721 current_lang_name = *--current_lang_stack;
5724 /* Type instantiation routines. */
5726 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5727 matches the TARGET_TYPE. If there is no satisfactory match, return
5728 error_mark_node, and issue an error message if COMPLAIN is
5729 non-zero. Permit pointers to member function if PTRMEM is non-zero.
5730 If TEMPLATE_ONLY, the name of the overloaded function
5731 was a template-id, and EXPLICIT_TARGS are the explicitly provided
5732 template arguments. */
5735 resolve_address_of_overloaded_function (target_type,
5746 tree explicit_targs;
5748 /* Here's what the standard says:
5752 If the name is a function template, template argument deduction
5753 is done, and if the argument deduction succeeds, the deduced
5754 arguments are used to generate a single template function, which
5755 is added to the set of overloaded functions considered.
5757 Non-member functions and static member functions match targets of
5758 type "pointer-to-function" or "reference-to-function." Nonstatic
5759 member functions match targets of type "pointer-to-member
5760 function;" the function type of the pointer to member is used to
5761 select the member function from the set of overloaded member
5762 functions. If a nonstatic member function is selected, the
5763 reference to the overloaded function name is required to have the
5764 form of a pointer to member as described in 5.3.1.
5766 If more than one function is selected, any template functions in
5767 the set are eliminated if the set also contains a non-template
5768 function, and any given template function is eliminated if the
5769 set contains a second template function that is more specialized
5770 than the first according to the partial ordering rules 14.5.5.2.
5771 After such eliminations, if any, there shall remain exactly one
5772 selected function. */
5775 int is_reference = 0;
5776 /* We store the matches in a TREE_LIST rooted here. The functions
5777 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5778 interoperability with most_specialized_instantiation. */
5779 tree matches = NULL_TREE;
5782 /* By the time we get here, we should be seeing only real
5783 pointer-to-member types, not the internal POINTER_TYPE to
5784 METHOD_TYPE representation. */
5785 my_friendly_assert (!(TREE_CODE (target_type) == POINTER_TYPE
5786 && (TREE_CODE (TREE_TYPE (target_type))
5787 == METHOD_TYPE)), 0);
5789 if (TREE_CODE (overload) == COMPONENT_REF)
5790 overload = TREE_OPERAND (overload, 1);
5792 /* Check that the TARGET_TYPE is reasonable. */
5793 if (TYPE_PTRFN_P (target_type))
5796 else if (TYPE_PTRMEMFUNC_P (target_type))
5797 /* This is OK, too. */
5799 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
5801 /* This is OK, too. This comes from a conversion to reference
5803 target_type = build_reference_type (target_type);
5809 cp_error("cannot resolve overloaded function `%D' based on conversion to type `%T'",
5810 DECL_NAME (OVL_FUNCTION (overload)), target_type);
5811 return error_mark_node;
5814 /* If we can find a non-template function that matches, we can just
5815 use it. There's no point in generating template instantiations
5816 if we're just going to throw them out anyhow. But, of course, we
5817 can only do this when we don't *need* a template function. */
5822 for (fns = overload; fns; fns = OVL_CHAIN (fns))
5824 tree fn = OVL_FUNCTION (fns);
5827 if (TREE_CODE (fn) == TEMPLATE_DECL)
5828 /* We're not looking for templates just yet. */
5831 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5833 /* We're looking for a non-static member, and this isn't
5834 one, or vice versa. */
5837 /* See if there's a match. */
5838 fntype = TREE_TYPE (fn);
5840 fntype = build_ptrmemfunc_type (build_pointer_type (fntype));
5841 else if (!is_reference)
5842 fntype = build_pointer_type (fntype);
5844 if (can_convert_arg (target_type, fntype, fn))
5845 matches = tree_cons (fn, NULL_TREE, matches);
5849 /* Now, if we've already got a match (or matches), there's no need
5850 to proceed to the template functions. But, if we don't have a
5851 match we need to look at them, too. */
5854 tree target_fn_type;
5855 tree target_arg_types;
5856 tree target_ret_type;
5861 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type));
5863 target_fn_type = TREE_TYPE (target_type);
5864 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
5865 target_ret_type = TREE_TYPE (target_fn_type);
5867 for (fns = overload; fns; fns = OVL_CHAIN (fns))
5869 tree fn = OVL_FUNCTION (fns);
5871 tree instantiation_type;
5874 if (TREE_CODE (fn) != TEMPLATE_DECL)
5875 /* We're only looking for templates. */
5878 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5880 /* We're not looking for a non-static member, and this is
5881 one, or vice versa. */
5884 /* Try to do argument deduction. */
5885 targs = make_tree_vec (DECL_NTPARMS (fn));
5886 if (fn_type_unification (fn, explicit_targs, targs,
5887 target_arg_types, target_ret_type,
5889 /* Argument deduction failed. */
5892 /* Instantiate the template. */
5893 instantiation = instantiate_template (fn, targs);
5894 if (instantiation == error_mark_node)
5895 /* Instantiation failed. */
5898 /* See if there's a match. */
5899 instantiation_type = TREE_TYPE (instantiation);
5901 instantiation_type =
5902 build_ptrmemfunc_type (build_pointer_type (instantiation_type));
5903 else if (!is_reference)
5904 instantiation_type = build_pointer_type (instantiation_type);
5905 if (can_convert_arg (target_type, instantiation_type, instantiation))
5906 matches = tree_cons (instantiation, fn, matches);
5909 /* Now, remove all but the most specialized of the matches. */
5912 tree match = most_specialized_instantiation (matches,
5915 if (match != error_mark_node)
5916 matches = tree_cons (match, NULL_TREE, NULL_TREE);
5920 /* Now we should have exactly one function in MATCHES. */
5921 if (matches == NULL_TREE)
5923 /* There were *no* matches. */
5926 cp_error ("no matches converting function `%D' to type `%#T'",
5927 DECL_NAME (OVL_FUNCTION (overload)),
5930 /* print_candidates expects a chain with the functions in
5931 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5932 so why be clever?). */
5933 for (; overload; overload = OVL_NEXT (overload))
5934 matches = tree_cons (NULL_TREE, OVL_CURRENT (overload),
5937 print_candidates (matches);
5939 return error_mark_node;
5941 else if (TREE_CHAIN (matches))
5943 /* There were too many matches. */
5949 cp_error ("converting overloaded function `%D' to type `%#T' is ambiguous",
5950 DECL_NAME (OVL_FUNCTION (overload)),
5953 /* Since print_candidates expects the functions in the
5954 TREE_VALUE slot, we flip them here. */
5955 for (match = matches; match; match = TREE_CHAIN (match))
5956 TREE_VALUE (match) = TREE_PURPOSE (match);
5958 print_candidates (matches);
5961 return error_mark_node;
5964 /* Good, exactly one match. Now, convert it to the correct type. */
5965 fn = TREE_PURPOSE (matches);
5967 if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE
5968 && !ptrmem && !flag_ms_extensions)
5971 return error_mark_node;
5973 cp_pedwarn ("assuming pointer to member `%D'", fn);
5977 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
5978 return build_unary_op (ADDR_EXPR, fn, 0);
5981 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
5982 will mark the function as addressed, but here we must do it
5984 mark_addressable (fn);
5990 /* This function will instantiate the type of the expression given in
5991 RHS to match the type of LHSTYPE. If errors exist, then return
5992 error_mark_node. FLAGS is a bit mask. If ITF_COMPLAIN is set, then
5993 we complain on errors. If we are not complaining, never modify rhs,
5994 as overload resolution wants to try many possible instantiations, in
5995 the hope that at least one will work.
5997 For non-recursive calls, LHSTYPE should be a function, pointer to
5998 function, or a pointer to member function. */
6001 instantiate_type (lhstype, rhs, flags)
6003 enum instantiate_type_flags flags;
6005 int complain = (flags & itf_complain);
6006 int strict = (flags & itf_no_attributes)
6007 ? COMPARE_NO_ATTRIBUTES : COMPARE_STRICT;
6008 int allow_ptrmem = flags & itf_ptrmem_ok;
6010 flags &= ~itf_ptrmem_ok;
6012 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
6015 error ("not enough type information");
6016 return error_mark_node;
6019 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
6021 if (comptypes (lhstype, TREE_TYPE (rhs), strict))
6024 cp_error ("argument of type `%T' does not match `%T'",
6025 TREE_TYPE (rhs), lhstype);
6026 return error_mark_node;
6029 /* We don't overwrite rhs if it is an overloaded function.
6030 Copying it would destroy the tree link. */
6031 if (TREE_CODE (rhs) != OVERLOAD)
6032 rhs = copy_node (rhs);
6034 /* This should really only be used when attempting to distinguish
6035 what sort of a pointer to function we have. For now, any
6036 arithmetic operation which is not supported on pointers
6037 is rejected as an error. */
6039 switch (TREE_CODE (rhs))
6046 my_friendly_abort (177);
6047 return error_mark_node;
6054 new_rhs = instantiate_type (build_pointer_type (lhstype),
6055 TREE_OPERAND (rhs, 0), flags);
6056 if (new_rhs == error_mark_node)
6057 return error_mark_node;
6059 TREE_TYPE (rhs) = lhstype;
6060 TREE_OPERAND (rhs, 0) = new_rhs;
6065 rhs = copy_node (TREE_OPERAND (rhs, 0));
6066 TREE_TYPE (rhs) = unknown_type_node;
6067 return instantiate_type (lhstype, rhs, flags);
6070 return instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6073 rhs = TREE_OPERAND (rhs, 1);
6074 if (BASELINK_P (rhs))
6075 return instantiate_type (lhstype, TREE_VALUE (rhs),
6076 flags | allow_ptrmem);
6078 /* This can happen if we are forming a pointer-to-member for a
6080 my_friendly_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR, 0);
6084 case TEMPLATE_ID_EXPR:
6086 tree fns = TREE_OPERAND (rhs, 0);
6087 tree args = TREE_OPERAND (rhs, 1);
6090 resolve_address_of_overloaded_function (lhstype,
6094 /*template_only=*/1,
6100 resolve_address_of_overloaded_function (lhstype,
6104 /*template_only=*/0,
6105 /*explicit_targs=*/NULL_TREE);
6108 /* Now we should have a baselink. */
6109 my_friendly_assert (BASELINK_P (rhs), 990412);
6111 return instantiate_type (lhstype, TREE_VALUE (rhs), flags);
6114 /* This is too hard for now. */
6115 my_friendly_abort (183);
6116 return error_mark_node;
6121 TREE_OPERAND (rhs, 0)
6122 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6123 if (TREE_OPERAND (rhs, 0) == error_mark_node)
6124 return error_mark_node;
6125 TREE_OPERAND (rhs, 1)
6126 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6127 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6128 return error_mark_node;
6130 TREE_TYPE (rhs) = lhstype;
6134 case TRUNC_DIV_EXPR:
6135 case FLOOR_DIV_EXPR:
6137 case ROUND_DIV_EXPR:
6139 case TRUNC_MOD_EXPR:
6140 case FLOOR_MOD_EXPR:
6142 case ROUND_MOD_EXPR:
6143 case FIX_ROUND_EXPR:
6144 case FIX_FLOOR_EXPR:
6146 case FIX_TRUNC_EXPR:
6162 case PREINCREMENT_EXPR:
6163 case PREDECREMENT_EXPR:
6164 case POSTINCREMENT_EXPR:
6165 case POSTDECREMENT_EXPR:
6167 error ("invalid operation on uninstantiated type");
6168 return error_mark_node;
6170 case TRUTH_AND_EXPR:
6172 case TRUTH_XOR_EXPR:
6179 case TRUTH_ANDIF_EXPR:
6180 case TRUTH_ORIF_EXPR:
6181 case TRUTH_NOT_EXPR:
6183 error ("not enough type information");
6184 return error_mark_node;
6187 if (type_unknown_p (TREE_OPERAND (rhs, 0)))
6190 error ("not enough type information");
6191 return error_mark_node;
6193 TREE_OPERAND (rhs, 1)
6194 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6195 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6196 return error_mark_node;
6197 TREE_OPERAND (rhs, 2)
6198 = instantiate_type (lhstype, TREE_OPERAND (rhs, 2), flags);
6199 if (TREE_OPERAND (rhs, 2) == error_mark_node)
6200 return error_mark_node;
6202 TREE_TYPE (rhs) = lhstype;
6206 TREE_OPERAND (rhs, 1)
6207 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
6208 if (TREE_OPERAND (rhs, 1) == error_mark_node)
6209 return error_mark_node;
6211 TREE_TYPE (rhs) = lhstype;
6216 if (PTRMEM_OK_P (rhs))
6217 flags |= itf_ptrmem_ok;
6219 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
6221 case ENTRY_VALUE_EXPR:
6222 my_friendly_abort (184);
6223 return error_mark_node;
6226 return error_mark_node;
6229 my_friendly_abort (185);
6230 return error_mark_node;
6234 /* Return the name of the virtual function pointer field
6235 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6236 this may have to look back through base types to find the
6237 ultimate field name. (For single inheritance, these could
6238 all be the same name. Who knows for multiple inheritance). */
6241 get_vfield_name (type)
6244 tree binfo = TYPE_BINFO (type);
6247 while (BINFO_BASETYPES (binfo)
6248 && TYPE_CONTAINS_VPTR_P (BINFO_TYPE (BINFO_BASETYPE (binfo, 0)))
6249 && ! TREE_VIA_VIRTUAL (BINFO_BASETYPE (binfo, 0)))
6250 binfo = BINFO_BASETYPE (binfo, 0);
6252 type = BINFO_TYPE (binfo);
6253 buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT)
6254 + TYPE_NAME_LENGTH (type) + 2);
6255 sprintf (buf, VFIELD_NAME_FORMAT, TYPE_NAME_STRING (type));
6256 return get_identifier (buf);
6260 print_class_statistics ()
6262 #ifdef GATHER_STATISTICS
6263 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
6264 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
6265 fprintf (stderr, "build_method_call = %d (inner = %d)\n",
6266 n_build_method_call, n_inner_fields_searched);
6269 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
6270 n_vtables, n_vtable_searches);
6271 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
6272 n_vtable_entries, n_vtable_elems);
6277 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6278 according to [class]:
6279 The class-name is also inserted
6280 into the scope of the class itself. For purposes of access checking,
6281 the inserted class name is treated as if it were a public member name. */
6284 build_self_reference ()
6286 tree name = constructor_name (current_class_type);
6287 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
6290 DECL_NONLOCAL (value) = 1;
6291 DECL_CONTEXT (value) = current_class_type;
6292 DECL_ARTIFICIAL (value) = 1;
6294 if (processing_template_decl)
6295 value = push_template_decl (value);
6297 saved_cas = current_access_specifier;
6298 current_access_specifier = access_public_node;
6299 finish_member_declaration (value);
6300 current_access_specifier = saved_cas;
6303 /* Returns 1 if TYPE contains only padding bytes. */
6306 is_empty_class (type)
6311 if (type == error_mark_node)
6314 if (! IS_AGGR_TYPE (type))
6318 return integer_zerop (CLASSTYPE_SIZE (type));
6320 if (TYPE_BINFO_BASETYPES (type))
6322 t = TYPE_FIELDS (type);
6323 while (t && TREE_CODE (t) != FIELD_DECL)
6325 return (t == NULL_TREE);
6328 /* Find the enclosing class of the given NODE. NODE can be a *_DECL or
6329 a *_TYPE node. NODE can also be a local class. */
6332 get_enclosing_class (type)
6337 while (node && TREE_CODE (node) != NAMESPACE_DECL)
6339 switch (TREE_CODE_CLASS (TREE_CODE (node)))
6342 node = DECL_CONTEXT (node);
6348 node = TYPE_CONTEXT (node);
6352 my_friendly_abort (0);
6358 /* Return 1 if TYPE or one of its enclosing classes is derived from BASE. */
6361 is_base_of_enclosing_class (base, type)
6366 if (get_binfo (base, type, 0))
6369 type = get_enclosing_class (type);
6374 /* Note that NAME was looked up while the current class was being
6375 defined and that the result of that lookup was DECL. */
6378 maybe_note_name_used_in_class (name, decl)
6382 splay_tree names_used;
6384 /* If we're not defining a class, there's nothing to do. */
6385 if (!current_class_type || !TYPE_BEING_DEFINED (current_class_type))
6388 /* If there's already a binding for this NAME, then we don't have
6389 anything to worry about. */
6390 if (IDENTIFIER_CLASS_VALUE (name))
6393 if (!current_class_stack[current_class_depth - 1].names_used)
6394 current_class_stack[current_class_depth - 1].names_used
6395 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
6396 names_used = current_class_stack[current_class_depth - 1].names_used;
6398 splay_tree_insert (names_used,
6399 (splay_tree_key) name,
6400 (splay_tree_value) decl);
6403 /* Note that NAME was declared (as DECL) in the current class. Check
6404 to see that the declaration is legal. */
6407 note_name_declared_in_class (name, decl)
6411 splay_tree names_used;
6414 /* Look to see if we ever used this name. */
6416 = current_class_stack[current_class_depth - 1].names_used;
6420 n = splay_tree_lookup (names_used, (splay_tree_key) name);
6423 /* [basic.scope.class]
6425 A name N used in a class S shall refer to the same declaration
6426 in its context and when re-evaluated in the completed scope of
6428 cp_error ("declaration of `%#D'", decl);
6429 cp_error_at ("changes meaning of `%s' from `%+#D'",
6430 IDENTIFIER_POINTER (DECL_NAME (OVL_CURRENT (decl))),
6435 /* Returns the VAR_DECL for the complete vtable associated with
6436 BINFO. (Under the new ABI, secondary vtables are merged with
6437 primary vtables; this function will return the VAR_DECL for the
6441 get_vtbl_decl_for_binfo (binfo)
6446 decl = BINFO_VTABLE (binfo);
6447 if (decl && TREE_CODE (decl) == PLUS_EXPR)
6449 my_friendly_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR,
6451 decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0);
6454 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 20000403);
6458 /* Called from get_primary_binfo via dfs_walk. */
6461 dfs_get_primary_binfo (binfo, data)
6465 tree primary_base = (tree) data;
6467 if (TREE_VIA_VIRTUAL (binfo)
6468 && same_type_p (TREE_TYPE (binfo), TREE_TYPE (primary_base)))
6474 /* Returns the binfo for the primary base of BINFO. Note that in a
6475 complex hierarchy the resulting BINFO may not actually *be*
6476 primary. In particular if the resulting BINFO is a virtual base,
6477 and it occurs elsewhere in the hierarchy, then this occurrence may
6478 not actually be a primary base in the complete object. Check
6479 BINFO_PRIMARY_MARKED_P to be sure. */
6482 get_primary_binfo (binfo)
6488 primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo));
6492 /* A non-virtual primary base is always a direct base, and easy to
6494 if (!TREE_VIA_VIRTUAL (primary_base))
6498 /* Scan the direct basetypes until we find a base with the same
6499 type as the primary base. */
6500 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
6502 tree base_binfo = BINFO_BASETYPE (binfo, i);
6504 if (same_type_p (BINFO_TYPE (base_binfo),
6505 BINFO_TYPE (primary_base)))
6509 /* We should always find the primary base. */
6510 my_friendly_abort (20000729);
6513 /* For a primary virtual base, we have to scan the entire hierarchy
6514 rooted at BINFO; the virtual base could be an indirect virtual
6516 result = dfs_walk (binfo, dfs_get_primary_binfo, NULL, primary_base);
6517 my_friendly_assert (result != NULL_TREE, 20000730);
6521 /* Dump the offsets of all the bases rooted at BINFO (in the hierarchy
6522 dominated by T) to stderr. INDENT should be zero when called from
6523 the top level; it is incremented recursively. */
6526 dump_class_hierarchy_r (t, binfo, indent)
6533 fprintf (stderr, "%*s0x%lx (%s) ", indent, "",
6534 (unsigned long) binfo,
6535 type_as_string (binfo, TS_PLAIN));
6536 fprintf (stderr, HOST_WIDE_INT_PRINT_DEC,
6537 tree_low_cst (BINFO_OFFSET (binfo), 0));
6538 if (TREE_VIA_VIRTUAL (binfo))
6539 fprintf (stderr, " virtual");
6540 if (BINFO_PRIMARY_MARKED_P (binfo)
6541 || (TREE_VIA_VIRTUAL (binfo)
6542 && BINFO_PRIMARY_MARKED_P (binfo_for_vbase (BINFO_TYPE (binfo),
6544 fprintf (stderr, " primary");
6545 fprintf (stderr, "\n");
6547 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
6548 dump_class_hierarchy_r (t, BINFO_BASETYPE (binfo, i), indent + 2);
6551 /* Dump the BINFO hierarchy for T. */
6554 dump_class_hierarchy (t)
6557 dump_class_hierarchy_r (t, TYPE_BINFO (t), 0);
6560 /* Virtual function table initialization. */
6562 /* Create all the necessary vtables for T and its base classes. */
6568 if (merge_primary_and_secondary_vtables_p ())
6573 /* Under the new ABI, we lay out the primary and secondary
6574 vtables in one contiguous vtable. The primary vtable is
6575 first, followed by the non-virtual secondary vtables in
6576 inheritance graph order. */
6577 list = build_tree_list (TYPE_BINFO_VTABLE (t), NULL_TREE);
6578 accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t),
6579 TYPE_BINFO (t), t, list);
6580 /* Then come the virtual bases, also in inheritance graph
6582 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
6584 if (!TREE_VIA_VIRTUAL (vbase))
6587 accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), t, list);
6590 if (TYPE_BINFO_VTABLE (t))
6591 initialize_vtable (TYPE_BINFO (t), TREE_VALUE (list));
6595 dfs_walk (TYPE_BINFO (t), dfs_finish_vtbls,
6596 dfs_unmarked_real_bases_queue_p, t);
6597 dfs_walk (TYPE_BINFO (t), dfs_unmark,
6598 dfs_marked_real_bases_queue_p, t);
6602 /* Called from finish_vtbls via dfs_walk. */
6605 dfs_finish_vtbls (binfo, data)
6609 tree t = (tree) data;
6611 if (BINFO_NEW_VTABLE_MARKED (binfo, t))
6612 initialize_vtable (binfo,
6613 build_vtbl_initializer (binfo, binfo, t,
6614 TYPE_BINFO (t), NULL));
6616 SET_BINFO_MARKED (binfo);
6621 /* Initialize the vtable for BINFO with the INITS. */
6624 initialize_vtable (binfo, inits)
6630 layout_vtable_decl (binfo, list_length (inits));
6631 decl = get_vtbl_decl_for_binfo (binfo);
6632 initialize_array (decl, inits);
6635 /* Initialize DECL (a declaration for a namespace-scope array) with
6639 initialize_array (decl, inits)
6645 context = DECL_CONTEXT (decl);
6646 DECL_CONTEXT (decl) = NULL_TREE;
6647 DECL_INITIAL (decl) = build_nt (CONSTRUCTOR, NULL_TREE, inits);
6648 cp_finish_decl (decl, DECL_INITIAL (decl), NULL_TREE, 0);
6649 DECL_CONTEXT (decl) = context;
6652 /* Build the VTT (virtual table table) for T. */
6663 /* Under the old ABI, we don't use VTTs. */
6667 /* Build up the initializers for the VTT. */
6669 index = size_zero_node;
6670 build_vtt_inits (TYPE_BINFO (t), t, /*virtual_vtts_p=*/1,
6673 /* If we didn't need a VTT, we're done. */
6677 /* Figure out the type of the VTT. */
6678 type = build_index_type (size_int (list_length (inits)));
6679 type = build_cplus_array_type (const_ptr_type_node, type);
6681 /* Now, build the VTT object itself. */
6682 vtt = build_vtable (t, get_vtt_name (t), type);
6683 pushdecl_top_level (vtt);
6684 initialize_array (vtt, inits);
6687 /* The type corresponding to BINFO is a base class of T, but BINFO is
6688 in the base class hierarchy of a class derived from T. Return the
6689 base, in T's hierarchy, that corresponds to BINFO. */
6692 get_matching_base (binfo, t)
6699 if (same_type_p (BINFO_TYPE (binfo), t))
6702 if (TREE_VIA_VIRTUAL (binfo))
6703 return binfo_for_vbase (BINFO_TYPE (binfo), t);
6705 derived = get_matching_base (BINFO_INHERITANCE_CHAIN (binfo), t);
6706 for (i = 0; i < BINFO_N_BASETYPES (derived); ++i)
6707 if (same_type_p (BINFO_TYPE (BINFO_BASETYPE (derived, i)),
6708 BINFO_TYPE (binfo)))
6709 return BINFO_BASETYPE (derived, i);
6711 my_friendly_abort (20000628);
6715 /* Recursively build the VTT-initializer for BINFO (which is in the
6716 hierarchy dominated by T). If VIRTUAL_VTTS_P is non-zero, then
6717 sub-VTTs for virtual bases are included. INITS points to the end
6718 of the initializer list to date. INDEX is the VTT index where the
6719 next element will be placed. */
6722 build_vtt_inits (binfo, t, virtual_vtts_p, inits, index)
6732 tree secondary_vptrs;
6735 /* We only need VTTs for subobjects with virtual bases. */
6736 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo)))
6739 /* We need to use a construction vtable if this is not the primary
6741 ctor_vtbl_p = !same_type_p (TREE_TYPE (binfo), t);
6744 build_ctor_vtbl_group (binfo, t);
6746 /* Record the offset in the VTT where this sub-VTT can be found. */
6747 BINFO_SUBVTT_INDEX (binfo) = *index;
6750 /* Add the address of the primary vtable for the complete object. */
6751 init = BINFO_VTABLE (binfo);
6752 if (TREE_CODE (init) == TREE_LIST)
6753 init = TREE_VALUE (init);
6754 *inits = build_tree_list (NULL_TREE, init);
6755 inits = &TREE_CHAIN (*inits);
6756 BINFO_VPTR_INDEX (binfo) = *index;
6757 *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node));
6759 /* Recursively add the secondary VTTs for non-virtual bases. */
6760 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
6762 b = BINFO_BASETYPE (binfo, i);
6763 if (!TREE_VIA_VIRTUAL (b))
6764 inits = build_vtt_inits (BINFO_BASETYPE (binfo, i), t,
6765 /*virtuals_vtts_p=*/0,
6769 /* Add secondary virtual pointers for all subobjects of BINFO with
6770 either virtual bases or virtual functions overridden along a
6771 virtual path between the declaration and D, except subobjects
6772 that are non-virtual primary bases. */
6773 secondary_vptrs = tree_cons (t, NULL_TREE, BINFO_TYPE (binfo));
6774 TREE_TYPE (secondary_vptrs) = *index;
6775 dfs_walk_real (binfo,
6776 dfs_build_secondary_vptr_vtt_inits,
6778 dfs_unmarked_real_bases_queue_p,
6780 dfs_walk (binfo, dfs_unmark, dfs_marked_real_bases_queue_p, t);
6781 *index = TREE_TYPE (secondary_vptrs);
6783 /* The secondary vptrs come back in reverse order. After we reverse
6784 them, and add the INITS, the last init will be the first element
6786 secondary_vptrs = TREE_VALUE (secondary_vptrs);
6787 if (secondary_vptrs)
6789 *inits = nreverse (secondary_vptrs);
6790 inits = &TREE_CHAIN (secondary_vptrs);
6791 my_friendly_assert (*inits == NULL_TREE, 20000517);
6794 /* Add the secondary VTTs for virtual bases. */
6796 for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b))
6800 if (!TREE_VIA_VIRTUAL (b))
6803 vbase = binfo_for_vbase (BINFO_TYPE (b), t);
6804 inits = build_vtt_inits (vbase, t, /*virtual_vtts_p=*/0,
6808 dfs_walk (binfo, dfs_fixup_binfo_vtbls,
6809 dfs_unmarked_real_bases_queue_p,
6810 build_tree_list (t, binfo));
6815 /* Called from build_vtt_inits via dfs_walk. */
6818 dfs_build_secondary_vptr_vtt_inits (binfo, data)
6830 SET_BINFO_MARKED (binfo);
6832 /* We don't care about bases that don't have vtables. */
6833 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
6836 /* We're only interested in proper subobjects of T. */
6837 if (same_type_p (BINFO_TYPE (binfo), t))
6840 /* We're not interested in non-virtual primary bases. */
6841 if (!TREE_VIA_VIRTUAL (binfo) && BINFO_PRIMARY_MARKED_P (binfo))
6844 /* If BINFO doesn't have virtual bases, then we have to look to see
6845 whether or not any virtual functions were overidden along a
6846 virtual path. The point is that given:
6848 struct V { virtual void f(); int i; };
6849 struct C : public virtual V { void f (); };
6851 when we constrct C we need a secondary vptr for V-in-C because we
6852 don't know what the vcall offset for `f' should be. If `V' ends
6853 up in a different place in the complete object, then we'll need a
6854 different vcall offset than that present in the normal V-in-C
6856 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo))
6857 && !BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P (get_matching_base (binfo, t)))
6860 /* Record the index where this secondary vptr can be found. */
6861 index = TREE_TYPE (l);
6862 BINFO_VPTR_INDEX (binfo) = index;
6863 TREE_TYPE (l) = size_binop (PLUS_EXPR, index,
6864 TYPE_SIZE_UNIT (ptr_type_node));
6866 /* Add the initializer for the secondary vptr itself. */
6867 init = BINFO_VTABLE (binfo);
6868 if (TREE_CODE (init) == TREE_LIST)
6869 init = TREE_VALUE (init);
6870 TREE_VALUE (l) = tree_cons (NULL_TREE, init, TREE_VALUE (l));
6875 /* Called from build_vtt_inits via dfs_walk. */
6878 dfs_fixup_binfo_vtbls (binfo, data)
6882 CLEAR_BINFO_MARKED (binfo);
6884 /* We don't care about bases that don't have vtables. */
6885 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
6888 /* If we scribbled the construction vtable vptr into BINFO, clear it
6890 if (TREE_CODE (BINFO_VTABLE (binfo)) == TREE_LIST
6891 && (TREE_PURPOSE (BINFO_VTABLE (binfo))
6892 == TREE_VALUE ((tree) data)))
6893 BINFO_VTABLE (binfo) = TREE_CHAIN (BINFO_VTABLE (binfo));
6898 /* Build the construction vtable group for BINFO which is in the
6899 hierarchy dominated by T. */
6902 build_ctor_vtbl_group (binfo, t)
6913 /* See if we've already create this construction vtable group. */
6915 id = mangle_ctor_vtbl_for_type (t, binfo);
6917 id = get_ctor_vtbl_name (t, binfo);
6918 if (IDENTIFIER_GLOBAL_VALUE (id))
6921 /* Build a version of VTBL (with the wrong type) for use in
6922 constructing the addresses of secondary vtables in the
6923 construction vtable group. */
6924 vtbl = build_vtable (t, id, ptr_type_node);
6925 list = build_tree_list (vtbl, NULL_TREE);
6926 accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)),
6928 for (vbase = TYPE_BINFO (TREE_TYPE (binfo));
6930 vbase = TREE_CHAIN (vbase))
6934 if (!TREE_VIA_VIRTUAL (vbase))
6937 b = binfo_for_vbase (BINFO_TYPE (vbase), t);
6938 accumulate_vtbl_inits (b, vbase, binfo, t, list);
6941 inits = TREE_VALUE (list);
6943 /* Figure out the type of the construction vtable. */
6944 type = build_index_type (size_int (list_length (inits)));
6945 type = build_cplus_array_type (vtable_entry_type, type);
6946 TREE_TYPE (vtbl) = type;
6948 /* Initialize the construction vtable. */
6949 pushdecl_top_level (vtbl);
6950 initialize_array (vtbl, inits);
6953 /* Add the vtbl initializers for BINFO (and its non-primary,
6954 non-virtual bases) to the list of INITS. BINFO is in the hierarchy
6955 dominated by T. ORIG_BINFO must have the same type as BINFO, but
6956 may be different from BINFO if we are building a construction
6957 vtable. RTTI_BINFO gives the object that should be used as the
6958 complete object for BINFO. */
6961 accumulate_vtbl_inits (binfo, orig_binfo, rtti_binfo, t, inits)
6971 my_friendly_assert (same_type_p (BINFO_TYPE (binfo),
6972 BINFO_TYPE (orig_binfo)),
6975 /* This is a construction vtable if the RTTI type is not the most
6976 derived type in the hierarchy. */
6977 ctor_vtbl_p = !same_type_p (BINFO_TYPE (rtti_binfo), t);
6979 /* If we're building a construction vtable, we're not interested in
6980 subobjects that don't require construction vtables. */
6982 && !TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo))
6983 && !(BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P
6984 (get_matching_base (binfo, BINFO_TYPE (rtti_binfo)))))
6987 /* Build the initializers for the BINFO-in-T vtable. */
6989 = chainon (TREE_VALUE (inits),
6990 dfs_accumulate_vtbl_inits (binfo, orig_binfo,
6991 rtti_binfo, t, inits));
6993 /* Walk the BINFO and its bases. We walk in preorder so that as we
6994 initialize each vtable we can figure out at what offset the
6995 secondary vtable lies from the primary vtable. We can't use
6996 dfs_walk here because we need to iterate through bases of BINFO
6997 and RTTI_BINFO simultaneously. */
6998 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
7002 base_binfo = BINFO_BASETYPE (binfo, i);
7003 /* Skip virtual bases. */
7004 if (TREE_VIA_VIRTUAL (base_binfo))
7006 accumulate_vtbl_inits (base_binfo,
7007 BINFO_BASETYPE (orig_binfo, i),
7014 /* Called from finish_vtbls via dfs_walk when using the new ABI.
7015 Accumulates the vtable initializers for all of the vtables into
7016 TREE_VALUE (DATA). Returns the initializers for the BINFO vtable. */
7019 dfs_accumulate_vtbl_inits (binfo, orig_binfo, rtti_binfo, t, l)
7026 tree inits = NULL_TREE;
7028 if (BINFO_NEW_VTABLE_MARKED (orig_binfo, t))
7034 /* Compute the initializer for this vtable. */
7035 inits = build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo,
7038 /* Figure out the position to which the VPTR should point. */
7039 vtbl = TREE_PURPOSE (l);
7040 vtbl = build1 (ADDR_EXPR,
7043 index = size_binop (PLUS_EXPR,
7044 size_int (non_fn_entries),
7045 size_int (list_length (TREE_VALUE (l))));
7046 index = size_binop (MULT_EXPR,
7047 TYPE_SIZE_UNIT (vtable_entry_type),
7049 vtbl = build (PLUS_EXPR, TREE_TYPE (vtbl), vtbl, index);
7050 TREE_CONSTANT (vtbl) = 1;
7052 /* For an ordinary vtable, set BINFO_VTABLE. */
7053 if (same_type_p (BINFO_TYPE (rtti_binfo), t))
7054 BINFO_VTABLE (binfo) = vtbl;
7055 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7056 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7057 straighten this out. */
7059 BINFO_VTABLE (binfo) =
7060 tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo));
7066 /* Construct the initializer for BINFOs virtual function table. BINFO
7067 is part of the hierarchy dominated by T. If we're building a
7068 construction vtable, the ORIG_BINFO is the binfo we should use to
7069 find the actual function pointers to put in the vtable. Otherwise,
7070 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7071 BINFO that should be indicated by the RTTI information in the
7072 vtable; it will be a base class of T, rather than T itself, if we
7073 are building a construction vtable.
7075 The value returned is a TREE_LIST suitable for wrapping in a
7076 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7077 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7078 number of non-function entries in the vtable.
7080 It might seem that this function should never be called with a
7081 BINFO for which BINFO_PRIMARY_MARKED_P holds, the vtable for such a
7082 base is always subsumed by a derived class vtable. However, when
7083 we are building construction vtables we do build vtables for
7084 primary bases; we need these while the primary base is being
7088 build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo, non_fn_entries_p)
7093 int *non_fn_entries_p;
7100 /* Initialize VID. */
7101 bzero (&vid, sizeof (vid));
7104 vid.last_init = &vid.inits;
7105 vid.primary_vtbl_p = (binfo == TYPE_BINFO (t));
7106 vid.ctor_vtbl_p = !same_type_p (BINFO_TYPE (rtti_binfo), t);
7107 /* The first vbase or vcall offset is at index -3 in the vtable. */
7108 vid.index = ssize_int (-3);
7110 /* Add entries to the vtable for RTTI. */
7111 build_rtti_vtbl_entries (binfo, rtti_binfo, &vid);
7113 /* Create an array for keeping track of the functions we've
7114 processed. When we see multiple functions with the same
7115 signature, we share the vcall offsets. */
7116 VARRAY_TREE_INIT (vid.fns, 32, "fns");
7117 /* Add the vcall and vbase offset entries. */
7118 build_vcall_and_vbase_vtbl_entries (binfo, &vid);
7120 VARRAY_FREE (vid.fns);
7121 /* Clear BINFO_VTABLE_PAATH_MARKED; it's set by
7122 build_vbase_offset_vtbl_entries. */
7123 for (vbase = CLASSTYPE_VBASECLASSES (t);
7125 vbase = TREE_CHAIN (vbase))
7126 CLEAR_BINFO_VTABLE_PATH_MARKED (TREE_VALUE (vbase));
7128 if (non_fn_entries_p)
7129 *non_fn_entries_p = list_length (vid.inits);
7131 /* Go through all the ordinary virtual functions, building up
7133 vfun_inits = NULL_TREE;
7134 for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v))
7142 /* Pull the offset for `this', and the function to call, out of
7144 delta = BV_DELTA (v);
7146 if (BV_USE_VCALL_INDEX_P (v))
7148 vcall_index = BV_VCALL_INDEX (v);
7149 my_friendly_assert (vcall_index != NULL_TREE, 20000621);
7152 vcall_index = NULL_TREE;
7155 my_friendly_assert (TREE_CODE (delta) == INTEGER_CST, 19990727);
7156 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 19990727);
7158 /* You can't call an abstract virtual function; it's abstract.
7159 So, we replace these functions with __pure_virtual. */
7160 if (DECL_PURE_VIRTUAL_P (fn))
7163 /* Take the address of the function, considering it to be of an
7164 appropriate generic type. */
7165 pfn = build1 (ADDR_EXPR, vfunc_ptr_type_node, fn);
7166 /* The address of a function can't change. */
7167 TREE_CONSTANT (pfn) = 1;
7168 /* Enter it in the vtable. */
7169 init = build_vtable_entry (delta, vcall_index, pfn,
7170 BV_GENERATE_THUNK_WITH_VTABLE_P (v));
7171 /* And add it to the chain of initializers. */
7172 vfun_inits = tree_cons (NULL_TREE, init, vfun_inits);
7175 /* The initializers for virtual functions were built up in reverse
7176 order; straighten them out now. */
7177 vfun_inits = nreverse (vfun_inits);
7179 /* The negative offset initializers are also in reverse order. */
7180 vid.inits = nreverse (vid.inits);
7182 /* Chain the two together. */
7183 return chainon (vid.inits, vfun_inits);
7186 /* Sets vid->inits to be the initializers for the vbase and vcall
7187 offsets in BINFO, which is in the hierarchy dominated by T. */
7190 build_vcall_and_vbase_vtbl_entries (binfo, vid)
7192 vtbl_init_data *vid;
7196 /* If this is a derived class, we must first create entries
7197 corresponding to the primary base class. */
7198 b = get_primary_binfo (binfo);
7200 build_vcall_and_vbase_vtbl_entries (b, vid);
7202 /* Add the vbase entries for this base. */
7203 build_vbase_offset_vtbl_entries (binfo, vid);
7204 /* Add the vcall entries for this base. */
7205 build_vcall_offset_vtbl_entries (binfo, vid);
7208 /* Returns the initializers for the vbase offset entries in the vtable
7209 for BINFO (which is part of the class hierarchy dominated by T), in
7210 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7211 where the next vbase offset will go. */
7214 build_vbase_offset_vtbl_entries (binfo, vid)
7216 vtbl_init_data *vid;
7221 /* Under the old ABI, pointers to virtual bases are stored in each
7223 if (!vbase_offsets_in_vtable_p ())
7226 /* If there are no virtual baseclasses, then there is nothing to
7228 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo)))
7233 /* Go through the virtual bases, adding the offsets. */
7234 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
7236 vbase = TREE_CHAIN (vbase))
7241 if (!TREE_VIA_VIRTUAL (vbase))
7244 /* Find the instance of this virtual base in the complete
7246 b = binfo_for_vbase (BINFO_TYPE (vbase), t);
7248 /* If we've already got an offset for this virtual base, we
7249 don't need another one. */
7250 if (BINFO_VTABLE_PATH_MARKED (b))
7252 SET_BINFO_VTABLE_PATH_MARKED (b);
7254 /* Figure out where we can find this vbase offset. */
7255 delta = size_binop (MULT_EXPR,
7258 TYPE_SIZE_UNIT (vtable_entry_type)));
7259 if (vid->primary_vtbl_p)
7260 BINFO_VPTR_FIELD (b) = delta;
7262 if (binfo != TYPE_BINFO (t))
7266 /* Find the instance of this virtual base in the type of BINFO. */
7267 orig_vbase = binfo_for_vbase (BINFO_TYPE (vbase),
7268 BINFO_TYPE (binfo));
7270 /* The vbase offset had better be the same. */
7271 if (!tree_int_cst_equal (delta,
7272 BINFO_VPTR_FIELD (orig_vbase)))
7273 my_friendly_abort (20000403);
7276 /* The next vbase will come at a more negative offset. */
7277 vid->index = size_binop (MINUS_EXPR, vid->index, ssize_int (1));
7279 /* The initializer is the delta from BINFO to this virtual base.
7280 The vbase offsets go in reverse inheritance-graph order, and
7281 we are walking in inheritance graph order so these end up in
7283 delta = size_diffop (BINFO_OFFSET (b), BINFO_OFFSET (binfo));
7285 = build_tree_list (NULL_TREE,
7286 fold (build1 (NOP_EXPR,
7289 vid->last_init = &TREE_CHAIN (*vid->last_init);
7293 /* Adds the initializers for the vcall offset entries in the vtable
7294 for BINFO (which is part of the class hierarchy dominated by T) to
7298 build_vcall_offset_vtbl_entries (binfo, vid)
7300 vtbl_init_data *vid;
7302 /* Under the old ABI, the adjustments to the `this' pointer were made
7304 if (!vcall_offsets_in_vtable_p ())
7307 /* We only need these entries if this base is a virtual base. */
7308 if (!TREE_VIA_VIRTUAL (binfo))
7311 /* We need a vcall offset for each of the virtual functions in this
7312 vtable. For example:
7314 class A { virtual void f (); };
7315 class B : virtual public A { };
7316 class C: virtual public A, public B {};
7323 The location of `A' is not at a fixed offset relative to `B'; the
7324 offset depends on the complete object derived from `B'. So,
7325 `B' vtable contains an entry for `f' that indicates by what
7326 amount the `this' pointer for `B' needs to be adjusted to arrive
7329 We need entries for all the functions in our primary vtable and
7330 in our non-virtual bases vtables. */
7332 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7333 add_vcall_offset_vtbl_entries_r (binfo, vid);
7336 /* Build vcall offsets, starting with those for BINFO. */
7339 add_vcall_offset_vtbl_entries_r (binfo, vid)
7341 vtbl_init_data *vid;
7346 /* Don't walk into virtual bases -- except, of course, for the
7347 virtual base for which we are building vcall offsets. */
7348 if (TREE_VIA_VIRTUAL (binfo) && vid->vbase != binfo)
7351 /* If BINFO has a primary base, process it first. */
7352 primary_binfo = get_primary_binfo (binfo);
7354 add_vcall_offset_vtbl_entries_r (primary_binfo, vid);
7356 /* Add BINFO itself to the list. */
7357 add_vcall_offset_vtbl_entries_1 (binfo, vid);
7359 /* Scan the non-primary bases of BINFO. */
7360 for (i = 0; i < BINFO_N_BASETYPES (binfo); ++i)
7364 base_binfo = BINFO_BASETYPE (binfo, i);
7365 if (base_binfo != primary_binfo)
7366 add_vcall_offset_vtbl_entries_r (base_binfo, vid);
7370 /* Called from build_vcall_offset_vtbl_entries via dfs_walk. */
7373 add_vcall_offset_vtbl_entries_1 (binfo, vid)
7375 vtbl_init_data* vid;
7377 tree derived_virtuals;
7381 /* If BINFO is a primary base, this is the least derived class of
7382 BINFO that is not a primary base. */
7383 tree non_primary_binfo;
7385 binfo_inits = NULL_TREE;
7387 /* We might be a primary base class. Go up the inheritance
7388 hierarchy until we find the class of which we are a primary base:
7389 it is the BINFO_VIRTUALS there that we need to consider. */
7390 non_primary_binfo = binfo;
7391 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
7395 /* If we have reached a virtual base, then it must be the
7396 virtual base for which we are building vcall offsets. In
7397 turn, the virtual base must be a (possibly indirect) primary
7398 base of the class that we are initializing, or we wouldn't
7399 care about its vtable offsets. */
7400 if (TREE_VIA_VIRTUAL (non_primary_binfo))
7402 non_primary_binfo = vid->binfo;
7406 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
7407 if (get_primary_binfo (b) != non_primary_binfo)
7409 non_primary_binfo = b;
7412 /* Make entries for the rest of the virtuals. */
7413 for (base_virtuals = BINFO_VIRTUALS (binfo),
7414 derived_virtuals = BINFO_VIRTUALS (non_primary_binfo),
7415 orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
7417 base_virtuals = TREE_CHAIN (base_virtuals),
7418 derived_virtuals = TREE_CHAIN (derived_virtuals),
7419 orig_virtuals = TREE_CHAIN (orig_virtuals))
7427 /* Find the declaration that originally caused this function to
7429 orig_fn = BV_FN (orig_virtuals);
7431 /* We do not need an entry if this function is declared in a
7432 virtual base (or one of its virtual bases), and not
7433 overridden in the section of the hierarchy dominated by the
7434 virtual base for which we are building vcall offsets. */
7435 if (!same_type_p (DECL_CONTEXT (orig_fn), BINFO_TYPE (binfo)))
7438 /* Find the overriding function. */
7439 fn = BV_FN (derived_virtuals);
7441 /* If there is already an entry for a function with the same
7442 signature as FN, then we do not need a second vcall offset.
7443 Check the list of functions already present in the derived
7445 for (i = 0; i < VARRAY_ACTIVE_SIZE (vid->fns); ++i)
7449 derived_entry = VARRAY_TREE (vid->fns, i);
7450 if (same_signature_p (BV_FN (derived_entry), fn))
7452 BV_VCALL_INDEX (derived_virtuals)
7453 = BV_VCALL_INDEX (derived_entry);
7457 if (i != VARRAY_ACTIVE_SIZE (vid->fns))
7460 /* The FN comes from BASE. So, we must caculate the adjustment
7461 from the virtual base that derived from BINFO to BASE. */
7462 base = DECL_CONTEXT (fn);
7463 base_binfo = get_binfo (base, vid->derived, /*protect=*/0);
7465 /* Compute the vcall offset. */
7469 fold (build1 (NOP_EXPR, vtable_entry_type,
7470 size_diffop (BINFO_OFFSET (base_binfo),
7471 BINFO_OFFSET (vid->vbase))))));
7472 vid->last_init = &TREE_CHAIN (*vid->last_init);
7474 /* Keep track of the vtable index where this vcall offset can be
7475 found. For a construction vtable, we already made this
7476 annotation when we build the original vtable. */
7477 if (!vid->ctor_vtbl_p)
7478 BV_VCALL_INDEX (derived_virtuals) = vid->index;
7480 /* The next vcall offset will be found at a more negative
7482 vid->index = size_binop (MINUS_EXPR, vid->index, ssize_int (1));
7484 /* Keep track of this function. */
7485 VARRAY_PUSH_TREE (vid->fns, derived_virtuals);
7489 /* Return vtbl initializers for the RTTI entries coresponding to the
7490 BINFO's vtable. The RTTI entries should indicate the object given
7494 build_rtti_vtbl_entries (binfo, rtti_binfo, vid)
7497 vtbl_init_data *vid;
7506 basetype = BINFO_TYPE (binfo);
7507 t = BINFO_TYPE (rtti_binfo);
7509 /* For a COM object there is no RTTI entry. */
7510 if (CLASSTYPE_COM_INTERFACE (basetype))
7513 /* To find the complete object, we will first convert to our most
7514 primary base, and then add the offset in the vtbl to that value. */
7516 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b)))
7520 primary_base = get_primary_binfo (b);
7521 if (!BINFO_PRIMARY_MARKED_P (primary_base))
7525 offset = size_diffop (BINFO_OFFSET (rtti_binfo), BINFO_OFFSET (b));
7527 /* The second entry is, in the case of the new ABI, the address of
7528 the typeinfo object, or, in the case of the old ABI, a function
7529 which returns a typeinfo object. */
7530 if (new_abi_rtti_p ())
7533 decl = build_unary_op (ADDR_EXPR, get_tinfo_decl (t), 0);
7535 decl = integer_zero_node;
7537 /* Convert the declaration to a type that can be stored in the
7539 init = build1 (NOP_EXPR, vfunc_ptr_type_node, decl);
7540 TREE_CONSTANT (init) = 1;
7545 decl = get_tinfo_decl (t);
7547 decl = abort_fndecl;
7549 /* Convert the declaration to a type that can be stored in the
7551 init = build1 (ADDR_EXPR, vfunc_ptr_type_node, decl);
7552 TREE_CONSTANT (init) = 1;
7553 init = build_vtable_entry (offset, NULL_TREE, init,
7554 /*generate_with_vtable_p=*/0);
7556 *vid->last_init = build_tree_list (NULL_TREE, init);
7557 vid->last_init = &TREE_CHAIN (*vid->last_init);
7559 /* Add the offset-to-top entry. It comes earlier in the vtable that
7560 the the typeinfo entry. */
7561 if (flag_vtable_thunks)
7563 /* Convert the offset to look like a function pointer, so that
7564 we can put it in the vtable. */
7565 init = build1 (NOP_EXPR, vfunc_ptr_type_node, offset);
7566 TREE_CONSTANT (init) = 1;
7567 *vid->last_init = build_tree_list (NULL_TREE, init);
7568 vid->last_init = &TREE_CHAIN (*vid->last_init);
7572 /* Build an entry in the virtual function table. DELTA is the offset
7573 for the `this' pointer. VCALL_INDEX is the vtable index containing
7574 the vcall offset; zero if none. ENTRY is the virtual function
7575 table entry itself. It's TREE_TYPE must be VFUNC_PTR_TYPE_NODE,
7576 but it may not actually be a virtual function table pointer. (For
7577 example, it might be the address of the RTTI object, under the new
7581 build_vtable_entry (delta, vcall_index, entry, generate_with_vtable_p)
7585 int generate_with_vtable_p;
7587 if (flag_vtable_thunks)
7591 fn = TREE_OPERAND (entry, 0);
7592 if ((!integer_zerop (delta) || vcall_index != NULL_TREE)
7593 && fn != abort_fndecl
7594 && !DECL_TINFO_FN_P (fn))
7596 entry = make_thunk (entry, delta, vcall_index,
7597 generate_with_vtable_p);
7598 entry = build1 (ADDR_EXPR, vtable_entry_type, entry);
7599 TREE_READONLY (entry) = 1;
7600 TREE_CONSTANT (entry) = 1;
7602 #ifdef GATHER_STATISTICS
7603 n_vtable_entries += 1;
7609 tree elems = tree_cons (NULL_TREE, delta,
7610 tree_cons (NULL_TREE, integer_zero_node,
7611 build_tree_list (NULL_TREE, entry)));
7612 tree entry = build (CONSTRUCTOR, vtable_entry_type, NULL_TREE, elems);
7614 /* We don't use vcall offsets when not using vtable thunks. */
7615 my_friendly_assert (vcall_index == NULL_TREE, 20000125);
7617 /* DELTA used to be constructed by `size_int' and/or size_binop,
7618 which caused overflow problems when it was negative. That should
7621 if (! int_fits_type_p (delta, delta_type_node))
7623 if (flag_huge_objects)
7624 sorry ("object size exceeds built-in limit for virtual function table implementation");
7626 sorry ("object size exceeds normal limit for virtual function table implementation, recompile all source and use -fhuge-objects");
7629 TREE_CONSTANT (entry) = 1;
7630 TREE_STATIC (entry) = 1;
7631 TREE_READONLY (entry) = 1;
7633 #ifdef GATHER_STATISTICS
7634 n_vtable_entries += 1;