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 ((tree
));
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
);
867 if (TREE_VIA_VIRTUAL (binfo
))
868 my_friendly_assert (binfo
== binfo_for_vbase (BINFO_TYPE (binfo
),
872 if (BINFO_NEW_VTABLE_MARKED (binfo
, current_class_type
))
873 /* We already created a vtable for this base. There's no need to
877 /* Remember that we've created a vtable for this BINFO, so that we
878 don't try to do so again. */
879 SET_BINFO_NEW_VTABLE_MARKED (binfo
, current_class_type
);
881 /* Make fresh virtual list, so we can smash it later. */
882 BINFO_VIRTUALS (binfo
) = copy_virtuals (binfo
);
884 if (TREE_VIA_VIRTUAL (binfo
))
886 tree binfo1
= binfo_for_vbase (BINFO_TYPE (binfo
), for_type
);
888 /* XXX - This should never happen, if it does, the caller should
889 ensure that the binfo is from for_type's binfos, not from any
890 base type's. We can remove all this code after a while. */
892 warning ("internal inconsistency: binfo offset error for rtti");
894 offset
= BINFO_OFFSET (binfo1
);
897 offset
= BINFO_OFFSET (binfo
);
899 /* In the new ABI, secondary vtables are laid out as part of the
900 same structure as the primary vtable. */
901 if (merge_primary_and_secondary_vtables_p ())
903 BINFO_VTABLE (binfo
) = NULL_TREE
;
907 /* Create the declaration for the secondary vtable. */
908 basetype
= TYPE_MAIN_VARIANT (BINFO_TYPE (binfo
));
909 buf2
= TYPE_ASSEMBLER_NAME_STRING (basetype
);
910 i
= TYPE_ASSEMBLER_NAME_LENGTH (basetype
) + 1;
912 /* We know that the vtable that we are going to create doesn't exist
913 yet in the global namespace, and when we finish, it will be
914 pushed into the global namespace. In complex MI hierarchies, we
915 have to loop while the name we are thinking of adding is globally
916 defined, adding more name components to the vtable name as we
917 loop, until the name is unique. This is because in complex MI
918 cases, we might have the same base more than once. This means
919 that the order in which this function is called for vtables must
920 remain the same, otherwise binary compatibility can be
925 char *buf1
= (char *) alloca (TYPE_ASSEMBLER_NAME_LENGTH (for_type
)
929 sprintf (buf1
, "%s%c%s", TYPE_ASSEMBLER_NAME_STRING (for_type
), joiner
,
931 buf
= (char *) alloca (strlen (VTABLE_NAME_PREFIX
) + strlen (buf1
) + 1);
932 sprintf (buf
, "%s%s", VTABLE_NAME_PREFIX
, buf1
);
933 name
= get_identifier (buf
);
935 /* If this name doesn't clash, then we can use it, otherwise
936 we add more to the name until it is unique. */
938 if (! IDENTIFIER_GLOBAL_VALUE (name
))
941 /* Set values for next loop through, if the name isn't unique. */
943 path
= BINFO_INHERITANCE_CHAIN (path
);
945 /* We better not run out of stuff to make it unique. */
946 my_friendly_assert (path
!= NULL_TREE
, 368);
948 basetype
= TYPE_MAIN_VARIANT (BINFO_TYPE (path
));
950 if (for_type
== basetype
)
952 /* If we run out of basetypes in the path, we have already
953 found created a vtable with that name before, we now
954 resort to tacking on _%d to distinguish them. */
956 i
= TYPE_ASSEMBLER_NAME_LENGTH (basetype
) + 1 + i
+ 1 + 3;
957 buf1
= (char *) alloca (i
);
959 sprintf (buf1
, "%s%c%s%c%d",
960 TYPE_ASSEMBLER_NAME_STRING (basetype
), joiner
,
962 buf
= (char *) alloca (strlen (VTABLE_NAME_PREFIX
)
963 + strlen (buf1
) + 1);
964 sprintf (buf
, "%s%s", VTABLE_NAME_PREFIX
, buf1
);
965 name
= get_identifier (buf
);
967 /* If this name doesn't clash, then we can use it,
968 otherwise we add something different to the name until
970 } while (++j
<= 999 && IDENTIFIER_GLOBAL_VALUE (name
));
972 /* Hey, they really like MI don't they? Increase the 3
973 above to 6, and the 999 to 999999. :-) */
974 my_friendly_assert (j
<= 999, 369);
979 i
= TYPE_ASSEMBLER_NAME_LENGTH (basetype
) + 1 + i
;
980 new_buf2
= (char *) alloca (i
);
981 sprintf (new_buf2
, "%s%c%s",
982 TYPE_ASSEMBLER_NAME_STRING (basetype
), joiner
, buf2
);
986 new_decl
= build_vtable (for_type
, name
, TREE_TYPE (orig_decl
));
987 DECL_ALIGN (new_decl
) = DECL_ALIGN (orig_decl
);
988 DECL_USER_ALIGN (new_decl
) = DECL_USER_ALIGN (orig_decl
);
989 BINFO_VTABLE (binfo
) = pushdecl_top_level (new_decl
);
991 #ifdef GATHER_STATISTICS
993 n_vtable_elems
+= list_length (BINFO_VIRTUALS (binfo
));
999 /* Create a new vtable for BINFO which is the hierarchy dominated by
1003 make_new_vtable (t
, binfo
)
1007 if (binfo
== TYPE_BINFO (t
))
1008 /* In this case, it is *type*'s vtable we are modifying. We start
1009 with the approximation that it's vtable is that of the
1010 immediate base class. */
1011 return build_primary_vtable (TYPE_BINFO (DECL_CONTEXT (TYPE_VFIELD (t
))),
1014 /* This is our very own copy of `basetype' to play with. Later,
1015 we will fill in all the virtual functions that override the
1016 virtual functions in these base classes which are not defined
1017 by the current type. */
1018 return build_secondary_vtable (binfo
, t
);
1021 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
1022 (which is in the hierarchy dominated by T) list FNDECL as its
1023 BV_FN. DELTA is the required constant adjustment from the `this'
1024 pointer where the vtable entry appears to the `this' required when
1025 the function is actually called. */
1028 modify_vtable_entry (t
, binfo
, fndecl
, delta
, virtuals
)
1039 if (fndecl
!= BV_FN (v
)
1040 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
1044 /* We need a new vtable for BINFO. */
1045 if (make_new_vtable (t
, binfo
))
1047 /* If we really did make a new vtable, we also made a copy
1048 of the BINFO_VIRTUALS list. Now, we have to find the
1049 corresponding entry in that list. */
1050 *virtuals
= BINFO_VIRTUALS (binfo
);
1051 while (BV_FN (*virtuals
) != BV_FN (v
))
1052 *virtuals
= TREE_CHAIN (*virtuals
);
1056 base_fndecl
= BV_FN (v
);
1057 BV_DELTA (v
) = delta
;
1058 BV_VCALL_INDEX (v
) = NULL_TREE
;
1061 /* Now assign virtual dispatch information, if unset. We can
1062 dispatch this, through any overridden base function. */
1063 if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
1065 DECL_VINDEX (fndecl
) = DECL_VINDEX (base_fndecl
);
1066 DECL_VIRTUAL_CONTEXT (fndecl
) = DECL_VIRTUAL_CONTEXT (base_fndecl
);
1071 /* Return the index (in the virtual function table) of the first
1072 virtual function. */
1075 first_vfun_index (t
)
1078 /* Under the old ABI, the offset-to-top and RTTI entries are at
1079 indices zero and one; under the new ABI, the first virtual
1080 function is at index zero. */
1081 if (!CLASSTYPE_COM_INTERFACE (t
) && !flag_new_abi
)
1082 return flag_vtable_thunks
? 2 : 1;
1087 /* Set DECL_VINDEX for DECL. VINDEX_P is the number of virtual
1088 functions present in the vtable so far. */
1091 set_vindex (t
, decl
, vfuns_p
)
1098 vindex
= (*vfuns_p
)++;
1099 vindex
+= first_vfun_index (t
);
1100 DECL_VINDEX (decl
) = build_shared_int_cst (vindex
);
1103 /* Add a virtual function to all the appropriate vtables for the class
1104 T. DECL_VINDEX(X) should be error_mark_node, if we want to
1105 allocate a new slot in our table. If it is error_mark_node, we
1106 know that no other function from another vtable is overridden by X.
1107 VFUNS_P keeps track of how many virtuals there are in our
1108 main vtable for the type, and we build upon the NEW_VIRTUALS list
1112 add_virtual_function (new_virtuals_p
, overridden_virtuals_p
,
1114 tree
*new_virtuals_p
;
1115 tree
*overridden_virtuals_p
;
1118 tree t
; /* Structure type. */
1122 /* If this function doesn't override anything from a base class, we
1123 can just assign it a new DECL_VINDEX now. Otherwise, if it does
1124 override something, we keep it around and assign its DECL_VINDEX
1125 later, in modify_all_vtables. */
1126 if (TREE_CODE (DECL_VINDEX (fndecl
)) == INTEGER_CST
)
1127 /* We've already dealt with this function. */
1130 new_virtual
= make_node (TREE_LIST
);
1131 BV_FN (new_virtual
) = fndecl
;
1132 BV_DELTA (new_virtual
) = integer_zero_node
;
1134 if (DECL_VINDEX (fndecl
) == error_mark_node
)
1136 /* FNDECL is a new virtual function; it doesn't override any
1137 virtual function in a base class. */
1139 /* We remember that this was the base sub-object for rtti. */
1140 CLASSTYPE_RTTI (t
) = t
;
1142 /* Now assign virtual dispatch information. */
1143 set_vindex (t
, fndecl
, vfuns_p
);
1144 DECL_VIRTUAL_CONTEXT (fndecl
) = t
;
1146 /* Save the state we've computed on the NEW_VIRTUALS list. */
1147 TREE_CHAIN (new_virtual
) = *new_virtuals_p
;
1148 *new_virtuals_p
= new_virtual
;
1152 /* FNDECL overrides a function from a base class. */
1153 TREE_CHAIN (new_virtual
) = *overridden_virtuals_p
;
1154 *overridden_virtuals_p
= new_virtual
;
1158 /* Add method METHOD to class TYPE. If ERROR_P is true, we are adding
1159 the method after the class has already been defined because a
1160 declaration for it was seen. (Even though that is erroneous, we
1161 add the method for improved error recovery.) */
1164 add_method (type
, method
, error_p
)
1169 int using = (DECL_CONTEXT (method
) != type
);
1174 if (!CLASSTYPE_METHOD_VEC (type
))
1175 /* Make a new method vector. We start with 8 entries. We must
1176 allocate at least two (for constructors and destructors), and
1177 we're going to end up with an assignment operator at some point
1180 We could use a TREE_LIST for now, and convert it to a TREE_VEC
1181 in finish_struct, but we would probably waste more memory
1182 making the links in the list than we would by over-allocating
1183 the size of the vector here. Furthermore, we would complicate
1184 all the code that expects this to be a vector. */
1185 CLASSTYPE_METHOD_VEC (type
) = make_tree_vec (8);
1187 method_vec
= CLASSTYPE_METHOD_VEC (type
);
1188 len
= TREE_VEC_LENGTH (method_vec
);
1190 /* Constructors and destructors go in special slots. */
1191 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1192 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1193 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1194 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1197 /* See if we already have an entry with this name. */
1198 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
; slot
< len
; ++slot
)
1199 if (!TREE_VEC_ELT (method_vec
, slot
)
1200 || (DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec
,
1202 == DECL_NAME (method
)))
1207 /* We need a bigger method vector. */
1211 /* In the non-error case, we are processing a class
1212 definition. Double the size of the vector to give room
1216 /* In the error case, the vector is already complete. We
1217 don't expect many errors, and the rest of the front-end
1218 will get confused if there are empty slots in the vector. */
1222 new_vec
= make_tree_vec (new_len
);
1223 bcopy ((PTR
) &TREE_VEC_ELT (method_vec
, 0),
1224 (PTR
) &TREE_VEC_ELT (new_vec
, 0),
1225 len
* sizeof (tree
));
1227 method_vec
= CLASSTYPE_METHOD_VEC (type
) = new_vec
;
1230 if (DECL_CONV_FN_P (method
) && !TREE_VEC_ELT (method_vec
, slot
))
1232 /* Type conversion operators have to come before ordinary
1233 methods; add_conversions depends on this to speed up
1234 looking for conversion operators. So, if necessary, we
1235 slide some of the vector elements up. In theory, this
1236 makes this algorithm O(N^2) but we don't expect many
1237 conversion operators. */
1238 for (slot
= 2; slot
< len
; ++slot
)
1240 tree fn
= TREE_VEC_ELT (method_vec
, slot
);
1243 /* There are no more entries in the vector, so we
1244 can insert the new conversion operator here. */
1247 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
1248 /* We can insert the new function right at the
1253 if (!TREE_VEC_ELT (method_vec
, slot
))
1254 /* There is nothing in the Ith slot, so we can avoid
1259 /* We know the last slot in the vector is empty
1260 because we know that at this point there's room
1261 for a new function. */
1262 bcopy ((PTR
) &TREE_VEC_ELT (method_vec
, slot
),
1263 (PTR
) &TREE_VEC_ELT (method_vec
, slot
+ 1),
1264 (len
- slot
- 1) * sizeof (tree
));
1265 TREE_VEC_ELT (method_vec
, slot
) = NULL_TREE
;
1270 if (template_class_depth (type
))
1271 /* TYPE is a template class. Don't issue any errors now; wait
1272 until instantiation time to complain. */
1278 /* Check to see if we've already got this method. */
1279 for (fns
= TREE_VEC_ELT (method_vec
, slot
);
1281 fns
= OVL_NEXT (fns
))
1283 tree fn
= OVL_CURRENT (fns
);
1285 if (TREE_CODE (fn
) != TREE_CODE (method
))
1288 if (TREE_CODE (method
) != TEMPLATE_DECL
)
1290 /* [over.load] Member function declarations with the
1291 same name and the same parameter types cannot be
1292 overloaded if any of them is a static member
1293 function declaration. */
1294 if ((DECL_STATIC_FUNCTION_P (fn
)
1295 != DECL_STATIC_FUNCTION_P (method
))
1298 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1299 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1301 if (! DECL_STATIC_FUNCTION_P (fn
))
1302 parms1
= TREE_CHAIN (parms1
);
1303 if (! DECL_STATIC_FUNCTION_P (method
))
1304 parms2
= TREE_CHAIN (parms2
);
1306 if (compparms (parms1
, parms2
))
1309 /* Defer to the local function. */
1312 cp_error ("`%#D' and `%#D' cannot be overloaded",
1317 /* Since this is an ordinary function in a
1318 non-template class, it's mangled name can be used
1319 as a unique identifier. This technique is only
1320 an optimization; we would get the same results if
1321 we just used decls_match here. */
1322 if (DECL_ASSEMBLER_NAME (fn
)
1323 != DECL_ASSEMBLER_NAME (method
))
1326 else if (!decls_match (fn
, method
))
1329 /* There has already been a declaration of this method
1330 or member template. */
1331 cp_error_at ("`%D' has already been declared in `%T'",
1334 /* We don't call duplicate_decls here to merge the
1335 declarations because that will confuse things if the
1336 methods have inline definitions. In particular, we
1337 will crash while processing the definitions. */
1342 /* Actually insert the new method. */
1343 TREE_VEC_ELT (method_vec
, slot
)
1344 = build_overload (method
, TREE_VEC_ELT (method_vec
, slot
));
1346 /* Add the new binding. */
1347 if (!DECL_CONSTRUCTOR_P (method
)
1348 && !DECL_DESTRUCTOR_P (method
))
1349 push_class_level_binding (DECL_NAME (method
),
1350 TREE_VEC_ELT (method_vec
, slot
));
1353 /* Subroutines of finish_struct. */
1355 /* Look through the list of fields for this struct, deleting
1356 duplicates as we go. This must be recursive to handle
1359 FIELD is the field which may not appear anywhere in FIELDS.
1360 FIELD_PTR, if non-null, is the starting point at which
1361 chained deletions may take place.
1362 The value returned is the first acceptable entry found
1365 Note that anonymous fields which are not of UNION_TYPE are
1366 not duplicates, they are just anonymous fields. This happens
1367 when we have unnamed bitfields, for example. */
1370 delete_duplicate_fields_1 (field
, fields
)
1375 if (DECL_NAME (field
) == 0)
1377 if (! ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1380 for (x
= TYPE_FIELDS (TREE_TYPE (field
)); x
; x
= TREE_CHAIN (x
))
1381 fields
= delete_duplicate_fields_1 (x
, fields
);
1386 for (x
= fields
; x
; prev
= x
, x
= TREE_CHAIN (x
))
1388 if (DECL_NAME (x
) == 0)
1390 if (! ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
1392 TYPE_FIELDS (TREE_TYPE (x
))
1393 = delete_duplicate_fields_1 (field
, TYPE_FIELDS (TREE_TYPE (x
)));
1394 if (TYPE_FIELDS (TREE_TYPE (x
)) == 0)
1397 fields
= TREE_CHAIN (fields
);
1399 TREE_CHAIN (prev
) = TREE_CHAIN (x
);
1402 else if (TREE_CODE (field
) == USING_DECL
)
1403 /* A using declaration may is allowed to appear more than
1404 once. We'll prune these from the field list later, and
1405 handle_using_decl will complain about invalid multiple
1408 else if (DECL_NAME (field
) == DECL_NAME (x
))
1410 if (TREE_CODE (field
) == CONST_DECL
1411 && TREE_CODE (x
) == CONST_DECL
)
1412 cp_error_at ("duplicate enum value `%D'", x
);
1413 else if (TREE_CODE (field
) == CONST_DECL
1414 || TREE_CODE (x
) == CONST_DECL
)
1415 cp_error_at ("duplicate field `%D' (as enum and non-enum)",
1417 else if (DECL_DECLARES_TYPE_P (field
)
1418 && DECL_DECLARES_TYPE_P (x
))
1420 if (same_type_p (TREE_TYPE (field
), TREE_TYPE (x
)))
1422 cp_error_at ("duplicate nested type `%D'", x
);
1424 else if (DECL_DECLARES_TYPE_P (field
)
1425 || DECL_DECLARES_TYPE_P (x
))
1427 /* Hide tag decls. */
1428 if ((TREE_CODE (field
) == TYPE_DECL
1429 && DECL_ARTIFICIAL (field
))
1430 || (TREE_CODE (x
) == TYPE_DECL
1431 && DECL_ARTIFICIAL (x
)))
1433 cp_error_at ("duplicate field `%D' (as type and non-type)",
1437 cp_error_at ("duplicate member `%D'", x
);
1439 fields
= TREE_CHAIN (fields
);
1441 TREE_CHAIN (prev
) = TREE_CHAIN (x
);
1449 delete_duplicate_fields (fields
)
1453 for (x
= fields
; x
&& TREE_CHAIN (x
); x
= TREE_CHAIN (x
))
1454 TREE_CHAIN (x
) = delete_duplicate_fields_1 (x
, TREE_CHAIN (x
));
1457 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1458 legit, otherwise return 0. */
1461 alter_access (t
, fdecl
, access
)
1468 if (!DECL_LANG_SPECIFIC (fdecl
))
1469 retrofit_lang_decl (fdecl
);
1471 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1474 if (TREE_VALUE (elem
) != access
)
1476 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1477 cp_error_at ("conflicting access specifications for method `%D', ignored", TREE_TYPE (fdecl
));
1479 error ("conflicting access specifications for field `%s', ignored",
1480 IDENTIFIER_POINTER (DECL_NAME (fdecl
)));
1484 /* They're changing the access to the same thing they changed
1485 it to before. That's OK. */
1491 enforce_access (t
, fdecl
);
1492 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1498 /* Process the USING_DECL, which is a member of T. */
1501 handle_using_decl (using_decl
, t
)
1505 tree ctype
= DECL_INITIAL (using_decl
);
1506 tree name
= DECL_NAME (using_decl
);
1508 = TREE_PRIVATE (using_decl
) ? access_private_node
1509 : TREE_PROTECTED (using_decl
) ? access_protected_node
1510 : access_public_node
;
1512 tree flist
= NULL_TREE
;
1515 binfo
= binfo_or_else (ctype
, t
);
1519 if (name
== constructor_name (ctype
)
1520 || name
== constructor_name_full (ctype
))
1522 cp_error_at ("using-declaration for constructor", using_decl
);
1526 fdecl
= lookup_member (binfo
, name
, 0, 0);
1530 cp_error_at ("no members matching `%D' in `%#T'", using_decl
, ctype
);
1534 if (BASELINK_P (fdecl
))
1535 /* Ignore base type this came from. */
1536 fdecl
= TREE_VALUE (fdecl
);
1538 old_value
= IDENTIFIER_CLASS_VALUE (name
);
1541 if (is_overloaded_fn (old_value
))
1542 old_value
= OVL_CURRENT (old_value
);
1544 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1547 old_value
= NULL_TREE
;
1550 if (is_overloaded_fn (fdecl
))
1555 else if (is_overloaded_fn (old_value
))
1558 /* It's OK to use functions from a base when there are functions with
1559 the same name already present in the current class. */;
1562 cp_error ("`%D' invalid in `%#T'", using_decl
, t
);
1563 cp_error_at (" because of local method `%#D' with same name",
1564 OVL_CURRENT (old_value
));
1570 cp_error ("`%D' invalid in `%#T'", using_decl
, t
);
1571 cp_error_at (" because of local field `%#D' with same name", old_value
);
1575 /* Make type T see field decl FDECL with access ACCESS.*/
1577 for (; flist
; flist
= OVL_NEXT (flist
))
1579 add_method (t
, OVL_CURRENT (flist
), /*error_p=*/0);
1580 alter_access (t
, OVL_CURRENT (flist
), access
);
1583 alter_access (t
, fdecl
, access
);
1586 /* Run through the base clases of T, updating
1587 CANT_HAVE_DEFAULT_CTOR_P, CANT_HAVE_CONST_CTOR_P, and
1588 NO_CONST_ASN_REF_P. Also set flag bits in T based on properties of
1592 check_bases (t
, cant_have_default_ctor_p
, cant_have_const_ctor_p
,
1595 int *cant_have_default_ctor_p
;
1596 int *cant_have_const_ctor_p
;
1597 int *no_const_asn_ref_p
;
1601 int seen_nearly_empty_base_p
;
1604 binfos
= TYPE_BINFO_BASETYPES (t
);
1605 n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
1606 seen_nearly_empty_base_p
= 0;
1608 /* An aggregate cannot have baseclasses. */
1609 CLASSTYPE_NON_AGGREGATE (t
) |= (n_baseclasses
!= 0);
1611 for (i
= 0; i
< n_baseclasses
; ++i
)
1616 /* Figure out what base we're looking at. */
1617 base_binfo
= TREE_VEC_ELT (binfos
, i
);
1618 basetype
= TREE_TYPE (base_binfo
);
1620 /* If the type of basetype is incomplete, then we already
1621 complained about that fact (and we should have fixed it up as
1623 if (!COMPLETE_TYPE_P (basetype
))
1626 /* The base type is of incomplete type. It is
1627 probably best to pretend that it does not
1629 if (i
== n_baseclasses
-1)
1630 TREE_VEC_ELT (binfos
, i
) = NULL_TREE
;
1631 TREE_VEC_LENGTH (binfos
) -= 1;
1633 for (j
= i
; j
+1 < n_baseclasses
; j
++)
1634 TREE_VEC_ELT (binfos
, j
) = TREE_VEC_ELT (binfos
, j
+1);
1638 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1639 here because the case of virtual functions but non-virtual
1640 dtor is handled in finish_struct_1. */
1641 if (warn_ecpp
&& ! TYPE_POLYMORPHIC_P (basetype
)
1642 && TYPE_HAS_DESTRUCTOR (basetype
))
1643 cp_warning ("base class `%#T' has a non-virtual destructor",
1646 /* If the base class doesn't have copy constructors or
1647 assignment operators that take const references, then the
1648 derived class cannot have such a member automatically
1650 if (! TYPE_HAS_CONST_INIT_REF (basetype
))
1651 *cant_have_const_ctor_p
= 1;
1652 if (TYPE_HAS_ASSIGN_REF (basetype
)
1653 && !TYPE_HAS_CONST_ASSIGN_REF (basetype
))
1654 *no_const_asn_ref_p
= 1;
1655 /* Similarly, if the base class doesn't have a default
1656 constructor, then the derived class won't have an
1657 automatically generated default constructor. */
1658 if (TYPE_HAS_CONSTRUCTOR (basetype
)
1659 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
))
1661 *cant_have_default_ctor_p
= 1;
1662 if (! TYPE_HAS_CONSTRUCTOR (t
))
1663 cp_pedwarn ("base `%T' with only non-default constructor in class without a constructor",
1667 /* If the base class is not empty or nearly empty, then this
1668 class cannot be nearly empty. */
1669 if (!CLASSTYPE_NEARLY_EMPTY_P (basetype
) && !is_empty_class (basetype
))
1670 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1671 /* And if there is more than one nearly empty base, then the
1672 derived class is not nearly empty either. */
1673 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
)
1674 && seen_nearly_empty_base_p
)
1675 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1676 /* If this is the first nearly empty base class, then remember
1678 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1679 seen_nearly_empty_base_p
= 1;
1681 /* A lot of properties from the bases also apply to the derived
1683 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1684 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1685 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1686 TYPE_HAS_COMPLEX_ASSIGN_REF (t
)
1687 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype
);
1688 TYPE_HAS_COMPLEX_INIT_REF (t
) |= TYPE_HAS_COMPLEX_INIT_REF (basetype
);
1689 TYPE_OVERLOADS_CALL_EXPR (t
) |= TYPE_OVERLOADS_CALL_EXPR (basetype
);
1690 TYPE_OVERLOADS_ARRAY_REF (t
) |= TYPE_OVERLOADS_ARRAY_REF (basetype
);
1691 TYPE_OVERLOADS_ARROW (t
) |= TYPE_OVERLOADS_ARROW (basetype
);
1692 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1694 /* Derived classes can implicitly become COMified if their bases
1696 if (CLASSTYPE_COM_INTERFACE (basetype
))
1697 CLASSTYPE_COM_INTERFACE (t
) = 1;
1698 else if (i
== 0 && CLASSTYPE_COM_INTERFACE (t
))
1701 ("COM interface type `%T' with non-COM leftmost base class `%T'",
1703 CLASSTYPE_COM_INTERFACE (t
) = 0;
1708 /* Called via dfs_walk from mark_primary_bases. Sets
1709 BINFO_PRIMARY_MARKED_P for BINFO, if appropriate. */
1712 dfs_mark_primary_bases (binfo
, data
)
1718 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (binfo
)))
1721 base_binfo
= get_primary_binfo (binfo
);
1723 if (TREE_VIA_VIRTUAL (base_binfo
))
1729 shared_binfo
= binfo_for_vbase (BINFO_TYPE (base_binfo
), type
);
1731 /* If this virtual base is not already primary somewhere else in
1732 the hiearchy, then we'll be using this copy. */
1733 if (!BINFO_PRIMARY_MARKED_P (shared_binfo
))
1735 /* Make sure the CLASSTYPE_VBASECLASSES list contains the
1736 primary copy; it's the one that really exists. */
1737 if (base_binfo
!= shared_binfo
)
1738 TREE_VALUE (purpose_member (BINFO_TYPE (base_binfo
),
1739 CLASSTYPE_VBASECLASSES (type
)))
1743 base_binfo
= NULL_TREE
;
1747 BINFO_PRIMARY_BASE_OF (base_binfo
) = binfo
;
1752 /* Set BINFO_PRIMARY_MARKED_P for all binfos in the hierarchy
1753 dominated by BINFO that are primary bases. */
1756 mark_primary_bases (type
)
1761 /* Mark the TYPE_BINFO hierarchy. We need to mark primary bases in
1762 pre-order to deal with primary virtual bases. (The virtual base
1763 would be skipped if it were not marked as primary, and that
1764 requires getting to dfs_mark_primary_bases before
1765 dfs_skip_nonprimary_vbases_unmarkedp has a chance to skip the
1767 dfs_walk_real (TYPE_BINFO (type
), dfs_mark_primary_bases
, NULL
,
1768 dfs_skip_nonprimary_vbases_unmarkedp
, type
);
1770 /* Now go through the virtual base classes in inheritance graph
1771 order. Any that are not already primary will need to be
1772 allocated in TYPE, and so we need to mark their primary bases. */
1773 for (vbases
= TYPE_BINFO (type
); vbases
; vbases
= TREE_CHAIN (vbases
))
1777 /* Make sure that only BINFOs appear on this list.
1778 Historically, the TREE_CHAIN was used for other purposes, and
1779 we want to make sure that none of those uses remain. */
1780 my_friendly_assert (TREE_CODE (vbases
) == TREE_VEC
, 20000402);
1782 if (!TREE_VIA_VIRTUAL (vbases
))
1785 vbase
= binfo_for_vbase (BINFO_TYPE (vbases
), type
);
1786 if (BINFO_PRIMARY_MARKED_P (vbase
))
1787 /* This virtual base was already included in the hierarchy, so
1788 there's nothing to do here. */
1791 /* Now, walk its bases. */
1792 dfs_walk_real (vbase
, dfs_mark_primary_bases
, NULL
,
1793 dfs_skip_nonprimary_vbases_unmarkedp
, type
);
1797 /* Make the BINFO the primary base of T. */
1800 set_primary_base (t
, binfo
, vfuns_p
)
1807 CLASSTYPE_PRIMARY_BINFO (t
) = binfo
;
1808 basetype
= BINFO_TYPE (binfo
);
1809 TYPE_BINFO_VTABLE (t
) = TYPE_BINFO_VTABLE (basetype
);
1810 TYPE_BINFO_VIRTUALS (t
) = TYPE_BINFO_VIRTUALS (basetype
);
1811 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1812 CLASSTYPE_RTTI (t
) = CLASSTYPE_RTTI (basetype
);
1813 *vfuns_p
= CLASSTYPE_VSIZE (basetype
);
1816 /* Determine the primary class for T. */
1819 determine_primary_base (t
, vfuns_p
)
1823 int i
, n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
1827 /* If there are no baseclasses, there is certainly no primary base. */
1828 if (n_baseclasses
== 0)
1831 type_binfo
= TYPE_BINFO (t
);
1833 for (i
= 0; i
< n_baseclasses
; i
++)
1835 tree base_binfo
= BINFO_BASETYPE (type_binfo
, i
);
1836 tree basetype
= BINFO_TYPE (base_binfo
);
1838 if (TYPE_CONTAINS_VPTR_P (basetype
))
1840 /* Even a virtual baseclass can contain our RTTI
1841 information. But, we prefer a non-virtual polymorphic
1843 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
1844 CLASSTYPE_RTTI (t
) = CLASSTYPE_RTTI (basetype
);
1846 /* A virtual baseclass can't be the primary base under the
1847 old ABI. And under the new ABI we still prefer a
1848 non-virtual base. */
1849 if (TREE_VIA_VIRTUAL (base_binfo
))
1852 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
1854 set_primary_base (t
, base_binfo
, vfuns_p
);
1855 CLASSTYPE_VFIELDS (t
) = copy_list (CLASSTYPE_VFIELDS (basetype
));
1861 /* Only add unique vfields, and flatten them out as we go. */
1862 for (vfields
= CLASSTYPE_VFIELDS (basetype
);
1864 vfields
= TREE_CHAIN (vfields
))
1865 if (VF_BINFO_VALUE (vfields
) == NULL_TREE
1866 || ! TREE_VIA_VIRTUAL (VF_BINFO_VALUE (vfields
)))
1867 CLASSTYPE_VFIELDS (t
)
1868 = tree_cons (base_binfo
,
1869 VF_BASETYPE_VALUE (vfields
),
1870 CLASSTYPE_VFIELDS (t
));
1872 if (!flag_new_abi
&& *vfuns_p
== 0)
1873 set_primary_base (t
, base_binfo
, vfuns_p
);
1878 if (!TYPE_VFIELD (t
))
1879 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
1881 /* Mark the indirect primary bases. */
1882 for (vbases
= CLASSTYPE_VBASECLASSES (t
);
1884 vbases
= TREE_CHAIN (vbases
))
1886 tree binfo
= TREE_VALUE (vbases
);
1888 /* See if this virtual base is an indirect primary base. If so,
1889 it must be either a primary base or an indirect primary base
1890 in one of the direct bases. */
1891 for (i
= 0; i
< n_baseclasses
; ++i
)
1896 basetype
= TYPE_BINFO_BASETYPE (t
, i
);
1897 for (v
= CLASSTYPE_VBASECLASSES (basetype
);
1901 tree b
= TREE_VALUE (v
);
1902 if ((BINFO_PRIMARY_MARKED_P (b
)
1903 || BINFO_INDIRECT_PRIMARY_P (b
))
1904 && same_type_p (BINFO_TYPE (b
), BINFO_TYPE (binfo
)))
1906 BINFO_INDIRECT_PRIMARY_P (binfo
) = 1;
1911 /* If we've discovered that this virtual base is an indirect
1912 primary base, then we can move on to the next virtual
1914 if (BINFO_INDIRECT_PRIMARY_P (binfo
))
1919 /* The new ABI allows for the use of a "nearly-empty" virtual base
1920 class as the primary base class if no non-virtual polymorphic
1921 base can be found. */
1922 if (flag_new_abi
&& !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
1924 /* If not NULL, this is the best primary base candidate we have
1926 tree candidate
= NULL_TREE
;
1929 /* Loop over the baseclasses. */
1930 for (base_binfo
= TYPE_BINFO (t
);
1932 base_binfo
= TREE_CHAIN (base_binfo
))
1934 tree basetype
= BINFO_TYPE (base_binfo
);
1936 if (TREE_VIA_VIRTUAL (base_binfo
)
1937 && CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1939 /* If this is not an indirect primary base, then it's
1940 definitely our primary base. */
1941 if (!BINFO_INDIRECT_PRIMARY_P (base_binfo
))
1943 candidate
= base_binfo
;
1946 /* If this was an indirect primary base, it's still our
1947 primary base -- unless there's another nearly-empty
1948 virtual base that isn't an indirect primary base. */
1949 else if (!candidate
)
1950 candidate
= base_binfo
;
1954 /* If we've got a primary base, use it. */
1957 set_primary_base (t
, candidate
, vfuns_p
);
1958 CLASSTYPE_VFIELDS (t
)
1959 = copy_list (CLASSTYPE_VFIELDS (BINFO_TYPE (candidate
)));
1963 /* Mark the primary base classes at this point. */
1964 mark_primary_bases (t
);
1967 /* Set memoizing fields and bits of T (and its variants) for later
1971 finish_struct_bits (t
)
1974 int i
, n_baseclasses
= CLASSTYPE_N_BASECLASSES (t
);
1976 /* Fix up variants (if any). */
1977 tree variants
= TYPE_NEXT_VARIANT (t
);
1980 /* These fields are in the _TYPE part of the node, not in
1981 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1982 TYPE_HAS_CONSTRUCTOR (variants
) = TYPE_HAS_CONSTRUCTOR (t
);
1983 TYPE_HAS_DESTRUCTOR (variants
) = TYPE_HAS_DESTRUCTOR (t
);
1984 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1985 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1986 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1988 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (variants
)
1989 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t
);
1990 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1991 TYPE_USES_VIRTUAL_BASECLASSES (variants
) = TYPE_USES_VIRTUAL_BASECLASSES (t
);
1992 /* Copy whatever these are holding today. */
1993 TYPE_MIN_VALUE (variants
) = TYPE_MIN_VALUE (t
);
1994 TYPE_MAX_VALUE (variants
) = TYPE_MAX_VALUE (t
);
1995 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1996 TYPE_SIZE (variants
) = TYPE_SIZE (t
);
1997 TYPE_SIZE_UNIT (variants
) = TYPE_SIZE_UNIT (t
);
1998 variants
= TYPE_NEXT_VARIANT (variants
);
2001 if (n_baseclasses
&& TYPE_POLYMORPHIC_P (t
))
2002 /* For a class w/o baseclasses, `finish_struct' has set
2003 CLASS_TYPE_ABSTRACT_VIRTUALS correctly (by
2004 definition). Similarly for a class whose base classes do not
2005 have vtables. When neither of these is true, we might have
2006 removed abstract virtuals (by providing a definition), added
2007 some (by declaring new ones), or redeclared ones from a base
2008 class. We need to recalculate what's really an abstract virtual
2009 at this point (by looking in the vtables). */
2010 get_pure_virtuals (t
);
2014 /* Notice whether this class has type conversion functions defined. */
2015 tree binfo
= TYPE_BINFO (t
);
2016 tree binfos
= BINFO_BASETYPES (binfo
);
2019 for (i
= n_baseclasses
-1; i
>= 0; i
--)
2021 basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, i
));
2023 TYPE_HAS_CONVERSION (t
) |= TYPE_HAS_CONVERSION (basetype
);
2027 /* If this type has a copy constructor, force its mode to be BLKmode, and
2028 force its TREE_ADDRESSABLE bit to be nonzero. This will cause it to
2029 be passed by invisible reference and prevent it from being returned in
2032 Also do this if the class has BLKmode but can still be returned in
2033 registers, since function_cannot_inline_p won't let us inline
2034 functions returning such a type. This affects the HP-PA. */
2035 if (! TYPE_HAS_TRIVIAL_INIT_REF (t
)
2036 || (TYPE_MODE (t
) == BLKmode
&& ! aggregate_value_p (t
)
2037 && CLASSTYPE_NON_AGGREGATE (t
)))
2040 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
2041 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
2043 TYPE_MODE (variants
) = BLKmode
;
2044 TREE_ADDRESSABLE (variants
) = 1;
2049 /* Issue warnings about T having private constructors, but no friends,
2052 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2053 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2054 non-private static member functions. */
2057 maybe_warn_about_overly_private_class (t
)
2060 int has_member_fn
= 0;
2061 int has_nonprivate_method
= 0;
2064 if (!warn_ctor_dtor_privacy
2065 /* If the class has friends, those entities might create and
2066 access instances, so we should not warn. */
2067 || (CLASSTYPE_FRIEND_CLASSES (t
)
2068 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
2069 /* We will have warned when the template was declared; there's
2070 no need to warn on every instantiation. */
2071 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
2072 /* There's no reason to even consider warning about this
2076 /* We only issue one warning, if more than one applies, because
2077 otherwise, on code like:
2080 // Oops - forgot `public:'
2086 we warn several times about essentially the same problem. */
2088 /* Check to see if all (non-constructor, non-destructor) member
2089 functions are private. (Since there are no friends or
2090 non-private statics, we can't ever call any of the private member
2092 for (fn
= TYPE_METHODS (t
); fn
; fn
= TREE_CHAIN (fn
))
2093 /* We're not interested in compiler-generated methods; they don't
2094 provide any way to call private members. */
2095 if (!DECL_ARTIFICIAL (fn
))
2097 if (!TREE_PRIVATE (fn
))
2099 if (DECL_STATIC_FUNCTION_P (fn
))
2100 /* A non-private static member function is just like a
2101 friend; it can create and invoke private member
2102 functions, and be accessed without a class
2106 has_nonprivate_method
= 1;
2109 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
2113 if (!has_nonprivate_method
&& has_member_fn
)
2115 /* There are no non-private methods, and there's at least one
2116 private member function that isn't a constructor or
2117 destructor. (If all the private members are
2118 constructors/destructors we want to use the code below that
2119 issues error messages specifically referring to
2120 constructors/destructors.) */
2122 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (t
));
2123 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (t
); i
++)
2124 if (TREE_VIA_PUBLIC (TREE_VEC_ELT (binfos
, i
))
2125 || TREE_VIA_PROTECTED (TREE_VEC_ELT (binfos
, i
)))
2127 has_nonprivate_method
= 1;
2130 if (!has_nonprivate_method
)
2132 cp_warning ("all member functions in class `%T' are private", t
);
2137 /* Even if some of the member functions are non-private, the class
2138 won't be useful for much if all the constructors or destructors
2139 are private: such an object can never be created or destroyed. */
2140 if (TYPE_HAS_DESTRUCTOR (t
))
2142 tree dtor
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t
), 1);
2144 if (TREE_PRIVATE (dtor
))
2146 cp_warning ("`%#T' only defines a private destructor and has no friends",
2152 if (TYPE_HAS_CONSTRUCTOR (t
))
2154 int nonprivate_ctor
= 0;
2156 /* If a non-template class does not define a copy
2157 constructor, one is defined for it, enabling it to avoid
2158 this warning. For a template class, this does not
2159 happen, and so we would normally get a warning on:
2161 template <class T> class C { private: C(); };
2163 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
2164 complete non-template or fully instantiated classes have this
2166 if (!TYPE_HAS_INIT_REF (t
))
2167 nonprivate_ctor
= 1;
2169 for (fn
= TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t
), 0);
2173 tree ctor
= OVL_CURRENT (fn
);
2174 /* Ideally, we wouldn't count copy constructors (or, in
2175 fact, any constructor that takes an argument of the
2176 class type as a parameter) because such things cannot
2177 be used to construct an instance of the class unless
2178 you already have one. But, for now at least, we're
2180 if (! TREE_PRIVATE (ctor
))
2182 nonprivate_ctor
= 1;
2187 if (nonprivate_ctor
== 0)
2189 cp_warning ("`%#T' only defines private constructors and has no friends",
2196 /* Function to help qsort sort FIELD_DECLs by name order. */
2199 field_decl_cmp (x
, y
)
2202 if (DECL_NAME (*x
) == DECL_NAME (*y
))
2203 /* A nontype is "greater" than a type. */
2204 return DECL_DECLARES_TYPE_P (*y
) - DECL_DECLARES_TYPE_P (*x
);
2205 if (DECL_NAME (*x
) == NULL_TREE
)
2207 if (DECL_NAME (*y
) == NULL_TREE
)
2209 if (DECL_NAME (*x
) < DECL_NAME (*y
))
2214 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2217 method_name_cmp (m1
, m2
)
2218 const tree
*m1
, *m2
;
2220 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2222 if (*m1
== NULL_TREE
)
2224 if (*m2
== NULL_TREE
)
2226 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2231 /* Warn about duplicate methods in fn_fields. Also compact method
2232 lists so that lookup can be made faster.
2234 Data Structure: List of method lists. The outer list is a
2235 TREE_LIST, whose TREE_PURPOSE field is the field name and the
2236 TREE_VALUE is the DECL_CHAIN of the FUNCTION_DECLs. TREE_CHAIN
2237 links the entire list of methods for TYPE_METHODS. Friends are
2238 chained in the same way as member functions (? TREE_CHAIN or
2239 DECL_CHAIN), but they live in the TREE_TYPE field of the outer
2240 list. That allows them to be quickly deleted, and requires no
2243 Sort methods that are not special (i.e., constructors, destructors,
2244 and type conversion operators) so that we can find them faster in
2248 finish_struct_methods (t
)
2255 if (!TYPE_METHODS (t
))
2257 /* Clear these for safety; perhaps some parsing error could set
2258 these incorrectly. */
2259 TYPE_HAS_CONSTRUCTOR (t
) = 0;
2260 TYPE_HAS_DESTRUCTOR (t
) = 0;
2261 CLASSTYPE_METHOD_VEC (t
) = NULL_TREE
;
2265 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2266 my_friendly_assert (method_vec
!= NULL_TREE
, 19991215);
2267 len
= TREE_VEC_LENGTH (method_vec
);
2269 /* First fill in entry 0 with the constructors, entry 1 with destructors,
2270 and the next few with type conversion operators (if any). */
2271 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2272 fn_fields
= TREE_CHAIN (fn_fields
))
2273 /* Clear out this flag. */
2274 DECL_IN_AGGR_P (fn_fields
) = 0;
2276 if (TYPE_HAS_DESTRUCTOR (t
) && !CLASSTYPE_DESTRUCTORS (t
))
2277 /* We thought there was a destructor, but there wasn't. Some
2278 parse errors cause this anomalous situation. */
2279 TYPE_HAS_DESTRUCTOR (t
) = 0;
2281 /* Issue warnings about private constructors and such. If there are
2282 no methods, then some public defaults are generated. */
2283 maybe_warn_about_overly_private_class (t
);
2285 /* Now sort the methods. */
2286 while (len
> 2 && TREE_VEC_ELT (method_vec
, len
-1) == NULL_TREE
)
2288 TREE_VEC_LENGTH (method_vec
) = len
;
2290 /* The type conversion ops have to live at the front of the vec, so we
2292 for (slot
= 2; slot
< len
; ++slot
)
2294 tree fn
= TREE_VEC_ELT (method_vec
, slot
);
2296 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2300 qsort (&TREE_VEC_ELT (method_vec
, slot
), len
-slot
, sizeof (tree
),
2301 (int (*)(const void *, const void *))method_name_cmp
);
2304 /* Emit error when a duplicate definition of a type is seen. Patch up. */
2307 duplicate_tag_error (t
)
2310 cp_error ("redefinition of `%#T'", t
);
2311 cp_error_at ("previous definition here", t
);
2313 /* Pretend we haven't defined this type. */
2315 /* All of the component_decl's were TREE_CHAINed together in the parser.
2316 finish_struct_methods walks these chains and assembles all methods with
2317 the same base name into DECL_CHAINs. Now we don't need the parser chains
2318 anymore, so we unravel them. */
2320 /* This used to be in finish_struct, but it turns out that the
2321 TREE_CHAIN is used by dbxout_type_methods and perhaps some other
2323 if (CLASSTYPE_METHOD_VEC (t
))
2325 tree method_vec
= CLASSTYPE_METHOD_VEC (t
);
2326 int i
, len
= TREE_VEC_LENGTH (method_vec
);
2327 for (i
= 0; i
< len
; i
++)
2329 tree unchain
= TREE_VEC_ELT (method_vec
, i
);
2330 while (unchain
!= NULL_TREE
)
2332 TREE_CHAIN (OVL_CURRENT (unchain
)) = NULL_TREE
;
2333 unchain
= OVL_NEXT (unchain
);
2338 if (TYPE_LANG_SPECIFIC (t
))
2340 tree binfo
= TYPE_BINFO (t
);
2341 int interface_only
= CLASSTYPE_INTERFACE_ONLY (t
);
2342 int interface_unknown
= CLASSTYPE_INTERFACE_UNKNOWN (t
);
2343 tree template_info
= CLASSTYPE_TEMPLATE_INFO (t
);
2344 int use_template
= CLASSTYPE_USE_TEMPLATE (t
);
2346 bzero ((char *) TYPE_LANG_SPECIFIC (t
), sizeof (struct lang_type
));
2347 BINFO_BASETYPES(binfo
) = NULL_TREE
;
2349 TYPE_BINFO (t
) = binfo
;
2350 CLASSTYPE_INTERFACE_ONLY (t
) = interface_only
;
2351 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t
, interface_unknown
);
2352 TYPE_REDEFINED (t
) = 1;
2353 CLASSTYPE_TEMPLATE_INFO (t
) = template_info
;
2354 CLASSTYPE_USE_TEMPLATE (t
) = use_template
;
2356 TYPE_SIZE (t
) = NULL_TREE
;
2357 TYPE_MODE (t
) = VOIDmode
;
2358 TYPE_FIELDS (t
) = NULL_TREE
;
2359 TYPE_METHODS (t
) = NULL_TREE
;
2360 TYPE_VFIELD (t
) = NULL_TREE
;
2361 TYPE_CONTEXT (t
) = NULL_TREE
;
2362 TYPE_NONCOPIED_PARTS (t
) = NULL_TREE
;
2365 /* Make the BINFO's vtablehave N entries, including RTTI entries,
2366 vbase and vcall offsets, etc. Set its type and call the backend
2370 layout_vtable_decl (binfo
, n
)
2378 itype
= size_int (n
);
2379 atype
= build_cplus_array_type (vtable_entry_type
,
2380 build_index_type (itype
));
2381 layout_type (atype
);
2383 /* We may have to grow the vtable. */
2384 vtable
= get_vtbl_decl_for_binfo (binfo
);
2385 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2387 TREE_TYPE (vtable
) = atype
;
2388 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2389 layout_decl (vtable
, 0);
2391 /* At one time the vtable info was grabbed 2 words at a time. This
2392 fails on Sparc unless you have 8-byte alignment. */
2393 DECL_ALIGN (vtable
) = MAX (TYPE_ALIGN (double_type_node
),
2394 DECL_ALIGN (vtable
));
2398 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2399 have the same signature. */
2402 same_signature_p (fndecl
, base_fndecl
)
2403 tree fndecl
, base_fndecl
;
2405 /* One destructor overrides another if they are the same kind of
2407 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2408 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2410 /* But a non-destructor never overrides a destructor, nor vice
2411 versa, nor do different kinds of destructors override
2412 one-another. For example, a complete object destructor does not
2413 override a deleting destructor. */
2414 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2417 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
))
2419 tree types
, base_types
;
2420 types
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2421 base_types
= TYPE_ARG_TYPES (TREE_TYPE (base_fndecl
));
2422 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types
)))
2423 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types
))))
2424 && compparms (TREE_CHAIN (base_types
), TREE_CHAIN (types
)))
2430 typedef struct find_final_overrider_data_s
{
2431 /* The function for which we are trying to find a final overrider. */
2433 /* The base class in which the function was declared. */
2434 tree declaring_base
;
2435 /* The most derived class in the hierarchy. */
2436 tree most_derived_type
;
2437 /* The final overriding function. */
2439 /* The BINFO for the class in which the final overriding function
2441 tree overriding_base
;
2442 } find_final_overrider_data
;
2444 /* Called from find_final_overrider via dfs_walk. */
2447 dfs_find_final_overrider (binfo
, data
)
2451 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2453 if (same_type_p (BINFO_TYPE (binfo
),
2454 BINFO_TYPE (ffod
->declaring_base
))
2455 && tree_int_cst_equal (BINFO_OFFSET (binfo
),
2456 BINFO_OFFSET (ffod
->declaring_base
)))
2461 /* We haven't found an overrider yet. */
2463 /* We've found a path to the declaring base. Walk down the path
2464 looking for an overrider for FN. */
2465 for (path
= reverse_path (binfo
);
2467 path
= TREE_CHAIN (path
))
2469 for (method
= TYPE_METHODS (BINFO_TYPE (TREE_VALUE (path
)));
2471 method
= TREE_CHAIN (method
))
2472 if (DECL_VIRTUAL_P (method
)
2473 && same_signature_p (method
, ffod
->fn
))
2480 /* If we found an overrider, record the overriding function, and
2481 the base from which it came. */
2486 /* Assume the path is non-virtual. See if there are any
2487 virtual bases from (but not including) the overrider up
2488 to and including the base where the function is
2490 for (base
= TREE_CHAIN (path
); base
; base
= TREE_CHAIN (base
))
2491 if (TREE_VIA_VIRTUAL (TREE_VALUE (base
)))
2493 base
= ffod
->declaring_base
;
2494 while (BINFO_PRIMARY_MARKED_P (base
))
2496 BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P (base
) = 1;
2497 base
= BINFO_INHERITANCE_CHAIN (base
);
2499 BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P (base
) = 1;
2503 if (ffod
->overriding_fn
&& ffod
->overriding_fn
!= method
)
2505 /* We've found a different overrider along a different
2506 path. That can be OK if the new one overrides the
2509 struct S { virtual void f(); };
2510 struct T : public virtual S { virtual void f(); };
2511 struct U : public virtual S, public virtual T {};
2513 Here `T::f' is the final overrider for `S::f'. */
2514 if (strictly_overrides (method
, ffod
->overriding_fn
))
2516 ffod
->overriding_fn
= method
;
2517 ffod
->overriding_base
= TREE_VALUE (path
);
2519 else if (!strictly_overrides (ffod
->overriding_fn
, method
))
2521 cp_error ("no unique final overrider for `%D' in `%T'",
2522 ffod
->most_derived_type
,
2524 cp_error ("candidates are: `%#D'", ffod
->overriding_fn
);
2525 cp_error (" `%#D'", method
);
2526 return error_mark_node
;
2529 else if (ffod
->overriding_base
2530 && (!tree_int_cst_equal
2531 (BINFO_OFFSET (TREE_VALUE (path
)),
2532 BINFO_OFFSET (ffod
->overriding_base
))))
2534 /* We've found two instances of the same base that
2535 provide overriders. */
2536 cp_error ("no unique final overrider for `%D' since there two instances of `%T' in `%T'",
2538 BINFO_TYPE (ffod
->overriding_base
),
2539 ffod
->most_derived_type
);
2540 return error_mark_node
;
2544 ffod
->overriding_fn
= method
;
2545 ffod
->overriding_base
= TREE_VALUE (path
);
2553 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2554 FN and whose TREE_VALUE is the binfo for the base where the
2555 overriding occurs. BINFO (in the hierarchy dominated by T) is the
2556 base object in which FN is declared. */
2559 find_final_overrider (t
, binfo
, fn
)
2564 find_final_overrider_data ffod
;
2566 /* Getting this right is a little tricky. This is legal:
2568 struct S { virtual void f (); };
2569 struct T { virtual void f (); };
2570 struct U : public S, public T { };
2572 even though calling `f' in `U' is ambiguous. But,
2574 struct R { virtual void f(); };
2575 struct S : virtual public R { virtual void f (); };
2576 struct T : virtual public R { virtual void f (); };
2577 struct U : public S, public T { };
2579 is not -- there's no way to decide whether to put `S::f' or
2580 `T::f' in the vtable for `R'.
2582 The solution is to look at all paths to BINFO. If we find
2583 different overriders along any two, then there is a problem. */
2585 ffod
.declaring_base
= binfo
;
2586 ffod
.most_derived_type
= t
;
2587 ffod
.overriding_fn
= NULL_TREE
;
2588 ffod
.overriding_base
= NULL_TREE
;
2590 if (dfs_walk (TYPE_BINFO (t
),
2591 dfs_find_final_overrider
,
2594 return error_mark_node
;
2596 return build_tree_list (ffod
.overriding_fn
, ffod
.overriding_base
);
2599 /* Update a entry in the vtable for BINFO, which is in the hierarchy
2600 dominated by T. FN has been overridden in BINFO; VIRTUALS points
2601 to the corresponding position in the BINFO_VIRTUALS list. */
2604 update_vtable_entry_for_fn (t
, binfo
, fn
, virtuals
)
2614 int generate_thunk_with_vtable_p
;
2616 /* Find the function which originally caused this vtable
2617 entry to be present. */
2624 primary_base
= get_primary_binfo (b
);
2628 for (f
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (primary_base
)));
2631 if (same_signature_p (BV_FN (f
), fn
))
2641 /* Find the final overrider. */
2642 overrider
= find_final_overrider (t
, b
, fn
);
2643 if (overrider
== error_mark_node
)
2646 /* Compute the constant adjustment to the `this' pointer. The
2647 `this' pointer, when this function is called, will point at the
2648 class whose vtable this is. */
2649 delta
= size_binop (PLUS_EXPR
,
2650 get_derived_offset (binfo
,
2651 DECL_VIRTUAL_CONTEXT (fn
)),
2652 BINFO_OFFSET (binfo
));
2654 /* Assume that we will produce a thunk that convert all the way to
2655 the final overrider, and not to an intermediate virtual base. */
2656 virtual_base
= NULL_TREE
;
2658 /* Assume that we will always generate thunks with the vtables that
2660 generate_thunk_with_vtable_p
= 1;
2662 /* Under the new ABI, we will convert to an intermediate virtual
2663 base first, and then use the vcall offset located there to finish
2669 /* If we find BINFO, then the final overrider is in a class
2670 derived from BINFO, so the thunks can be generated with
2671 the final overrider. */
2673 && same_type_p (BINFO_TYPE (b
), BINFO_TYPE (binfo
)))
2674 generate_thunk_with_vtable_p
= 0;
2676 /* If we find the final overrider, then we can stop
2678 if (same_type_p (BINFO_TYPE (b
),
2679 BINFO_TYPE (TREE_VALUE (overrider
))))
2682 /* If we find a virtual base, and we haven't yet found the
2683 overrider, then there is a virtual base between the
2684 declaring base and the final overrider. */
2685 if (!virtual_base
&& TREE_VIA_VIRTUAL (b
))
2687 generate_thunk_with_vtable_p
= 1;
2691 b
= BINFO_INHERITANCE_CHAIN (b
);
2695 virtual_base
= NULL_TREE
;
2698 /* The `this' pointer needs to be adjusted to the nearest virtual
2700 delta
= size_diffop (BINFO_OFFSET (virtual_base
), delta
);
2702 /* The `this' pointer needs to be adjusted from pointing to
2703 BINFO to pointing at the base where the final overrider
2705 delta
= size_diffop (BINFO_OFFSET (TREE_VALUE (overrider
)), delta
);
2707 modify_vtable_entry (t
,
2709 TREE_PURPOSE (overrider
),
2714 BV_USE_VCALL_INDEX_P (*virtuals
) = 1;
2715 if (generate_thunk_with_vtable_p
)
2716 BV_GENERATE_THUNK_WITH_VTABLE_P (*virtuals
) = 1;
2719 /* Called from modify_all_vtables via dfs_walk. */
2722 dfs_modify_vtables (binfo
, data
)
2726 if (/* There's no need to modify the vtable for a primary base;
2727 we're not going to use that vtable anyhow. */
2728 !BINFO_PRIMARY_MARKED_P (binfo
)
2729 /* Similarly, a base without a vtable needs no modification. */
2730 && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo
)))
2738 /* If we're supporting RTTI then we always need a new vtable to
2739 point to the RTTI information. Under the new ABI we may need
2740 a new vtable to contain vcall and vbase offsets. */
2741 if (flag_rtti
|| flag_new_abi
)
2742 make_new_vtable (t
, binfo
);
2744 /* Now, go through each of the virtual functions in the virtual
2745 function table for BINFO. Find the final overrider, and
2746 update the BINFO_VIRTUALS list appropriately. */
2747 for (virtuals
= BINFO_VIRTUALS (binfo
),
2748 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2750 virtuals
= TREE_CHAIN (virtuals
),
2751 old_virtuals
= TREE_CHAIN (old_virtuals
))
2752 update_vtable_entry_for_fn (t
,
2754 BV_FN (old_virtuals
),
2758 SET_BINFO_MARKED (binfo
);
2763 /* Update all of the primary and secondary vtables for T. Create new
2764 vtables as required, and initialize their RTTI information. Each
2765 of the functions in OVERRIDDEN_VIRTUALS overrides a virtual
2766 function from a base class; find and modify the appropriate entries
2767 to point to the overriding functions. Returns a list, in
2768 declaration order, of the functions that are overridden in this
2769 class, but do not appear in the primary base class vtable, and
2770 which should therefore be appended to the end of the vtable for T. */
2773 modify_all_vtables (t
, vfuns_p
, overridden_virtuals
)
2776 tree overridden_virtuals
;
2780 binfo
= TYPE_BINFO (t
);
2782 /* Update all of the vtables. */
2785 dfs_unmarked_real_bases_queue_p
,
2787 dfs_walk (binfo
, dfs_unmark
, dfs_marked_real_bases_queue_p
, t
);
2789 /* If we should include overriding functions for secondary vtables
2790 in our primary vtable, add them now. */
2791 if (all_overridden_vfuns_in_vtables_p ())
2793 tree
*fnsp
= &overridden_virtuals
;
2797 tree fn
= TREE_VALUE (*fnsp
);
2799 if (!BINFO_VIRTUALS (binfo
)
2800 || !value_member (fn
, BINFO_VIRTUALS (binfo
)))
2802 /* Set the vtable index. */
2803 set_vindex (t
, fn
, vfuns_p
);
2804 /* We don't need to convert to a base class when calling
2806 DECL_VIRTUAL_CONTEXT (fn
) = t
;
2808 /* We don't need to adjust the `this' pointer when
2809 calling this function. */
2810 BV_DELTA (*fnsp
) = integer_zero_node
;
2811 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2813 /* This is an overridden function not already in our
2815 fnsp
= &TREE_CHAIN (*fnsp
);
2818 /* We've already got an entry for this function. Skip
2820 *fnsp
= TREE_CHAIN (*fnsp
);
2824 overridden_virtuals
= NULL_TREE
;
2826 return overridden_virtuals
;
2829 /* Here, we already know that they match in every respect.
2830 All we have to check is where they had their declarations. */
2833 strictly_overrides (fndecl1
, fndecl2
)
2834 tree fndecl1
, fndecl2
;
2836 int distance
= get_base_distance (DECL_CONTEXT (fndecl2
),
2837 DECL_CONTEXT (fndecl1
),
2839 if (distance
== -2 || distance
> 0)
2844 /* Get the base virtual function declarations in T that are either
2845 overridden or hidden by FNDECL as a list. We set TREE_PURPOSE with
2846 the overrider/hider. */
2849 get_basefndecls (fndecl
, t
)
2852 tree methods
= TYPE_METHODS (t
);
2853 tree base_fndecls
= NULL_TREE
;
2854 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (t
));
2855 int i
, n_baseclasses
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2859 if (TREE_CODE (methods
) == FUNCTION_DECL
2860 && DECL_VINDEX (methods
) != NULL_TREE
2861 && DECL_NAME (fndecl
) == DECL_NAME (methods
))
2862 base_fndecls
= tree_cons (fndecl
, methods
, base_fndecls
);
2864 methods
= TREE_CHAIN (methods
);
2868 return base_fndecls
;
2870 for (i
= 0; i
< n_baseclasses
; i
++)
2872 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2873 tree basetype
= BINFO_TYPE (base_binfo
);
2875 base_fndecls
= chainon (get_basefndecls (fndecl
, basetype
),
2879 return base_fndecls
;
2882 /* Mark the functions that have been hidden with their overriders.
2883 Since we start out with all functions already marked with a hider,
2884 no need to mark functions that are just hidden.
2886 Subroutine of warn_hidden. */
2889 mark_overriders (fndecl
, base_fndecls
)
2890 tree fndecl
, base_fndecls
;
2892 for (; base_fndecls
; base_fndecls
= TREE_CHAIN (base_fndecls
))
2893 if (same_signature_p (fndecl
, TREE_VALUE (base_fndecls
)))
2894 TREE_PURPOSE (base_fndecls
) = fndecl
;
2897 /* If this declaration supersedes the declaration of
2898 a method declared virtual in the base class, then
2899 mark this field as being virtual as well. */
2902 check_for_override (decl
, ctype
)
2905 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (ctype
));
2906 int i
, n_baselinks
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2907 int virtualp
= DECL_VIRTUAL_P (decl
);
2908 int found_overriden_fn
= 0;
2910 for (i
= 0; i
< n_baselinks
; i
++)
2912 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2913 if (TYPE_POLYMORPHIC_P (BINFO_TYPE (base_binfo
)))
2915 tree tmp
= get_matching_virtual
2916 (base_binfo
, decl
, DECL_DESTRUCTOR_P (decl
));
2918 if (tmp
&& !found_overriden_fn
)
2920 /* If this function overrides some virtual in some base
2921 class, then the function itself is also necessarily
2922 virtual, even if the user didn't explicitly say so. */
2923 DECL_VIRTUAL_P (decl
) = 1;
2925 /* The TMP we really want is the one from the deepest
2926 baseclass on this path, taking care not to
2927 duplicate if we have already found it (via another
2928 path to its virtual baseclass. */
2929 if (TREE_CODE (TREE_TYPE (decl
)) == FUNCTION_TYPE
)
2931 cp_error_at ("`static %#D' cannot be declared", decl
);
2932 cp_error_at (" since `virtual %#D' declared in base class",
2938 /* Set DECL_VINDEX to a value that is neither an
2939 INTEGER_CST nor the error_mark_node so that
2940 add_virtual_function will realize this is an
2941 overridden function. */
2943 = tree_cons (tmp
, NULL_TREE
, DECL_VINDEX (decl
));
2945 /* We now know that DECL overrides something,
2946 which is all that is important. But, we must
2947 continue to iterate through all the base-classes
2948 in order to allow get_matching_virtual to check for
2949 various illegal overrides. */
2950 found_overriden_fn
= 1;
2956 if (DECL_VINDEX (decl
) == NULL_TREE
)
2957 DECL_VINDEX (decl
) = error_mark_node
;
2958 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2962 /* Warn about hidden virtual functions that are not overridden in t.
2963 We know that constructors and destructors don't apply. */
2969 tree method_vec
= CLASSTYPE_METHOD_VEC (t
);
2970 int n_methods
= method_vec
? TREE_VEC_LENGTH (method_vec
) : 0;
2973 /* We go through each separately named virtual function. */
2974 for (i
= 2; i
< n_methods
&& TREE_VEC_ELT (method_vec
, i
); ++i
)
2976 tree fns
= TREE_VEC_ELT (method_vec
, i
);
2977 tree fndecl
= NULL_TREE
;
2979 tree base_fndecls
= NULL_TREE
;
2980 tree binfos
= BINFO_BASETYPES (TYPE_BINFO (t
));
2981 int i
, n_baseclasses
= binfos
? TREE_VEC_LENGTH (binfos
) : 0;
2983 /* First see if we have any virtual functions in this batch. */
2984 for (; fns
; fns
= OVL_NEXT (fns
))
2986 fndecl
= OVL_CURRENT (fns
);
2987 if (DECL_VINDEX (fndecl
))
2991 if (fns
== NULL_TREE
)
2994 /* First we get a list of all possible functions that might be
2995 hidden from each base class. */
2996 for (i
= 0; i
< n_baseclasses
; i
++)
2998 tree base_binfo
= TREE_VEC_ELT (binfos
, i
);
2999 tree basetype
= BINFO_TYPE (base_binfo
);
3001 base_fndecls
= chainon (get_basefndecls (fndecl
, basetype
),
3005 fns
= OVL_NEXT (fns
);
3007 /* ...then mark up all the base functions with overriders, preferring
3008 overriders to hiders. */
3010 for (; fns
; fns
= OVL_NEXT (fns
))
3012 fndecl
= OVL_CURRENT (fns
);
3013 if (DECL_VINDEX (fndecl
))
3014 mark_overriders (fndecl
, base_fndecls
);
3017 /* Now give a warning for all base functions without overriders,
3018 as they are hidden. */
3019 for (; base_fndecls
; base_fndecls
= TREE_CHAIN (base_fndecls
))
3020 if (!same_signature_p (TREE_PURPOSE (base_fndecls
),
3021 TREE_VALUE (base_fndecls
)))
3023 /* Here we know it is a hider, and no overrider exists. */
3024 cp_warning_at ("`%D' was hidden", TREE_VALUE (base_fndecls
));
3025 cp_warning_at (" by `%D'", TREE_PURPOSE (base_fndecls
));
3030 /* Check for things that are invalid. There are probably plenty of other
3031 things we should check for also. */
3034 finish_struct_anon (t
)
3039 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
3041 if (TREE_STATIC (field
))
3043 if (TREE_CODE (field
) != FIELD_DECL
)
3046 if (DECL_NAME (field
) == NULL_TREE
3047 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
3049 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
3050 for (; elt
; elt
= TREE_CHAIN (elt
))
3052 if (DECL_ARTIFICIAL (elt
))
3055 if (DECL_NAME (elt
) == constructor_name (t
))
3056 cp_pedwarn_at ("ISO C++ forbids member `%D' with same name as enclosing class",
3059 if (TREE_CODE (elt
) != FIELD_DECL
)
3061 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
3066 if (TREE_PRIVATE (elt
))
3067 cp_pedwarn_at ("private member `%#D' in anonymous union",
3069 else if (TREE_PROTECTED (elt
))
3070 cp_pedwarn_at ("protected member `%#D' in anonymous union",
3073 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
3074 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
3080 /* Create default constructors, assignment operators, and so forth for
3081 the type indicated by T, if they are needed.
3082 CANT_HAVE_DEFAULT_CTOR, CANT_HAVE_CONST_CTOR, and
3083 CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, the
3084 class cannot have a default constructor, copy constructor taking a
3085 const reference argument, or an assignment operator taking a const
3086 reference, respectively. If a virtual destructor is created, its
3087 DECL is returned; otherwise the return value is NULL_TREE. */
3090 add_implicitly_declared_members (t
, cant_have_default_ctor
,
3091 cant_have_const_cctor
,
3092 cant_have_const_assignment
)
3094 int cant_have_default_ctor
;
3095 int cant_have_const_cctor
;
3096 int cant_have_const_assignment
;
3099 tree implicit_fns
= NULL_TREE
;
3100 tree virtual_dtor
= NULL_TREE
;
3104 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) && !TYPE_HAS_DESTRUCTOR (t
))
3106 default_fn
= implicitly_declare_fn (sfk_destructor
, t
, /*const_p=*/0);
3107 check_for_override (default_fn
, t
);
3109 /* If we couldn't make it work, then pretend we didn't need it. */
3110 if (default_fn
== void_type_node
)
3111 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 0;
3114 TREE_CHAIN (default_fn
) = implicit_fns
;
3115 implicit_fns
= default_fn
;
3117 if (DECL_VINDEX (default_fn
))
3118 virtual_dtor
= default_fn
;
3122 /* Any non-implicit destructor is non-trivial. */
3123 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) |= TYPE_HAS_DESTRUCTOR (t
);
3125 /* Default constructor. */
3126 if (! TYPE_HAS_CONSTRUCTOR (t
) && ! cant_have_default_ctor
)
3128 default_fn
= implicitly_declare_fn (sfk_constructor
, t
, /*const_p=*/0);
3129 TREE_CHAIN (default_fn
) = implicit_fns
;
3130 implicit_fns
= default_fn
;
3133 /* Copy constructor. */
3134 if (! TYPE_HAS_INIT_REF (t
) && ! TYPE_FOR_JAVA (t
))
3136 /* ARM 12.18: You get either X(X&) or X(const X&), but
3139 = implicitly_declare_fn (sfk_copy_constructor
, t
,
3140 /*const_p=*/!cant_have_const_cctor
);
3141 TREE_CHAIN (default_fn
) = implicit_fns
;
3142 implicit_fns
= default_fn
;
3145 /* Assignment operator. */
3146 if (! TYPE_HAS_ASSIGN_REF (t
) && ! TYPE_FOR_JAVA (t
))
3149 = implicitly_declare_fn (sfk_assignment_operator
, t
,
3150 /*const_p=*/!cant_have_const_assignment
);
3151 TREE_CHAIN (default_fn
) = implicit_fns
;
3152 implicit_fns
= default_fn
;
3155 /* Now, hook all of the new functions on to TYPE_METHODS,
3156 and add them to the CLASSTYPE_METHOD_VEC. */
3157 for (f
= &implicit_fns
; *f
; f
= &TREE_CHAIN (*f
))
3158 add_method (t
, *f
, /*error_p=*/0);
3159 *f
= TYPE_METHODS (t
);
3160 TYPE_METHODS (t
) = implicit_fns
;
3162 return virtual_dtor
;
3165 /* Subroutine of finish_struct_1. Recursively count the number of fields
3166 in TYPE, including anonymous union members. */
3169 count_fields (fields
)
3174 for (x
= fields
; x
; x
= TREE_CHAIN (x
))
3176 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3177 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3184 /* Subroutine of finish_struct_1. Recursively add all the fields in the
3185 TREE_LIST FIELDS to the TREE_VEC FIELD_VEC, starting at offset IDX. */
3188 add_fields_to_vec (fields
, field_vec
, idx
)
3189 tree fields
, field_vec
;
3193 for (x
= fields
; x
; x
= TREE_CHAIN (x
))
3195 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3196 idx
= add_fields_to_vec (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3198 TREE_VEC_ELT (field_vec
, idx
++) = x
;
3203 /* FIELD is a bit-field. We are finishing the processing for its
3204 enclosing type. Issue any appropriate messages and set appropriate
3208 check_bitfield_decl (field
)
3211 tree type
= TREE_TYPE (field
);
3214 /* Detect invalid bit-field type. */
3215 if (DECL_INITIAL (field
)
3216 && ! INTEGRAL_TYPE_P (TREE_TYPE (field
)))
3218 cp_error_at ("bit-field `%#D' with non-integral type", field
);
3219 w
= error_mark_node
;
3222 /* Detect and ignore out of range field width. */
3223 if (DECL_INITIAL (field
))
3225 w
= DECL_INITIAL (field
);
3227 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3230 /* detect invalid field size. */
3231 if (TREE_CODE (w
) == CONST_DECL
)
3232 w
= DECL_INITIAL (w
);
3234 w
= decl_constant_value (w
);
3236 if (TREE_CODE (w
) != INTEGER_CST
)
3238 cp_error_at ("bit-field `%D' width not an integer constant",
3240 w
= error_mark_node
;
3242 else if (tree_int_cst_sgn (w
) < 0)
3244 cp_error_at ("negative width in bit-field `%D'", field
);
3245 w
= error_mark_node
;
3247 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3249 cp_error_at ("zero width for bit-field `%D'", field
);
3250 w
= error_mark_node
;
3252 else if (compare_tree_int (w
, TYPE_PRECISION (type
)) > 0
3253 && TREE_CODE (type
) != ENUMERAL_TYPE
3254 && TREE_CODE (type
) != BOOLEAN_TYPE
)
3255 cp_warning_at ("width of `%D' exceeds its type", field
);
3256 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3257 && (0 > compare_tree_int (w
,
3258 min_precision (TYPE_MIN_VALUE (type
),
3259 TREE_UNSIGNED (type
)))
3260 || 0 > compare_tree_int (w
,
3262 (TYPE_MAX_VALUE (type
),
3263 TREE_UNSIGNED (type
)))))
3264 cp_warning_at ("`%D' is too small to hold all values of `%#T'",
3268 /* Remove the bit-field width indicator so that the rest of the
3269 compiler does not treat that value as an initializer. */
3270 DECL_INITIAL (field
) = NULL_TREE
;
3272 if (w
!= error_mark_node
)
3274 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3275 DECL_BIT_FIELD (field
) = 1;
3277 if (integer_zerop (w
))
3279 #ifdef EMPTY_FIELD_BOUNDARY
3280 DECL_ALIGN (field
) = MAX (DECL_ALIGN (field
),
3281 EMPTY_FIELD_BOUNDARY
);
3283 #ifdef PCC_BITFIELD_TYPE_MATTERS
3284 if (PCC_BITFIELD_TYPE_MATTERS
)
3286 DECL_ALIGN (field
) = MAX (DECL_ALIGN (field
),
3288 DECL_USER_ALIGN (field
) |= TYPE_USER_ALIGN (type
);
3295 /* Non-bit-fields are aligned for their type. */
3296 DECL_BIT_FIELD (field
) = 0;
3297 CLEAR_DECL_C_BIT_FIELD (field
);
3298 DECL_ALIGN (field
) = MAX (DECL_ALIGN (field
), TYPE_ALIGN (type
));
3299 DECL_USER_ALIGN (field
) |= TYPE_USER_ALIGN (type
);
3303 /* FIELD is a non bit-field. We are finishing the processing for its
3304 enclosing type T. Issue any appropriate messages and set appropriate
3308 check_field_decl (field
, t
, cant_have_const_ctor
,
3309 cant_have_default_ctor
, no_const_asn_ref
,
3310 any_default_members
)
3313 int *cant_have_const_ctor
;
3314 int *cant_have_default_ctor
;
3315 int *no_const_asn_ref
;
3316 int *any_default_members
;
3318 tree type
= strip_array_types (TREE_TYPE (field
));
3320 /* An anonymous union cannot contain any fields which would change
3321 the settings of CANT_HAVE_CONST_CTOR and friends. */
3322 if (ANON_UNION_TYPE_P (type
))
3324 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
3325 structs. So, we recurse through their fields here. */
3326 else if (ANON_AGGR_TYPE_P (type
))
3330 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
3331 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3332 check_field_decl (fields
, t
, cant_have_const_ctor
,
3333 cant_have_default_ctor
, no_const_asn_ref
,
3334 any_default_members
);
3336 /* Check members with class type for constructors, destructors,
3338 else if (CLASS_TYPE_P (type
))
3340 /* Never let anything with uninheritable virtuals
3341 make it through without complaint. */
3342 abstract_virtuals_error (field
, type
);
3344 if (TREE_CODE (t
) == UNION_TYPE
)
3346 if (TYPE_NEEDS_CONSTRUCTING (type
))
3347 cp_error_at ("member `%#D' with constructor not allowed in union",
3349 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3350 cp_error_at ("member `%#D' with destructor not allowed in union",
3352 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
3353 cp_error_at ("member `%#D' with copy assignment operator not allowed in union",
3358 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3359 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3360 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3361 TYPE_HAS_COMPLEX_ASSIGN_REF (t
) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type
);
3362 TYPE_HAS_COMPLEX_INIT_REF (t
) |= TYPE_HAS_COMPLEX_INIT_REF (type
);
3365 if (!TYPE_HAS_CONST_INIT_REF (type
))
3366 *cant_have_const_ctor
= 1;
3368 if (!TYPE_HAS_CONST_ASSIGN_REF (type
))
3369 *no_const_asn_ref
= 1;
3371 if (TYPE_HAS_CONSTRUCTOR (type
)
3372 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type
))
3373 *cant_have_default_ctor
= 1;
3375 if (DECL_INITIAL (field
) != NULL_TREE
)
3377 /* `build_class_init_list' does not recognize
3379 if (TREE_CODE (t
) == UNION_TYPE
&& any_default_members
!= 0)
3380 cp_error_at ("multiple fields in union `%T' initialized");
3381 *any_default_members
= 1;
3384 /* Non-bit-fields are aligned for their type, except packed fields
3385 which require only BITS_PER_UNIT alignment. */
3386 DECL_ALIGN (field
) = MAX (DECL_ALIGN (field
),
3387 (DECL_PACKED (field
)
3389 : TYPE_ALIGN (TREE_TYPE (field
))));
3390 if (! DECL_PACKED (field
))
3391 DECL_USER_ALIGN (field
) |= TYPE_USER_ALIGN (TREE_TYPE (field
));
3394 /* Check the data members (both static and non-static), class-scoped
3395 typedefs, etc., appearing in the declaration of T. Issue
3396 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3397 declaration order) of access declarations; each TREE_VALUE in this
3398 list is a USING_DECL.
3400 In addition, set the following flags:
3403 The class is empty, i.e., contains no non-static data members.
3405 CANT_HAVE_DEFAULT_CTOR_P
3406 This class cannot have an implicitly generated default
3409 CANT_HAVE_CONST_CTOR_P
3410 This class cannot have an implicitly generated copy constructor
3411 taking a const reference.
3413 CANT_HAVE_CONST_ASN_REF
3414 This class cannot have an implicitly generated assignment
3415 operator taking a const reference.
3417 All of these flags should be initialized before calling this
3420 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3421 fields can be added by adding to this chain. */
3424 check_field_decls (t
, access_decls
, empty_p
,
3425 cant_have_default_ctor_p
, cant_have_const_ctor_p
,
3430 int *cant_have_default_ctor_p
;
3431 int *cant_have_const_ctor_p
;
3432 int *no_const_asn_ref_p
;
3437 int any_default_members
;
3439 /* First, delete any duplicate fields. */
3440 delete_duplicate_fields (TYPE_FIELDS (t
));
3442 /* Assume there are no access declarations. */
3443 *access_decls
= NULL_TREE
;
3444 /* Assume this class has no pointer members. */
3446 /* Assume none of the members of this class have default
3448 any_default_members
= 0;
3450 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3453 tree type
= TREE_TYPE (x
);
3455 GNU_xref_member (current_class_name
, x
);
3457 next
= &TREE_CHAIN (x
);
3459 if (TREE_CODE (x
) == FIELD_DECL
)
3461 DECL_PACKED (x
) |= TYPE_PACKED (t
);
3463 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3464 /* We don't treat zero-width bitfields as making a class
3469 /* The class is non-empty. */
3471 /* The class is not even nearly empty. */
3472 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3476 if (TREE_CODE (x
) == USING_DECL
)
3478 /* Prune the access declaration from the list of fields. */
3479 *field
= TREE_CHAIN (x
);
3481 /* Save the access declarations for our caller. */
3482 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3484 /* Since we've reset *FIELD there's no reason to skip to the
3490 if (TREE_CODE (x
) == TYPE_DECL
3491 || TREE_CODE (x
) == TEMPLATE_DECL
)
3494 /* If we've gotten this far, it's a data member, possibly static,
3495 or an enumerator. */
3497 DECL_CONTEXT (x
) = t
;
3499 /* ``A local class cannot have static data members.'' ARM 9.4 */
3500 if (current_function_decl
&& TREE_STATIC (x
))
3501 cp_error_at ("field `%D' in local class cannot be static", x
);
3503 /* Perform error checking that did not get done in
3505 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3507 cp_error_at ("field `%D' invalidly declared function type",
3509 type
= build_pointer_type (type
);
3510 TREE_TYPE (x
) = type
;
3512 else if (TREE_CODE (type
) == METHOD_TYPE
)
3514 cp_error_at ("field `%D' invalidly declared method type", x
);
3515 type
= build_pointer_type (type
);
3516 TREE_TYPE (x
) = type
;
3518 else if (TREE_CODE (type
) == OFFSET_TYPE
)
3520 cp_error_at ("field `%D' invalidly declared offset type", x
);
3521 type
= build_pointer_type (type
);
3522 TREE_TYPE (x
) = type
;
3525 if (type
== error_mark_node
)
3528 /* When this goes into scope, it will be a non-local reference. */
3529 DECL_NONLOCAL (x
) = 1;
3531 if (TREE_CODE (x
) == CONST_DECL
)
3534 if (TREE_CODE (x
) == VAR_DECL
)
3536 if (TREE_CODE (t
) == UNION_TYPE
)
3537 /* Unions cannot have static members. */
3538 cp_error_at ("field `%D' declared static in union", x
);
3543 /* Now it can only be a FIELD_DECL. */
3545 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3546 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3548 /* If this is of reference type, check if it needs an init.
3549 Also do a little ANSI jig if necessary. */
3550 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3552 CLASSTYPE_NON_POD_P (t
) = 1;
3553 if (DECL_INITIAL (x
) == NULL_TREE
)
3554 CLASSTYPE_REF_FIELDS_NEED_INIT (t
) = 1;
3556 /* ARM $12.6.2: [A member initializer list] (or, for an
3557 aggregate, initialization by a brace-enclosed list) is the
3558 only way to initialize nonstatic const and reference
3560 *cant_have_default_ctor_p
= 1;
3561 TYPE_HAS_COMPLEX_ASSIGN_REF (t
) = 1;
3563 if (! TYPE_HAS_CONSTRUCTOR (t
) && extra_warnings
)
3566 cp_warning_at ("non-static reference `%#D' in class without a constructor", x
);
3568 cp_warning_at ("non-static reference in class without a constructor", x
);
3572 type
= strip_array_types (type
);
3574 if (TREE_CODE (type
) == POINTER_TYPE
)
3577 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3578 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3580 if (! pod_type_p (type
)
3581 /* For some reason, pointers to members are POD types themselves,
3582 but are not allowed in POD structs. Silly. */
3583 || TYPE_PTRMEM_P (type
) || TYPE_PTRMEMFUNC_P (type
))
3584 CLASSTYPE_NON_POD_P (t
) = 1;
3586 /* If any field is const, the structure type is pseudo-const. */
3587 if (CP_TYPE_CONST_P (type
))
3589 C_TYPE_FIELDS_READONLY (t
) = 1;
3590 if (DECL_INITIAL (x
) == NULL_TREE
)
3591 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
) = 1;
3593 /* ARM $12.6.2: [A member initializer list] (or, for an
3594 aggregate, initialization by a brace-enclosed list) is the
3595 only way to initialize nonstatic const and reference
3597 *cant_have_default_ctor_p
= 1;
3598 TYPE_HAS_COMPLEX_ASSIGN_REF (t
) = 1;
3600 if (! TYPE_HAS_CONSTRUCTOR (t
) && extra_warnings
)
3603 cp_warning_at ("non-static const member `%#D' in class without a constructor", x
);
3605 cp_warning_at ("non-static const member in class without a constructor", x
);
3608 /* A field that is pseudo-const makes the structure likewise. */
3609 else if (IS_AGGR_TYPE (type
))
3611 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3612 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3613 |= CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
);
3616 /* Core issue 80: A nonstatic data member is required to have a
3617 different name from the class iff the class has a
3618 user-defined constructor. */
3619 if (DECL_NAME (x
) == constructor_name (t
)
3620 && TYPE_HAS_CONSTRUCTOR (t
))
3621 cp_pedwarn_at ("field `%#D' with same name as class", x
);
3623 /* We set DECL_C_BIT_FIELD in grokbitfield.
3624 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3625 if (DECL_C_BIT_FIELD (x
))
3626 check_bitfield_decl (x
);
3628 check_field_decl (x
, t
,
3629 cant_have_const_ctor_p
,
3630 cant_have_default_ctor_p
,
3632 &any_default_members
);
3635 /* Effective C++ rule 11. */
3636 if (has_pointers
&& warn_ecpp
&& TYPE_HAS_CONSTRUCTOR (t
)
3637 && ! (TYPE_HAS_INIT_REF (t
) && TYPE_HAS_ASSIGN_REF (t
)))
3639 cp_warning ("`%#T' has pointer data members", t
);
3641 if (! TYPE_HAS_INIT_REF (t
))
3643 cp_warning (" but does not override `%T(const %T&)'", t
, t
);
3644 if (! TYPE_HAS_ASSIGN_REF (t
))
3645 cp_warning (" or `operator=(const %T&)'", t
);
3647 else if (! TYPE_HAS_ASSIGN_REF (t
))
3648 cp_warning (" but does not override `operator=(const %T&)'", t
);
3652 /* Check anonymous struct/anonymous union fields. */
3653 finish_struct_anon (t
);
3655 /* We've built up the list of access declarations in reverse order.
3657 *access_decls
= nreverse (*access_decls
);
3660 /* Return a FIELD_DECL for a pointer-to-virtual-table or
3661 pointer-to-virtual-base. The NAME, ASSEMBLER_NAME, and TYPE of the
3662 field are as indicated. The CLASS_TYPE in which this field occurs
3663 is also indicated. FCONTEXT is the type that is needed for the debug
3664 info output routines. *EMPTY_P is set to a non-zero value by this
3665 function to indicate that a class containing this field is
3669 build_vtbl_or_vbase_field (name
, assembler_name
, type
, class_type
, fcontext
,
3672 tree assembler_name
;
3680 /* This class is non-empty. */
3683 /* Build the FIELD_DECL. */
3684 field
= build_decl (FIELD_DECL
, name
, type
);
3685 DECL_ASSEMBLER_NAME (field
) = assembler_name
;
3686 DECL_VIRTUAL_P (field
) = 1;
3687 DECL_ARTIFICIAL (field
) = 1;
3688 DECL_FIELD_CONTEXT (field
) = class_type
;
3689 DECL_FCONTEXT (field
) = fcontext
;
3690 DECL_ALIGN (field
) = TYPE_ALIGN (type
);
3691 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (type
);
3697 /* Record the type of BINFO in the slot in DATA (which is really a
3698 `varray_type *') corresponding to the BINFO_OFFSET. */
3701 dfs_record_base_offsets (binfo
, data
)
3706 unsigned HOST_WIDE_INT offset
= tree_low_cst (BINFO_OFFSET (binfo
), 1);
3708 v
= (varray_type
*) data
;
3709 while (VARRAY_SIZE (*v
) <= offset
)
3710 VARRAY_GROW (*v
, 2 * VARRAY_SIZE (*v
));
3711 VARRAY_TREE (*v
, offset
) = tree_cons (NULL_TREE
,
3713 VARRAY_TREE (*v
, offset
));
3718 /* Add the offset of BINFO and its bases to BASE_OFFSETS. */
3721 record_base_offsets (binfo
, base_offsets
)
3723 varray_type
*base_offsets
;
3726 dfs_record_base_offsets
,
3731 /* Returns non-NULL if there is already an entry in DATA (which is
3732 really a `varray_type') indicating that an object with the same
3733 type of BINFO is already at the BINFO_OFFSET for BINFO. */
3736 dfs_search_base_offsets (binfo
, data
)
3740 if (is_empty_class (BINFO_TYPE (binfo
)))
3742 varray_type v
= (varray_type
) data
;
3743 /* Find the offset for this BINFO. */
3744 unsigned HOST_WIDE_INT offset
= tree_low_cst (BINFO_OFFSET (binfo
), 1);
3747 /* If we haven't yet encountered any objects at offsets that
3748 big, then there's no conflict. */
3749 if (VARRAY_SIZE (v
) <= offset
)
3751 /* Otherwise, go through the objects already allocated at this
3753 for (t
= VARRAY_TREE (v
, offset
); t
; t
= TREE_CHAIN (t
))
3754 if (same_type_p (TREE_VALUE (t
), BINFO_TYPE (binfo
)))
3761 /* Returns non-zero if there's a conflict between BINFO and a base
3762 already mentioned in BASE_OFFSETS if BINFO is placed at its current
3766 layout_conflict_p (binfo
, base_offsets
)
3768 varray_type base_offsets
;
3770 return dfs_walk (binfo
, dfs_search_base_offsets
, dfs_skip_vbases
,
3771 base_offsets
) != NULL_TREE
;
3774 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3775 non-static data member of the type indicated by RLI. BINFO is the
3776 binfo corresponding to the base subobject, or, if this is a
3777 non-static data-member, a dummy BINFO for the type of the data
3778 member. BINFO may be NULL if checks to see if the field overlaps
3779 an existing field with the same type are not required. V maps
3780 offsets to types already located at those offsets. This function
3781 determines the position of the DECL. */
3784 layout_nonempty_base_or_field (rli
, decl
, binfo
, v
)
3785 record_layout_info rli
;
3790 /* Try to place the field. It may take more than one try if we have
3791 a hard time placing the field without putting two objects of the
3792 same type at the same address. */
3796 struct record_layout_info_s old_rli
= *rli
;
3798 /* Place this field. */
3799 place_field (rli
, decl
);
3801 /* Now that we know where it wil be placed, update its
3803 offset
= byte_position (decl
);
3804 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
3805 propagate_binfo_offsets (binfo
,
3806 convert (ssizetype
, offset
));
3808 /* We have to check to see whether or not there is already
3809 something of the same type at the offset we're about to use.
3813 struct T : public S { int i; };
3814 struct U : public S, public T {};
3816 Here, we put S at offset zero in U. Then, we can't put T at
3817 offset zero -- its S component would be at the same address
3818 as the S we already allocated. So, we have to skip ahead.
3819 Since all data members, including those whose type is an
3820 empty class, have non-zero size, any overlap can happen only
3821 with a direct or indirect base-class -- it can't happen with
3823 if (binfo
&& flag_new_abi
&& layout_conflict_p (binfo
, v
))
3825 /* Undo the propagate_binfo_offsets call. */
3826 offset
= size_diffop (size_zero_node
, offset
);
3827 propagate_binfo_offsets (binfo
, convert (ssizetype
, offset
));
3829 /* Strip off the size allocated to this field. That puts us
3830 at the first place we could have put the field with
3831 proper alignment. */
3834 /* Bump up by the alignment required for the type, without
3835 virtual base classes. */
3837 = size_binop (PLUS_EXPR
, rli
->bitpos
,
3838 bitsize_int (CLASSTYPE_ALIGN (BINFO_TYPE (binfo
))));
3839 normalize_rli (rli
);
3842 /* There was no conflict. We're done laying out this field. */
3847 /* Layout the empty base BINFO. EOC indicates the byte currently just
3848 past the end of the class, and should be correctly aligned for a
3849 class of the type indicated by BINFO; BINFO_OFFSETS gives the
3850 offsets of the other bases allocated so far. */
3853 layout_empty_base (binfo
, eoc
, binfo_offsets
)
3856 varray_type binfo_offsets
;
3859 tree basetype
= BINFO_TYPE (binfo
);
3861 /* This routine should only be used for empty classes. */
3862 my_friendly_assert (is_empty_class (basetype
), 20000321);
3863 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
3865 /* This is an empty base class. We first try to put it at offset
3867 if (layout_conflict_p (binfo
, binfo_offsets
))
3869 /* That didn't work. Now, we move forward from the next
3870 available spot in the class. */
3871 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
3874 if (!layout_conflict_p (binfo
, binfo_offsets
))
3875 /* We finally found a spot where there's no overlap. */
3878 /* There's overlap here, too. Bump along to the next spot. */
3879 propagate_binfo_offsets (binfo
, alignment
);
3884 /* Build a FIELD_DECL for the base given by BINFO in the class
3885 indicated by RLI. If the new object is non-empty, clear *EMPTY_P.
3886 *BASE_ALIGN is a running maximum of the alignments of any base
3890 build_base_field (rli
, binfo
, empty_p
, base_align
, v
)
3891 record_layout_info rli
;
3894 unsigned int *base_align
;
3897 tree basetype
= BINFO_TYPE (binfo
);
3900 if (!COMPLETE_TYPE_P (basetype
))
3901 /* This error is now reported in xref_tag, thus giving better
3902 location information. */
3905 decl
= build_decl (FIELD_DECL
, NULL_TREE
, basetype
);
3906 DECL_ARTIFICIAL (decl
) = 1;
3907 DECL_FIELD_CONTEXT (decl
) = rli
->t
;
3908 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
3909 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
3910 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
3911 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
3915 /* Brain damage for backwards compatibility. For no good
3916 reason, the old basetype layout made every base have at least
3917 as large as the alignment for the bases up to that point,
3918 gratuitously wasting space. So we do the same thing here. */
3919 *base_align
= MAX (*base_align
, DECL_ALIGN (decl
));
3921 = size_binop (MAX_EXPR
, DECL_SIZE (decl
), bitsize_int (*base_align
));
3922 DECL_SIZE_UNIT (decl
)
3923 = size_binop (MAX_EXPR
, DECL_SIZE_UNIT (decl
),
3924 size_int (*base_align
/ BITS_PER_UNIT
));
3927 if (!integer_zerop (DECL_SIZE (decl
)))
3929 /* The containing class is non-empty because it has a non-empty
3933 /* Try to place the field. It may take more than one try if we
3934 have a hard time placing the field without putting two
3935 objects of the same type at the same address. */
3936 layout_nonempty_base_or_field (rli
, decl
, binfo
, *v
);
3940 unsigned HOST_WIDE_INT eoc
;
3942 /* On some platforms (ARM), even empty classes will not be
3944 eoc
= tree_low_cst (rli_size_unit_so_far (rli
), 0);
3945 eoc
= CEIL (eoc
, DECL_ALIGN (decl
)) * DECL_ALIGN (decl
);
3946 layout_empty_base (binfo
, size_int (eoc
), *v
);
3949 /* Check for inaccessible base classes. If the same base class
3950 appears more than once in the hierarchy, but isn't virtual, then
3952 if (get_base_distance (basetype
, rli
->t
, 0, NULL
) == -2)
3953 cp_warning ("direct base `%T' inaccessible in `%T' due to ambiguity",
3956 /* Record the offsets of BINFO and its base subobjects. */
3957 record_base_offsets (binfo
, v
);
3960 /* Layout all of the non-virtual base classes. Returns a map from
3961 offsets to types present at those offsets. */
3964 build_base_fields (rli
, empty_p
)
3965 record_layout_info rli
;
3968 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3971 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (rec
);
3974 unsigned int base_align
= 0;
3976 /* Create the table mapping offsets to empty base classes. */
3977 VARRAY_TREE_INIT (v
, 32, "v");
3979 /* Under the new ABI, the primary base class is always allocated
3981 if (flag_new_abi
&& CLASSTYPE_HAS_PRIMARY_BASE_P (rec
))
3982 build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (rec
),
3983 empty_p
, &base_align
, &v
);
3985 /* Now allocate the rest of the bases. */
3986 for (i
= 0; i
< n_baseclasses
; ++i
)
3990 base_binfo
= BINFO_BASETYPE (TYPE_BINFO (rec
), i
);
3992 /* Under the new ABI, the primary base was already allocated
3993 above, so we don't need to allocate it again here. */
3994 if (flag_new_abi
&& base_binfo
== CLASSTYPE_PRIMARY_BINFO (rec
))
3997 /* A primary virtual base class is allocated just like any other
3998 base class, but a non-primary virtual base is allocated
3999 later, in layout_virtual_bases. */
4000 if (TREE_VIA_VIRTUAL (base_binfo
)
4001 && !BINFO_PRIMARY_MARKED_P (base_binfo
))
4004 build_base_field (rli
, base_binfo
, empty_p
, &base_align
, &v
);
4010 /* Go through the TYPE_METHODS of T issuing any appropriate
4011 diagnostics, figuring out which methods override which other
4012 methods, and so forth. */
4019 int seen_one_arg_array_delete_p
= 0;
4021 for (x
= TYPE_METHODS (t
); x
; x
= TREE_CHAIN (x
))
4023 GNU_xref_member (current_class_name
, x
);
4025 /* If this was an evil function, don't keep it in class. */
4026 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (x
)))
4029 check_for_override (x
, t
);
4030 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4031 cp_error_at ("initializer specified for non-virtual method `%D'", x
);
4033 /* The name of the field is the original field name
4034 Save this in auxiliary field for later overloading. */
4035 if (DECL_VINDEX (x
))
4037 TYPE_POLYMORPHIC_P (t
) = 1;
4038 if (DECL_PURE_VIRTUAL_P (x
))
4039 CLASSTYPE_PURE_VIRTUALS (t
)
4040 = tree_cons (NULL_TREE
, x
, CLASSTYPE_PURE_VIRTUALS (t
));
4043 if (DECL_ARRAY_DELETE_OPERATOR_P (x
))
4047 /* When dynamically allocating an array of this type, we
4048 need a "cookie" to record how many elements we allocated,
4049 even if the array elements have no non-trivial
4050 destructor, if the usual array deallocation function
4051 takes a second argument of type size_t. The standard (in
4052 [class.free]) requires that the second argument be set
4054 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (x
)));
4055 /* This is overly conservative, but we must maintain this
4056 behavior for backwards compatibility. */
4057 if (!flag_new_abi
&& second_parm
!= void_list_node
)
4058 TYPE_VEC_DELETE_TAKES_SIZE (t
) = 1;
4059 /* Under the new ABI, we choose only those function that are
4060 explicitly declared as `operator delete[] (void *,
4062 else if (flag_new_abi
4063 && !seen_one_arg_array_delete_p
4065 && TREE_CHAIN (second_parm
) == void_list_node
4066 && same_type_p (TREE_VALUE (second_parm
), sizetype
))
4067 TYPE_VEC_DELETE_TAKES_SIZE (t
) = 1;
4068 /* If there's no second parameter, then this is the usual
4069 deallocation function. */
4070 else if (second_parm
== void_list_node
)
4071 seen_one_arg_array_delete_p
= 1;
4076 /* FN is a constructor or destructor. Clone the declaration to create
4077 a specialized in-charge or not-in-charge version, as indicated by
4081 build_clone (fn
, name
)
4088 /* Copy the function. */
4089 clone
= copy_decl (fn
);
4090 /* Remember where this function came from. */
4091 DECL_CLONED_FUNCTION (clone
) = fn
;
4092 /* Reset the function name. */
4093 DECL_NAME (clone
) = name
;
4094 DECL_ASSEMBLER_NAME (clone
) = DECL_NAME (clone
);
4095 /* There's no pending inline data for this function. */
4096 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4097 DECL_PENDING_INLINE_P (clone
) = 0;
4098 /* And it hasn't yet been deferred. */
4099 DECL_DEFERRED_FN (clone
) = 0;
4100 /* There's no magic VTT parameter in the clone. */
4101 DECL_VTT_PARM (clone
) = NULL_TREE
;
4103 /* The base-class destructor is not virtual. */
4104 if (name
== base_dtor_identifier
)
4106 DECL_VIRTUAL_P (clone
) = 0;
4107 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4108 DECL_VINDEX (clone
) = NULL_TREE
;
4111 /* If there was an in-charge parameter, drop it from the function
4113 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4119 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4120 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4121 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4122 /* Skip the `this' parameter. */
4123 parmtypes
= TREE_CHAIN (parmtypes
);
4124 /* Skip the in-charge parameter. */
4125 parmtypes
= TREE_CHAIN (parmtypes
);
4126 /* If this is subobject constructor or destructor, add the vtt
4128 if (DECL_NEEDS_VTT_PARM_P (clone
))
4129 parmtypes
= hash_tree_chain (vtt_parm_type
, parmtypes
);
4131 = build_cplus_method_type (basetype
,
4132 TREE_TYPE (TREE_TYPE (clone
)),
4135 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4139 /* Copy the function parameters. But, DECL_ARGUMENTS aren't
4140 function parameters; instead, those are the template parameters. */
4141 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4143 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4144 /* Remove the in-charge parameter. */
4145 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4147 TREE_CHAIN (DECL_ARGUMENTS (clone
))
4148 = TREE_CHAIN (TREE_CHAIN (DECL_ARGUMENTS (clone
)));
4149 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4152 /* Add the VTT parameter. */
4153 if (DECL_NEEDS_VTT_PARM_P (clone
))
4157 parm
= build_artificial_parm (vtt_parm_identifier
,
4159 TREE_CHAIN (parm
) = TREE_CHAIN (DECL_ARGUMENTS (clone
));
4160 TREE_CHAIN (DECL_ARGUMENTS (clone
)) = parm
;
4163 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= TREE_CHAIN (parms
))
4165 DECL_CONTEXT (parms
) = clone
;
4166 copy_lang_decl (parms
);
4170 /* Mangle the function name. */
4171 set_mangled_name_for_decl (clone
);
4173 /* Create the RTL for this function. */
4174 DECL_RTL (clone
) = NULL_RTX
;
4175 rest_of_decl_compilation (clone
, NULL
, /*top_level=*/1, at_eof
);
4177 /* Make it easy to find the CLONE given the FN. */
4178 TREE_CHAIN (clone
) = TREE_CHAIN (fn
);
4179 TREE_CHAIN (fn
) = clone
;
4181 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
4182 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4186 DECL_TEMPLATE_RESULT (clone
)
4187 = build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4188 result
= DECL_TEMPLATE_RESULT (clone
);
4189 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4190 DECL_TI_TEMPLATE (result
) = clone
;
4192 else if (DECL_DEFERRED_FN (fn
))
4198 /* Produce declarations for all appropriate clones of FN. If
4199 UPDATE_METHOD_VEC_P is non-zero, the clones are added to the
4200 CLASTYPE_METHOD_VEC as well. */
4203 clone_function_decl (fn
, update_method_vec_p
)
4205 int update_method_vec_p
;
4209 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4211 /* For each constructor, we need two variants: an in-charge version
4212 and a not-in-charge version. */
4213 clone
= build_clone (fn
, complete_ctor_identifier
);
4214 if (update_method_vec_p
)
4215 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
4216 clone
= build_clone (fn
, base_ctor_identifier
);
4217 if (update_method_vec_p
)
4218 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
4222 my_friendly_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
), 20000411);
4224 /* For each destructor, we need three variants: an in-charge
4225 version, a not-in-charge version, and an in-charge deleting
4226 version. We clone the deleting version first because that
4227 means it will go second on the TYPE_METHODS list -- and that
4228 corresponds to the correct layout order in the virtual
4230 clone
= build_clone (fn
, deleting_dtor_identifier
);
4231 if (update_method_vec_p
)
4232 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
4233 clone
= build_clone (fn
, complete_dtor_identifier
);
4234 if (update_method_vec_p
)
4235 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
4236 clone
= build_clone (fn
, base_dtor_identifier
);
4237 if (update_method_vec_p
)
4238 add_method (DECL_CONTEXT (clone
), clone
, /*error_p=*/0);
4242 /* For each of the constructors and destructors in T, create an
4243 in-charge and not-in-charge variant. */
4246 clone_constructors_and_destructors (t
)
4251 /* We only clone constructors and destructors under the new ABI. */
4255 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4257 if (!CLASSTYPE_METHOD_VEC (t
))
4260 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4261 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4262 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4263 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4266 /* Remove all zero-width bit-fields from T. */
4269 remove_zero_width_bit_fields (t
)
4274 fieldsp
= &TYPE_FIELDS (t
);
4277 if (TREE_CODE (*fieldsp
) == FIELD_DECL
4278 && DECL_C_BIT_FIELD (*fieldsp
)
4279 && DECL_INITIAL (*fieldsp
))
4280 *fieldsp
= TREE_CHAIN (*fieldsp
);
4282 fieldsp
= &TREE_CHAIN (*fieldsp
);
4286 /* Check the validity of the bases and members declared in T. Add any
4287 implicitly-generated functions (like copy-constructors and
4288 assignment operators). Compute various flag bits (like
4289 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4290 level: i.e., independently of the ABI in use. */
4293 check_bases_and_members (t
, empty_p
)
4297 /* Nonzero if we are not allowed to generate a default constructor
4299 int cant_have_default_ctor
;
4300 /* Nonzero if the implicitly generated copy constructor should take
4301 a non-const reference argument. */
4302 int cant_have_const_ctor
;
4303 /* Nonzero if the the implicitly generated assignment operator
4304 should take a non-const reference argument. */
4305 int no_const_asn_ref
;
4308 /* By default, we use const reference arguments and generate default
4310 cant_have_default_ctor
= 0;
4311 cant_have_const_ctor
= 0;
4312 no_const_asn_ref
= 0;
4314 /* Assume that the class is nearly empty; we'll clear this flag if
4315 it turns out not to be nearly empty. */
4316 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
4318 /* Check all the base-classes. */
4319 check_bases (t
, &cant_have_default_ctor
, &cant_have_const_ctor
,
4322 /* Check all the data member declarations. */
4323 check_field_decls (t
, &access_decls
, empty_p
,
4324 &cant_have_default_ctor
,
4325 &cant_have_const_ctor
,
4328 /* Check all the method declarations. */
4331 /* A nearly-empty class has to be vptr-containing; a nearly empty
4332 class contains just a vptr. */
4333 if (!TYPE_CONTAINS_VPTR_P (t
))
4334 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4336 /* Do some bookkeeping that will guide the generation of implicitly
4337 declared member functions. */
4338 TYPE_HAS_COMPLEX_INIT_REF (t
)
4339 |= (TYPE_HAS_INIT_REF (t
)
4340 || TYPE_USES_VIRTUAL_BASECLASSES (t
)
4341 || TYPE_POLYMORPHIC_P (t
));
4342 TYPE_NEEDS_CONSTRUCTING (t
)
4343 |= (TYPE_HAS_CONSTRUCTOR (t
)
4344 || TYPE_USES_VIRTUAL_BASECLASSES (t
)
4345 || TYPE_POLYMORPHIC_P (t
));
4346 CLASSTYPE_NON_AGGREGATE (t
) |= (TYPE_HAS_CONSTRUCTOR (t
)
4347 || TYPE_POLYMORPHIC_P (t
));
4348 CLASSTYPE_NON_POD_P (t
)
4349 |= (CLASSTYPE_NON_AGGREGATE (t
) || TYPE_HAS_DESTRUCTOR (t
)
4350 || TYPE_HAS_ASSIGN_REF (t
));
4351 TYPE_HAS_REAL_ASSIGN_REF (t
) |= TYPE_HAS_ASSIGN_REF (t
);
4352 TYPE_HAS_COMPLEX_ASSIGN_REF (t
)
4353 |= TYPE_HAS_ASSIGN_REF (t
) || TYPE_USES_VIRTUAL_BASECLASSES (t
);
4355 /* Synthesize any needed methods. Note that methods will be synthesized
4356 for anonymous unions; grok_x_components undoes that. */
4357 add_implicitly_declared_members (t
, cant_have_default_ctor
,
4358 cant_have_const_ctor
,
4361 /* Create the in-charge and not-in-charge variants of constructors
4363 clone_constructors_and_destructors (t
);
4365 /* Process the using-declarations. */
4366 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
4367 handle_using_decl (TREE_VALUE (access_decls
), t
);
4369 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4370 finish_struct_methods (t
);
4373 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4374 accordingly. If a new vfield was created (because T doesn't have a
4375 primary base class), then the newly created field is returned. It
4376 is not added to the TYPE_FIELDS list; it is the caller's
4377 responsibility to do that. */
4380 create_vtable_ptr (t
, empty_p
, vfuns_p
,
4381 new_virtuals_p
, overridden_virtuals_p
)
4385 tree
*new_virtuals_p
;
4386 tree
*overridden_virtuals_p
;
4390 /* Loop over the virtual functions, adding them to our various
4392 for (fn
= TYPE_METHODS (t
); fn
; fn
= TREE_CHAIN (fn
))
4393 if (DECL_VINDEX (fn
)
4394 && !(flag_new_abi
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)))
4395 add_virtual_function (new_virtuals_p
, overridden_virtuals_p
,
4398 /* If we couldn't find an appropriate base class, create a new field
4399 here. Even if there weren't any new virtual functions, we might need a
4400 new virtual function table if we're supposed to include vptrs in
4401 all classes that need them. */
4402 if (!TYPE_VFIELD (t
)
4404 || (TYPE_CONTAINS_VPTR_P (t
) && vptrs_present_everywhere_p ())))
4406 /* We build this decl with vtbl_ptr_type_node, which is a
4407 `vtable_entry_type*'. It might seem more precise to use
4408 `vtable_entry_type (*)[N]' where N is the number of firtual
4409 functions. However, that would require the vtable pointer in
4410 base classes to have a different type than the vtable pointer
4411 in derived classes. We could make that happen, but that
4412 still wouldn't solve all the problems. In particular, the
4413 type-based alias analysis code would decide that assignments
4414 to the base class vtable pointer can't alias assignments to
4415 the derived class vtable pointer, since they have different
4416 types. Thus, in an derived class destructor, where the base
4417 class constructor was inlined, we could generate bad code for
4418 setting up the vtable pointer.
4420 Therefore, we use one type for all vtable pointers. We still
4421 use a type-correct type; it's just doesn't indicate the array
4422 bounds. That's better than using `void*' or some such; it's
4423 cleaner, and it let's the alias analysis code know that these
4424 stores cannot alias stores to void*! */
4426 = build_vtbl_or_vbase_field (get_vfield_name (t
),
4427 get_identifier (VFIELD_BASE
),
4433 if (flag_new_abi
&& CLASSTYPE_N_BASECLASSES (t
))
4434 /* If there were any baseclasses, they can't possibly be at
4435 offset zero any more, because that's where the vtable
4436 pointer is. So, converting to a base class is going to
4438 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t
) = 1;
4440 return TYPE_VFIELD (t
);
4446 /* Fixup the inline function given by INFO now that the class is
4450 fixup_pending_inline (fn
)
4453 if (DECL_PENDING_INLINE_INFO (fn
))
4455 tree args
= DECL_ARGUMENTS (fn
);
4458 DECL_CONTEXT (args
) = fn
;
4459 args
= TREE_CHAIN (args
);
4464 /* Fixup the inline methods and friends in TYPE now that TYPE is
4468 fixup_inline_methods (type
)
4471 tree method
= TYPE_METHODS (type
);
4473 if (method
&& TREE_CODE (method
) == TREE_VEC
)
4475 if (TREE_VEC_ELT (method
, 1))
4476 method
= TREE_VEC_ELT (method
, 1);
4477 else if (TREE_VEC_ELT (method
, 0))
4478 method
= TREE_VEC_ELT (method
, 0);
4480 method
= TREE_VEC_ELT (method
, 2);
4483 /* Do inline member functions. */
4484 for (; method
; method
= TREE_CHAIN (method
))
4485 fixup_pending_inline (method
);
4488 for (method
= CLASSTYPE_INLINE_FRIENDS (type
);
4490 method
= TREE_CHAIN (method
))
4491 fixup_pending_inline (TREE_VALUE (method
));
4492 CLASSTYPE_INLINE_FRIENDS (type
) = NULL_TREE
;
4495 /* Add OFFSET to all base types of BINFO which is a base in the
4496 hierarchy dominated by T.
4498 OFFSET, which is a type offset, is number of bytes. */
4501 propagate_binfo_offsets (binfo
, offset
)
4508 /* Update BINFO's offset. */
4509 BINFO_OFFSET (binfo
)
4510 = convert (sizetype
,
4511 size_binop (PLUS_EXPR
,
4512 convert (ssizetype
, BINFO_OFFSET (binfo
)),
4515 /* Find the primary base class. */
4516 primary_binfo
= get_primary_binfo (binfo
);
4518 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4520 for (i
= -1; i
< BINFO_N_BASETYPES (binfo
); ++i
)
4524 /* On the first through the loop, do the primary base. Because
4525 the primary base need not be an immediate base, we must
4526 handle the primary base specially. */
4532 base_binfo
= primary_binfo
;
4536 base_binfo
= BINFO_BASETYPE (binfo
, i
);
4537 /* Don't do the primary base twice. */
4538 if (base_binfo
== primary_binfo
)
4542 /* Skip virtual bases that aren't our primary base. */
4543 if (TREE_VIA_VIRTUAL (base_binfo
)
4544 && BINFO_PRIMARY_BASE_OF (base_binfo
) != binfo
)
4547 propagate_binfo_offsets (base_binfo
, offset
);
4551 /* Called via dfs_walk from layout_virtual bases. */
4554 dfs_set_offset_for_unshared_vbases (binfo
, data
)
4558 /* If this is a virtual base, make sure it has the same offset as
4559 the shared copy. If it's a primary base, then we know it's
4561 if (TREE_VIA_VIRTUAL (binfo
) && !BINFO_PRIMARY_MARKED_P (binfo
))
4563 tree t
= (tree
) data
;
4567 vbase
= binfo_for_vbase (BINFO_TYPE (binfo
), t
);
4568 offset
= size_diffop (BINFO_OFFSET (vbase
), BINFO_OFFSET (binfo
));
4569 propagate_binfo_offsets (binfo
, offset
);
4575 /* Set BINFO_OFFSET for all of the virtual bases for T. Update
4576 TYPE_ALIGN and TYPE_SIZE for T. BASE_OFFSETS is a varray mapping
4577 offsets to the types at those offsets. */
4580 layout_virtual_bases (t
, base_offsets
)
4582 varray_type
*base_offsets
;
4585 unsigned HOST_WIDE_INT dsize
;
4586 unsigned HOST_WIDE_INT eoc
;
4588 if (CLASSTYPE_N_BASECLASSES (t
) == 0)
4591 #ifdef STRUCTURE_SIZE_BOUNDARY
4592 /* Packed structures don't need to have minimum size. */
4593 if (! TYPE_PACKED (t
))
4594 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), STRUCTURE_SIZE_BOUNDARY
);
4597 /* DSIZE is the size of the class without the virtual bases. */
4598 dsize
= tree_low_cst (TYPE_SIZE (t
), 1);
4600 /* Make every class have alignment of at least one. */
4601 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), BITS_PER_UNIT
);
4603 /* Go through the virtual bases, allocating space for each virtual
4604 base that is not already a primary base class. Under the new
4605 ABI, these are allocated according to a depth-first left-to-right
4606 postorder traversal; in the new ABI, inheritance graph order is
4608 for (vbases
= (flag_new_abi
4610 : CLASSTYPE_VBASECLASSES (t
));
4612 vbases
= TREE_CHAIN (vbases
))
4618 if (!TREE_VIA_VIRTUAL (vbases
))
4620 vbase
= binfo_for_vbase (BINFO_TYPE (vbases
), t
);
4623 vbase
= TREE_VALUE (vbases
);
4625 if (!BINFO_PRIMARY_MARKED_P (vbase
))
4627 /* This virtual base is not a primary base of any class in the
4628 hierarchy, so we have to add space for it. */
4630 unsigned int desired_align
;
4632 basetype
= BINFO_TYPE (vbase
);
4635 desired_align
= CLASSTYPE_ALIGN (basetype
);
4637 /* Under the old ABI, virtual bases were aligned as for the
4638 entire base object (including its virtual bases). That's
4639 wasteful, in general. */
4640 desired_align
= TYPE_ALIGN (basetype
);
4641 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), desired_align
);
4643 /* Add padding so that we can put the virtual base class at an
4644 appropriately aligned offset. */
4645 dsize
= CEIL (dsize
, desired_align
) * desired_align
;
4647 /* Under the new ABI, we try to squish empty virtual bases in
4648 just like ordinary empty bases. */
4649 if (flag_new_abi
&& is_empty_class (basetype
))
4650 layout_empty_base (vbase
,
4651 size_int (CEIL (dsize
, BITS_PER_UNIT
)),
4657 offset
= ssize_int (CEIL (dsize
, BITS_PER_UNIT
));
4658 offset
= size_diffop (offset
,
4660 BINFO_OFFSET (vbase
)));
4662 /* And compute the offset of the virtual base. */
4663 propagate_binfo_offsets (vbase
, offset
);
4664 /* Every virtual baseclass takes a least a UNIT, so that
4665 we can take it's address and get something different
4667 dsize
+= MAX (BITS_PER_UNIT
,
4668 tree_low_cst (CLASSTYPE_SIZE (basetype
), 0));
4671 /* Keep track of the offsets assigned to this virtual base. */
4672 record_base_offsets (vbase
, base_offsets
);
4676 /* Now, go through the TYPE_BINFO hierarchy, setting the
4677 BINFO_OFFSETs correctly for all non-primary copies of the virtual
4678 bases and their direct and indirect bases. The ambiguity checks
4679 in get_base_distance depend on the BINFO_OFFSETs being set
4681 dfs_walk (TYPE_BINFO (t
), dfs_set_offset_for_unshared_vbases
, NULL
, t
);
4683 /* If we had empty base classes that protruded beyond the end of the
4684 class, we didn't update DSIZE above; we were hoping to overlay
4685 multiple such bases at the same location. */
4686 eoc
= end_of_class (t
, /*include_virtuals_p=*/1);
4687 if (eoc
* BITS_PER_UNIT
> dsize
)
4688 dsize
= (eoc
+ 1) * BITS_PER_UNIT
;
4690 /* Now, make sure that the total size of the type is a multiple of
4692 dsize
= CEIL (dsize
, TYPE_ALIGN (t
)) * TYPE_ALIGN (t
);
4693 TYPE_SIZE (t
) = bitsize_int (dsize
);
4694 TYPE_SIZE_UNIT (t
) = convert (sizetype
,
4695 size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (t
),
4696 bitsize_unit_node
));
4698 /* Check for ambiguous virtual bases. */
4700 for (vbases
= CLASSTYPE_VBASECLASSES (t
);
4702 vbases
= TREE_CHAIN (vbases
))
4704 tree basetype
= BINFO_TYPE (TREE_VALUE (vbases
));
4705 if (get_base_distance (basetype
, t
, 0, (tree
*)0) == -2)
4706 cp_warning ("virtual base `%T' inaccessible in `%T' due to ambiguity",
4711 /* Returns the offset of the byte just past the end of the base class
4712 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4713 only non-virtual bases are included. */
4715 static unsigned HOST_WIDE_INT
4716 end_of_class (t
, include_virtuals_p
)
4718 int include_virtuals_p
;
4720 unsigned HOST_WIDE_INT result
= 0;
4723 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (t
); ++i
)
4727 unsigned HOST_WIDE_INT end_of_base
;
4729 base_binfo
= BINFO_BASETYPE (TYPE_BINFO (t
), i
);
4731 if (!include_virtuals_p
4732 && TREE_VIA_VIRTUAL (base_binfo
)
4733 && !BINFO_PRIMARY_MARKED_P (base_binfo
))
4736 offset
= size_binop (PLUS_EXPR
,
4737 BINFO_OFFSET (base_binfo
),
4738 CLASSTYPE_SIZE_UNIT (BINFO_TYPE (base_binfo
)));
4739 end_of_base
= tree_low_cst (offset
, /*pos=*/1);
4740 if (end_of_base
> result
)
4741 result
= end_of_base
;
4747 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4748 BINFO_OFFSETs for all of the base-classes. Position the vtable
4752 layout_class_type (t
, empty_p
, vfuns_p
,
4753 new_virtuals_p
, overridden_virtuals_p
)
4757 tree
*new_virtuals_p
;
4758 tree
*overridden_virtuals_p
;
4760 tree non_static_data_members
;
4763 record_layout_info rli
;
4765 unsigned HOST_WIDE_INT eoc
;
4767 /* Keep track of the first non-static data member. */
4768 non_static_data_members
= TYPE_FIELDS (t
);
4770 /* Start laying out the record. */
4771 rli
= start_record_layout (t
);
4773 /* If possible, we reuse the virtual function table pointer from one
4774 of our base classes. */
4775 determine_primary_base (t
, vfuns_p
);
4777 /* Create a pointer to our virtual function table. */
4778 vptr
= create_vtable_ptr (t
, empty_p
, vfuns_p
,
4779 new_virtuals_p
, overridden_virtuals_p
);
4781 /* Under the new ABI, the vptr is always the first thing in the
4783 if (flag_new_abi
&& vptr
)
4785 TYPE_FIELDS (t
) = chainon (vptr
, TYPE_FIELDS (t
));
4786 place_field (rli
, vptr
);
4789 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4790 v
= build_base_fields (rli
, empty_p
);
4791 /* Add pointers to all of our virtual base-classes. */
4792 TYPE_FIELDS (t
) = chainon (build_vbase_pointer_fields (rli
, empty_p
),
4795 /* CLASSTYPE_INLINE_FRIENDS is really TYPE_NONCOPIED_PARTS. Thus,
4796 we have to save this before we start modifying
4797 TYPE_NONCOPIED_PARTS. */
4798 fixup_inline_methods (t
);
4800 /* Layout the non-static data members. */
4801 for (field
= non_static_data_members
; field
; field
= TREE_CHAIN (field
))
4807 /* We still pass things that aren't non-static data members to
4808 the back-end, in case it wants to do something with them. */
4809 if (TREE_CODE (field
) != FIELD_DECL
)
4811 place_field (rli
, field
);
4815 type
= TREE_TYPE (field
);
4817 /* If this field is a bit-field whose width is greater than its
4818 type, then there are some special rules for allocating it
4819 under the new ABI. Under the old ABI, there were no special
4820 rules, but the back-end can't handle bitfields longer than a
4821 `long long', so we use the same mechanism. */
4822 if (DECL_C_BIT_FIELD (field
)
4824 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
4826 && 0 < compare_tree_int (DECL_SIZE (field
),
4828 (long_long_unsigned_type_node
)))))
4830 integer_type_kind itk
;
4833 /* We must allocate the bits as if suitably aligned for the
4834 longest integer type that fits in this many bits. type
4835 of the field. Then, we are supposed to use the left over
4836 bits as additional padding. */
4837 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
4838 if (INT_CST_LT (DECL_SIZE (field
),
4839 TYPE_SIZE (integer_types
[itk
])))
4842 /* ITK now indicates a type that is too large for the
4843 field. We have to back up by one to find the largest
4845 integer_type
= integer_types
[itk
- 1];
4846 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
4847 TYPE_SIZE (integer_type
));
4848 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
4849 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
4850 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
4853 padding
= NULL_TREE
;
4855 /* Create a dummy BINFO corresponding to this field. */
4856 binfo
= make_binfo (size_zero_node
, type
, NULL_TREE
, NULL_TREE
);
4857 unshare_base_binfos (binfo
);
4858 layout_nonempty_base_or_field (rli
, field
, binfo
, v
);
4860 /* If we needed additional padding after this field, add it
4866 padding_field
= build_decl (FIELD_DECL
,
4869 DECL_BIT_FIELD (padding_field
) = 1;
4870 DECL_SIZE (padding_field
) = padding
;
4871 DECL_ALIGN (padding_field
) = 1;
4872 DECL_USER_ALIGN (padding_field
) = 0;
4873 layout_nonempty_base_or_field (rli
, padding_field
, NULL_TREE
, v
);
4877 /* It might be the case that we grew the class to allocate a
4878 zero-sized base class. That won't be reflected in RLI, yet,
4879 because we are willing to overlay multiple bases at the same
4880 offset. However, now we need to make sure that RLI is big enough
4881 to reflect the entire class. */
4882 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
4883 if (TREE_CODE (rli_size_unit_so_far (rli
)) == INTEGER_CST
4884 && compare_tree_int (rli_size_unit_so_far (rli
), eoc
) < 0)
4886 /* We don't handle zero-sized base classes specially under the
4887 old ABI, so if we get here, we had better be operating under
4888 the new ABI rules. */
4889 my_friendly_assert (flag_new_abi
, 20000321);
4890 rli
->offset
= size_binop (MAX_EXPR
, rli
->offset
, size_int (eoc
+ 1));
4891 rli
->bitpos
= bitsize_zero_node
;
4894 /* We make all structures have at least one element, so that they
4895 have non-zero size. In the new ABI, the class may be empty even
4896 if it has basetypes. Therefore, we add the fake field after all
4897 the other fields; if there are already FIELD_DECLs on the list,
4898 their offsets will not be disturbed. */
4903 padding
= build_decl (FIELD_DECL
, NULL_TREE
, char_type_node
);
4904 place_field (rli
, padding
);
4905 TYPE_NONCOPIED_PARTS (t
)
4906 = tree_cons (NULL_TREE
, padding
, TYPE_NONCOPIED_PARTS (t
));
4907 TREE_STATIC (TYPE_NONCOPIED_PARTS (t
)) = 1;
4910 /* Under the old ABI, the vptr comes at the very end of the
4912 if (!flag_new_abi
&& vptr
)
4914 place_field (rli
, vptr
);
4915 TYPE_FIELDS (t
) = chainon (TYPE_FIELDS (t
), vptr
);
4918 /* Let the back-end lay out the type. Note that at this point we
4919 have only included non-virtual base-classes; we will lay out the
4920 virtual base classes later. So, the TYPE_SIZE/TYPE_ALIGN after
4921 this call are not necessarily correct; they are just the size and
4922 alignment when no virtual base clases are used. */
4923 finish_record_layout (rli
);
4925 /* Delete all zero-width bit-fields from the list of fields. Now
4926 that the type is laid out they are no longer important. */
4927 remove_zero_width_bit_fields (t
);
4929 /* Remember the size and alignment of the class before adding
4930 the virtual bases. */
4931 if (*empty_p
&& flag_new_abi
)
4933 CLASSTYPE_SIZE (t
) = bitsize_zero_node
;
4934 CLASSTYPE_SIZE_UNIT (t
) = size_zero_node
;
4936 else if (flag_new_abi
)
4938 CLASSTYPE_SIZE (t
) = TYPE_BINFO_SIZE (t
);
4939 CLASSTYPE_SIZE_UNIT (t
) = TYPE_BINFO_SIZE_UNIT (t
);
4943 CLASSTYPE_SIZE (t
) = TYPE_SIZE (t
);
4944 CLASSTYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (t
);
4947 CLASSTYPE_ALIGN (t
) = TYPE_ALIGN (t
);
4948 CLASSTYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (t
);
4950 /* Set the TYPE_DECL for this type to contain the right
4951 value for DECL_OFFSET, so that we can use it as part
4952 of a COMPONENT_REF for multiple inheritance. */
4953 layout_decl (TYPE_MAIN_DECL (t
), 0);
4955 /* Now fix up any virtual base class types that we left lying
4956 around. We must get these done before we try to lay out the
4957 virtual function table. As a side-effect, this will remove the
4958 base subobject fields. */
4959 layout_virtual_bases (t
, &v
);
4965 /* Create a RECORD_TYPE or UNION_TYPE node for a C struct or union declaration
4966 (or C++ class declaration).
4968 For C++, we must handle the building of derived classes.
4969 Also, C++ allows static class members. The way that this is
4970 handled is to keep the field name where it is (as the DECL_NAME
4971 of the field), and place the overloaded decl in the bit position
4972 of the field. layout_record and layout_union will know about this.
4974 More C++ hair: inline functions have text in their
4975 DECL_PENDING_INLINE_INFO nodes which must somehow be parsed into
4976 meaningful tree structure. After the struct has been laid out, set
4977 things up so that this can happen.
4979 And still more: virtual functions. In the case of single inheritance,
4980 when a new virtual function is seen which redefines a virtual function
4981 from the base class, the new virtual function is placed into
4982 the virtual function table at exactly the same address that
4983 it had in the base class. When this is extended to multiple
4984 inheritance, the same thing happens, except that multiple virtual
4985 function tables must be maintained. The first virtual function
4986 table is treated in exactly the same way as in the case of single
4987 inheritance. Additional virtual function tables have different
4988 DELTAs, which tell how to adjust `this' to point to the right thing.
4990 ATTRIBUTES is the set of decl attributes to be applied, if any. */
4998 /* The NEW_VIRTUALS is a TREE_LIST. The TREE_VALUE of each node is
4999 a FUNCTION_DECL. Each of these functions is a virtual function
5000 declared in T that does not override any virtual function from a
5002 tree new_virtuals
= NULL_TREE
;
5003 /* The OVERRIDDEN_VIRTUALS list is like the NEW_VIRTUALS list,
5004 except that each declaration here overrides the declaration from
5006 tree overridden_virtuals
= NULL_TREE
;
5011 if (COMPLETE_TYPE_P (t
))
5013 if (IS_AGGR_TYPE (t
))
5014 cp_error ("redefinition of `%#T'", t
);
5016 my_friendly_abort (172);
5021 GNU_xref_decl (current_function_decl
, t
);
5023 /* If this type was previously laid out as a forward reference,
5024 make sure we lay it out again. */
5025 TYPE_SIZE (t
) = NULL_TREE
;
5026 CLASSTYPE_GOT_SEMICOLON (t
) = 0;
5027 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
5029 CLASSTYPE_RTTI (t
) = NULL_TREE
;
5031 /* Do end-of-class semantic processing: checking the validity of the
5032 bases and members and add implicitly generated methods. */
5033 check_bases_and_members (t
, &empty
);
5035 /* Layout the class itself. */
5036 layout_class_type (t
, &empty
, &vfuns
,
5037 &new_virtuals
, &overridden_virtuals
);
5039 /* Set up the DECL_FIELD_BITPOS of the vfield if we need to, as we
5040 might need to know it for setting up the offsets in the vtable
5041 (or in thunks) below. */
5042 vfield
= TYPE_VFIELD (t
);
5043 if (vfield
!= NULL_TREE
5044 && DECL_FIELD_CONTEXT (vfield
) != t
)
5046 tree binfo
= get_binfo (DECL_FIELD_CONTEXT (vfield
), t
, 0);
5048 vfield
= copy_decl (vfield
);
5050 DECL_FIELD_CONTEXT (vfield
) = t
;
5051 DECL_FIELD_OFFSET (vfield
)
5052 = size_binop (PLUS_EXPR
,
5053 BINFO_OFFSET (binfo
),
5054 DECL_FIELD_OFFSET (vfield
));
5055 TYPE_VFIELD (t
) = vfield
;
5059 = modify_all_vtables (t
, &vfuns
, nreverse (overridden_virtuals
));
5061 /* If we created a new vtbl pointer for this class, add it to the
5063 if (TYPE_VFIELD (t
) && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5064 CLASSTYPE_VFIELDS (t
)
5065 = chainon (CLASSTYPE_VFIELDS (t
), build_tree_list (NULL_TREE
, t
));
5067 /* If necessary, create the primary vtable for this class. */
5069 || overridden_virtuals
5070 || (TYPE_CONTAINS_VPTR_P (t
) && vptrs_present_everywhere_p ()))
5072 new_virtuals
= nreverse (new_virtuals
);
5073 /* We must enter these virtuals into the table. */
5074 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5075 build_primary_vtable (NULL_TREE
, t
);
5076 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
), t
))
5077 /* Here we know enough to change the type of our virtual
5078 function table, but we will wait until later this function. */
5079 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
5081 /* If this type has basetypes with constructors, then those
5082 constructors might clobber the virtual function table. But
5083 they don't if the derived class shares the exact vtable of the base
5086 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t
) = 1;
5088 /* If we didn't need a new vtable, see if we should copy one from
5090 else if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5092 tree binfo
= CLASSTYPE_PRIMARY_BINFO (t
);
5094 /* If this class uses a different vtable than its primary base
5095 then when we will need to initialize our vptr after the base
5096 class constructor runs. */
5097 if (TYPE_BINFO_VTABLE (t
) != BINFO_VTABLE (binfo
))
5098 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t
) = 1;
5101 if (TYPE_CONTAINS_VPTR_P (t
))
5103 if (TYPE_BINFO_VTABLE (t
))
5104 my_friendly_assert (DECL_VIRTUAL_P (TYPE_BINFO_VTABLE (t
)),
5106 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
5107 my_friendly_assert (TYPE_BINFO_VIRTUALS (t
) == NULL_TREE
,
5110 CLASSTYPE_VSIZE (t
) = vfuns
;
5111 /* Entries for virtual functions defined in the primary base are
5112 followed by entries for new functions unique to this class. */
5113 TYPE_BINFO_VIRTUALS (t
)
5114 = chainon (TYPE_BINFO_VIRTUALS (t
), new_virtuals
);
5115 /* Finally, add entries for functions that override virtuals
5116 from non-primary bases. */
5117 TYPE_BINFO_VIRTUALS (t
)
5118 = chainon (TYPE_BINFO_VIRTUALS (t
), overridden_virtuals
);
5121 finish_struct_bits (t
);
5123 /* Complete the rtl for any static member objects of the type we're
5125 for (x
= TYPE_FIELDS (t
); x
; x
= TREE_CHAIN (x
))
5127 if (TREE_CODE (x
) == VAR_DECL
&& TREE_STATIC (x
)
5128 && TREE_TYPE (x
) == t
)
5130 DECL_MODE (x
) = TYPE_MODE (t
);
5131 make_decl_rtl (x
, NULL
, 0);
5135 /* Done with FIELDS...now decide whether to sort these for
5136 faster lookups later.
5138 The C front-end only does this when n_fields > 15. We use
5139 a smaller number because most searches fail (succeeding
5140 ultimately as the search bores through the inheritance
5141 hierarchy), and we want this failure to occur quickly. */
5143 n_fields
= count_fields (TYPE_FIELDS (t
));
5146 tree field_vec
= make_tree_vec (n_fields
);
5147 add_fields_to_vec (TYPE_FIELDS (t
), field_vec
, 0);
5148 qsort (&TREE_VEC_ELT (field_vec
, 0), n_fields
, sizeof (tree
),
5149 (int (*)(const void *, const void *))field_decl_cmp
);
5150 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t
)))
5151 retrofit_lang_decl (TYPE_MAIN_DECL (t
));
5152 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t
)) = field_vec
;
5155 if (TYPE_HAS_CONSTRUCTOR (t
))
5157 tree vfields
= CLASSTYPE_VFIELDS (t
);
5161 /* Mark the fact that constructor for T
5162 could affect anybody inheriting from T
5163 who wants to initialize vtables for VFIELDS's type. */
5164 if (VF_DERIVED_VALUE (vfields
))
5165 TREE_ADDRESSABLE (vfields
) = 1;
5166 vfields
= TREE_CHAIN (vfields
);
5170 /* Make the rtl for any new vtables we have created, and unmark
5171 the base types we marked. */
5173 /* Build the VTT for T. */
5176 if (TYPE_VFIELD (t
))
5178 /* In addition to this one, all the other vfields should be listed. */
5179 /* Before that can be done, we have to have FIELD_DECLs for them, and
5180 a place to find them. */
5181 TYPE_NONCOPIED_PARTS (t
)
5182 = tree_cons (default_conversion (TYPE_BINFO_VTABLE (t
)),
5183 TYPE_VFIELD (t
), TYPE_NONCOPIED_PARTS (t
));
5185 if (warn_nonvdtor
&& TYPE_HAS_DESTRUCTOR (t
)
5186 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t
), 1)) == NULL_TREE
)
5187 cp_warning ("`%#T' has virtual functions but non-virtual destructor",
5191 hack_incomplete_structures (t
);
5193 if (warn_overloaded_virtual
)
5196 maybe_suppress_debug_info (t
);
5198 /* Finish debugging output for this type. */
5199 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
5202 /* When T was built up, the member declarations were added in reverse
5203 order. Rearrange them to declaration order. */
5206 unreverse_member_declarations (t
)
5213 /* The TYPE_FIELDS, TYPE_METHODS, and CLASSTYPE_TAGS are all in
5214 reverse order. Put them in declaration order now. */
5215 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
5216 CLASSTYPE_TAGS (t
) = nreverse (CLASSTYPE_TAGS (t
));
5218 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5219 reverse order, so we can't just use nreverse. */
5221 for (x
= TYPE_FIELDS (t
);
5222 x
&& TREE_CODE (x
) != TYPE_DECL
;
5225 next
= TREE_CHAIN (x
);
5226 TREE_CHAIN (x
) = prev
;
5231 TREE_CHAIN (TYPE_FIELDS (t
)) = x
;
5233 TYPE_FIELDS (t
) = prev
;
5238 finish_struct (t
, attributes
)
5241 /* Now that we've got all the field declarations, reverse everything
5243 unreverse_member_declarations (t
);
5245 cplus_decl_attributes (t
, attributes
, NULL_TREE
);
5247 if (processing_template_decl
)
5249 finish_struct_methods (t
);
5250 TYPE_SIZE (t
) = bitsize_zero_node
;
5253 finish_struct_1 (t
);
5255 TYPE_BEING_DEFINED (t
) = 0;
5257 if (current_class_type
)
5260 error ("trying to finish struct, but kicked out due to previous parse errors.");
5262 if (processing_template_decl
)
5264 tree scope
= current_scope ();
5265 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
5266 add_stmt (build_min (TAG_DEFN
, t
));
5272 /* Return the dynamic type of INSTANCE, if known.
5273 Used to determine whether the virtual function table is needed
5276 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5277 of our knowledge of its type. *NONNULL should be initialized
5278 before this function is called. */
5281 fixed_type_or_null (instance
, nonnull
)
5285 switch (TREE_CODE (instance
))
5288 /* Check that we are not going through a cast of some sort. */
5289 if (TREE_TYPE (instance
)
5290 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (instance
, 0))))
5291 instance
= TREE_OPERAND (instance
, 0);
5292 /* fall through... */
5294 /* This is a call to a constructor, hence it's never zero. */
5295 if (TREE_HAS_CONSTRUCTOR (instance
))
5299 return TREE_TYPE (instance
);
5304 /* This is a call to a constructor, hence it's never zero. */
5305 if (TREE_HAS_CONSTRUCTOR (instance
))
5309 return TREE_TYPE (instance
);
5311 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
);
5318 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
5319 /* Propagate nonnull. */
5320 fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
);
5321 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
5322 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
);
5327 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
);
5332 return fixed_type_or_null (TREE_OPERAND (instance
, 0), nonnull
);
5335 return fixed_type_or_null (TREE_OPERAND (instance
, 1), nonnull
);
5339 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
5340 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance
))))
5344 return TREE_TYPE (TREE_TYPE (instance
));
5346 /* fall through... */
5349 if (IS_AGGR_TYPE (TREE_TYPE (instance
)))
5353 return TREE_TYPE (instance
);
5357 if (instance
== current_class_ptr
5358 && flag_this_is_variable
<= 0)
5360 /* Normally, 'this' must be non-null. */
5361 if (flag_this_is_variable
== 0)
5364 /* <0 means we're in a constructor and we know our type. */
5365 if (flag_this_is_variable
< 0)
5366 return TREE_TYPE (TREE_TYPE (instance
));
5368 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
5369 /* Reference variables should be references to objects. */
5379 /* Return non-zero if the dynamic type of INSTANCE is known, and equivalent
5380 to the static type. We also handle the case where INSTANCE is really
5383 Used to determine whether the virtual function table is needed
5386 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5387 of our knowledge of its type. *NONNULL should be initialized
5388 before this function is called. */
5391 resolves_to_fixed_type_p (instance
, nonnull
)
5395 tree t
= TREE_TYPE (instance
);
5396 tree fixed
= fixed_type_or_null (instance
, nonnull
);
5397 if (fixed
== NULL_TREE
)
5399 if (POINTER_TYPE_P (t
))
5401 return same_type_ignoring_top_level_qualifiers_p (t
, fixed
);
5406 init_class_processing ()
5408 current_class_depth
= 0;
5409 current_class_stack_size
= 10;
5411 = (class_stack_node_t
) xmalloc (current_class_stack_size
5412 * sizeof (struct class_stack_node
));
5413 VARRAY_TREE_INIT (local_classes
, 8, "local_classes");
5414 ggc_add_tree_varray_root (&local_classes
, 1);
5416 access_default_node
= build_int_2 (0, 0);
5417 access_public_node
= build_int_2 (ak_public
, 0);
5418 access_protected_node
= build_int_2 (ak_protected
, 0);
5419 access_private_node
= build_int_2 (ak_private
, 0);
5420 access_default_virtual_node
= build_int_2 (4, 0);
5421 access_public_virtual_node
= build_int_2 (4 | ak_public
, 0);
5422 access_protected_virtual_node
= build_int_2 (4 | ak_protected
, 0);
5423 access_private_virtual_node
= build_int_2 (4 | ak_private
, 0);
5425 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
5426 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
5427 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
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
) == BOUND_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 (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5968 && !ptrmem
&& !flag_ms_extensions
)
5970 static int explained
;
5973 return error_mark_node
;
5975 cp_pedwarn ("assuming pointer to member `%D'", fn
);
5978 cp_pedwarn ("(a pointer to member can only be formed with `&%E')", fn
);
5984 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
5985 return build_unary_op (ADDR_EXPR
, fn
, 0);
5988 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
5989 will mark the function as addressed, but here we must do it
5991 mark_addressable (fn
);
5997 /* This function will instantiate the type of the expression given in
5998 RHS to match the type of LHSTYPE. If errors exist, then return
5999 error_mark_node. FLAGS is a bit mask. If ITF_COMPLAIN is set, then
6000 we complain on errors. If we are not complaining, never modify rhs,
6001 as overload resolution wants to try many possible instantiations, in
6002 the hope that at least one will work.
6004 For non-recursive calls, LHSTYPE should be a function, pointer to
6005 function, or a pointer to member function. */
6008 instantiate_type (lhstype
, rhs
, flags
)
6010 enum instantiate_type_flags flags
;
6012 int complain
= (flags
& itf_complain
);
6013 int strict
= (flags
& itf_no_attributes
)
6014 ? COMPARE_NO_ATTRIBUTES
: COMPARE_STRICT
;
6015 int allow_ptrmem
= flags
& itf_ptrmem_ok
;
6017 flags
&= ~itf_ptrmem_ok
;
6019 if (TREE_CODE (lhstype
) == UNKNOWN_TYPE
)
6022 error ("not enough type information");
6023 return error_mark_node
;
6026 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
6028 if (comptypes (lhstype
, TREE_TYPE (rhs
), strict
))
6031 cp_error ("argument of type `%T' does not match `%T'",
6032 TREE_TYPE (rhs
), lhstype
);
6033 return error_mark_node
;
6036 /* We don't overwrite rhs if it is an overloaded function.
6037 Copying it would destroy the tree link. */
6038 if (TREE_CODE (rhs
) != OVERLOAD
)
6039 rhs
= copy_node (rhs
);
6041 /* This should really only be used when attempting to distinguish
6042 what sort of a pointer to function we have. For now, any
6043 arithmetic operation which is not supported on pointers
6044 is rejected as an error. */
6046 switch (TREE_CODE (rhs
))
6053 my_friendly_abort (177);
6054 return error_mark_node
;
6061 new_rhs
= instantiate_type (build_pointer_type (lhstype
),
6062 TREE_OPERAND (rhs
, 0), flags
);
6063 if (new_rhs
== error_mark_node
)
6064 return error_mark_node
;
6066 TREE_TYPE (rhs
) = lhstype
;
6067 TREE_OPERAND (rhs
, 0) = new_rhs
;
6072 rhs
= copy_node (TREE_OPERAND (rhs
, 0));
6073 TREE_TYPE (rhs
) = unknown_type_node
;
6074 return instantiate_type (lhstype
, rhs
, flags
);
6077 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6080 rhs
= TREE_OPERAND (rhs
, 1);
6081 if (BASELINK_P (rhs
))
6082 return instantiate_type (lhstype
, TREE_VALUE (rhs
),
6083 flags
| allow_ptrmem
);
6085 /* This can happen if we are forming a pointer-to-member for a
6087 my_friendly_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
, 0);
6091 case TEMPLATE_ID_EXPR
:
6093 tree fns
= TREE_OPERAND (rhs
, 0);
6094 tree args
= TREE_OPERAND (rhs
, 1);
6097 resolve_address_of_overloaded_function (lhstype
,
6101 /*template_only=*/1,
6107 resolve_address_of_overloaded_function (lhstype
,
6111 /*template_only=*/0,
6112 /*explicit_targs=*/NULL_TREE
);
6115 /* Now we should have a baselink. */
6116 my_friendly_assert (BASELINK_P (rhs
), 990412);
6118 return instantiate_type (lhstype
, TREE_VALUE (rhs
), flags
);
6121 /* This is too hard for now. */
6122 my_friendly_abort (183);
6123 return error_mark_node
;
6128 TREE_OPERAND (rhs
, 0)
6129 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
6130 if (TREE_OPERAND (rhs
, 0) == error_mark_node
)
6131 return error_mark_node
;
6132 TREE_OPERAND (rhs
, 1)
6133 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6134 if (TREE_OPERAND (rhs
, 1) == error_mark_node
)
6135 return error_mark_node
;
6137 TREE_TYPE (rhs
) = lhstype
;
6141 case TRUNC_DIV_EXPR
:
6142 case FLOOR_DIV_EXPR
:
6144 case ROUND_DIV_EXPR
:
6146 case TRUNC_MOD_EXPR
:
6147 case FLOOR_MOD_EXPR
:
6149 case ROUND_MOD_EXPR
:
6150 case FIX_ROUND_EXPR
:
6151 case FIX_FLOOR_EXPR
:
6153 case FIX_TRUNC_EXPR
:
6169 case PREINCREMENT_EXPR
:
6170 case PREDECREMENT_EXPR
:
6171 case POSTINCREMENT_EXPR
:
6172 case POSTDECREMENT_EXPR
:
6174 error ("invalid operation on uninstantiated type");
6175 return error_mark_node
;
6177 case TRUTH_AND_EXPR
:
6179 case TRUTH_XOR_EXPR
:
6186 case TRUTH_ANDIF_EXPR
:
6187 case TRUTH_ORIF_EXPR
:
6188 case TRUTH_NOT_EXPR
:
6190 error ("not enough type information");
6191 return error_mark_node
;
6194 if (type_unknown_p (TREE_OPERAND (rhs
, 0)))
6197 error ("not enough type information");
6198 return error_mark_node
;
6200 TREE_OPERAND (rhs
, 1)
6201 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6202 if (TREE_OPERAND (rhs
, 1) == error_mark_node
)
6203 return error_mark_node
;
6204 TREE_OPERAND (rhs
, 2)
6205 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 2), flags
);
6206 if (TREE_OPERAND (rhs
, 2) == error_mark_node
)
6207 return error_mark_node
;
6209 TREE_TYPE (rhs
) = lhstype
;
6213 TREE_OPERAND (rhs
, 1)
6214 = instantiate_type (lhstype
, TREE_OPERAND (rhs
, 1), flags
);
6215 if (TREE_OPERAND (rhs
, 1) == error_mark_node
)
6216 return error_mark_node
;
6218 TREE_TYPE (rhs
) = lhstype
;
6223 if (PTRMEM_OK_P (rhs
))
6224 flags
|= itf_ptrmem_ok
;
6226 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
6228 case ENTRY_VALUE_EXPR
:
6229 my_friendly_abort (184);
6230 return error_mark_node
;
6233 return error_mark_node
;
6236 my_friendly_abort (185);
6237 return error_mark_node
;
6241 /* Return the name of the virtual function pointer field
6242 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6243 this may have to look back through base types to find the
6244 ultimate field name. (For single inheritance, these could
6245 all be the same name. Who knows for multiple inheritance). */
6248 get_vfield_name (type
)
6251 tree binfo
= TYPE_BINFO (type
);
6254 while (BINFO_BASETYPES (binfo
)
6255 && TYPE_CONTAINS_VPTR_P (BINFO_TYPE (BINFO_BASETYPE (binfo
, 0)))
6256 && ! TREE_VIA_VIRTUAL (BINFO_BASETYPE (binfo
, 0)))
6257 binfo
= BINFO_BASETYPE (binfo
, 0);
6259 type
= BINFO_TYPE (binfo
);
6260 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
6261 + TYPE_NAME_LENGTH (type
) + 2);
6262 sprintf (buf
, VFIELD_NAME_FORMAT
, TYPE_NAME_STRING (type
));
6263 return get_identifier (buf
);
6267 print_class_statistics ()
6269 #ifdef GATHER_STATISTICS
6270 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
6271 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
6272 fprintf (stderr
, "build_method_call = %d (inner = %d)\n",
6273 n_build_method_call
, n_inner_fields_searched
);
6276 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
6277 n_vtables
, n_vtable_searches
);
6278 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
6279 n_vtable_entries
, n_vtable_elems
);
6284 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6285 according to [class]:
6286 The class-name is also inserted
6287 into the scope of the class itself. For purposes of access checking,
6288 the inserted class name is treated as if it were a public member name. */
6291 build_self_reference ()
6293 tree name
= constructor_name (current_class_type
);
6294 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
6297 DECL_NONLOCAL (value
) = 1;
6298 DECL_CONTEXT (value
) = current_class_type
;
6299 DECL_ARTIFICIAL (value
) = 1;
6301 if (processing_template_decl
)
6302 value
= push_template_decl (value
);
6304 saved_cas
= current_access_specifier
;
6305 current_access_specifier
= access_public_node
;
6306 finish_member_declaration (value
);
6307 current_access_specifier
= saved_cas
;
6310 /* Returns 1 if TYPE contains only padding bytes. */
6313 is_empty_class (type
)
6318 if (type
== error_mark_node
)
6321 if (! IS_AGGR_TYPE (type
))
6325 return integer_zerop (CLASSTYPE_SIZE (type
));
6327 if (TYPE_BINFO_BASETYPES (type
))
6329 t
= TYPE_FIELDS (type
);
6330 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
6332 return (t
== NULL_TREE
);
6335 /* Find the enclosing class of the given NODE. NODE can be a *_DECL or
6336 a *_TYPE node. NODE can also be a local class. */
6339 get_enclosing_class (type
)
6344 while (node
&& TREE_CODE (node
) != NAMESPACE_DECL
)
6346 switch (TREE_CODE_CLASS (TREE_CODE (node
)))
6349 node
= DECL_CONTEXT (node
);
6355 node
= TYPE_CONTEXT (node
);
6359 my_friendly_abort (0);
6365 /* Return 1 if TYPE or one of its enclosing classes is derived from BASE. */
6368 is_base_of_enclosing_class (base
, type
)
6373 if (get_binfo (base
, type
, 0))
6376 type
= get_enclosing_class (type
);
6381 /* Note that NAME was looked up while the current class was being
6382 defined and that the result of that lookup was DECL. */
6385 maybe_note_name_used_in_class (name
, decl
)
6389 splay_tree names_used
;
6391 /* If we're not defining a class, there's nothing to do. */
6392 if (!current_class_type
|| !TYPE_BEING_DEFINED (current_class_type
))
6395 /* If there's already a binding for this NAME, then we don't have
6396 anything to worry about. */
6397 if (IDENTIFIER_CLASS_VALUE (name
))
6400 if (!current_class_stack
[current_class_depth
- 1].names_used
)
6401 current_class_stack
[current_class_depth
- 1].names_used
6402 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
6403 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
6405 splay_tree_insert (names_used
,
6406 (splay_tree_key
) name
,
6407 (splay_tree_value
) decl
);
6410 /* Note that NAME was declared (as DECL) in the current class. Check
6411 to see that the declaration is legal. */
6414 note_name_declared_in_class (name
, decl
)
6418 splay_tree names_used
;
6421 /* Look to see if we ever used this name. */
6423 = current_class_stack
[current_class_depth
- 1].names_used
;
6427 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
6430 /* [basic.scope.class]
6432 A name N used in a class S shall refer to the same declaration
6433 in its context and when re-evaluated in the completed scope of
6435 cp_error ("declaration of `%#D'", decl
);
6436 cp_error_at ("changes meaning of `%s' from `%+#D'",
6437 IDENTIFIER_POINTER (DECL_NAME (OVL_CURRENT (decl
))),
6442 /* Returns the VAR_DECL for the complete vtable associated with
6443 BINFO. (Under the new ABI, secondary vtables are merged with
6444 primary vtables; this function will return the VAR_DECL for the
6448 get_vtbl_decl_for_binfo (binfo
)
6453 decl
= BINFO_VTABLE (binfo
);
6454 if (decl
&& TREE_CODE (decl
) == PLUS_EXPR
)
6456 my_friendly_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
,
6458 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
6461 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 20000403);
6465 /* Called from get_primary_binfo via dfs_walk. */
6468 dfs_get_primary_binfo (binfo
, data
)
6472 tree primary_base
= (tree
) data
;
6474 if (TREE_VIA_VIRTUAL (binfo
)
6475 && same_type_p (TREE_TYPE (binfo
), TREE_TYPE (primary_base
)))
6481 /* Returns the binfo for the primary base of BINFO. Note that in a
6482 complex hierarchy the resulting BINFO may not actually *be*
6483 primary. In particular if the resulting BINFO is a virtual base,
6484 and it occurs elsewhere in the hierarchy, then this occurrence may
6485 not actually be a primary base in the complete object. Check
6486 BINFO_PRIMARY_MARKED_P to be sure. */
6489 get_primary_binfo (binfo
)
6495 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
6499 /* A non-virtual primary base is always a direct base, and easy to
6501 if (!TREE_VIA_VIRTUAL (primary_base
))
6505 /* Scan the direct basetypes until we find a base with the same
6506 type as the primary base. */
6507 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
6509 tree base_binfo
= BINFO_BASETYPE (binfo
, i
);
6511 if (same_type_p (BINFO_TYPE (base_binfo
),
6512 BINFO_TYPE (primary_base
)))
6516 /* We should always find the primary base. */
6517 my_friendly_abort (20000729);
6520 /* For a primary virtual base, we have to scan the entire hierarchy
6521 rooted at BINFO; the virtual base could be an indirect virtual
6523 result
= dfs_walk (binfo
, dfs_get_primary_binfo
, NULL
, primary_base
);
6524 my_friendly_assert (result
!= NULL_TREE
, 20000730);
6528 /* Dump the offsets of all the bases rooted at BINFO (in the hierarchy
6529 dominated by T) to stderr. INDENT should be zero when called from
6530 the top level; it is incremented recursively. */
6533 dump_class_hierarchy_r (t
, binfo
, indent
)
6540 fprintf (stderr
, "%*s0x%lx (%s) ", indent
, "",
6541 (unsigned long) binfo
,
6542 type_as_string (binfo
, TS_PLAIN
));
6543 fprintf (stderr
, HOST_WIDE_INT_PRINT_DEC
,
6544 tree_low_cst (BINFO_OFFSET (binfo
), 0));
6545 if (TREE_VIA_VIRTUAL (binfo
))
6546 fprintf (stderr
, " virtual");
6547 if (BINFO_PRIMARY_MARKED_P (binfo
)
6548 || (TREE_VIA_VIRTUAL (binfo
)
6549 && BINFO_PRIMARY_MARKED_P (binfo_for_vbase (BINFO_TYPE (binfo
),
6551 fprintf (stderr
, " primary");
6552 fprintf (stderr
, "\n");
6554 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
6555 dump_class_hierarchy_r (t
, BINFO_BASETYPE (binfo
, i
), indent
+ 2);
6558 /* Dump the BINFO hierarchy for T. */
6561 dump_class_hierarchy (t
)
6564 dump_class_hierarchy_r (t
, TYPE_BINFO (t
), 0);
6567 /* Virtual function table initialization. */
6569 /* Create all the necessary vtables for T and its base classes. */
6575 if (merge_primary_and_secondary_vtables_p ())
6580 /* Under the new ABI, we lay out the primary and secondary
6581 vtables in one contiguous vtable. The primary vtable is
6582 first, followed by the non-virtual secondary vtables in
6583 inheritance graph order. */
6584 list
= build_tree_list (TYPE_BINFO_VTABLE (t
), NULL_TREE
);
6585 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
),
6586 TYPE_BINFO (t
), t
, list
);
6587 /* Then come the virtual bases, also in inheritance graph
6589 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
6591 if (!TREE_VIA_VIRTUAL (vbase
))
6594 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), t
, list
);
6597 if (TYPE_BINFO_VTABLE (t
))
6598 initialize_vtable (TYPE_BINFO (t
), TREE_VALUE (list
));
6602 dfs_walk (TYPE_BINFO (t
), dfs_finish_vtbls
,
6603 dfs_unmarked_real_bases_queue_p
, t
);
6604 dfs_walk (TYPE_BINFO (t
), dfs_unmark
,
6605 dfs_marked_real_bases_queue_p
, t
);
6609 /* Called from finish_vtbls via dfs_walk. */
6612 dfs_finish_vtbls (binfo
, data
)
6616 tree t
= (tree
) data
;
6618 if (BINFO_NEW_VTABLE_MARKED (binfo
, t
))
6619 initialize_vtable (binfo
,
6620 build_vtbl_initializer (binfo
, binfo
, t
,
6621 TYPE_BINFO (t
), NULL
));
6623 SET_BINFO_MARKED (binfo
);
6628 /* Initialize the vtable for BINFO with the INITS. */
6631 initialize_vtable (binfo
, inits
)
6637 layout_vtable_decl (binfo
, list_length (inits
));
6638 decl
= get_vtbl_decl_for_binfo (binfo
);
6639 initialize_array (decl
, inits
);
6642 /* Initialize DECL (a declaration for a namespace-scope array) with
6646 initialize_array (decl
, inits
)
6652 context
= DECL_CONTEXT (decl
);
6653 DECL_CONTEXT (decl
) = NULL_TREE
;
6654 DECL_INITIAL (decl
) = build_nt (CONSTRUCTOR
, NULL_TREE
, inits
);
6655 cp_finish_decl (decl
, DECL_INITIAL (decl
), NULL_TREE
, 0);
6656 DECL_CONTEXT (decl
) = context
;
6659 /* Build the VTT (virtual table table) for T. */
6670 /* Under the old ABI, we don't use VTTs. */
6674 /* Build up the initializers for the VTT. */
6676 index
= size_zero_node
;
6677 build_vtt_inits (TYPE_BINFO (t
), t
, /*virtual_vtts_p=*/1,
6680 /* If we didn't need a VTT, we're done. */
6684 /* Figure out the type of the VTT. */
6685 type
= build_index_type (size_int (list_length (inits
)));
6686 type
= build_cplus_array_type (const_ptr_type_node
, type
);
6688 /* Now, build the VTT object itself. */
6689 vtt
= build_vtable (t
, get_vtt_name (t
), type
);
6690 pushdecl_top_level (vtt
);
6691 initialize_array (vtt
, inits
);
6694 /* The type corresponding to BINFO is a base class of T, but BINFO is
6695 in the base class hierarchy of a class derived from T. Return the
6696 base, in T's hierarchy, that corresponds to BINFO. */
6699 get_matching_base (binfo
, t
)
6706 if (same_type_p (BINFO_TYPE (binfo
), t
))
6709 if (TREE_VIA_VIRTUAL (binfo
))
6710 return binfo_for_vbase (BINFO_TYPE (binfo
), t
);
6712 derived
= get_matching_base (BINFO_INHERITANCE_CHAIN (binfo
), t
);
6713 for (i
= 0; i
< BINFO_N_BASETYPES (derived
); ++i
)
6714 if (same_type_p (BINFO_TYPE (BINFO_BASETYPE (derived
, i
)),
6715 BINFO_TYPE (binfo
)))
6716 return BINFO_BASETYPE (derived
, i
);
6718 my_friendly_abort (20000628);
6722 /* Recursively build the VTT-initializer for BINFO (which is in the
6723 hierarchy dominated by T). If VIRTUAL_VTTS_P is non-zero, then
6724 sub-VTTs for virtual bases are included. INITS points to the end
6725 of the initializer list to date. INDEX is the VTT index where the
6726 next element will be placed. */
6729 build_vtt_inits (binfo
, t
, virtual_vtts_p
, inits
, index
)
6739 tree secondary_vptrs
;
6742 /* We only need VTTs for subobjects with virtual bases. */
6743 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
)))
6746 /* We need to use a construction vtable if this is not the primary
6748 ctor_vtbl_p
= !same_type_p (TREE_TYPE (binfo
), t
);
6751 build_ctor_vtbl_group (binfo
, t
);
6753 /* Record the offset in the VTT where this sub-VTT can be found. */
6754 BINFO_SUBVTT_INDEX (binfo
) = *index
;
6757 /* Add the address of the primary vtable for the complete object. */
6758 init
= BINFO_VTABLE (binfo
);
6759 if (TREE_CODE (init
) == TREE_LIST
)
6760 init
= TREE_VALUE (init
);
6761 *inits
= build_tree_list (NULL_TREE
, init
);
6762 inits
= &TREE_CHAIN (*inits
);
6763 BINFO_VPTR_INDEX (binfo
) = *index
;
6764 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
6766 /* Recursively add the secondary VTTs for non-virtual bases. */
6767 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
6769 b
= BINFO_BASETYPE (binfo
, i
);
6770 if (!TREE_VIA_VIRTUAL (b
))
6771 inits
= build_vtt_inits (BINFO_BASETYPE (binfo
, i
), t
,
6772 /*virtuals_vtts_p=*/0,
6776 /* Add secondary virtual pointers for all subobjects of BINFO with
6777 either virtual bases or virtual functions overridden along a
6778 virtual path between the declaration and D, except subobjects
6779 that are non-virtual primary bases. */
6780 secondary_vptrs
= tree_cons (t
, NULL_TREE
, BINFO_TYPE (binfo
));
6781 TREE_TYPE (secondary_vptrs
) = *index
;
6782 dfs_walk_real (binfo
,
6783 dfs_build_secondary_vptr_vtt_inits
,
6785 dfs_unmarked_real_bases_queue_p
,
6787 dfs_walk (binfo
, dfs_unmark
, dfs_marked_real_bases_queue_p
, t
);
6788 *index
= TREE_TYPE (secondary_vptrs
);
6790 /* The secondary vptrs come back in reverse order. After we reverse
6791 them, and add the INITS, the last init will be the first element
6793 secondary_vptrs
= TREE_VALUE (secondary_vptrs
);
6794 if (secondary_vptrs
)
6796 *inits
= nreverse (secondary_vptrs
);
6797 inits
= &TREE_CHAIN (secondary_vptrs
);
6798 my_friendly_assert (*inits
== NULL_TREE
, 20000517);
6801 /* Add the secondary VTTs for virtual bases. */
6803 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
6807 if (!TREE_VIA_VIRTUAL (b
))
6810 vbase
= binfo_for_vbase (BINFO_TYPE (b
), t
);
6811 inits
= build_vtt_inits (vbase
, t
, /*virtual_vtts_p=*/0,
6815 dfs_walk (binfo
, dfs_fixup_binfo_vtbls
,
6816 dfs_unmarked_real_bases_queue_p
,
6817 build_tree_list (t
, binfo
));
6822 /* Called from build_vtt_inits via dfs_walk. */
6825 dfs_build_secondary_vptr_vtt_inits (binfo
, data
)
6837 SET_BINFO_MARKED (binfo
);
6839 /* We don't care about bases that don't have vtables. */
6840 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
6843 /* We're only interested in proper subobjects of T. */
6844 if (same_type_p (BINFO_TYPE (binfo
), t
))
6847 /* We're not interested in non-virtual primary bases. */
6848 if (!TREE_VIA_VIRTUAL (binfo
) && BINFO_PRIMARY_MARKED_P (binfo
))
6851 /* If BINFO doesn't have virtual bases, then we have to look to see
6852 whether or not any virtual functions were overidden along a
6853 virtual path. The point is that given:
6855 struct V { virtual void f(); int i; };
6856 struct C : public virtual V { void f (); };
6858 when we constrct C we need a secondary vptr for V-in-C because we
6859 don't know what the vcall offset for `f' should be. If `V' ends
6860 up in a different place in the complete object, then we'll need a
6861 different vcall offset than that present in the normal V-in-C
6863 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
))
6864 && !BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P (get_matching_base (binfo
, t
)))
6867 /* Record the index where this secondary vptr can be found. */
6868 index
= TREE_TYPE (l
);
6869 BINFO_VPTR_INDEX (binfo
) = index
;
6870 TREE_TYPE (l
) = size_binop (PLUS_EXPR
, index
,
6871 TYPE_SIZE_UNIT (ptr_type_node
));
6873 /* Add the initializer for the secondary vptr itself. */
6874 init
= BINFO_VTABLE (binfo
);
6875 if (TREE_CODE (init
) == TREE_LIST
)
6876 init
= TREE_VALUE (init
);
6877 TREE_VALUE (l
) = tree_cons (NULL_TREE
, init
, TREE_VALUE (l
));
6882 /* Called from build_vtt_inits via dfs_walk. */
6885 dfs_fixup_binfo_vtbls (binfo
, data
)
6889 CLEAR_BINFO_MARKED (binfo
);
6891 /* We don't care about bases that don't have vtables. */
6892 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
6895 /* If we scribbled the construction vtable vptr into BINFO, clear it
6897 if (TREE_CODE (BINFO_VTABLE (binfo
)) == TREE_LIST
6898 && (TREE_PURPOSE (BINFO_VTABLE (binfo
))
6899 == TREE_VALUE ((tree
) data
)))
6900 BINFO_VTABLE (binfo
) = TREE_CHAIN (BINFO_VTABLE (binfo
));
6905 /* Build the construction vtable group for BINFO which is in the
6906 hierarchy dominated by T. */
6909 build_ctor_vtbl_group (binfo
, t
)
6920 /* See if we've already create this construction vtable group. */
6922 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
6924 id
= get_ctor_vtbl_name (t
, binfo
);
6925 if (IDENTIFIER_GLOBAL_VALUE (id
))
6928 /* Build a version of VTBL (with the wrong type) for use in
6929 constructing the addresses of secondary vtables in the
6930 construction vtable group. */
6931 vtbl
= build_vtable (t
, id
, ptr_type_node
);
6932 list
= build_tree_list (vtbl
, NULL_TREE
);
6933 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
6935 for (vbase
= TYPE_BINFO (TREE_TYPE (binfo
));
6937 vbase
= TREE_CHAIN (vbase
))
6941 if (!TREE_VIA_VIRTUAL (vbase
))
6944 b
= binfo_for_vbase (BINFO_TYPE (vbase
), t
);
6945 accumulate_vtbl_inits (b
, vbase
, binfo
, t
, list
);
6948 inits
= TREE_VALUE (list
);
6950 /* Figure out the type of the construction vtable. */
6951 type
= build_index_type (size_int (list_length (inits
)));
6952 type
= build_cplus_array_type (vtable_entry_type
, type
);
6953 TREE_TYPE (vtbl
) = type
;
6955 /* Initialize the construction vtable. */
6956 pushdecl_top_level (vtbl
);
6957 initialize_array (vtbl
, inits
);
6960 /* Add the vtbl initializers for BINFO (and its non-primary,
6961 non-virtual bases) to the list of INITS. BINFO is in the hierarchy
6962 dominated by T. ORIG_BINFO must have the same type as BINFO, but
6963 may be different from BINFO if we are building a construction
6964 vtable. RTTI_BINFO gives the object that should be used as the
6965 complete object for BINFO. */
6968 accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, t
, inits
)
6978 my_friendly_assert (same_type_p (BINFO_TYPE (binfo
),
6979 BINFO_TYPE (orig_binfo
)),
6982 /* This is a construction vtable if the RTTI type is not the most
6983 derived type in the hierarchy. */
6984 ctor_vtbl_p
= !same_type_p (BINFO_TYPE (rtti_binfo
), t
);
6986 /* If we're building a construction vtable, we're not interested in
6987 subobjects that don't require construction vtables. */
6989 && !TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
))
6990 && !(BINFO_OVERRIDE_ALONG_VIRTUAL_PATH_P
6991 (get_matching_base (binfo
, BINFO_TYPE (rtti_binfo
)))))
6994 /* Build the initializers for the BINFO-in-T vtable. */
6996 = chainon (TREE_VALUE (inits
),
6997 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
,
6998 rtti_binfo
, t
, inits
));
7000 /* Walk the BINFO and its bases. We walk in preorder so that as we
7001 initialize each vtable we can figure out at what offset the
7002 secondary vtable lies from the primary vtable. We can't use
7003 dfs_walk here because we need to iterate through bases of BINFO
7004 and RTTI_BINFO simultaneously. */
7005 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
7009 base_binfo
= BINFO_BASETYPE (binfo
, i
);
7010 /* Skip virtual bases. */
7011 if (TREE_VIA_VIRTUAL (base_binfo
))
7013 accumulate_vtbl_inits (base_binfo
,
7014 BINFO_BASETYPE (orig_binfo
, i
),
7021 /* Called from finish_vtbls via dfs_walk when using the new ABI.
7022 Accumulates the vtable initializers for all of the vtables into
7023 TREE_VALUE (DATA). Returns the initializers for the BINFO vtable. */
7026 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, t
, l
)
7033 tree inits
= NULL_TREE
;
7035 if (BINFO_NEW_VTABLE_MARKED (orig_binfo
, t
))
7041 /* Compute the initializer for this vtable. */
7042 inits
= build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
7045 /* Figure out the position to which the VPTR should point. */
7046 vtbl
= TREE_PURPOSE (l
);
7047 vtbl
= build1 (ADDR_EXPR
,
7050 index
= size_binop (PLUS_EXPR
,
7051 size_int (non_fn_entries
),
7052 size_int (list_length (TREE_VALUE (l
))));
7053 index
= size_binop (MULT_EXPR
,
7054 TYPE_SIZE_UNIT (vtable_entry_type
),
7056 vtbl
= build (PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
, index
);
7057 TREE_CONSTANT (vtbl
) = 1;
7059 /* For an ordinary vtable, set BINFO_VTABLE. */
7060 if (same_type_p (BINFO_TYPE (rtti_binfo
), t
))
7061 BINFO_VTABLE (binfo
) = vtbl
;
7062 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7063 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7064 straighten this out. */
7066 BINFO_VTABLE (binfo
) =
7067 tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
7073 /* Construct the initializer for BINFOs virtual function table. BINFO
7074 is part of the hierarchy dominated by T. If we're building a
7075 construction vtable, the ORIG_BINFO is the binfo we should use to
7076 find the actual function pointers to put in the vtable. Otherwise,
7077 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7078 BINFO that should be indicated by the RTTI information in the
7079 vtable; it will be a base class of T, rather than T itself, if we
7080 are building a construction vtable.
7082 The value returned is a TREE_LIST suitable for wrapping in a
7083 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7084 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7085 number of non-function entries in the vtable.
7087 It might seem that this function should never be called with a
7088 BINFO for which BINFO_PRIMARY_MARKED_P holds, the vtable for such a
7089 base is always subsumed by a derived class vtable. However, when
7090 we are building construction vtables we do build vtables for
7091 primary bases; we need these while the primary base is being
7095 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
, non_fn_entries_p
)
7100 int *non_fn_entries_p
;
7107 /* Initialize VID. */
7108 bzero (&vid
, sizeof (vid
));
7111 vid
.last_init
= &vid
.inits
;
7112 vid
.primary_vtbl_p
= (binfo
== TYPE_BINFO (t
));
7113 vid
.ctor_vtbl_p
= !same_type_p (BINFO_TYPE (rtti_binfo
), t
);
7114 /* The first vbase or vcall offset is at index -3 in the vtable. */
7115 vid
.index
= ssize_int (-3);
7117 /* Add entries to the vtable for RTTI. */
7118 build_rtti_vtbl_entries (binfo
, rtti_binfo
, &vid
);
7120 /* Create an array for keeping track of the functions we've
7121 processed. When we see multiple functions with the same
7122 signature, we share the vcall offsets. */
7123 VARRAY_TREE_INIT (vid
.fns
, 32, "fns");
7124 /* Add the vcall and vbase offset entries. */
7125 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
7127 VARRAY_FREE (vid
.fns
);
7128 /* Clear BINFO_VTABLE_PAATH_MARKED; it's set by
7129 build_vbase_offset_vtbl_entries. */
7130 for (vbase
= CLASSTYPE_VBASECLASSES (t
);
7132 vbase
= TREE_CHAIN (vbase
))
7133 CLEAR_BINFO_VTABLE_PATH_MARKED (TREE_VALUE (vbase
));
7135 if (non_fn_entries_p
)
7136 *non_fn_entries_p
= list_length (vid
.inits
);
7138 /* Go through all the ordinary virtual functions, building up
7140 vfun_inits
= NULL_TREE
;
7141 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
7149 /* Pull the offset for `this', and the function to call, out of
7151 delta
= BV_DELTA (v
);
7153 if (BV_USE_VCALL_INDEX_P (v
))
7155 vcall_index
= BV_VCALL_INDEX (v
);
7156 my_friendly_assert (vcall_index
!= NULL_TREE
, 20000621);
7159 vcall_index
= NULL_TREE
;
7162 my_friendly_assert (TREE_CODE (delta
) == INTEGER_CST
, 19990727);
7163 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
, 19990727);
7165 /* You can't call an abstract virtual function; it's abstract.
7166 So, we replace these functions with __pure_virtual. */
7167 if (DECL_PURE_VIRTUAL_P (fn
))
7170 /* Take the address of the function, considering it to be of an
7171 appropriate generic type. */
7172 pfn
= build1 (ADDR_EXPR
, vfunc_ptr_type_node
, fn
);
7173 /* The address of a function can't change. */
7174 TREE_CONSTANT (pfn
) = 1;
7175 /* Enter it in the vtable. */
7176 init
= build_vtable_entry (delta
, vcall_index
, pfn
,
7177 BV_GENERATE_THUNK_WITH_VTABLE_P (v
));
7178 /* And add it to the chain of initializers. */
7179 vfun_inits
= tree_cons (NULL_TREE
, init
, vfun_inits
);
7182 /* The initializers for virtual functions were built up in reverse
7183 order; straighten them out now. */
7184 vfun_inits
= nreverse (vfun_inits
);
7186 /* The negative offset initializers are also in reverse order. */
7187 vid
.inits
= nreverse (vid
.inits
);
7189 /* Chain the two together. */
7190 return chainon (vid
.inits
, vfun_inits
);
7193 /* Sets vid->inits to be the initializers for the vbase and vcall
7194 offsets in BINFO, which is in the hierarchy dominated by T. */
7197 build_vcall_and_vbase_vtbl_entries (binfo
, vid
)
7199 vtbl_init_data
*vid
;
7203 /* If this is a derived class, we must first create entries
7204 corresponding to the primary base class. */
7205 b
= get_primary_binfo (binfo
);
7207 build_vcall_and_vbase_vtbl_entries (b
, vid
);
7209 /* Add the vbase entries for this base. */
7210 build_vbase_offset_vtbl_entries (binfo
, vid
);
7211 /* Add the vcall entries for this base. */
7212 build_vcall_offset_vtbl_entries (binfo
, vid
);
7215 /* Returns the initializers for the vbase offset entries in the vtable
7216 for BINFO (which is part of the class hierarchy dominated by T), in
7217 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7218 where the next vbase offset will go. */
7221 build_vbase_offset_vtbl_entries (binfo
, vid
)
7223 vtbl_init_data
*vid
;
7228 /* Under the old ABI, pointers to virtual bases are stored in each
7230 if (!vbase_offsets_in_vtable_p ())
7233 /* If there are no virtual baseclasses, then there is nothing to
7235 if (!TYPE_USES_VIRTUAL_BASECLASSES (BINFO_TYPE (binfo
)))
7240 /* Go through the virtual bases, adding the offsets. */
7241 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
7243 vbase
= TREE_CHAIN (vbase
))
7248 if (!TREE_VIA_VIRTUAL (vbase
))
7251 /* Find the instance of this virtual base in the complete
7253 b
= binfo_for_vbase (BINFO_TYPE (vbase
), t
);
7255 /* If we've already got an offset for this virtual base, we
7256 don't need another one. */
7257 if (BINFO_VTABLE_PATH_MARKED (b
))
7259 SET_BINFO_VTABLE_PATH_MARKED (b
);
7261 /* Figure out where we can find this vbase offset. */
7262 delta
= size_binop (MULT_EXPR
,
7265 TYPE_SIZE_UNIT (vtable_entry_type
)));
7266 if (vid
->primary_vtbl_p
)
7267 BINFO_VPTR_FIELD (b
) = delta
;
7269 if (binfo
!= TYPE_BINFO (t
))
7273 /* Find the instance of this virtual base in the type of BINFO. */
7274 orig_vbase
= binfo_for_vbase (BINFO_TYPE (vbase
),
7275 BINFO_TYPE (binfo
));
7277 /* The vbase offset had better be the same. */
7278 if (!tree_int_cst_equal (delta
,
7279 BINFO_VPTR_FIELD (orig_vbase
)))
7280 my_friendly_abort (20000403);
7283 /* The next vbase will come at a more negative offset. */
7284 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
, ssize_int (1));
7286 /* The initializer is the delta from BINFO to this virtual base.
7287 The vbase offsets go in reverse inheritance-graph order, and
7288 we are walking in inheritance graph order so these end up in
7290 delta
= size_diffop (BINFO_OFFSET (b
), BINFO_OFFSET (binfo
));
7292 = build_tree_list (NULL_TREE
,
7293 fold (build1 (NOP_EXPR
,
7296 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);
7300 /* Adds the initializers for the vcall offset entries in the vtable
7301 for BINFO (which is part of the class hierarchy dominated by T) to
7305 build_vcall_offset_vtbl_entries (binfo
, vid
)
7307 vtbl_init_data
*vid
;
7309 /* Under the old ABI, the adjustments to the `this' pointer were made
7311 if (!vcall_offsets_in_vtable_p ())
7314 /* We only need these entries if this base is a virtual base. */
7315 if (!TREE_VIA_VIRTUAL (binfo
))
7318 /* We need a vcall offset for each of the virtual functions in this
7319 vtable. For example:
7321 class A { virtual void f (); };
7322 class B : virtual public A { };
7323 class C: virtual public A, public B {};
7330 The location of `A' is not at a fixed offset relative to `B'; the
7331 offset depends on the complete object derived from `B'. So,
7332 `B' vtable contains an entry for `f' that indicates by what
7333 amount the `this' pointer for `B' needs to be adjusted to arrive
7336 We need entries for all the functions in our primary vtable and
7337 in our non-virtual bases vtables. */
7339 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7340 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
7343 /* Build vcall offsets, starting with those for BINFO. */
7346 add_vcall_offset_vtbl_entries_r (binfo
, vid
)
7348 vtbl_init_data
*vid
;
7353 /* Don't walk into virtual bases -- except, of course, for the
7354 virtual base for which we are building vcall offsets. */
7355 if (TREE_VIA_VIRTUAL (binfo
) && vid
->vbase
!= binfo
)
7358 /* If BINFO has a primary base, process it first. */
7359 primary_binfo
= get_primary_binfo (binfo
);
7361 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
7363 /* Add BINFO itself to the list. */
7364 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
7366 /* Scan the non-primary bases of BINFO. */
7367 for (i
= 0; i
< BINFO_N_BASETYPES (binfo
); ++i
)
7371 base_binfo
= BINFO_BASETYPE (binfo
, i
);
7372 if (base_binfo
!= primary_binfo
)
7373 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
7377 /* Called from build_vcall_offset_vtbl_entries via dfs_walk. */
7380 add_vcall_offset_vtbl_entries_1 (binfo
, vid
)
7382 vtbl_init_data
* vid
;
7384 tree derived_virtuals
;
7388 /* If BINFO is a primary base, this is the least derived class of
7389 BINFO that is not a primary base. */
7390 tree non_primary_binfo
;
7392 binfo_inits
= NULL_TREE
;
7394 /* We might be a primary base class. Go up the inheritance
7395 hierarchy until we find the class of which we are a primary base:
7396 it is the BINFO_VIRTUALS there that we need to consider. */
7397 non_primary_binfo
= binfo
;
7398 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
7402 /* If we have reached a virtual base, then it must be the
7403 virtual base for which we are building vcall offsets. In
7404 turn, the virtual base must be a (possibly indirect) primary
7405 base of the class that we are initializing, or we wouldn't
7406 care about its vtable offsets. */
7407 if (TREE_VIA_VIRTUAL (non_primary_binfo
))
7409 non_primary_binfo
= vid
->binfo
;
7413 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
7414 if (get_primary_binfo (b
) != non_primary_binfo
)
7416 non_primary_binfo
= b
;
7419 /* Make entries for the rest of the virtuals. */
7420 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
7421 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
7422 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
7424 base_virtuals
= TREE_CHAIN (base_virtuals
),
7425 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
7426 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
7434 /* Find the declaration that originally caused this function to
7436 orig_fn
= BV_FN (orig_virtuals
);
7438 /* We do not need an entry if this function is declared in a
7439 virtual base (or one of its virtual bases), and not
7440 overridden in the section of the hierarchy dominated by the
7441 virtual base for which we are building vcall offsets. */
7442 if (!same_type_p (DECL_CONTEXT (orig_fn
), BINFO_TYPE (binfo
)))
7445 /* Find the overriding function. */
7446 fn
= BV_FN (derived_virtuals
);
7448 /* If there is already an entry for a function with the same
7449 signature as FN, then we do not need a second vcall offset.
7450 Check the list of functions already present in the derived
7452 for (i
= 0; i
< VARRAY_ACTIVE_SIZE (vid
->fns
); ++i
)
7456 derived_entry
= VARRAY_TREE (vid
->fns
, i
);
7457 if (same_signature_p (BV_FN (derived_entry
), fn
))
7459 BV_VCALL_INDEX (derived_virtuals
)
7460 = BV_VCALL_INDEX (derived_entry
);
7464 if (i
!= VARRAY_ACTIVE_SIZE (vid
->fns
))
7467 /* The FN comes from BASE. So, we must caculate the adjustment
7468 from the virtual base that derived from BINFO to BASE. */
7469 base
= DECL_CONTEXT (fn
);
7470 base_binfo
= get_binfo (base
, vid
->derived
, /*protect=*/0);
7472 /* Compute the vcall offset. */
7476 fold (build1 (NOP_EXPR
, vtable_entry_type
,
7477 size_diffop (BINFO_OFFSET (base_binfo
),
7478 BINFO_OFFSET (vid
->vbase
))))));
7479 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);
7481 /* Keep track of the vtable index where this vcall offset can be
7482 found. For a construction vtable, we already made this
7483 annotation when we build the original vtable. */
7484 if (!vid
->ctor_vtbl_p
)
7485 BV_VCALL_INDEX (derived_virtuals
) = vid
->index
;
7487 /* The next vcall offset will be found at a more negative
7489 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
, ssize_int (1));
7491 /* Keep track of this function. */
7492 VARRAY_PUSH_TREE (vid
->fns
, derived_virtuals
);
7496 /* Return vtbl initializers for the RTTI entries coresponding to the
7497 BINFO's vtable. The RTTI entries should indicate the object given
7501 build_rtti_vtbl_entries (binfo
, rtti_binfo
, vid
)
7504 vtbl_init_data
*vid
;
7513 basetype
= BINFO_TYPE (binfo
);
7514 t
= BINFO_TYPE (rtti_binfo
);
7516 /* For a COM object there is no RTTI entry. */
7517 if (CLASSTYPE_COM_INTERFACE (basetype
))
7520 /* To find the complete object, we will first convert to our most
7521 primary base, and then add the offset in the vtbl to that value. */
7523 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
)))
7527 primary_base
= get_primary_binfo (b
);
7528 if (!BINFO_PRIMARY_MARKED_P (primary_base
))
7532 offset
= size_diffop (BINFO_OFFSET (rtti_binfo
), BINFO_OFFSET (b
));
7534 /* The second entry is, in the case of the new ABI, the address of
7535 the typeinfo object, or, in the case of the old ABI, a function
7536 which returns a typeinfo object. */
7537 if (new_abi_rtti_p ())
7540 decl
= build_unary_op (ADDR_EXPR
, get_tinfo_decl (t
), 0);
7542 decl
= integer_zero_node
;
7544 /* Convert the declaration to a type that can be stored in the
7546 init
= build1 (NOP_EXPR
, vfunc_ptr_type_node
, decl
);
7547 TREE_CONSTANT (init
) = 1;
7552 decl
= get_tinfo_decl (t
);
7554 decl
= abort_fndecl
;
7556 /* Convert the declaration to a type that can be stored in the
7558 init
= build1 (ADDR_EXPR
, vfunc_ptr_type_node
, decl
);
7559 TREE_CONSTANT (init
) = 1;
7560 init
= build_vtable_entry (offset
, NULL_TREE
, init
,
7561 /*generate_with_vtable_p=*/0);
7563 *vid
->last_init
= build_tree_list (NULL_TREE
, init
);
7564 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);
7566 /* Add the offset-to-top entry. It comes earlier in the vtable that
7567 the the typeinfo entry. */
7568 if (flag_vtable_thunks
)
7570 /* Convert the offset to look like a function pointer, so that
7571 we can put it in the vtable. */
7572 init
= build1 (NOP_EXPR
, vfunc_ptr_type_node
, offset
);
7573 TREE_CONSTANT (init
) = 1;
7574 *vid
->last_init
= build_tree_list (NULL_TREE
, init
);
7575 vid
->last_init
= &TREE_CHAIN (*vid
->last_init
);
7579 /* Build an entry in the virtual function table. DELTA is the offset
7580 for the `this' pointer. VCALL_INDEX is the vtable index containing
7581 the vcall offset; zero if none. ENTRY is the virtual function
7582 table entry itself. It's TREE_TYPE must be VFUNC_PTR_TYPE_NODE,
7583 but it may not actually be a virtual function table pointer. (For
7584 example, it might be the address of the RTTI object, under the new
7588 build_vtable_entry (delta
, vcall_index
, entry
, generate_with_vtable_p
)
7592 int generate_with_vtable_p
;
7594 if (flag_vtable_thunks
)
7598 fn
= TREE_OPERAND (entry
, 0);
7599 if ((!integer_zerop (delta
) || vcall_index
!= NULL_TREE
)
7600 && fn
!= abort_fndecl
7601 && !DECL_TINFO_FN_P (fn
))
7603 entry
= make_thunk (entry
, delta
, vcall_index
,
7604 generate_with_vtable_p
);
7605 entry
= build1 (ADDR_EXPR
, vtable_entry_type
, entry
);
7606 TREE_READONLY (entry
) = 1;
7607 TREE_CONSTANT (entry
) = 1;
7609 #ifdef GATHER_STATISTICS
7610 n_vtable_entries
+= 1;
7616 tree elems
= tree_cons (NULL_TREE
, delta
,
7617 tree_cons (NULL_TREE
, integer_zero_node
,
7618 build_tree_list (NULL_TREE
, entry
)));
7619 tree entry
= build (CONSTRUCTOR
, vtable_entry_type
, NULL_TREE
, elems
);
7621 /* We don't use vcall offsets when not using vtable thunks. */
7622 my_friendly_assert (vcall_index
== NULL_TREE
, 20000125);
7624 /* DELTA used to be constructed by `size_int' and/or size_binop,
7625 which caused overflow problems when it was negative. That should
7628 if (! int_fits_type_p (delta
, delta_type_node
))
7630 if (flag_huge_objects
)
7631 sorry ("object size exceeds built-in limit for virtual function table implementation");
7633 sorry ("object size exceeds normal limit for virtual function table implementation, recompile all source and use -fhuge-objects");
7636 TREE_CONSTANT (entry
) = 1;
7637 TREE_STATIC (entry
) = 1;
7638 TREE_READONLY (entry
) = 1;
7640 #ifdef GATHER_STATISTICS
7641 n_vtable_entries
+= 1;