1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 92-97, 1998, 1999 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* High-level class interface. */
37 #define obstack_chunk_alloc xmalloc
38 #define obstack_chunk_free free
40 /* This is how we tell when two virtual member functions are really the
42 #define SAME_FN(FN1DECL, FN2DECL) (DECL_ASSEMBLER_NAME (FN1DECL) == DECL_ASSEMBLER_NAME (FN2DECL))
44 extern void set_class_shadows PROTO ((tree));
46 /* The number of nested classes being processed. If we are not in the
47 scope of any class, this is zero. */
49 int current_class_depth;
51 /* In order to deal with nested classes, we keep a stack of classes.
52 The topmost entry is the innermost class, and is the entry at index
53 CURRENT_CLASS_DEPTH */
55 typedef struct class_stack_node {
56 /* The name of the class. */
59 /* The _TYPE node for the class. */
62 /* The access specifier pending for new declarations in the scope of
66 /* If were defining TYPE, the names used in this class. */
67 splay_tree names_used;
68 }* class_stack_node_t;
70 /* The stack itself. This is an dynamically resized array. The
71 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
72 static int current_class_stack_size;
73 static class_stack_node_t current_class_stack;
77 static tree get_vfield_name PROTO((tree));
78 static void finish_struct_anon PROTO((tree));
79 static tree build_vbase_pointer PROTO((tree, tree));
80 static tree build_vtable_entry PROTO((tree, tree));
81 static tree get_vtable_name PROTO((tree));
82 static tree get_derived_offset PROTO((tree, tree));
83 static tree get_basefndecls PROTO((tree, tree));
84 static void set_rtti_entry PROTO((tree, tree, tree));
85 static tree build_vtable PROTO((tree, tree));
86 static void prepare_fresh_vtable PROTO((tree, tree));
87 static void fixup_vtable_deltas1 PROTO((tree, tree));
88 static void fixup_vtable_deltas PROTO((tree, int, tree));
89 static void finish_vtbls PROTO((tree, int, tree));
90 static void modify_vtable_entry PROTO((tree, tree, tree));
91 static tree get_vtable_entry_n PROTO((tree, unsigned HOST_WIDE_INT));
92 static void add_virtual_function PROTO((tree *, tree *, int *, tree, tree));
93 static tree delete_duplicate_fields_1 PROTO((tree, tree));
94 static void delete_duplicate_fields PROTO((tree));
95 static void finish_struct_bits PROTO((tree, int));
96 static int alter_access PROTO((tree, tree, tree, tree));
97 static void handle_using_decl PROTO((tree, tree));
98 static int overrides PROTO((tree, tree));
99 static int strictly_overrides PROTO((tree, tree));
100 static void merge_overrides PROTO((tree, tree, int, tree));
101 static void override_one_vtable PROTO((tree, tree, tree));
102 static void mark_overriders PROTO((tree, tree));
103 static void check_for_override PROTO((tree, tree));
104 static tree get_class_offset_1 PROTO((tree, tree, tree, tree, tree));
105 static tree get_class_offset PROTO((tree, tree, tree, tree));
106 static void modify_one_vtable PROTO((tree, tree, tree));
107 static void modify_all_vtables PROTO((tree, tree));
108 static void modify_all_direct_vtables PROTO((tree, int, tree, tree));
109 static void modify_all_indirect_vtables PROTO((tree, int, int, tree, tree));
110 static void determine_primary_base PROTO((tree, struct base_info *));
111 static void finish_struct_methods PROTO((tree));
112 static void maybe_warn_about_overly_private_class PROTO ((tree));
113 static int field_decl_cmp PROTO ((const tree *, const tree *));
114 static int method_name_cmp PROTO ((const tree *, const tree *));
115 static tree add_implicitly_declared_members PROTO((tree, int, int, int));
116 static tree fixed_type_or_null PROTO((tree, int *));
117 static tree resolve_address_of_overloaded_function PROTO((tree, tree, int,
119 static void build_vtable_entry_ref PROTO((tree, tree, tree));
120 static tree build_vtable_entry_for_fn PROTO((tree, tree));
121 static tree build_vtbl_initializer PROTO((tree));
122 static int count_fields PROTO((tree));
123 static int add_fields_to_vec PROTO((tree, tree, int));
124 static void check_bitfield_decl PROTO((tree));
125 static void check_field_decl PROTO((tree, tree, int *, int *, int *, int *));
126 static void check_field_decls PROTO((tree, tree *, int *, int *, int *,
128 static int avoid_overlap PROTO((tree, tree, int *));
129 static tree build_base_fields PROTO((tree, int *));
130 static tree build_vbase_pointer_fields PROTO((tree, int *));
131 static tree build_vtbl_or_vbase_field PROTO((tree, tree, tree, tree, int *));
132 static void check_methods PROTO((tree));
133 static void remove_zero_width_bit_fields PROTO((tree));
134 static void check_bases PROTO((tree, int *, int *, int *));
135 static void check_bases_and_members PROTO((tree, int *));
136 static void create_vtable_ptr PROTO((tree, int *, int *, int *, tree *, tree *));
137 static void layout_class_type PROTO((tree, int *, int *, int *, tree *, tree *));
138 static void fixup_pending_inline PROTO((struct pending_inline *));
139 static void fixup_inline_methods PROTO((tree));
140 static void set_primary_base PROTO((tree, int, int *));
142 /* Variables shared between class.c and call.c. */
144 #ifdef GATHER_STATISTICS
146 int n_vtable_entries = 0;
147 int n_vtable_searches = 0;
148 int n_vtable_elems = 0;
149 int n_convert_harshness = 0;
150 int n_compute_conversion_costs = 0;
151 int n_build_method_call = 0;
152 int n_inner_fields_searched = 0;
155 /* Virtual baseclass things. */
158 build_vbase_pointer (exp, type)
162 FORMAT_VBASE_NAME (name, type);
164 return build_component_ref (exp, get_identifier (name), NULL_TREE, 0);
168 /* Is the type of the EXPR, the complete type of the object?
169 If we are going to be wrong, we must be conservative, and return 0. */
172 complete_type_p (expr)
175 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
178 switch (TREE_CODE (expr))
185 expr = TREE_OPERAND (expr, 0);
189 if (! TREE_HAS_CONSTRUCTOR (expr))
191 /* fall through... */
194 if (TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
195 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (expr)))
196 && TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type)
198 /* fall through... */
201 if (IS_AGGR_TYPE (TREE_TYPE (expr))
202 && TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type)
204 /* fall through... */
215 /* Build multi-level access to EXPR using hierarchy path PATH.
216 CODE is PLUS_EXPR if we are going with the grain,
217 and MINUS_EXPR if we are not (in which case, we cannot traverse
218 virtual baseclass links).
220 TYPE is the type we want this path to have on exit.
222 NONNULL is non-zero if we know (for any reason) that EXPR is
223 not, in fact, zero. */
226 build_vbase_path (code, type, expr, path, nonnull)
228 tree type, expr, path;
231 register int changed = 0;
232 tree last = NULL_TREE, last_virtual = NULL_TREE;
234 tree null_expr = 0, nonnull_expr;
236 tree offset = integer_zero_node;
238 if (BINFO_INHERITANCE_CHAIN (path) == NULL_TREE)
239 return build1 (NOP_EXPR, type, expr);
241 /* We could do better if we had additional logic to convert back to the
242 unconverted type (the static type of the complete object), and then
243 convert back to the type we want. Until that is done, we only optimize
244 if the complete type is the same type as expr has. */
245 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
247 if (!fixed_type_p && TREE_SIDE_EFFECTS (expr))
248 expr = save_expr (expr);
251 if (BINFO_INHERITANCE_CHAIN (path))
252 path = reverse_path (path);
254 basetype = BINFO_TYPE (path);
258 if (TREE_VIA_VIRTUAL (path))
260 last_virtual = BINFO_TYPE (path);
261 if (code == PLUS_EXPR)
263 changed = ! fixed_type_p;
269 /* We already check for ambiguous things in the caller, just
273 tree binfo = get_binfo (last, TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (nonnull_expr))), 0);
274 nonnull_expr = convert_pointer_to_real (binfo, nonnull_expr);
276 ind = build_indirect_ref (nonnull_expr, NULL_PTR);
277 nonnull_expr = build_vbase_pointer (ind, last_virtual);
279 && TREE_CODE (type) == POINTER_TYPE
280 && null_expr == NULL_TREE)
282 null_expr = build1 (NOP_EXPR, build_pointer_type (last_virtual), integer_zero_node);
283 expr = build (COND_EXPR, build_pointer_type (last_virtual),
284 build (EQ_EXPR, boolean_type_node, expr,
286 null_expr, nonnull_expr);
289 /* else we'll figure out the offset below. */
291 /* Happens in the case of parse errors. */
292 if (nonnull_expr == error_mark_node)
293 return error_mark_node;
297 cp_error ("cannot cast up from virtual baseclass `%T'",
299 return error_mark_node;
303 path = BINFO_INHERITANCE_CHAIN (path);
305 /* LAST is now the last basetype assoc on the path. */
307 /* A pointer to a virtual base member of a non-null object
308 is non-null. Therefore, we only need to test for zeroness once.
309 Make EXPR the canonical expression to deal with here. */
312 TREE_OPERAND (expr, 2) = nonnull_expr;
313 TREE_TYPE (expr) = TREE_TYPE (TREE_OPERAND (expr, 1))
314 = TREE_TYPE (nonnull_expr);
319 /* If we go through any virtual base pointers, make sure that
320 casts to BASETYPE from the last virtual base class use
321 the right value for BASETYPE. */
324 tree intype = TREE_TYPE (TREE_TYPE (expr));
325 if (TYPE_MAIN_VARIANT (intype) != BINFO_TYPE (last))
327 tree binfo = get_binfo (last, TYPE_MAIN_VARIANT (intype), 0);
328 offset = BINFO_OFFSET (binfo);
335 offset = BINFO_OFFSET (BINFO_FOR_VBASE (last_virtual,
337 offset = size_binop (PLUS_EXPR, offset, BINFO_OFFSET (last));
340 offset = BINFO_OFFSET (last);
343 if (TREE_INT_CST_LOW (offset))
345 /* Bash types to make the backend happy. */
346 offset = cp_convert (type, offset);
348 /* This shouldn't be necessary. (mrs) */
349 expr = build1 (NOP_EXPR, type, expr);
352 /* If expr might be 0, we need to preserve that zeroness. */
356 TREE_TYPE (null_expr) = type;
358 null_expr = build1 (NOP_EXPR, type, integer_zero_node);
359 if (TREE_SIDE_EFFECTS (expr))
360 expr = save_expr (expr);
362 return build (COND_EXPR, type,
363 build (EQ_EXPR, boolean_type_node, expr, integer_zero_node),
365 build (code, type, expr, offset));
367 else return build (code, type, expr, offset);
370 /* Cannot change the TREE_TYPE of a NOP_EXPR here, since it may
371 be used multiple times in initialization of multiple inheritance. */
374 TREE_TYPE (expr) = type;
378 return build1 (NOP_EXPR, type, expr);
381 /* Virtual function things. */
383 /* Build an entry in the virtual function table.
384 DELTA is the offset for the `this' pointer.
385 PFN is an ADDR_EXPR containing a pointer to the virtual function.
386 Note that the index (DELTA2) in the virtual function table
390 build_vtable_entry (delta, pfn)
393 if (flag_vtable_thunks)
395 HOST_WIDE_INT idelta = TREE_INT_CST_LOW (delta);
396 if (idelta && ! DECL_PURE_VIRTUAL_P (TREE_OPERAND (pfn, 0)))
398 pfn = build1 (ADDR_EXPR, vtable_entry_type,
399 make_thunk (pfn, idelta));
400 TREE_READONLY (pfn) = 1;
401 TREE_CONSTANT (pfn) = 1;
403 #ifdef GATHER_STATISTICS
404 n_vtable_entries += 1;
410 extern int flag_huge_objects;
411 tree elems = tree_cons (NULL_TREE, delta,
412 tree_cons (NULL_TREE, integer_zero_node,
413 build_expr_list (NULL_TREE, pfn)));
414 tree entry = build (CONSTRUCTOR, vtable_entry_type, NULL_TREE, elems);
416 /* DELTA used to be constructed by `size_int' and/or size_binop,
417 which caused overflow problems when it was negative. That should
420 if (! int_fits_type_p (delta, delta_type_node))
422 if (flag_huge_objects)
423 sorry ("object size exceeds built-in limit for virtual function table implementation");
425 sorry ("object size exceeds normal limit for virtual function table implementation, recompile all source and use -fhuge-objects");
428 TREE_CONSTANT (entry) = 1;
429 TREE_STATIC (entry) = 1;
430 TREE_READONLY (entry) = 1;
432 #ifdef GATHER_STATISTICS
433 n_vtable_entries += 1;
440 /* Build a vtable entry for FNDECL. DELTA is the amount by which we
441 must adjust the this pointer when calling F. */
444 build_vtable_entry_for_fn (delta, fndecl)
450 /* Take the address of the function, considering it to be of an
451 appropriate generic type. */
452 pfn = build1 (ADDR_EXPR, vfunc_ptr_type_node, fndecl);
453 /* The address of a function can't change. */
454 TREE_CONSTANT (pfn) = 1;
455 /* Now build the vtable entry itself. */
456 return build_vtable_entry (delta, pfn);
459 /* We want to give the assembler the vtable identifier as well as
460 the offset to the function pointer. So we generate
462 __asm__ __volatile__ (".vtable_entry %c0, %c1"
463 : : "s"(&class_vtable),
464 "i"((long)&vtbl[idx].pfn - (long)&vtbl[0])); */
467 build_vtable_entry_ref (basetype, vtbl, idx)
468 tree basetype, vtbl, idx;
470 static char asm_stmt[] = ".vtable_entry %c0, %c1";
473 s = build_unary_op (ADDR_EXPR, TYPE_BINFO_VTABLE (basetype), 0);
474 s = build_tree_list (build_string (1, "s"), s);
476 i = build_array_ref (vtbl, idx);
477 if (!flag_vtable_thunks)
478 i = build_component_ref (i, pfn_identifier, vtable_entry_type, 0);
479 i = build_c_cast (ptrdiff_type_node, build_unary_op (ADDR_EXPR, i, 0));
480 i2 = build_array_ref (vtbl, build_int_2(0,0));
481 i2 = build_c_cast (ptrdiff_type_node, build_unary_op (ADDR_EXPR, i2, 0));
482 i = build_binary_op (MINUS_EXPR, i, i2);
483 i = build_tree_list (build_string (1, "i"), i);
485 finish_asm_stmt (ridpointers[RID_VOLATILE],
486 build_string (sizeof(asm_stmt)-1, asm_stmt),
487 NULL_TREE, chainon (s, i), NULL_TREE);
490 /* Given an object INSTANCE, return an expression which yields the
491 virtual function vtable element corresponding to INDEX. There are
492 many special cases for INSTANCE which we take care of here, mainly
493 to avoid creating extra tree nodes when we don't have to. */
496 build_vtbl_ref (instance, idx)
500 tree basetype = TREE_TYPE (instance);
502 if (TREE_CODE (basetype) == REFERENCE_TYPE)
503 basetype = TREE_TYPE (basetype);
505 if (instance == current_class_ref)
506 vtbl = build_vfield_ref (instance, basetype);
511 /* Try to figure out what a reference refers to, and
512 access its virtual function table directly. */
513 tree ref = NULL_TREE;
515 if (TREE_CODE (instance) == INDIRECT_REF
516 && TREE_CODE (TREE_TYPE (TREE_OPERAND (instance, 0))) == REFERENCE_TYPE)
517 ref = TREE_OPERAND (instance, 0);
518 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
521 if (ref && TREE_CODE (ref) == VAR_DECL
522 && DECL_INITIAL (ref))
524 tree init = DECL_INITIAL (ref);
526 while (TREE_CODE (init) == NOP_EXPR
527 || TREE_CODE (init) == NON_LVALUE_EXPR)
528 init = TREE_OPERAND (init, 0);
529 if (TREE_CODE (init) == ADDR_EXPR)
531 init = TREE_OPERAND (init, 0);
532 if (IS_AGGR_TYPE (TREE_TYPE (init))
533 && (TREE_CODE (init) == PARM_DECL
534 || TREE_CODE (init) == VAR_DECL))
540 if (IS_AGGR_TYPE (TREE_TYPE (instance))
541 && (TREE_CODE (instance) == RESULT_DECL
542 || TREE_CODE (instance) == PARM_DECL
543 || TREE_CODE (instance) == VAR_DECL))
544 vtbl = TYPE_BINFO_VTABLE (basetype);
546 vtbl = build_vfield_ref (instance, basetype);
549 assemble_external (vtbl);
552 build_vtable_entry_ref (basetype, vtbl, idx);
554 aref = build_array_ref (vtbl, idx);
559 /* Given an object INSTANCE, return an expression which yields the
560 virtual function corresponding to INDEX. There are many special
561 cases for INSTANCE which we take care of here, mainly to avoid
562 creating extra tree nodes when we don't have to. */
565 build_vfn_ref (ptr_to_instptr, instance, idx)
566 tree *ptr_to_instptr, instance;
569 tree aref = build_vtbl_ref (instance, idx);
571 /* When using thunks, there is no extra delta, and we get the pfn
573 if (flag_vtable_thunks)
578 /* Save the intermediate result in a SAVE_EXPR so we don't have to
579 compute each component of the virtual function pointer twice. */
580 if (TREE_CODE (aref) == INDIRECT_REF)
581 TREE_OPERAND (aref, 0) = save_expr (TREE_OPERAND (aref, 0));
584 = build (PLUS_EXPR, TREE_TYPE (*ptr_to_instptr),
586 cp_convert (ptrdiff_type_node,
587 build_component_ref (aref, delta_identifier, NULL_TREE, 0)));
590 return build_component_ref (aref, pfn_identifier, NULL_TREE, 0);
593 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
594 for the given TYPE. */
597 get_vtable_name (type)
600 tree type_id = build_typename_overload (type);
601 char *buf = (char *) alloca (strlen (VTABLE_NAME_PREFIX)
602 + IDENTIFIER_LENGTH (type_id) + 2);
603 const char *ptr = IDENTIFIER_POINTER (type_id);
605 for (i = 0; ptr[i] == OPERATOR_TYPENAME_FORMAT[i]; i++) ;
607 /* We don't take off the numbers; prepare_fresh_vtable uses the
608 DECL_ASSEMBLER_NAME for the type, which includes the number
609 in `3foo'. If we were to pull them off here, we'd end up with
610 something like `_vt.foo.3bar', instead of a uniform definition. */
611 while (ptr[i] >= '0' && ptr[i] <= '9')
614 sprintf (buf, "%s%s", VTABLE_NAME_PREFIX, ptr+i);
615 return get_identifier (buf);
618 /* Return the offset to the main vtable for a given base BINFO. */
621 get_vfield_offset (binfo)
625 = size_binop (FLOOR_DIV_EXPR,
626 DECL_FIELD_BITPOS (TYPE_VFIELD (BINFO_TYPE (binfo))),
627 size_int (BITS_PER_UNIT));
628 tmp = convert (sizetype, tmp);
629 return size_binop (PLUS_EXPR, tmp, BINFO_OFFSET (binfo));
632 /* Get the offset to the start of the original binfo that we derived
633 this binfo from. If we find TYPE first, return the offset only
634 that far. The shortened search is useful because the this pointer
635 on method calling is expected to point to a DECL_CONTEXT (fndecl)
636 object, and not a baseclass of it. */
639 get_derived_offset (binfo, type)
642 tree offset1 = get_vfield_offset (TYPE_BINFO (BINFO_TYPE (binfo)));
645 while (BINFO_BASETYPES (binfo)
646 && (i=CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo))) != -1)
648 tree binfos = BINFO_BASETYPES (binfo);
649 if (BINFO_TYPE (binfo) == type)
651 binfo = TREE_VEC_ELT (binfos, i);
653 offset2 = get_vfield_offset (TYPE_BINFO (BINFO_TYPE (binfo)));
654 return size_binop (MINUS_EXPR, offset1, offset2);
657 /* Update the rtti info for this class. */
660 set_rtti_entry (virtuals, offset, type)
661 tree virtuals, offset, type;
665 if (CLASSTYPE_COM_INTERFACE (type))
669 fn = get_tinfo_fn_unused (type);
671 /* If someone tries to get RTTI information for a type compiled
672 without RTTI, they're out of luck. By calling __pure_virtual
673 in this case, we give a small clue as to what went wrong. We
674 could consider having a __no_typeinfo function as well, for a
675 more specific hint. */
678 if (flag_vtable_thunks)
680 /* The first slot holds the offset. */
681 TREE_PURPOSE (virtuals) = offset;
683 /* The next node holds the function. */
684 virtuals = TREE_CHAIN (virtuals);
685 offset = integer_zero_node;
688 /* This slot holds the function to call. */
689 TREE_PURPOSE (virtuals) = offset;
690 TREE_VALUE (virtuals) = fn;
693 /* Build a virtual function for type TYPE.
694 If BINFO is non-NULL, build the vtable starting with the initial
695 approximation that it is the same as the one which is the head of
696 the association list. */
699 build_vtable (binfo, type)
702 tree name = get_vtable_name (type);
709 virtuals = copy_list (BINFO_VIRTUALS (binfo));
710 decl = build_lang_decl (VAR_DECL, name,
711 TREE_TYPE (BINFO_VTABLE (binfo)));
713 /* Now do rtti stuff. */
714 offset = get_derived_offset (TYPE_BINFO (type), NULL_TREE);
715 offset = ssize_binop (MINUS_EXPR, integer_zero_node, offset);
716 set_rtti_entry (virtuals, offset, type);
720 virtuals = NULL_TREE;
721 decl = build_lang_decl (VAR_DECL, name, void_type_node);
724 #ifdef GATHER_STATISTICS
726 n_vtable_elems += list_length (virtuals);
729 /* Set TREE_PUBLIC and TREE_EXTERN as appropriate. */
730 import_export_vtable (decl, type, 0);
732 decl = pushdecl_top_level (decl);
733 SET_IDENTIFIER_GLOBAL_VALUE (name, decl);
734 /* Initialize the association list for this type, based
735 on our first approximation. */
736 TYPE_BINFO_VTABLE (type) = decl;
737 TYPE_BINFO_VIRTUALS (type) = virtuals;
739 DECL_ARTIFICIAL (decl) = 1;
740 TREE_STATIC (decl) = 1;
741 #ifndef WRITABLE_VTABLES
742 /* Make them READONLY by default. (mrs) */
743 TREE_READONLY (decl) = 1;
745 /* At one time the vtable info was grabbed 2 words at a time. This
746 fails on sparc unless you have 8-byte alignment. (tiemann) */
747 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
750 DECL_VIRTUAL_P (decl) = 1;
751 DECL_CONTEXT (decl) = type;
753 binfo = TYPE_BINFO (type);
754 SET_BINFO_NEW_VTABLE_MARKED (binfo);
758 /* Give TYPE a new virtual function table which is initialized
759 with a skeleton-copy of its original initialization. The only
760 entry that changes is the `delta' entry, so we can really
761 share a lot of structure.
763 FOR_TYPE is the derived type which caused this table to
766 BINFO is the type association which provided TYPE for FOR_TYPE.
768 The order in which vtables are built (by calling this function) for
769 an object must remain the same, otherwise a binary incompatibility
773 prepare_fresh_vtable (binfo, for_type)
774 tree binfo, for_type;
777 tree orig_decl = BINFO_VTABLE (binfo);
790 basetype = TYPE_MAIN_VARIANT (BINFO_TYPE (binfo));
792 buf2 = TYPE_ASSEMBLER_NAME_STRING (basetype);
793 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1;
795 /* We know that the vtable that we are going to create doesn't exist
796 yet in the global namespace, and when we finish, it will be
797 pushed into the global namespace. In complex MI hierarchies, we
798 have to loop while the name we are thinking of adding is globally
799 defined, adding more name components to the vtable name as we
800 loop, until the name is unique. This is because in complex MI
801 cases, we might have the same base more than once. This means
802 that the order in which this function is called for vtables must
803 remain the same, otherwise binary compatibility can be
808 char *buf1 = (char *) alloca (TYPE_ASSEMBLER_NAME_LENGTH (for_type)
812 sprintf (buf1, "%s%c%s", TYPE_ASSEMBLER_NAME_STRING (for_type), joiner,
814 buf = (char *) alloca (strlen (VTABLE_NAME_PREFIX) + strlen (buf1) + 1);
815 sprintf (buf, "%s%s", VTABLE_NAME_PREFIX, buf1);
816 name = get_identifier (buf);
818 /* If this name doesn't clash, then we can use it, otherwise
819 we add more to the name until it is unique. */
821 if (! IDENTIFIER_GLOBAL_VALUE (name))
824 /* Set values for next loop through, if the name isn't unique. */
826 path = BINFO_INHERITANCE_CHAIN (path);
828 /* We better not run out of stuff to make it unique. */
829 my_friendly_assert (path != NULL_TREE, 368);
831 basetype = TYPE_MAIN_VARIANT (BINFO_TYPE (path));
833 if (for_type == basetype)
835 /* If we run out of basetypes in the path, we have already
836 found created a vtable with that name before, we now
837 resort to tacking on _%d to distinguish them. */
839 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1 + i + 1 + 3;
840 buf1 = (char *) alloca (i);
842 sprintf (buf1, "%s%c%s%c%d",
843 TYPE_ASSEMBLER_NAME_STRING (basetype), joiner,
845 buf = (char *) alloca (strlen (VTABLE_NAME_PREFIX)
846 + strlen (buf1) + 1);
847 sprintf (buf, "%s%s", VTABLE_NAME_PREFIX, buf1);
848 name = get_identifier (buf);
850 /* If this name doesn't clash, then we can use it,
851 otherwise we add something different to the name until
853 } while (++j <= 999 && IDENTIFIER_GLOBAL_VALUE (name));
855 /* Hey, they really like MI don't they? Increase the 3
856 above to 6, and the 999 to 999999. :-) */
857 my_friendly_assert (j <= 999, 369);
862 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1 + i;
863 new_buf2 = (char *) alloca (i);
864 sprintf (new_buf2, "%s%c%s",
865 TYPE_ASSEMBLER_NAME_STRING (basetype), joiner, buf2);
869 new_decl = build_lang_decl (VAR_DECL, name, TREE_TYPE (orig_decl));
870 /* Remember which class this vtable is really for. */
871 DECL_CONTEXT (new_decl) = for_type;
873 DECL_ARTIFICIAL (new_decl) = 1;
874 TREE_STATIC (new_decl) = 1;
875 BINFO_VTABLE (binfo) = pushdecl_top_level (new_decl);
876 DECL_VIRTUAL_P (new_decl) = 1;
877 #ifndef WRITABLE_VTABLES
878 /* Make them READONLY by default. (mrs) */
879 TREE_READONLY (new_decl) = 1;
881 DECL_ALIGN (new_decl) = DECL_ALIGN (orig_decl);
883 /* Make fresh virtual list, so we can smash it later. */
884 BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo));
886 if (TREE_VIA_VIRTUAL (binfo))
888 tree binfo1 = BINFO_FOR_VBASE (BINFO_TYPE (binfo), for_type);
890 /* XXX - This should never happen, if it does, the caller should
891 ensure that the binfo is from for_type's binfos, not from any
892 base type's. We can remove all this code after a while. */
894 warning ("internal inconsistency: binfo offset error for rtti");
896 offset = BINFO_OFFSET (binfo1);
899 offset = BINFO_OFFSET (binfo);
901 set_rtti_entry (BINFO_VIRTUALS (binfo),
902 ssize_binop (MINUS_EXPR, integer_zero_node, offset),
905 #ifdef GATHER_STATISTICS
907 n_vtable_elems += list_length (BINFO_VIRTUALS (binfo));
910 /* Set TREE_PUBLIC and TREE_EXTERN as appropriate. */
911 import_export_vtable (new_decl, for_type, 0);
913 if (TREE_VIA_VIRTUAL (binfo))
914 my_friendly_assert (binfo == BINFO_FOR_VBASE (BINFO_TYPE (binfo),
917 SET_BINFO_NEW_VTABLE_MARKED (binfo);
921 /* Access the virtual function table entry that logically
922 contains BASE_FNDECL. VIRTUALS is the virtual function table's
923 initializer. We can run off the end, when dealing with virtual
924 destructors in MI situations, return NULL_TREE in that case. */
927 get_vtable_entry (virtuals, base_fndecl)
928 tree virtuals, base_fndecl;
930 unsigned HOST_WIDE_INT n = (HOST_BITS_PER_WIDE_INT >= BITS_PER_WORD
931 ? (TREE_INT_CST_LOW (DECL_VINDEX (base_fndecl))
932 & (((unsigned HOST_WIDE_INT)1<<(BITS_PER_WORD-1))-1))
933 : TREE_INT_CST_LOW (DECL_VINDEX (base_fndecl)));
935 #ifdef GATHER_STATISTICS
936 n_vtable_searches += n;
939 while (n > 0 && virtuals)
942 virtuals = TREE_CHAIN (virtuals);
948 /* Change the offset for the FNDECL entry to NEW_OFFSET. Also update
949 DECL_VINDEX (FNDECL). */
952 modify_vtable_entry (old_entry_in_list, new_offset, fndecl)
953 tree old_entry_in_list, new_offset, fndecl;
955 tree base_fndecl = TREE_VALUE (old_entry_in_list);
957 /* Update the entry. */
958 TREE_PURPOSE (old_entry_in_list) = new_offset;
959 TREE_VALUE (old_entry_in_list) = fndecl;
961 /* Now assign virtual dispatch information, if unset. We can
962 dispatch this, through any overridden base function. */
963 if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
965 DECL_VINDEX (fndecl) = DECL_VINDEX (base_fndecl);
966 DECL_CONTEXT (fndecl) = DECL_CONTEXT (base_fndecl);
970 /* Access the virtual function table entry N. VIRTUALS is the virtual
971 function table's initializer. */
974 get_vtable_entry_n (virtuals, n)
976 unsigned HOST_WIDE_INT n;
981 virtuals = TREE_CHAIN (virtuals);
986 /* Add a virtual function to all the appropriate vtables for the class
987 T. DECL_VINDEX(X) should be error_mark_node, if we want to
988 allocate a new slot in our table. If it is error_mark_node, we
989 know that no other function from another vtable is overridden by X.
990 HAS_VIRTUAL keeps track of how many virtuals there are in our main
991 vtable for the type, and we build upon the PENDING_VIRTUALS list
995 add_virtual_function (pv, phv, has_virtual, fndecl, t)
999 tree t; /* Structure type. */
1001 tree pending_virtuals = *pv;
1002 tree pending_hard_virtuals = *phv;
1005 if (current_class_type == 0)
1006 cp_warning ("internal problem, current_class_type is zero when adding `%D', please report",
1008 if (current_class_type && t != current_class_type)
1009 cp_warning ("internal problem, current_class_type differs when adding `%D', please report",
1013 /* If the virtual function is a redefinition of a prior one,
1014 figure out in which base class the new definition goes,
1015 and if necessary, make a fresh virtual function table
1016 to hold that entry. */
1017 if (DECL_VINDEX (fndecl) == error_mark_node)
1019 /* We remember that this was the base sub-object for rtti. */
1020 CLASSTYPE_RTTI (t) = t;
1022 /* If we are using thunks, use two slots at the front, one
1023 for the offset pointer, one for the tdesc pointer.
1024 For ARM-style vtables, use the same slot for both. */
1025 if (*has_virtual == 0 && ! CLASSTYPE_COM_INTERFACE (t))
1027 if (flag_vtable_thunks)
1033 /* Build a new INT_CST for this DECL_VINDEX. */
1035 static tree index_table[256];
1037 /* We skip a slot for the offset/tdesc entry. */
1038 int i = (*has_virtual)++;
1040 if (i >= 256 || index_table[i] == 0)
1042 idx = build_int_2 (i, 0);
1044 index_table[i] = idx;
1047 idx = index_table[i];
1049 /* Now assign virtual dispatch information. */
1050 DECL_VINDEX (fndecl) = idx;
1051 DECL_CONTEXT (fndecl) = t;
1053 /* Save the state we've computed on the PENDING_VIRTUALS list. */
1054 pending_virtuals = tree_cons (integer_zero_node,
1058 /* Might already be INTEGER_CST if declared twice in class. We will
1059 give error later or we've already given it. */
1060 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
1062 /* Need an entry in some other virtual function table.
1063 Deal with this after we have laid out our virtual base classes. */
1064 pending_hard_virtuals = tree_cons (NULL_TREE,
1066 pending_hard_virtuals);
1068 *pv = pending_virtuals;
1069 *phv = pending_hard_virtuals;
1072 extern struct obstack *current_obstack;
1074 /* Add method METHOD to class TYPE.
1076 If non-NULL, FIELDS is the entry in the METHOD_VEC vector entry of
1077 the class type where the method should be added. */
1080 add_method (type, fields, method)
1081 tree type, *fields, method;
1083 /* Setting the DECL_CONTEXT and DECL_CLASS_CONTEXT here is probably
1085 DECL_CONTEXT (method) = type;
1086 DECL_CLASS_CONTEXT (method) = type;
1088 if (fields && *fields)
1089 *fields = build_overload (method, *fields);
1096 if (!CLASSTYPE_METHOD_VEC (type))
1097 /* Make a new method vector. We start with 8 entries. We must
1098 allocate at least two (for constructors and destructors), and
1099 we're going to end up with an assignment operator at some
1102 We could use a TREE_LIST for now, and convert it to a
1103 TREE_VEC in finish_struct, but we would probably waste more
1104 memory making the links in the list than we would by
1105 over-allocating the size of the vector here. Furthermore,
1106 we would complicate all the code that expects this to be a
1108 CLASSTYPE_METHOD_VEC (type) = make_tree_vec (8);
1110 method_vec = CLASSTYPE_METHOD_VEC (type);
1111 len = TREE_VEC_LENGTH (method_vec);
1113 if (DECL_NAME (method) == constructor_name (type))
1114 /* A new constructor or destructor. Constructors go in
1115 slot 0; destructors go in slot 1. */
1116 slot = DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (method)) ? 1 : 0;
1119 /* See if we already have an entry with this name. */
1120 for (slot = 2; slot < len; ++slot)
1121 if (!TREE_VEC_ELT (method_vec, slot)
1122 || (DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec,
1124 == DECL_NAME (method)))
1129 /* We need a bigger method vector. */
1130 tree new_vec = make_tree_vec (2 * len);
1131 bcopy ((PTR) &TREE_VEC_ELT (method_vec, 0),
1132 (PTR) &TREE_VEC_ELT (new_vec, 0),
1133 len * sizeof (tree));
1135 method_vec = CLASSTYPE_METHOD_VEC (type) = new_vec;
1138 if (DECL_CONV_FN_P (method) && !TREE_VEC_ELT (method_vec, slot))
1140 /* Type conversion operators have to come before
1141 ordinary methods; add_conversions depends on this to
1142 speed up looking for conversion operators. So, if
1143 necessary, we slide some of the vector elements up.
1144 In theory, this makes this algorithm O(N^2) but we
1145 don't expect many conversion operators. */
1146 for (slot = 2; slot < len; ++slot)
1148 tree fn = TREE_VEC_ELT (method_vec, slot);
1151 /* There are no more entries in the vector, so we
1152 can insert the new conversion operator here. */
1155 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1156 /* We can insert the new function right at the
1161 if (!TREE_VEC_ELT (method_vec, slot))
1162 /* There is nothing in the Ith slot, so we can avoid
1167 /* We know the last slot in the vector is empty
1168 because we know that at this point there's room
1169 for a new function. */
1170 bcopy ((PTR) &TREE_VEC_ELT (method_vec, slot),
1171 (PTR) &TREE_VEC_ELT (method_vec, slot + 1),
1172 (len - slot - 1) * sizeof (tree));
1173 TREE_VEC_ELT (method_vec, slot) = NULL_TREE;
1178 if (template_class_depth (type))
1179 /* TYPE is a template class. Don't issue any errors now; wait
1180 until instantiation time to complain. */
1186 /* Check to see if we've already got this method. */
1187 for (fns = TREE_VEC_ELT (method_vec, slot);
1189 fns = OVL_NEXT (fns))
1191 tree fn = OVL_CURRENT (fns);
1193 if (TREE_CODE (fn) != TREE_CODE (method))
1196 if (TREE_CODE (method) != TEMPLATE_DECL)
1198 /* [over.load] Member function declarations with the
1199 same name and the same parameter types cannot be
1200 overloaded if any of them is a static member
1201 function declaration. */
1202 if (DECL_STATIC_FUNCTION_P (fn)
1203 != DECL_STATIC_FUNCTION_P (method))
1205 tree parms1 = TYPE_ARG_TYPES (TREE_TYPE (fn));
1206 tree parms2 = TYPE_ARG_TYPES (TREE_TYPE (method));
1208 if (! DECL_STATIC_FUNCTION_P (fn))
1209 parms1 = TREE_CHAIN (parms1);
1211 parms2 = TREE_CHAIN (parms2);
1213 if (compparms (parms1, parms2))
1214 cp_error ("`%#D' and `%#D' cannot be overloaded",
1218 /* Since this is an ordinary function in a
1219 non-template class, it's mangled name can be used
1220 as a unique identifier. This technique is only
1221 an optimization; we would get the same results if
1222 we just used decls_match here. */
1223 if (DECL_ASSEMBLER_NAME (fn)
1224 != DECL_ASSEMBLER_NAME (method))
1227 else if (!decls_match (fn, method))
1230 /* There has already been a declaration of this method
1231 or member template. */
1232 cp_error_at ("`%D' has already been declared in `%T'",
1235 /* We don't call duplicate_decls here to merge the
1236 declarations because that will confuse things if the
1237 methods have inline definitions. In particular, we
1238 will crash while processing the definitions. */
1243 /* Actually insert the new method. */
1244 TREE_VEC_ELT (method_vec, slot)
1245 = build_overload (method, TREE_VEC_ELT (method_vec, slot));
1247 /* Add the new binding. */
1248 if (!DECL_CONSTRUCTOR_P (method)
1249 && !DECL_DESTRUCTOR_P (method))
1250 push_class_level_binding (DECL_NAME (method),
1251 TREE_VEC_ELT (method_vec, slot));
1255 /* Subroutines of finish_struct. */
1257 /* Look through the list of fields for this struct, deleting
1258 duplicates as we go. This must be recursive to handle
1261 FIELD is the field which may not appear anywhere in FIELDS.
1262 FIELD_PTR, if non-null, is the starting point at which
1263 chained deletions may take place.
1264 The value returned is the first acceptable entry found
1267 Note that anonymous fields which are not of UNION_TYPE are
1268 not duplicates, they are just anonymous fields. This happens
1269 when we have unnamed bitfields, for example. */
1272 delete_duplicate_fields_1 (field, fields)
1277 if (DECL_NAME (field) == 0)
1279 if (! ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1282 for (x = TYPE_FIELDS (TREE_TYPE (field)); x; x = TREE_CHAIN (x))
1283 fields = delete_duplicate_fields_1 (x, fields);
1288 for (x = fields; x; prev = x, x = TREE_CHAIN (x))
1290 if (DECL_NAME (x) == 0)
1292 if (! ANON_AGGR_TYPE_P (TREE_TYPE (x)))
1294 TYPE_FIELDS (TREE_TYPE (x))
1295 = delete_duplicate_fields_1 (field, TYPE_FIELDS (TREE_TYPE (x)));
1296 if (TYPE_FIELDS (TREE_TYPE (x)) == 0)
1299 fields = TREE_CHAIN (fields);
1301 TREE_CHAIN (prev) = TREE_CHAIN (x);
1304 else if (TREE_CODE (field) == USING_DECL)
1305 /* A using declaration may is allowed to appear more than
1306 once. We'll prune these from the field list later, and
1307 handle_using_decl will complain about invalid multiple
1310 else if (DECL_NAME (field) == DECL_NAME (x))
1312 if (TREE_CODE (field) == CONST_DECL
1313 && TREE_CODE (x) == CONST_DECL)
1314 cp_error_at ("duplicate enum value `%D'", x);
1315 else if (TREE_CODE (field) == CONST_DECL
1316 || TREE_CODE (x) == CONST_DECL)
1317 cp_error_at ("duplicate field `%D' (as enum and non-enum)",
1319 else if (DECL_DECLARES_TYPE_P (field)
1320 && DECL_DECLARES_TYPE_P (x))
1322 if (same_type_p (TREE_TYPE (field), TREE_TYPE (x)))
1324 cp_error_at ("duplicate nested type `%D'", x);
1326 else if (DECL_DECLARES_TYPE_P (field)
1327 || DECL_DECLARES_TYPE_P (x))
1329 /* Hide tag decls. */
1330 if ((TREE_CODE (field) == TYPE_DECL
1331 && DECL_ARTIFICIAL (field))
1332 || (TREE_CODE (x) == TYPE_DECL
1333 && DECL_ARTIFICIAL (x)))
1335 cp_error_at ("duplicate field `%D' (as type and non-type)",
1339 cp_error_at ("duplicate member `%D'", x);
1341 fields = TREE_CHAIN (fields);
1343 TREE_CHAIN (prev) = TREE_CHAIN (x);
1351 delete_duplicate_fields (fields)
1355 for (x = fields; x && TREE_CHAIN (x); x = TREE_CHAIN (x))
1356 TREE_CHAIN (x) = delete_duplicate_fields_1 (x, TREE_CHAIN (x));
1359 /* Change the access of FDECL to ACCESS in T. The access to FDECL is
1360 along the path given by BINFO. Return 1 if change was legit,
1361 otherwise return 0. */
1364 alter_access (t, binfo, fdecl, access)
1370 tree elem = purpose_member (t, DECL_ACCESS (fdecl));
1373 if (TREE_VALUE (elem) != access)
1375 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1376 cp_error_at ("conflicting access specifications for method `%D', ignored", TREE_TYPE (fdecl));
1378 error ("conflicting access specifications for field `%s', ignored",
1379 IDENTIFIER_POINTER (DECL_NAME (fdecl)));
1383 /* They're changing the access to the same thing they changed
1384 it to before. That's OK. */
1390 enforce_access (binfo, fdecl);
1391 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1397 /* Process the USING_DECL, which is a member of T. */
1400 handle_using_decl (using_decl, t)
1404 tree ctype = DECL_INITIAL (using_decl);
1405 tree name = DECL_NAME (using_decl);
1407 = TREE_PRIVATE (using_decl) ? access_private_node
1408 : TREE_PROTECTED (using_decl) ? access_protected_node
1409 : access_public_node;
1411 tree flist = NULL_TREE;
1412 tree fields = TYPE_FIELDS (t);
1413 tree method_vec = CLASSTYPE_METHOD_VEC (t);
1418 binfo = binfo_or_else (ctype, t);
1422 if (name == constructor_name (ctype)
1423 || name == constructor_name_full (ctype))
1425 cp_error_at ("using-declaration for constructor", using_decl);
1429 fdecl = lookup_member (binfo, name, 0, 0);
1433 cp_error_at ("no members matching `%D' in `%#T'", using_decl, ctype);
1437 /* Functions are represented as TREE_LIST, with the purpose
1438 being the type and the value the functions. Other members
1439 come as themselves. */
1440 if (TREE_CODE (fdecl) == TREE_LIST)
1441 /* Ignore base type this came from. */
1442 fdecl = TREE_VALUE (fdecl);
1444 if (TREE_CODE (fdecl) == OVERLOAD)
1446 /* We later iterate over all functions. */
1448 fdecl = OVL_FUNCTION (flist);
1451 name = DECL_NAME (fdecl);
1452 n_methods = method_vec ? TREE_VEC_LENGTH (method_vec) : 0;
1453 for (i = 2; i < n_methods && TREE_VEC_ELT (method_vec, i); i++)
1454 if (DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec, i)))
1457 cp_error ("cannot adjust access to `%#D' in `%#T'", fdecl, t);
1458 cp_error_at (" because of local method `%#D' with same name",
1459 OVL_CURRENT (TREE_VEC_ELT (method_vec, i)));
1463 if (! DECL_LANG_SPECIFIC (fdecl))
1464 /* We don't currently handle DECL_ACCESS for TYPE_DECLs; just return. */
1467 for (tmp = fields; tmp; tmp = TREE_CHAIN (tmp))
1468 if (DECL_NAME (tmp) == name)
1470 cp_error ("cannot adjust access to `%#D' in `%#T'", fdecl, t);
1471 cp_error_at (" because of local field `%#D' with same name", tmp);
1475 /* Make type T see field decl FDECL with access ACCESS.*/
1480 if (alter_access (t, binfo, OVL_FUNCTION (flist),
1483 flist = OVL_CHAIN (flist);
1487 alter_access (t, binfo, fdecl, access);
1493 int max_has_virtual;
1496 /* Run through the base clases of T, updating
1497 CANT_HAVE_DEFAULT_CTOR_P, CANT_HAVE_CONST_CTOR_P, and
1498 NO_CONST_ASN_REF_P. Also set flag bits in T based on properties of
1502 check_bases (t, cant_have_default_ctor_p, cant_have_const_ctor_p,
1505 int *cant_have_default_ctor_p;
1506 int *cant_have_const_ctor_p;
1507 int *no_const_asn_ref_p;
1511 int seen_nearly_empty_base_p;
1514 binfos = TYPE_BINFO_BASETYPES (t);
1515 n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1516 seen_nearly_empty_base_p = 0;
1518 /* An aggregate cannot have baseclasses. */
1519 CLASSTYPE_NON_AGGREGATE (t) |= (n_baseclasses != 0);
1521 for (i = 0; i < n_baseclasses; ++i)
1526 /* Figure out what base we're looking at. */
1527 base_binfo = TREE_VEC_ELT (binfos, i);
1528 basetype = TREE_TYPE (base_binfo);
1530 /* If the type of basetype is incomplete, then we already
1531 complained about that fact (and we should have fixed it up as
1533 if (TYPE_SIZE (basetype) == 0)
1536 /* The base type is of incomplete type. It is
1537 probably best to pretend that it does not
1539 if (i == n_baseclasses-1)
1540 TREE_VEC_ELT (binfos, i) = NULL_TREE;
1541 TREE_VEC_LENGTH (binfos) -= 1;
1543 for (j = i; j+1 < n_baseclasses; j++)
1544 TREE_VEC_ELT (binfos, j) = TREE_VEC_ELT (binfos, j+1);
1548 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1549 here because the case of virtual functions but non-virtual
1550 dtor is handled in finish_struct_1. */
1551 if (warn_ecpp && ! TYPE_POLYMORPHIC_P (basetype)
1552 && TYPE_HAS_DESTRUCTOR (basetype))
1553 cp_warning ("base class `%#T' has a non-virtual destructor",
1556 /* If the base class doesn't have copy constructors or
1557 assignment operators that take const references, then the
1558 derived class cannot have such a member automatically
1560 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1561 *cant_have_const_ctor_p = 1;
1562 if (TYPE_HAS_ASSIGN_REF (basetype)
1563 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1564 *no_const_asn_ref_p = 1;
1565 /* Similarly, if the base class doesn't have a default
1566 constructor, then the derived class won't have an
1567 automatically generated default constructor. */
1568 if (TYPE_HAS_CONSTRUCTOR (basetype)
1569 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype))
1571 *cant_have_default_ctor_p = 1;
1572 if (! TYPE_HAS_CONSTRUCTOR (t))
1574 cp_pedwarn ("base `%T' with only non-default constructor",
1576 cp_pedwarn ("in class without a constructor");
1580 /* If the base class is not empty or nearly empty, then this
1581 class cannot be nearly empty. */
1582 if (!CLASSTYPE_NEARLY_EMPTY_P (basetype) && !is_empty_class (basetype))
1583 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1584 /* And if there is more than one nearly empty base, then the
1585 derived class is not nearly empty either. */
1586 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype)
1587 && seen_nearly_empty_base_p)
1588 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1589 /* If this is the first nearly empty base class, then remember
1591 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1592 seen_nearly_empty_base_p = 1;
1594 /* A lot of properties from the bases also apply to the derived
1596 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1597 TYPE_NEEDS_DESTRUCTOR (t) |= TYPE_NEEDS_DESTRUCTOR (basetype);
1598 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
1599 |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1600 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1601 TYPE_OVERLOADS_CALL_EXPR (t) |= TYPE_OVERLOADS_CALL_EXPR (basetype);
1602 TYPE_OVERLOADS_ARRAY_REF (t) |= TYPE_OVERLOADS_ARRAY_REF (basetype);
1603 TYPE_OVERLOADS_ARROW (t) |= TYPE_OVERLOADS_ARROW (basetype);
1604 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1606 /* Derived classes can implicitly become COMified if their bases
1608 if (CLASSTYPE_COM_INTERFACE (basetype))
1609 CLASSTYPE_COM_INTERFACE (t) = 1;
1610 else if (i == 0 && CLASSTYPE_COM_INTERFACE (t))
1613 ("COM interface type `%T' with non-COM leftmost base class `%T'",
1615 CLASSTYPE_COM_INTERFACE (t) = 0;
1620 /* Make the Ith baseclass of T its primary base. */
1623 set_primary_base (t, i, has_virtual_p)
1630 CLASSTYPE_VFIELD_PARENT (t) = i;
1631 basetype = BINFO_TYPE (CLASSTYPE_PRIMARY_BINFO (t));
1632 TYPE_BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (basetype);
1633 TYPE_BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (basetype);
1634 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1635 CLASSTYPE_RTTI (t) = CLASSTYPE_RTTI (basetype);
1636 *has_virtual_p = CLASSTYPE_VSIZE (basetype);
1639 /* Determine the primary class for T. */
1642 determine_primary_base (t, b)
1644 struct base_info *b;
1646 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1647 bzero ((char *) b, sizeof (struct base_info));
1649 for (i = 0; i < n_baseclasses; i++)
1651 tree base_binfo = TREE_VEC_ELT (TYPE_BINFO_BASETYPES (t), i);
1652 tree basetype = BINFO_TYPE (base_binfo);
1654 if (TYPE_POLYMORPHIC_P (basetype))
1656 /* Even a virtual baseclass can contain our RTTI
1657 information. But, we prefer a non-virtual polymorphic
1659 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
1660 CLASSTYPE_RTTI (t) = CLASSTYPE_RTTI (basetype);
1662 /* A virtual baseclass can't be the primary base. */
1663 if (TREE_VIA_VIRTUAL (base_binfo))
1666 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
1668 set_primary_base (t, i, &b->has_virtual);
1669 CLASSTYPE_VFIELDS (t) = copy_list (CLASSTYPE_VFIELDS (basetype));
1675 /* Only add unique vfields, and flatten them out as we go. */
1676 for (vfields = CLASSTYPE_VFIELDS (basetype);
1678 vfields = TREE_CHAIN (vfields))
1679 if (VF_BINFO_VALUE (vfields) == NULL_TREE
1680 || ! TREE_VIA_VIRTUAL (VF_BINFO_VALUE (vfields)))
1681 CLASSTYPE_VFIELDS (t)
1682 = tree_cons (base_binfo,
1683 VF_BASETYPE_VALUE (vfields),
1684 CLASSTYPE_VFIELDS (t));
1686 if (b->has_virtual == 0)
1687 set_primary_base (t, i, &b->has_virtual);
1692 if (!TYPE_VFIELD (t))
1693 CLASSTYPE_VFIELD_PARENT (t) = -1;
1697 /* Find the base class with the largest number of virtual functions. */
1698 for (vfields = CLASSTYPE_VFIELDS (t);
1700 vfields = TREE_CHAIN (vfields))
1702 if (CLASSTYPE_VSIZE (VF_BASETYPE_VALUE (vfields)) > b->max_has_virtual)
1703 b->max_has_virtual = CLASSTYPE_VSIZE (VF_BASETYPE_VALUE (vfields));
1704 if (VF_DERIVED_VALUE (vfields)
1705 && CLASSTYPE_VSIZE (VF_DERIVED_VALUE (vfields)) > b->max_has_virtual)
1706 b->max_has_virtual = CLASSTYPE_VSIZE (VF_DERIVED_VALUE (vfields));
1711 /* Set memoizing fields and bits of T (and its variants) for later use.
1712 MAX_HAS_VIRTUAL is the largest size of any T's virtual function tables. */
1715 finish_struct_bits (t, max_has_virtual)
1717 int max_has_virtual;
1719 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1721 /* Fix up variants (if any). */
1722 tree variants = TYPE_NEXT_VARIANT (t);
1725 /* These fields are in the _TYPE part of the node, not in
1726 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1727 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1728 TYPE_HAS_DESTRUCTOR (variants) = TYPE_HAS_DESTRUCTOR (t);
1729 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1730 TYPE_NEEDS_DESTRUCTOR (variants) = TYPE_NEEDS_DESTRUCTOR (t);
1732 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (variants)
1733 = TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t);
1734 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1735 TYPE_USES_VIRTUAL_BASECLASSES (variants) = TYPE_USES_VIRTUAL_BASECLASSES (t);
1736 /* Copy whatever these are holding today. */
1737 TYPE_MIN_VALUE (variants) = TYPE_MIN_VALUE (t);
1738 TYPE_MAX_VALUE (variants) = TYPE_MAX_VALUE (t);
1739 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1740 TYPE_SIZE (variants) = TYPE_SIZE (t);
1741 TYPE_SIZE_UNIT (variants) = TYPE_SIZE_UNIT (t);
1742 variants = TYPE_NEXT_VARIANT (variants);
1745 if (n_baseclasses && max_has_virtual)
1746 /* For a class w/o baseclasses, `finish_struct' has set
1747 CLASS_TYPE_ABSTRACT_VIRTUALS correctly (by
1748 definition). Similarly for a class whose base classes do not
1749 have vtables. When neither of these is true, we might have
1750 removed abstract virtuals (by providing a definition), added
1751 some (by declaring new ones), or redeclared ones from a base
1752 class. We need to recalculate what's really an abstract virtual
1753 at this point (by looking in the vtables). */
1754 get_pure_virtuals (t);
1758 /* Notice whether this class has type conversion functions defined. */
1759 tree binfo = TYPE_BINFO (t);
1760 tree binfos = BINFO_BASETYPES (binfo);
1763 for (i = n_baseclasses-1; i >= 0; i--)
1765 basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
1767 TYPE_HAS_CONVERSION (t) |= TYPE_HAS_CONVERSION (basetype);
1771 /* If this type has a copy constructor, force its mode to be BLKmode, and
1772 force its TREE_ADDRESSABLE bit to be nonzero. This will cause it to
1773 be passed by invisible reference and prevent it from being returned in
1776 Also do this if the class has BLKmode but can still be returned in
1777 registers, since function_cannot_inline_p won't let us inline
1778 functions returning such a type. This affects the HP-PA. */
1779 if (! TYPE_HAS_TRIVIAL_INIT_REF (t)
1780 || (TYPE_MODE (t) == BLKmode && ! aggregate_value_p (t)
1781 && CLASSTYPE_NON_AGGREGATE (t)))
1784 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1785 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1787 TYPE_MODE (variants) = BLKmode;
1788 TREE_ADDRESSABLE (variants) = 1;
1793 /* Issue warnings about T having private constructors, but no friends,
1796 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1797 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1798 non-private static member functions. */
1801 maybe_warn_about_overly_private_class (t)
1804 int has_member_fn = 0;
1805 int has_nonprivate_method = 0;
1808 if (!warn_ctor_dtor_privacy
1809 /* If the class has friends, those entities might create and
1810 access instances, so we should not warn. */
1811 || (CLASSTYPE_FRIEND_CLASSES (t)
1812 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
1813 /* We will have warned when the template was declared; there's
1814 no need to warn on every instantiation. */
1815 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
1816 /* There's no reason to even consider warning about this
1820 /* We only issue one warning, if more than one applies, because
1821 otherwise, on code like:
1824 // Oops - forgot `public:'
1830 we warn several times about essentially the same problem. */
1832 /* Check to see if all (non-constructor, non-destructor) member
1833 functions are private. (Since there are no friends or
1834 non-private statics, we can't ever call any of the private member
1836 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
1837 /* We're not interested in compiler-generated methods; they don't
1838 provide any way to call private members. */
1839 if (!DECL_ARTIFICIAL (fn))
1841 if (!TREE_PRIVATE (fn))
1843 if (DECL_STATIC_FUNCTION_P (fn))
1844 /* A non-private static member function is just like a
1845 friend; it can create and invoke private member
1846 functions, and be accessed without a class
1850 has_nonprivate_method = 1;
1853 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
1857 if (!has_nonprivate_method && has_member_fn)
1859 /* There are no non-private methods, and there's at least one
1860 private member function that isn't a constructor or
1861 destructor. (If all the private members are
1862 constructors/destructors we want to use the code below that
1863 issues error messages specifically referring to
1864 constructors/destructors.) */
1866 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
1867 for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); i++)
1868 if (TREE_VIA_PUBLIC (TREE_VEC_ELT (binfos, i))
1869 || TREE_VIA_PROTECTED (TREE_VEC_ELT (binfos, i)))
1871 has_nonprivate_method = 1;
1874 if (!has_nonprivate_method)
1876 cp_warning ("all member functions in class `%T' are private", t);
1881 /* Even if some of the member functions are non-private, the class
1882 won't be useful for much if all the constructors or destructors
1883 are private: such an object can never be created or destroyed. */
1884 if (TYPE_HAS_DESTRUCTOR (t))
1886 tree dtor = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 1);
1888 if (TREE_PRIVATE (dtor))
1890 cp_warning ("`%#T' only defines a private destructor and has no friends",
1896 if (TYPE_HAS_CONSTRUCTOR (t))
1898 int nonprivate_ctor = 0;
1900 /* If a non-template class does not define a copy
1901 constructor, one is defined for it, enabling it to avoid
1902 this warning. For a template class, this does not
1903 happen, and so we would normally get a warning on:
1905 template <class T> class C { private: C(); };
1907 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1908 complete non-template or fully instantiated classes have this
1910 if (!TYPE_HAS_INIT_REF (t))
1911 nonprivate_ctor = 1;
1913 for (fn = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 0);
1917 tree ctor = OVL_CURRENT (fn);
1918 /* Ideally, we wouldn't count copy constructors (or, in
1919 fact, any constructor that takes an argument of the
1920 class type as a parameter) because such things cannot
1921 be used to construct an instance of the class unless
1922 you already have one. But, for now at least, we're
1924 if (! TREE_PRIVATE (ctor))
1926 nonprivate_ctor = 1;
1931 if (nonprivate_ctor == 0)
1933 cp_warning ("`%#T' only defines private constructors and has no friends",
1940 /* Function to help qsort sort FIELD_DECLs by name order. */
1943 field_decl_cmp (x, y)
1946 if (DECL_NAME (*x) == DECL_NAME (*y))
1948 if (DECL_NAME (*x) == NULL_TREE)
1950 if (DECL_NAME (*y) == NULL_TREE)
1952 if (DECL_NAME (*x) < DECL_NAME (*y))
1957 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1960 method_name_cmp (m1, m2)
1961 const tree *m1, *m2;
1963 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1965 if (*m1 == NULL_TREE)
1967 if (*m2 == NULL_TREE)
1969 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
1974 /* Warn about duplicate methods in fn_fields. Also compact method
1975 lists so that lookup can be made faster.
1977 Data Structure: List of method lists. The outer list is a
1978 TREE_LIST, whose TREE_PURPOSE field is the field name and the
1979 TREE_VALUE is the DECL_CHAIN of the FUNCTION_DECLs. TREE_CHAIN
1980 links the entire list of methods for TYPE_METHODS. Friends are
1981 chained in the same way as member functions (? TREE_CHAIN or
1982 DECL_CHAIN), but they live in the TREE_TYPE field of the outer
1983 list. That allows them to be quickly deleted, and requires no
1986 If there are any constructors/destructors, they are moved to the
1987 front of the list. This makes pushclass more efficient.
1989 @@ The above comment is obsolete. It mostly describes what add_method
1990 @@ and add_implicitly_declared_members do.
1992 Sort methods that are not special (i.e., constructors, destructors, and
1993 type conversion operators) so that we can find them faster in search. */
1996 finish_struct_methods (t)
2001 tree ctor_name = constructor_name (t);
2004 if (!TYPE_METHODS (t))
2006 /* Clear these for safety; perhaps some parsing error could set
2007 these incorrectly. */
2008 TYPE_HAS_CONSTRUCTOR (t) = 0;
2009 TYPE_HAS_DESTRUCTOR (t) = 0;
2010 CLASSTYPE_METHOD_VEC (t) = NULL_TREE;
2014 method_vec = CLASSTYPE_METHOD_VEC (t);
2015 my_friendly_assert (method_vec != NULL_TREE, 19991215);
2016 len = TREE_VEC_LENGTH (method_vec);
2018 /* First fill in entry 0 with the constructors, entry 1 with destructors,
2019 and the next few with type conversion operators (if any). */
2020 for (fn_fields = TYPE_METHODS (t); fn_fields;
2021 fn_fields = TREE_CHAIN (fn_fields))
2023 tree fn_name = DECL_NAME (fn_fields);
2025 /* Clear out this flag.
2027 @@ Doug may figure out how to break
2028 @@ this with nested classes and friends. */
2029 DECL_IN_AGGR_P (fn_fields) = 0;
2031 /* Note here that a copy ctor is private, so we don't dare generate
2032 a default copy constructor for a class that has a member
2033 of this type without making sure they have access to it. */
2034 if (fn_name == ctor_name)
2036 tree parmtypes = FUNCTION_ARG_CHAIN (fn_fields);
2037 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
2039 if (TREE_CODE (parmtype) == REFERENCE_TYPE
2040 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == t)
2042 if (TREE_CHAIN (parmtypes) == NULL_TREE
2043 || TREE_CHAIN (parmtypes) == void_list_node
2044 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
2046 if (TREE_PROTECTED (fn_fields))
2047 TYPE_HAS_NONPUBLIC_CTOR (t) = 1;
2048 else if (TREE_PRIVATE (fn_fields))
2049 TYPE_HAS_NONPUBLIC_CTOR (t) = 2;
2053 else if (fn_name == ansi_opname[(int) MODIFY_EXPR])
2055 tree parmtype = TREE_VALUE (FUNCTION_ARG_CHAIN (fn_fields));
2057 if (copy_assignment_arg_p (parmtype, DECL_VIRTUAL_P (fn_fields)))
2059 if (TREE_PROTECTED (fn_fields))
2060 TYPE_HAS_NONPUBLIC_ASSIGN_REF (t) = 1;
2061 else if (TREE_PRIVATE (fn_fields))
2062 TYPE_HAS_NONPUBLIC_ASSIGN_REF (t) = 2;
2067 if (TYPE_HAS_DESTRUCTOR (t) && !TREE_VEC_ELT (method_vec, 1))
2068 /* We thought there was a destructor, but there wasn't. Some
2069 parse errors cause this anomalous situation. */
2070 TYPE_HAS_DESTRUCTOR (t) = 0;
2072 /* Issue warnings about private constructors and such. If there are
2073 no methods, then some public defaults are generated. */
2074 maybe_warn_about_overly_private_class (t);
2076 /* Now sort the methods. */
2077 while (len > 2 && TREE_VEC_ELT (method_vec, len-1) == NULL_TREE)
2079 TREE_VEC_LENGTH (method_vec) = len;
2081 /* The type conversion ops have to live at the front of the vec, so we
2083 for (slot = 2; slot < len; ++slot)
2085 tree fn = TREE_VEC_ELT (method_vec, slot);
2087 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
2091 qsort (&TREE_VEC_ELT (method_vec, slot), len-slot, sizeof (tree),
2092 (int (*)(const void *, const void *))method_name_cmp);
2095 /* Emit error when a duplicate definition of a type is seen. Patch up. */
2098 duplicate_tag_error (t)
2101 cp_error ("redefinition of `%#T'", t);
2102 cp_error_at ("previous definition here", t);
2104 /* Pretend we haven't defined this type. */
2106 /* All of the component_decl's were TREE_CHAINed together in the parser.
2107 finish_struct_methods walks these chains and assembles all methods with
2108 the same base name into DECL_CHAINs. Now we don't need the parser chains
2109 anymore, so we unravel them. */
2111 /* This used to be in finish_struct, but it turns out that the
2112 TREE_CHAIN is used by dbxout_type_methods and perhaps some other
2114 if (CLASSTYPE_METHOD_VEC (t))
2116 tree method_vec = CLASSTYPE_METHOD_VEC (t);
2117 int i, len = TREE_VEC_LENGTH (method_vec);
2118 for (i = 0; i < len; i++)
2120 tree unchain = TREE_VEC_ELT (method_vec, i);
2121 while (unchain != NULL_TREE)
2123 TREE_CHAIN (OVL_CURRENT (unchain)) = NULL_TREE;
2124 unchain = OVL_NEXT (unchain);
2129 if (TYPE_LANG_SPECIFIC (t))
2131 tree binfo = TYPE_BINFO (t);
2132 int interface_only = CLASSTYPE_INTERFACE_ONLY (t);
2133 int interface_unknown = CLASSTYPE_INTERFACE_UNKNOWN (t);
2134 tree template_info = CLASSTYPE_TEMPLATE_INFO (t);
2135 int use_template = CLASSTYPE_USE_TEMPLATE (t);
2137 bzero ((char *) TYPE_LANG_SPECIFIC (t), sizeof (struct lang_type));
2138 BINFO_BASETYPES(binfo) = NULL_TREE;
2140 TYPE_BINFO (t) = binfo;
2141 CLASSTYPE_INTERFACE_ONLY (t) = interface_only;
2142 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t, interface_unknown);
2143 TYPE_REDEFINED (t) = 1;
2144 CLASSTYPE_TEMPLATE_INFO (t) = template_info;
2145 CLASSTYPE_USE_TEMPLATE (t) = use_template;
2147 TYPE_SIZE (t) = NULL_TREE;
2148 TYPE_MODE (t) = VOIDmode;
2149 TYPE_FIELDS (t) = NULL_TREE;
2150 TYPE_METHODS (t) = NULL_TREE;
2151 TYPE_VFIELD (t) = NULL_TREE;
2152 TYPE_CONTEXT (t) = NULL_TREE;
2153 TYPE_NONCOPIED_PARTS (t) = NULL_TREE;
2156 /* Construct the initializer for BINFOs virtual function table. */
2159 build_vtbl_initializer (binfo)
2162 tree v = BINFO_VIRTUALS (binfo);
2163 tree inits = NULL_TREE;
2165 /* Process the RTTI stuff at the head of the list. If we're not
2166 using vtable thunks, then the RTTI entry is just an ordinary
2167 function, and we can process it just like the other virtual
2168 function entries. */
2169 if (!CLASSTYPE_COM_INTERFACE (BINFO_TYPE (binfo))
2170 && flag_vtable_thunks)
2175 /* The first entry is an offset. */
2176 offset = TREE_PURPOSE (v);
2177 my_friendly_assert (TREE_CODE (offset) == INTEGER_CST,
2180 /* Convert the offset to look like a function pointer, so that
2181 we can put it in the vtable. */
2182 init = build1 (NOP_EXPR, vfunc_ptr_type_node, offset);
2183 TREE_CONSTANT (init) = 1;
2184 init = build_vtable_entry (integer_zero_node, init);
2185 inits = tree_cons (NULL_TREE, init, inits);
2187 /* Even in this case, the second entry (the tdesc pointer) is
2188 just an ordinary function. */
2192 /* Go through all the ordinary virtual functions, building up
2200 /* Pull the offset for `this', and the function to call, out of
2202 delta = TREE_PURPOSE (v);
2203 fn = TREE_VALUE (v);
2204 my_friendly_assert (TREE_CODE (delta) == INTEGER_CST, 19990727);
2205 my_friendly_assert (TREE_CODE (fn) == FUNCTION_DECL, 19990727);
2207 /* You can't call an abstract virtual function; it's abstract.
2208 So, we replace these functions with __pure_virtual. */
2209 if (DECL_PURE_VIRTUAL_P (fn))
2212 /* Package up that information for the vtable. */
2213 init = build_vtable_entry_for_fn (delta, fn);
2214 /* And add it to the chain of initializers. */
2215 inits = tree_cons (NULL_TREE, init, inits);
2221 /* The initializers were built up in reverse order; straighten them
2223 inits = nreverse (inits);
2224 /* Package all the initializers up as an array initializer. */
2225 return build_nt (CONSTRUCTOR, NULL_TREE, inits);
2228 /* finish up all new vtables. */
2231 finish_vtbls (binfo, do_self, t)
2236 tree binfos = BINFO_BASETYPES (binfo);
2237 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2239 /* Should we use something besides CLASSTYPE_VFIELDS? */
2240 if (do_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2242 if (BINFO_NEW_VTABLE_MARKED (binfo))
2246 decl = BINFO_VTABLE (binfo);
2247 context = DECL_CONTEXT (decl);
2248 DECL_CONTEXT (decl) = 0;
2249 DECL_INITIAL (decl) = build_vtbl_initializer (binfo);
2250 cp_finish_decl (decl, DECL_INITIAL (decl), NULL_TREE, 0);
2251 DECL_CONTEXT (decl) = context;
2253 CLEAR_BINFO_NEW_VTABLE_MARKED (binfo);
2256 for (i = 0; i < n_baselinks; i++)
2258 tree base_binfo = TREE_VEC_ELT (binfos, i);
2259 int is_not_base_vtable
2260 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2261 if (TREE_VIA_VIRTUAL (base_binfo))
2262 base_binfo = BINFO_FOR_VBASE (BINFO_TYPE (base_binfo), t);
2263 finish_vtbls (base_binfo, is_not_base_vtable, t);
2267 /* True if we should override the given BASE_FNDECL with the given
2271 overrides (fndecl, base_fndecl)
2272 tree fndecl, base_fndecl;
2274 /* Destructors have special names. */
2275 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (base_fndecl))
2276 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (fndecl)))
2278 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (base_fndecl))
2279 || DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (fndecl)))
2281 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl))
2283 tree types, base_types;
2285 retypes = TREE_TYPE (TREE_TYPE (fndecl));
2286 base_retypes = TREE_TYPE (TREE_TYPE (base_fndecl));
2288 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2289 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
2290 if ((TYPE_QUALS (TREE_TYPE (TREE_VALUE (base_types)))
2291 == TYPE_QUALS (TREE_TYPE (TREE_VALUE (types))))
2292 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
2299 get_class_offset_1 (parent, binfo, context, t, fndecl)
2300 tree parent, binfo, context, t, fndecl;
2302 tree binfos = BINFO_BASETYPES (binfo);
2303 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2304 tree rval = NULL_TREE;
2306 if (binfo == parent)
2307 return error_mark_node;
2309 for (i = 0; i < n_baselinks; i++)
2311 tree base_binfo = TREE_VEC_ELT (binfos, i);
2314 if (TREE_VIA_VIRTUAL (base_binfo))
2315 base_binfo = BINFO_FOR_VBASE (BINFO_TYPE (base_binfo), t);
2316 nrval = get_class_offset_1 (parent, base_binfo, context, t, fndecl);
2317 /* See if we have a new value */
2318 if (nrval && (nrval != error_mark_node || rval==0))
2320 /* Only compare if we have two offsets */
2321 if (rval && rval != error_mark_node
2322 && ! tree_int_cst_equal (nrval, rval))
2324 /* Only give error if the two offsets are different */
2325 error ("every virtual function must have a unique final overrider");
2326 cp_error (" found two (or more) `%T' class subobjects in `%T'", context, t);
2327 cp_error (" with virtual `%D' from virtual base class", fndecl);
2333 if (rval && BINFO_TYPE (binfo) == context)
2335 my_friendly_assert (rval == error_mark_node
2336 || tree_int_cst_equal (rval, BINFO_OFFSET (binfo)), 999);
2337 rval = BINFO_OFFSET (binfo);
2343 /* Get the offset to the CONTEXT subobject that is related to the
2347 get_class_offset (context, t, binfo, fndecl)
2348 tree context, t, binfo, fndecl;
2350 tree first_binfo = binfo;
2355 return integer_zero_node;
2357 if (BINFO_TYPE (binfo) == context)
2358 return BINFO_OFFSET (binfo);
2360 /* Check less derived binfos first. */
2361 while (BINFO_BASETYPES (binfo)
2362 && (i=CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo))) != -1)
2364 tree binfos = BINFO_BASETYPES (binfo);
2365 binfo = TREE_VEC_ELT (binfos, i);
2366 if (BINFO_TYPE (binfo) == context)
2367 return BINFO_OFFSET (binfo);
2370 /* Ok, not found in the less derived binfos, now check the more
2372 offset = get_class_offset_1 (first_binfo, TYPE_BINFO (t), context, t, fndecl);
2373 if (offset==0 || TREE_CODE (offset) != INTEGER_CST)
2374 my_friendly_abort (999); /* we have to find it. */
2378 /* Skip RTTI information at the front of the virtual list. */
2380 unsigned HOST_WIDE_INT
2381 skip_rtti_stuff (virtuals, t)
2386 if (CLASSTYPE_COM_INTERFACE (t))
2392 /* We always reserve a slot for the offset/tdesc entry. */
2394 *virtuals = TREE_CHAIN (*virtuals);
2396 if (flag_vtable_thunks && *virtuals)
2398 /* The second slot is reserved for the tdesc pointer when thunks
2401 *virtuals = TREE_CHAIN (*virtuals);
2407 modify_one_vtable (binfo, t, fndecl)
2408 tree binfo, t, fndecl;
2410 tree virtuals = BINFO_VIRTUALS (binfo);
2411 unsigned HOST_WIDE_INT n;
2413 /* update rtti entry */
2416 if (binfo == TYPE_BINFO (t))
2418 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2419 build_vtable (TYPE_BINFO (DECL_CONTEXT (TYPE_VFIELD (t))), t);
2423 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2424 prepare_fresh_vtable (binfo, t);
2427 if (fndecl == NULL_TREE)
2430 n = skip_rtti_stuff (&virtuals, BINFO_TYPE (binfo));
2434 tree current_fndecl = TREE_VALUE (virtuals);
2436 /* We should never have an instance of __pure_virtual on the
2437 BINFO_VIRTUALS list. If we do, then we will never notice
2438 that the function that should have been there instead has
2440 my_friendly_assert (current_fndecl != abort_fndecl,
2443 if (current_fndecl && overrides (fndecl, current_fndecl))
2445 tree base_offset, offset;
2446 tree context = DECL_CLASS_CONTEXT (fndecl);
2447 tree vfield = TYPE_VFIELD (t);
2450 offset = get_class_offset (context, t, binfo, fndecl);
2452 /* Find the right offset for the this pointer based on the
2453 base class we just found. We have to take into
2454 consideration the virtual base class pointers that we
2455 stick in before the virtual function table pointer.
2457 Also, we want just the delta between the most base class
2458 that we derived this vfield from and us. */
2459 base_offset = size_binop (PLUS_EXPR,
2460 get_derived_offset (binfo, DECL_CONTEXT (current_fndecl)),
2461 BINFO_OFFSET (binfo));
2462 this_offset = ssize_binop (MINUS_EXPR, offset, base_offset);
2464 if (binfo == TYPE_BINFO (t))
2466 /* In this case, it is *type*'s vtable we are modifying.
2467 We start with the approximation that it's vtable is that
2468 of the immediate base class. */
2469 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2470 build_vtable (TYPE_BINFO (DECL_CONTEXT (vfield)), t);
2474 /* This is our very own copy of `basetype' to play with.
2475 Later, we will fill in all the virtual functions
2476 that override the virtual functions in these base classes
2477 which are not defined by the current type. */
2478 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2479 prepare_fresh_vtable (binfo, t);
2483 cp_warning ("in %D", DECL_NAME (BINFO_VTABLE (binfo)));
2485 modify_vtable_entry (get_vtable_entry_n (BINFO_VIRTUALS (binfo), n),
2490 virtuals = TREE_CHAIN (virtuals);
2494 /* These are the ones that are not through virtual base classes. */
2497 modify_all_direct_vtables (binfo, do_self, t, fndecl)
2502 tree binfos = BINFO_BASETYPES (binfo);
2503 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2505 /* Should we use something besides CLASSTYPE_VFIELDS? */
2506 if (do_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2507 modify_one_vtable (binfo, t, fndecl);
2509 for (i = 0; i < n_baselinks; i++)
2511 tree base_binfo = TREE_VEC_ELT (binfos, i);
2512 int is_not_base_vtable
2513 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2514 if (! TREE_VIA_VIRTUAL (base_binfo))
2515 modify_all_direct_vtables (base_binfo, is_not_base_vtable, t, fndecl);
2519 /* Fixup all the delta entries in this one vtable that need updating. */
2522 fixup_vtable_deltas1 (binfo, t)
2525 tree virtuals = BINFO_VIRTUALS (binfo);
2526 unsigned HOST_WIDE_INT n;
2528 n = skip_rtti_stuff (&virtuals, BINFO_TYPE (binfo));
2532 tree fndecl = TREE_VALUE (virtuals);
2533 tree delta = TREE_PURPOSE (virtuals);
2537 tree base_offset, offset;
2538 tree context = DECL_CLASS_CONTEXT (fndecl);
2539 tree vfield = TYPE_VFIELD (t);
2542 offset = get_class_offset (context, t, binfo, fndecl);
2544 /* Find the right offset for the this pointer based on the
2545 base class we just found. We have to take into
2546 consideration the virtual base class pointers that we
2547 stick in before the virtual function table pointer.
2549 Also, we want just the delta between the most base class
2550 that we derived this vfield from and us. */
2551 base_offset = size_binop (PLUS_EXPR,
2552 get_derived_offset (binfo,
2553 DECL_CONTEXT (fndecl)),
2554 BINFO_OFFSET (binfo));
2555 this_offset = ssize_binop (MINUS_EXPR, offset, base_offset);
2557 if (! tree_int_cst_equal (this_offset, delta))
2559 /* Make sure we can modify the derived association with immunity. */
2560 if (binfo == TYPE_BINFO (t))
2562 /* In this case, it is *type*'s vtable we are modifying.
2563 We start with the approximation that it's vtable is that
2564 of the immediate base class. */
2565 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2566 build_vtable (TYPE_BINFO (DECL_CONTEXT (vfield)), t);
2570 /* This is our very own copy of `basetype' to play with.
2571 Later, we will fill in all the virtual functions
2572 that override the virtual functions in these base classes
2573 which are not defined by the current type. */
2574 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2575 prepare_fresh_vtable (binfo, t);
2578 modify_vtable_entry (get_vtable_entry_n (BINFO_VIRTUALS (binfo), n),
2584 virtuals = TREE_CHAIN (virtuals);
2588 /* Fixup all the delta entries in all the direct vtables that need updating.
2589 This happens when we have non-overridden virtual functions from a
2590 virtual base class, that are at a different offset, in the new
2591 hierarchy, because the layout of the virtual bases has changed. */
2594 fixup_vtable_deltas (binfo, init_self, t)
2599 tree binfos = BINFO_BASETYPES (binfo);
2600 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2602 for (i = 0; i < n_baselinks; i++)
2604 tree base_binfo = TREE_VEC_ELT (binfos, i);
2605 int is_not_base_vtable
2606 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2607 if (! TREE_VIA_VIRTUAL (base_binfo))
2608 fixup_vtable_deltas (base_binfo, is_not_base_vtable, t);
2610 /* Should we use something besides CLASSTYPE_VFIELDS? */
2611 if (init_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2612 fixup_vtable_deltas1 (binfo, t);
2615 /* These are the ones that are through virtual base classes. */
2618 modify_all_indirect_vtables (binfo, do_self, via_virtual, t, fndecl)
2620 int do_self, via_virtual;
2623 tree binfos = BINFO_BASETYPES (binfo);
2624 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2626 /* Should we use something besides CLASSTYPE_VFIELDS? */
2627 if (do_self && via_virtual && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2628 modify_one_vtable (binfo, t, fndecl);
2630 for (i = 0; i < n_baselinks; i++)
2632 tree base_binfo = TREE_VEC_ELT (binfos, i);
2633 int is_not_base_vtable
2634 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2635 if (TREE_VIA_VIRTUAL (base_binfo))
2638 base_binfo = BINFO_FOR_VBASE (BINFO_TYPE (base_binfo), t);
2640 modify_all_indirect_vtables (base_binfo, is_not_base_vtable, via_virtual, t, fndecl);
2645 modify_all_vtables (t, fndecl)
2649 /* Do these first, so that we will make use of any non-virtual class's
2650 vtable, over a virtual classes vtable. */
2651 modify_all_direct_vtables (TYPE_BINFO (t), 1, t, fndecl);
2652 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
2653 modify_all_indirect_vtables (TYPE_BINFO (t), 1, 0, t, fndecl);
2656 /* Here, we already know that they match in every respect.
2657 All we have to check is where they had their declarations. */
2660 strictly_overrides (fndecl1, fndecl2)
2661 tree fndecl1, fndecl2;
2663 int distance = get_base_distance (DECL_CLASS_CONTEXT (fndecl2),
2664 DECL_CLASS_CONTEXT (fndecl1),
2666 if (distance == -2 || distance > 0)
2671 /* Merge overrides for one vtable.
2672 If we want to merge in same function, we are fine.
2674 if one has a DECL_CLASS_CONTEXT that is a parent of the
2675 other, than choose the more derived one
2677 potentially ill-formed (see 10.3 [class.virtual])
2678 we have to check later to see if there was an
2679 override in this class. If there was ok, if not
2680 then it is ill-formed. (mrs)
2682 We take special care to reuse a vtable, if we can. */
2685 override_one_vtable (binfo, old, t)
2688 tree virtuals = BINFO_VIRTUALS (binfo);
2689 tree old_virtuals = BINFO_VIRTUALS (old);
2690 enum { REUSE_NEW, REUSE_OLD, UNDECIDED, NEITHER } choose = UNDECIDED;
2692 /* If we have already committed to modifying it, then don't try and
2693 reuse another vtable. */
2694 if (BINFO_NEW_VTABLE_MARKED (binfo))
2697 skip_rtti_stuff (&virtuals, BINFO_TYPE (binfo));
2698 skip_rtti_stuff (&old_virtuals, BINFO_TYPE (binfo));
2702 tree fndecl = TREE_VALUE (virtuals);
2703 tree old_fndecl = TREE_VALUE (old_virtuals);
2705 /* First check to see if they are the same. */
2706 if (DECL_ASSEMBLER_NAME (fndecl) == DECL_ASSEMBLER_NAME (old_fndecl))
2708 /* No need to do anything. */
2710 else if (strictly_overrides (fndecl, old_fndecl))
2712 if (choose == UNDECIDED)
2714 else if (choose == REUSE_OLD)
2717 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2719 prepare_fresh_vtable (binfo, t);
2720 override_one_vtable (binfo, old, t);
2725 else if (strictly_overrides (old_fndecl, fndecl))
2727 if (choose == UNDECIDED)
2729 else if (choose == REUSE_NEW)
2732 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2734 prepare_fresh_vtable (binfo, t);
2735 override_one_vtable (binfo, old, t);
2738 TREE_VALUE (virtuals) = TREE_VALUE (old_virtuals);
2740 else if (choose == NEITHER)
2742 TREE_VALUE (virtuals) = TREE_VALUE (old_virtuals);
2748 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2750 prepare_fresh_vtable (binfo, t);
2751 override_one_vtable (binfo, old, t);
2755 /* This MUST be overridden, or the class is ill-formed. */
2756 tree fndecl = TREE_VALUE (virtuals);
2758 fndecl = copy_node (fndecl);
2759 copy_lang_decl (fndecl);
2760 DECL_NEEDS_FINAL_OVERRIDER_P (fndecl) = 1;
2761 /* Make sure we search for it later. */
2762 if (! CLASSTYPE_PURE_VIRTUALS (t))
2763 CLASSTYPE_PURE_VIRTUALS (t) = error_mark_node;
2765 /* We can use integer_zero_node, as we will core dump
2766 if this is used anyway. */
2767 TREE_PURPOSE (virtuals) = integer_zero_node;
2768 TREE_VALUE (virtuals) = fndecl;
2771 virtuals = TREE_CHAIN (virtuals);
2772 old_virtuals = TREE_CHAIN (old_virtuals);
2775 /* Let's reuse the old vtable. */
2776 if (choose == REUSE_OLD)
2778 BINFO_VTABLE (binfo) = BINFO_VTABLE (old);
2779 BINFO_VIRTUALS (binfo) = BINFO_VIRTUALS (old);
2783 /* Merge in overrides for virtual bases.
2784 BINFO is the hierarchy we want to modify, and OLD has the potential
2788 merge_overrides (binfo, old, do_self, t)
2793 tree binfos = BINFO_BASETYPES (binfo);
2794 tree old_binfos = BINFO_BASETYPES (old);
2795 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2797 /* Should we use something besides CLASSTYPE_VFIELDS? */
2798 if (do_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2800 override_one_vtable (binfo, old, t);
2803 for (i = 0; i < n_baselinks; i++)
2805 tree base_binfo = TREE_VEC_ELT (binfos, i);
2806 tree old_base_binfo = TREE_VEC_ELT (old_binfos, i);
2807 int is_not_base_vtable
2808 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2809 if (! TREE_VIA_VIRTUAL (base_binfo))
2810 merge_overrides (base_binfo, old_base_binfo, is_not_base_vtable, t);
2814 /* Get the base virtual function declarations in T that are either
2815 overridden or hidden by FNDECL as a list. We set TREE_PURPOSE with
2816 the overrider/hider. */
2819 get_basefndecls (fndecl, t)
2822 tree methods = TYPE_METHODS (t);
2823 tree base_fndecls = NULL_TREE;
2824 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
2825 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2829 if (TREE_CODE (methods) == FUNCTION_DECL
2830 && DECL_VINDEX (methods) != NULL_TREE
2831 && DECL_NAME (fndecl) == DECL_NAME (methods))
2832 base_fndecls = tree_cons (fndecl, methods, base_fndecls);
2834 methods = TREE_CHAIN (methods);
2838 return base_fndecls;
2840 for (i = 0; i < n_baseclasses; i++)
2842 tree base_binfo = TREE_VEC_ELT (binfos, i);
2843 tree basetype = BINFO_TYPE (base_binfo);
2845 base_fndecls = chainon (get_basefndecls (fndecl, basetype),
2849 return base_fndecls;
2852 /* Mark the functions that have been hidden with their overriders.
2853 Since we start out with all functions already marked with a hider,
2854 no need to mark functions that are just hidden.
2856 Subroutine of warn_hidden. */
2859 mark_overriders (fndecl, base_fndecls)
2860 tree fndecl, base_fndecls;
2862 for (; base_fndecls; base_fndecls = TREE_CHAIN (base_fndecls))
2864 if (overrides (fndecl, TREE_VALUE (base_fndecls)))
2865 TREE_PURPOSE (base_fndecls) = fndecl;
2869 /* If this declaration supersedes the declaration of
2870 a method declared virtual in the base class, then
2871 mark this field as being virtual as well. */
2874 check_for_override (decl, ctype)
2877 tree binfos = BINFO_BASETYPES (TYPE_BINFO (ctype));
2878 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2879 int virtualp = DECL_VIRTUAL_P (decl);
2880 int found_overriden_fn = 0;
2882 for (i = 0; i < n_baselinks; i++)
2884 tree base_binfo = TREE_VEC_ELT (binfos, i);
2885 if (TYPE_POLYMORPHIC_P (BINFO_TYPE (base_binfo)))
2887 tree tmp = get_matching_virtual
2889 DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)));
2891 if (tmp && !found_overriden_fn)
2893 /* If this function overrides some virtual in some base
2894 class, then the function itself is also necessarily
2895 virtual, even if the user didn't explicitly say so. */
2896 DECL_VIRTUAL_P (decl) = 1;
2898 /* The TMP we really want is the one from the deepest
2899 baseclass on this path, taking care not to
2900 duplicate if we have already found it (via another
2901 path to its virtual baseclass. */
2902 if (TREE_CODE (TREE_TYPE (decl)) == FUNCTION_TYPE)
2904 cp_error_at ("`static %#D' cannot be declared", decl);
2905 cp_error_at (" since `virtual %#D' declared in base class",
2912 = tree_cons (NULL_TREE, tmp, DECL_VINDEX (decl));
2914 /* We now know that DECL overrides something,
2915 which is all that is important. But, we must
2916 continue to iterate through all the base-classes
2917 in order to allow get_matching_virtual to check for
2918 various illegal overrides. */
2919 found_overriden_fn = 1;
2925 if (DECL_VINDEX (decl) == NULL_TREE)
2926 DECL_VINDEX (decl) = error_mark_node;
2927 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2931 /* Warn about hidden virtual functions that are not overridden in t.
2932 We know that constructors and destructors don't apply. */
2938 tree method_vec = CLASSTYPE_METHOD_VEC (t);
2939 int n_methods = method_vec ? TREE_VEC_LENGTH (method_vec) : 0;
2942 /* We go through each separately named virtual function. */
2943 for (i = 2; i < n_methods && TREE_VEC_ELT (method_vec, i); ++i)
2945 tree fns = TREE_VEC_ELT (method_vec, i);
2948 tree base_fndecls = NULL_TREE;
2949 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
2950 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2952 /* First see if we have any virtual functions in this batch. */
2953 for (; fns; fns = OVL_NEXT (fns))
2955 fndecl = OVL_CURRENT (fns);
2956 if (DECL_VINDEX (fndecl))
2960 if (fns == NULL_TREE)
2963 /* First we get a list of all possible functions that might be
2964 hidden from each base class. */
2965 for (i = 0; i < n_baseclasses; i++)
2967 tree base_binfo = TREE_VEC_ELT (binfos, i);
2968 tree basetype = BINFO_TYPE (base_binfo);
2970 base_fndecls = chainon (get_basefndecls (fndecl, basetype),
2974 fns = OVL_NEXT (fns);
2976 /* ...then mark up all the base functions with overriders, preferring
2977 overriders to hiders. */
2979 for (; fns; fns = OVL_NEXT (fns))
2981 fndecl = OVL_CURRENT (fns);
2982 if (DECL_VINDEX (fndecl))
2983 mark_overriders (fndecl, base_fndecls);
2986 /* Now give a warning for all base functions without overriders,
2987 as they are hidden. */
2988 for (; base_fndecls; base_fndecls = TREE_CHAIN (base_fndecls))
2990 if (! overrides (TREE_PURPOSE (base_fndecls),
2991 TREE_VALUE (base_fndecls)))
2993 /* Here we know it is a hider, and no overrider exists. */
2994 cp_warning_at ("`%D' was hidden", TREE_VALUE (base_fndecls));
2995 cp_warning_at (" by `%D'", TREE_PURPOSE (base_fndecls));
3001 /* Check for things that are invalid. There are probably plenty of other
3002 things we should check for also. */
3005 finish_struct_anon (t)
3010 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
3012 if (TREE_STATIC (field))
3014 if (TREE_CODE (field) != FIELD_DECL)
3017 if (DECL_NAME (field) == NULL_TREE
3018 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
3020 tree elt = TYPE_FIELDS (TREE_TYPE (field));
3021 for (; elt; elt = TREE_CHAIN (elt))
3023 if (DECL_ARTIFICIAL (elt))
3026 if (DECL_NAME (elt) == constructor_name (t))
3027 cp_pedwarn_at ("ANSI C++ forbids member `%D' with same name as enclosing class",
3030 if (TREE_CODE (elt) != FIELD_DECL)
3032 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
3037 if (TREE_PRIVATE (elt))
3038 cp_pedwarn_at ("private member `%#D' in anonymous union",
3040 else if (TREE_PROTECTED (elt))
3041 cp_pedwarn_at ("protected member `%#D' in anonymous union",
3044 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
3045 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
3051 extern int interface_only, interface_unknown;
3053 /* Create default constructors, assignment operators, and so forth for
3054 the type indicated by T, if they are needed.
3055 CANT_HAVE_DEFAULT_CTOR, CANT_HAVE_CONST_CTOR, and
3056 CANT_HAVE_ASSIGNMENT are nonzero if, for whatever reason, the class
3057 cannot have a default constructor, copy constructor taking a const
3058 reference argument, or an assignment operator, respectively. If a
3059 virtual destructor is created, its DECL is returned; otherwise the
3060 return value is NULL_TREE. */
3063 add_implicitly_declared_members (t, cant_have_default_ctor,
3064 cant_have_const_cctor,
3065 cant_have_assignment)
3067 int cant_have_default_ctor;
3068 int cant_have_const_cctor;
3069 int cant_have_assignment;
3072 tree implicit_fns = NULL_TREE;
3073 tree name = TYPE_IDENTIFIER (t);
3074 tree virtual_dtor = NULL_TREE;
3078 if (TYPE_NEEDS_DESTRUCTOR (t) && !TYPE_HAS_DESTRUCTOR (t))
3080 default_fn = cons_up_default_function (t, name, 0);
3081 check_for_override (default_fn, t);
3083 /* If we couldn't make it work, then pretend we didn't need it. */
3084 if (default_fn == void_type_node)
3085 TYPE_NEEDS_DESTRUCTOR (t) = 0;
3088 TREE_CHAIN (default_fn) = implicit_fns;
3089 implicit_fns = default_fn;
3091 if (DECL_VINDEX (default_fn))
3092 virtual_dtor = default_fn;
3095 TYPE_NEEDS_DESTRUCTOR (t) |= TYPE_HAS_DESTRUCTOR (t);
3097 /* Default constructor. */
3098 if (! TYPE_HAS_CONSTRUCTOR (t) && ! cant_have_default_ctor)
3100 default_fn = cons_up_default_function (t, name, 2);
3101 TREE_CHAIN (default_fn) = implicit_fns;
3102 implicit_fns = default_fn;
3105 /* Copy constructor. */
3106 if (! TYPE_HAS_INIT_REF (t) && ! TYPE_FOR_JAVA (t))
3108 /* ARM 12.18: You get either X(X&) or X(const X&), but
3110 default_fn = cons_up_default_function (t, name,
3111 3 + cant_have_const_cctor);
3112 TREE_CHAIN (default_fn) = implicit_fns;
3113 implicit_fns = default_fn;
3116 /* Assignment operator. */
3117 if (! TYPE_HAS_ASSIGN_REF (t) && ! TYPE_FOR_JAVA (t))
3119 default_fn = cons_up_default_function (t, name,
3120 5 + cant_have_assignment);
3121 TREE_CHAIN (default_fn) = implicit_fns;
3122 implicit_fns = default_fn;
3125 /* Now, hook all of the new functions on to TYPE_METHODS,
3126 and add them to the CLASSTYPE_METHOD_VEC. */
3127 for (f = &implicit_fns; *f; f = &TREE_CHAIN (*f))
3128 add_method (t, 0, *f);
3129 *f = TYPE_METHODS (t);
3130 TYPE_METHODS (t) = implicit_fns;
3132 return virtual_dtor;
3135 /* Subroutine of finish_struct_1. Recursively count the number of fields
3136 in TYPE, including anonymous union members. */
3139 count_fields (fields)
3144 for (x = fields; x; x = TREE_CHAIN (x))
3146 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
3147 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
3154 /* Subroutine of finish_struct_1. Recursively add all the fields in the
3155 TREE_LIST FIELDS to the TREE_VEC FIELD_VEC, starting at offset IDX. */
3158 add_fields_to_vec (fields, field_vec, idx)
3159 tree fields, field_vec;
3163 for (x = fields; x; x = TREE_CHAIN (x))
3165 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
3166 idx = add_fields_to_vec (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
3168 TREE_VEC_ELT (field_vec, idx++) = x;
3173 /* FIELD is a bit-field. We are finishing the processing for its
3174 enclosing type. Issue any appropriate messages and set appropriate
3178 check_bitfield_decl (field)
3181 tree type = TREE_TYPE (field);
3183 /* Invalid bit-field size done by grokfield. */
3184 /* Detect invalid bit-field type. Simply checking if TYPE is
3185 integral is insufficient, as that is the array core of the field
3186 type. If TREE_TYPE (field) is integral, then TYPE must be the same. */
3187 if (DECL_INITIAL (field)
3188 && ! INTEGRAL_TYPE_P (TREE_TYPE (field)))
3190 cp_error_at ("bit-field `%#D' with non-integral type", field);
3191 DECL_INITIAL (field) = NULL;
3194 /* Detect and ignore out of range field width. */
3195 if (DECL_INITIAL (field))
3197 tree w = DECL_INITIAL (field);
3198 register int width = 0;
3200 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3203 /* detect invalid field size. */
3204 if (TREE_CODE (w) == CONST_DECL)
3205 w = DECL_INITIAL (w);
3206 else if (TREE_READONLY_DECL_P (w))
3207 w = decl_constant_value (w);
3209 if (TREE_CODE (w) != INTEGER_CST)
3211 cp_error_at ("bit-field `%D' width not an integer constant",
3213 DECL_INITIAL (field) = NULL_TREE;
3215 else if (width = TREE_INT_CST_LOW (w),
3218 DECL_INITIAL (field) = NULL;
3219 cp_error_at ("negative width in bit-field `%D'", field);
3221 else if (width == 0 && DECL_NAME (field) != 0)
3223 DECL_INITIAL (field) = NULL;
3224 cp_error_at ("zero width for bit-field `%D'", field);
3227 > TYPE_PRECISION (long_long_unsigned_type_node))
3229 /* The backend will dump if you try to use something too
3231 DECL_INITIAL (field) = NULL;
3232 sorry ("bit-fields larger than %d bits",
3233 TYPE_PRECISION (long_long_unsigned_type_node));
3234 cp_error_at (" in declaration of `%D'", field);
3236 else if (width > TYPE_PRECISION (type)
3237 && TREE_CODE (type) != ENUMERAL_TYPE
3238 && TREE_CODE (type) != BOOLEAN_TYPE)
3239 cp_warning_at ("width of `%D' exceeds its type", field);
3240 else if (TREE_CODE (type) == ENUMERAL_TYPE
3241 && ((min_precision (TYPE_MIN_VALUE (type),
3242 TREE_UNSIGNED (type)) > width)
3243 || (min_precision (TYPE_MAX_VALUE (type),
3244 TREE_UNSIGNED (type)) > width)))
3245 cp_warning_at ("`%D' is too small to hold all values of `%#T'",
3248 if (DECL_INITIAL (field))
3250 DECL_INITIAL (field) = NULL_TREE;
3251 DECL_FIELD_SIZE (field) = width;
3252 DECL_BIT_FIELD (field) = 1;
3256 #ifdef EMPTY_FIELD_BOUNDARY
3257 DECL_ALIGN (field) = MAX (DECL_ALIGN (field),
3258 EMPTY_FIELD_BOUNDARY);
3260 #ifdef PCC_BITFIELD_TYPE_MATTERS
3261 if (PCC_BITFIELD_TYPE_MATTERS)
3262 DECL_ALIGN (field) = MAX (DECL_ALIGN (field),
3269 /* Non-bit-fields are aligned for their type. */
3270 DECL_ALIGN (field) = MAX (DECL_ALIGN (field), TYPE_ALIGN (type));
3273 /* FIELD is a non bit-field. We are finishing the processing for its
3274 enclosing type T. Issue any appropriate messages and set appropriate
3278 check_field_decl (field, t, cant_have_const_ctor,
3279 cant_have_default_ctor, no_const_asn_ref,
3280 any_default_members)
3283 int *cant_have_const_ctor;
3284 int *cant_have_default_ctor;
3285 int *no_const_asn_ref;
3286 int *any_default_members;
3288 tree type = strip_array_types (TREE_TYPE (field));
3290 /* An anonymous union cannot contain any fields which would change
3291 the settings of CANT_HAVE_CONST_CTOR and friends. */
3292 if (ANON_UNION_TYPE_P (type))
3294 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
3295 structs. So, we recurse through their fields here. */
3296 else if (ANON_AGGR_TYPE_P (type))
3300 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
3301 if (TREE_CODE (field) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
3302 check_field_decl (fields, t, cant_have_const_ctor,
3303 cant_have_default_ctor, no_const_asn_ref,
3304 any_default_members);
3306 /* Check members with class type for constructors, destructors,
3308 else if (CLASS_TYPE_P (type))
3310 /* Never let anything with uninheritable virtuals
3311 make it through without complaint. */
3312 abstract_virtuals_error (field, type);
3314 if (TREE_CODE (t) == UNION_TYPE)
3316 if (TYPE_NEEDS_CONSTRUCTING (type))
3317 cp_error_at ("member `%#D' with constructor not allowed in union",
3319 if (TYPE_NEEDS_DESTRUCTOR (type))
3320 cp_error_at ("member `%#D' with destructor not allowed in union",
3322 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type))
3323 cp_error_at ("member `%#D' with copy assignment operator not allowed in union",
3328 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
3329 TYPE_NEEDS_DESTRUCTOR (t) |= TYPE_NEEDS_DESTRUCTOR (type);
3330 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
3331 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
3334 if (!TYPE_HAS_CONST_INIT_REF (type))
3335 *cant_have_const_ctor = 1;
3337 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
3338 *no_const_asn_ref = 1;
3340 if (TYPE_HAS_CONSTRUCTOR (type)
3341 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
3342 *cant_have_default_ctor = 1;
3344 if (DECL_INITIAL (field) != NULL_TREE)
3346 /* `build_class_init_list' does not recognize
3348 if (TREE_CODE (t) == UNION_TYPE && any_default_members != 0)
3349 cp_error_at ("multiple fields in union `%T' initialized");
3350 *any_default_members = 1;
3353 /* Non-bit-fields are aligned for their type, except packed fields
3354 which require only BITS_PER_UNIT alignment. */
3355 DECL_ALIGN (field) = MAX (DECL_ALIGN (field),
3356 (DECL_PACKED (field)
3358 : TYPE_ALIGN (TREE_TYPE (field))));
3361 /* Check the data members (both static and non-static), class-scoped
3362 typedefs, etc., appearing in the declaration of T. Issue
3363 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3364 declaration order) of access declarations; each TREE_VALUE in this
3365 list is a USING_DECL.
3367 In addition, set the following flags:
3370 The class is empty, i.e., contains no non-static data members.
3372 CANT_HAVE_DEFAULT_CTOR_P
3373 This class cannot have an implicitly generated default
3376 CANT_HAVE_CONST_CTOR_P
3377 This class cannot have an implicitly generated copy constructor
3378 taking a const reference.
3380 CANT_HAVE_CONST_ASN_REF
3381 This class cannot have an implicitly generated assignment
3382 operator taking a const reference.
3384 All of these flags should be initialized before calling this
3387 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3388 fields can be added by adding to this chain. */
3391 check_field_decls (t, access_decls, empty_p,
3392 cant_have_default_ctor_p, cant_have_const_ctor_p,
3397 int *cant_have_default_ctor_p;
3398 int *cant_have_const_ctor_p;
3399 int *no_const_asn_ref_p;
3404 int any_default_members;
3406 /* First, delete any duplicate fields. */
3407 delete_duplicate_fields (TYPE_FIELDS (t));
3409 /* Assume there are no access declarations. */
3410 *access_decls = NULL_TREE;
3411 /* Assume this class has no pointer members. */
3413 /* Assume none of the members of this class have default
3415 any_default_members = 0;
3417 for (field = &TYPE_FIELDS (t); *field; field = next)
3420 tree type = TREE_TYPE (x);
3422 GNU_xref_member (current_class_name, x);
3424 next = &TREE_CHAIN (x);
3426 if (TREE_CODE (x) == FIELD_DECL)
3428 DECL_PACKED (x) |= TYPE_PACKED (t);
3430 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
3431 /* We don't treat zero-width bitfields as making a class
3436 /* The class is non-empty. */
3438 /* The class is not even nearly empty. */
3439 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3443 if (TREE_CODE (x) == USING_DECL)
3445 /* Prune the access declaration from the list of fields. */
3446 *field = TREE_CHAIN (x);
3448 /* Save the access declarations for our caller. */
3449 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
3451 /* Since we've reset *FIELD there's no reason to skip to the
3457 if (TREE_CODE (x) == TYPE_DECL
3458 || TREE_CODE (x) == TEMPLATE_DECL)
3461 /* If we've gotten this far, it's a data member, possibly static,
3462 or an enumerator. */
3464 DECL_FIELD_CONTEXT (x) = t;
3466 /* ``A local class cannot have static data members.'' ARM 9.4 */
3467 if (current_function_decl && TREE_STATIC (x))
3468 cp_error_at ("field `%D' in local class cannot be static", x);
3470 /* Perform error checking that did not get done in
3472 if (TREE_CODE (type) == FUNCTION_TYPE)
3474 cp_error_at ("field `%D' invalidly declared function type",
3476 type = build_pointer_type (type);
3477 TREE_TYPE (x) = type;
3479 else if (TREE_CODE (type) == METHOD_TYPE)
3481 cp_error_at ("field `%D' invalidly declared method type", x);
3482 type = build_pointer_type (type);
3483 TREE_TYPE (x) = type;
3485 else if (TREE_CODE (type) == OFFSET_TYPE)
3487 cp_error_at ("field `%D' invalidly declared offset type", x);
3488 type = build_pointer_type (type);
3489 TREE_TYPE (x) = type;
3492 if (type == error_mark_node)
3495 DECL_SAVED_INSNS (x) = 0;
3496 DECL_FIELD_SIZE (x) = 0;
3498 /* When this goes into scope, it will be a non-local reference. */
3499 DECL_NONLOCAL (x) = 1;
3501 if (TREE_CODE (x) == CONST_DECL)
3504 if (TREE_CODE (x) == VAR_DECL)
3506 if (TREE_CODE (t) == UNION_TYPE)
3507 /* Unions cannot have static members. */
3508 cp_error_at ("field `%D' declared static in union", x);
3513 /* Now it can only be a FIELD_DECL. */
3515 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
3516 CLASSTYPE_NON_AGGREGATE (t) = 1;
3518 /* If this is of reference type, check if it needs an init.
3519 Also do a little ANSI jig if necessary. */
3520 if (TREE_CODE (type) == REFERENCE_TYPE)
3522 CLASSTYPE_NON_POD_P (t) = 1;
3523 if (DECL_INITIAL (x) == NULL_TREE)
3524 CLASSTYPE_REF_FIELDS_NEED_INIT (t) = 1;
3526 /* ARM $12.6.2: [A member initializer list] (or, for an
3527 aggregate, initialization by a brace-enclosed list) is the
3528 only way to initialize nonstatic const and reference
3530 *cant_have_default_ctor_p = 1;
3531 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3533 if (! TYPE_HAS_CONSTRUCTOR (t) && extra_warnings)
3536 cp_warning_at ("non-static reference `%#D' in class without a constructor", x);
3538 cp_warning_at ("non-static reference in class without a constructor", x);
3542 type = strip_array_types (type);
3544 if (TREE_CODE (type) == POINTER_TYPE)
3547 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
3548 CLASSTYPE_HAS_MUTABLE (t) = 1;
3550 if (! pod_type_p (type)
3551 /* For some reason, pointers to members are POD types themselves,
3552 but are not allowed in POD structs. Silly. */
3553 || TYPE_PTRMEM_P (type) || TYPE_PTRMEMFUNC_P (type))
3554 CLASSTYPE_NON_POD_P (t) = 1;
3556 /* If any field is const, the structure type is pseudo-const. */
3557 if (CP_TYPE_CONST_P (type))
3559 C_TYPE_FIELDS_READONLY (t) = 1;
3560 if (DECL_INITIAL (x) == NULL_TREE)
3561 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) = 1;
3563 /* ARM $12.6.2: [A member initializer list] (or, for an
3564 aggregate, initialization by a brace-enclosed list) is the
3565 only way to initialize nonstatic const and reference
3567 *cant_have_default_ctor_p = 1;
3568 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3570 if (! TYPE_HAS_CONSTRUCTOR (t) && extra_warnings)
3573 cp_warning_at ("non-static const member `%#D' in class without a constructor", x);
3575 cp_warning_at ("non-static const member in class without a constructor", x);
3578 /* A field that is pseudo-const makes the structure likewise. */
3579 else if (IS_AGGR_TYPE (type))
3581 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
3582 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
3583 |= CLASSTYPE_READONLY_FIELDS_NEED_INIT (type);
3586 /* We set DECL_C_BIT_FIELD in grokbitfield.
3587 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3588 if (DECL_C_BIT_FIELD (x))
3589 check_bitfield_decl (x);
3591 check_field_decl (x, t,
3592 cant_have_const_ctor_p,
3593 cant_have_default_ctor_p,
3595 &any_default_members);
3598 /* Effective C++ rule 11. */
3599 if (has_pointers && warn_ecpp && TYPE_HAS_CONSTRUCTOR (t)
3600 && ! (TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3602 cp_warning ("`%#T' has pointer data members", t);
3604 if (! TYPE_HAS_INIT_REF (t))
3606 cp_warning (" but does not override `%T(const %T&)'", t, t);
3607 if (! TYPE_HAS_ASSIGN_REF (t))
3608 cp_warning (" or `operator=(const %T&)'", t);
3610 else if (! TYPE_HAS_ASSIGN_REF (t))
3611 cp_warning (" but does not override `operator=(const %T&)'", t);
3615 /* Check anonymous struct/anonymous union fields. */
3616 finish_struct_anon (t);
3618 /* We've built up the list of access declarations in reverse order.
3620 *access_decls = nreverse (*access_decls);
3623 /* Return a FIELD_DECL for a pointer-to-virtual-table or
3624 pointer-to-virtual-base. The NAME, ASSEMBLER_NAME, and TYPE of the
3625 field are as indicated. The CLASS_TYPE in which this field occurs
3626 is also indicated. *EMPTY_P is set to a non-zero value by this
3627 function to indicate that a class containing this field is
3631 build_vtbl_or_vbase_field (name, assembler_name, type, class_type,
3634 tree assembler_name;
3641 /* This class is non-empty. */
3644 /* Build the FIELD_DECL. */
3645 field = build_lang_decl (FIELD_DECL, name, type);
3646 DECL_ASSEMBLER_NAME (field) = assembler_name;
3647 DECL_VIRTUAL_P (field) = 1;
3648 DECL_ARTIFICIAL (field) = 1;
3649 DECL_FIELD_CONTEXT (field) = class_type;
3650 DECL_CLASS_CONTEXT (field) = class_type;
3651 DECL_FCONTEXT (field) = class_type;
3652 DECL_SAVED_INSNS (field) = 0;
3653 DECL_FIELD_SIZE (field) = 0;
3654 DECL_ALIGN (field) = TYPE_ALIGN (type);
3660 /* Returns list of virtual base class pointers in a FIELD_DECL chain. */
3663 build_vbase_pointer_fields (rec, empty_p)
3667 /* Chain to hold all the new FIELD_DECLs which point at virtual
3669 tree vbase_decls = NULL_TREE;
3670 tree binfos = TYPE_BINFO_BASETYPES (rec);
3671 int n_baseclasses = CLASSTYPE_N_BASECLASSES (rec);
3675 /* Handle basetypes almost like fields, but record their
3676 offsets differently. */
3678 for (i = 0; i < n_baseclasses; i++)
3680 register tree base_binfo = TREE_VEC_ELT (binfos, i);
3681 register tree basetype = BINFO_TYPE (base_binfo);
3683 if (TYPE_SIZE (basetype) == 0)
3684 /* This error is now reported in xref_tag, thus giving better
3685 location information. */
3688 /* All basetypes are recorded in the association list of the
3691 if (TREE_VIA_VIRTUAL (base_binfo))
3696 /* The offset for a virtual base class is only used in computing
3697 virtual function tables and for initializing virtual base
3698 pointers. It is built once `get_vbase_types' is called. */
3700 /* If this basetype can come from another vbase pointer
3701 without an additional indirection, we will share
3702 that pointer. If an indirection is involved, we
3703 make our own pointer. */
3704 for (j = 0; j < n_baseclasses; j++)
3706 tree other_base_binfo = TREE_VEC_ELT (binfos, j);
3707 if (! TREE_VIA_VIRTUAL (other_base_binfo)
3708 && BINFO_FOR_VBASE (basetype, BINFO_TYPE (other_base_binfo)))
3711 FORMAT_VBASE_NAME (name, basetype);
3712 decl = build_vtbl_or_vbase_field (get_identifier (name),
3713 get_identifier (VTABLE_BASE),
3714 build_pointer_type (basetype),
3717 BINFO_VPTR_FIELD (base_binfo) = decl;
3718 TREE_CHAIN (decl) = vbase_decls;
3723 /* The space this decl occupies has already been accounted for. */
3731 /* If the empty base field in DECL overlaps with a base of the same type in
3732 NEWDECL, which is either another base field or the first data field of
3733 the class, pad the base just before NEWDECL and return 1. Otherwise,
3737 avoid_overlap (decl, newdecl, empty_p)
3743 if (newdecl == NULL_TREE
3744 || ! types_overlap_p (TREE_TYPE (decl), TREE_TYPE (newdecl)))
3747 for (field = decl; TREE_CHAIN (field) && TREE_CHAIN (field) != newdecl;
3748 field = TREE_CHAIN (field))
3751 DECL_SIZE (field) = integer_one_node;
3752 /* The containing class cannot be empty; this field takes up space. */
3758 /* Returns a list of fields to stand in for the base class subobjects
3759 of REC. These fields are later removed by layout_basetypes. */
3762 build_base_fields (rec, empty_p)
3766 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3768 tree base_decls = NULL_TREE;
3769 tree binfos = TYPE_BINFO_BASETYPES (rec);
3770 int n_baseclasses = CLASSTYPE_N_BASECLASSES (rec);
3771 tree decl, nextdecl;
3772 int i, saw_empty = 0;
3773 unsigned int base_align = 0;
3775 for (i = 0; i < n_baseclasses; ++i)
3777 register tree base_binfo = TREE_VEC_ELT (binfos, i);
3778 register tree basetype = BINFO_TYPE (base_binfo);
3780 if (TYPE_SIZE (basetype) == 0)
3781 /* This error is now reported in xref_tag, thus giving better
3782 location information. */
3785 if (TREE_VIA_VIRTUAL (base_binfo))
3788 decl = build_lang_decl (FIELD_DECL, NULL_TREE, basetype);
3789 DECL_ARTIFICIAL (decl) = 1;
3790 DECL_FIELD_CONTEXT (decl) = DECL_CLASS_CONTEXT (decl) = rec;
3791 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
3792 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
3793 TREE_CHAIN (decl) = base_decls;
3796 if (flag_new_abi && DECL_SIZE (decl) == integer_zero_node)
3800 /* The containing class is non-empty because it has a
3801 non-empty base class. */
3806 /* Brain damage for backwards compatibility. For no
3807 good reason, the old layout_basetypes made every base
3808 at least as large as the alignment for the bases up
3809 to that point, gratuitously wasting space. So we do
3810 the same thing here. */
3811 base_align = MAX (base_align, DECL_ALIGN (decl));
3813 = size_int (MAX (TREE_INT_CST_LOW (DECL_SIZE (decl)),
3819 /* Reverse the list of fields so we allocate the bases in the proper
3821 base_decls = nreverse (base_decls);
3823 /* In the presence of empty base classes, we run the risk of allocating
3824 two objects of the same class on top of one another. Avoid that. */
3825 if (flag_new_abi && saw_empty)
3826 for (decl = base_decls; decl; decl = TREE_CHAIN (decl))
3828 if (DECL_SIZE (decl) == integer_zero_node)
3830 /* First step through the following bases until we find
3831 an overlap or a non-empty base. */
3832 for (nextdecl = TREE_CHAIN (decl); nextdecl;
3833 nextdecl = TREE_CHAIN (nextdecl))
3835 if (avoid_overlap (decl, nextdecl, empty_p)
3836 || DECL_SIZE (nextdecl) != integer_zero_node)
3840 /* If we're still looking, also check against the first
3842 for (nextdecl = TYPE_FIELDS (rec);
3843 nextdecl && TREE_CODE (nextdecl) != FIELD_DECL;
3844 nextdecl = TREE_CHAIN (nextdecl))
3846 avoid_overlap (decl, nextdecl, empty_p);
3854 /* Go through the TYPE_METHODS of T issuing any appropriate
3855 diagnostics, figuring out which methods override which other
3856 methods, and so forth. */
3864 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
3866 GNU_xref_member (current_class_name, x);
3868 /* If this was an evil function, don't keep it in class. */
3869 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (x)))
3872 /* Do both of these, even though they're in the same union;
3873 if the insn `r' member and the size `i' member are
3874 different sizes, as on the alpha, the larger of the two
3875 will end up with garbage in it. */
3876 DECL_SAVED_INSNS (x) = 0;
3877 DECL_FIELD_SIZE (x) = 0;
3879 check_for_override (x, t);
3880 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
3881 cp_error_at ("initializer specified for non-virtual method `%D'", x);
3883 /* The name of the field is the original field name
3884 Save this in auxiliary field for later overloading. */
3885 if (DECL_VINDEX (x))
3887 TYPE_POLYMORPHIC_P (t) = 1;
3888 if (DECL_PURE_VIRTUAL_P (x))
3889 CLASSTYPE_PURE_VIRTUALS (t)
3890 = tree_cons (NULL_TREE, x, CLASSTYPE_PURE_VIRTUALS (t));
3895 /* Remove all zero-width bit-fields from T. */
3898 remove_zero_width_bit_fields (t)
3903 fieldsp = &TYPE_FIELDS (t);
3906 if (TREE_CODE (*fieldsp) == FIELD_DECL
3907 && DECL_C_BIT_FIELD (*fieldsp)
3908 && DECL_INITIAL (*fieldsp))
3909 *fieldsp = TREE_CHAIN (*fieldsp);
3911 fieldsp = &TREE_CHAIN (*fieldsp);
3915 /* Check the validity of the bases and members declared in T. Add any
3916 implicitly-generated functions (like copy-constructors and
3917 assignment operators). Compute various flag bits (like
3918 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
3919 level: i.e., independently of the ABI in use. */
3922 check_bases_and_members (t, empty_p)
3926 /* Nonzero if we are not allowed to generate a default constructor
3928 int cant_have_default_ctor;
3929 /* Nonzero if the implicitly generated copy constructor should take
3930 a non-const reference argument. */
3931 int cant_have_const_ctor;
3932 /* Nonzero if the the implicitly generated assignment operator
3933 should take a non-const reference argument. */
3934 int no_const_asn_ref;
3937 /* By default, we use const reference arguments and generate default
3939 cant_have_default_ctor = 0;
3940 cant_have_const_ctor = 0;
3941 no_const_asn_ref = 0;
3943 /* Assume that the class is nearly empty; we'll clear this flag if
3944 it turns out not to be nearly empty. */
3945 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
3947 /* Check all the base-classes. */
3948 check_bases (t, &cant_have_default_ctor, &cant_have_const_ctor,
3951 /* Check all the data member declarations. */
3952 check_field_decls (t, &access_decls, empty_p,
3953 &cant_have_default_ctor,
3954 &cant_have_const_ctor,
3957 /* Check all the method declarations. */
3960 /* A nearly-empty class has to be polymorphic; a nearly empty class
3962 if (!TYPE_POLYMORPHIC_P (t))
3963 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3965 /* Do some bookkeeping that will guide the generation of implicitly
3966 declared member functions. */
3967 TYPE_HAS_COMPLEX_INIT_REF (t)
3968 |= (TYPE_HAS_INIT_REF (t)
3969 || TYPE_USES_VIRTUAL_BASECLASSES (t)
3970 || TYPE_POLYMORPHIC_P (t));
3971 TYPE_NEEDS_CONSTRUCTING (t)
3972 |= (TYPE_HAS_CONSTRUCTOR (t)
3973 || TYPE_USES_VIRTUAL_BASECLASSES (t)
3974 || TYPE_POLYMORPHIC_P (t));
3975 CLASSTYPE_NON_AGGREGATE (t) |= (TYPE_HAS_CONSTRUCTOR (t)
3976 || TYPE_POLYMORPHIC_P (t));
3977 CLASSTYPE_NON_POD_P (t)
3978 |= (CLASSTYPE_NON_AGGREGATE (t) || TYPE_HAS_DESTRUCTOR (t)
3979 || TYPE_HAS_ASSIGN_REF (t));
3980 TYPE_HAS_REAL_ASSIGN_REF (t) |= TYPE_HAS_ASSIGN_REF (t);
3981 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
3982 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_USES_VIRTUAL_BASECLASSES (t);
3984 /* Synthesize any needed methods. Note that methods will be synthesized
3985 for anonymous unions; grok_x_components undoes that. */
3986 add_implicitly_declared_members (t, cant_have_default_ctor,
3987 cant_have_const_ctor,
3990 /* Build and sort the CLASSTYPE_METHOD_VEC. */
3991 finish_struct_methods (t);
3993 /* Process the access-declarations. We wait until now to do this
3994 because handle_using_decls requires that the CLASSTYPE_METHOD_VEC
3995 be set up correctly. */
3996 while (access_decls)
3998 handle_using_decl (TREE_VALUE (access_decls), t);
3999 access_decls = TREE_CHAIN (access_decls);
4003 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4004 accordingly, and, if necessary, add the TYPE_VFIELD to the
4005 TYPE_FIELDS list. */
4008 create_vtable_ptr (t, empty_p, has_virtual_p, max_has_virtual_p,
4009 pending_virtuals_p, pending_hard_virtuals_p)
4013 int *max_has_virtual_p;
4014 tree *pending_virtuals_p;
4015 tree *pending_hard_virtuals_p;
4019 /* If possible, we reuse the virtual function table pointer from one
4020 of our base classes. */
4021 if (CLASSTYPE_N_BASECLASSES (t))
4023 struct base_info base_info;
4025 /* Remember where we got our vfield from. */
4026 determine_primary_base (t, &base_info);
4027 *has_virtual_p = base_info.has_virtual;
4028 *max_has_virtual_p = base_info.max_has_virtual;
4031 /* Loop over the virtual functions, adding them to our various
4033 for (fn = TYPE_METHODS (t); fn; fn = TREE_CHAIN (fn))
4034 if (DECL_VINDEX (fn))
4035 add_virtual_function (pending_virtuals_p, pending_hard_virtuals_p,
4036 has_virtual_p, fn, t);
4038 /* If we couldn't find an appropriate base class, create a new field
4040 if (*has_virtual_p && !TYPE_VFIELD (t))
4042 /* We build this decl with vtbl_ptr_type_node, which is a
4043 `vtable_entry_type*'. It might seem more precise to use
4044 `vtable_entry_type (*)[N]' where N is the number of firtual
4045 functions. However, that would require the vtable pointer in
4046 base classes to have a different type than the vtable pointer
4047 in derived classes. We could make that happen, but that
4048 still wouldn't solve all the problems. In particular, the
4049 type-based alias analysis code would decide that assignments
4050 to the base class vtable pointer can't alias assignments to
4051 the derived class vtable pointer, since they have different
4052 types. Thus, in an derived class destructor, where the base
4053 class constructor was inlined, we could generate bad code for
4054 setting up the vtable pointer.
4056 Therefore, we use one type for all vtable pointers. We still
4057 use a type-correct type; it's just doesn't indicate the array
4058 bounds. That's better than using `void*' or some such; it's
4059 cleaner, and it let's the alias analysis code know that these
4060 stores cannot alias stores to void*! */
4062 = build_vtbl_or_vbase_field (get_vfield_name (t),
4063 get_identifier (VFIELD_BASE),
4068 /* Add the new field to the list of fields in this class. */
4070 /* In the old ABI, the vtable pointer goes at the end of the
4072 TYPE_FIELDS (t) = chainon (TYPE_FIELDS (t), TYPE_VFIELD (t));
4075 /* But in the new ABI, the vtable pointer is the first thing
4077 TYPE_FIELDS (t) = chainon (TYPE_VFIELD (t), TYPE_FIELDS (t));
4078 /* If there were any baseclasses, they can't possibly be at
4079 offset zero any more, because that's where the vtable
4080 pointer is. So, converting to a base class is going to
4082 if (CLASSTYPE_N_BASECLASSES (t))
4083 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (t) = 1;
4086 /* We can't yet add this new field to the list of all virtual
4087 function table pointers in this class. The
4088 modify_all_vtables function depends on this not being done.
4089 So, it is done later, in finish_struct_1. */
4093 /* Fixup the inline function given by INFO now that the class is
4097 fixup_pending_inline (info)
4098 struct pending_inline *info;
4103 tree fn = info->fndecl;
4105 args = DECL_ARGUMENTS (fn);
4108 DECL_CONTEXT (args) = fn;
4109 args = TREE_CHAIN (args);
4114 /* Fixup the inline methods and friends in TYPE now that TYPE is
4118 fixup_inline_methods (type)
4121 tree method = TYPE_METHODS (type);
4123 if (method && TREE_CODE (method) == TREE_VEC)
4125 if (TREE_VEC_ELT (method, 1))
4126 method = TREE_VEC_ELT (method, 1);
4127 else if (TREE_VEC_ELT (method, 0))
4128 method = TREE_VEC_ELT (method, 0);
4130 method = TREE_VEC_ELT (method, 2);
4133 /* Do inline member functions. */
4134 for (; method; method = TREE_CHAIN (method))
4135 fixup_pending_inline (DECL_PENDING_INLINE_INFO (method));
4138 for (method = CLASSTYPE_INLINE_FRIENDS (type);
4140 method = TREE_CHAIN (method))
4141 fixup_pending_inline (DECL_PENDING_INLINE_INFO (TREE_VALUE (method)));
4142 CLASSTYPE_INLINE_FRIENDS (type) = NULL_TREE;
4145 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4146 BINFO_OFFSETs for all of the base-classes. Position the vtable
4150 layout_class_type (t, empty_p, has_virtual_p, max_has_virtual_p,
4151 pending_virtuals_p, pending_hard_virtuals_p)
4155 int *max_has_virtual_p;
4156 tree *pending_virtuals_p;
4157 tree *pending_hard_virtuals_p;
4159 /* Add pointers to all of our virtual base-classes. */
4160 TYPE_FIELDS (t) = chainon (build_vbase_pointer_fields (t, empty_p),
4162 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4163 TYPE_FIELDS (t) = chainon (build_base_fields (t, empty_p),
4166 /* Create a pointer to our virtual function table. */
4167 create_vtable_ptr (t, empty_p, has_virtual_p, max_has_virtual_p,
4168 pending_virtuals_p, pending_hard_virtuals_p);
4170 /* CLASSTYPE_INLINE_FRIENDS is really TYPE_NONCOPIED_PARTS. Thus,
4171 we have to save this before we start modifying
4172 TYPE_NONCOPIED_PARTS. */
4173 fixup_inline_methods (t);
4175 /* We make all structures have at least one element, so that they
4176 have non-zero size. The field that we add here is fake, in the
4177 sense that, for example, we don't want people to be able to
4178 initialize it later. So, we add it just long enough to let the
4179 back-end lay out the type, and then remove it. */
4182 tree decl = build_lang_decl
4183 (FIELD_DECL, NULL_TREE, char_type_node);
4184 TREE_CHAIN (decl) = TYPE_FIELDS (t);
4185 TYPE_FIELDS (t) = decl;
4186 TYPE_NONCOPIED_PARTS (t)
4187 = tree_cons (NULL_TREE, decl, TYPE_NONCOPIED_PARTS (t));
4188 TREE_STATIC (TYPE_NONCOPIED_PARTS (t)) = 1;
4191 /* Let the back-end lay out the type. Note that at this point we
4192 have only included non-virtual base-classes; we will lay out the
4193 virtual base classes later. So, the TYPE_SIZE/TYPE_ALIGN after
4194 this call are not necessarily correct; they are just the size and
4195 alignment when no virtual base clases are used. */
4198 /* If we added an extra field to make this class non-empty, remove
4201 TYPE_FIELDS (t) = TREE_CHAIN (TYPE_FIELDS (t));
4203 /* Delete all zero-width bit-fields from the list of fields. Now
4204 that the type is laid out they are no longer important. */
4205 remove_zero_width_bit_fields (t);
4207 /* Remember the size and alignment of the class before adding
4208 the virtual bases. */
4209 if (*empty_p && flag_new_abi)
4210 CLASSTYPE_SIZE (t) = integer_zero_node;
4211 else if (flag_new_abi && TYPE_HAS_COMPLEX_INIT_REF (t)
4212 && TYPE_HAS_COMPLEX_ASSIGN_REF (t))
4213 CLASSTYPE_SIZE (t) = TYPE_BINFO_SIZE (t);
4215 CLASSTYPE_SIZE (t) = TYPE_SIZE (t);
4216 CLASSTYPE_ALIGN (t) = TYPE_ALIGN (t);
4218 /* Set the TYPE_DECL for this type to contain the right
4219 value for DECL_OFFSET, so that we can use it as part
4220 of a COMPONENT_REF for multiple inheritance. */
4221 layout_decl (TYPE_MAIN_DECL (t), 0);
4223 /* Now fix up any virtual base class types that we left lying
4224 around. We must get these done before we try to lay out the
4225 virtual function table. */
4226 if (CLASSTYPE_N_BASECLASSES (t))
4227 /* layout_basetypes will remove the base subobject fields. */
4228 *max_has_virtual_p = layout_basetypes (t, *max_has_virtual_p);
4231 /* Create a RECORD_TYPE or UNION_TYPE node for a C struct or union declaration
4232 (or C++ class declaration).
4234 For C++, we must handle the building of derived classes.
4235 Also, C++ allows static class members. The way that this is
4236 handled is to keep the field name where it is (as the DECL_NAME
4237 of the field), and place the overloaded decl in the DECL_FIELD_BITPOS
4238 of the field. layout_record and layout_union will know about this.
4240 More C++ hair: inline functions have text in their
4241 DECL_PENDING_INLINE_INFO nodes which must somehow be parsed into
4242 meaningful tree structure. After the struct has been laid out, set
4243 things up so that this can happen.
4245 And still more: virtual functions. In the case of single inheritance,
4246 when a new virtual function is seen which redefines a virtual function
4247 from the base class, the new virtual function is placed into
4248 the virtual function table at exactly the same address that
4249 it had in the base class. When this is extended to multiple
4250 inheritance, the same thing happens, except that multiple virtual
4251 function tables must be maintained. The first virtual function
4252 table is treated in exactly the same way as in the case of single
4253 inheritance. Additional virtual function tables have different
4254 DELTAs, which tell how to adjust `this' to point to the right thing.
4256 ATTRIBUTES is the set of decl attributes to be applied, if any. */
4264 int max_has_virtual;
4265 tree pending_virtuals = NULL_TREE;
4266 tree pending_hard_virtuals = NULL_TREE;
4273 if (IS_AGGR_TYPE (t))
4274 cp_error ("redefinition of `%#T'", t);
4276 my_friendly_abort (172);
4281 GNU_xref_decl (current_function_decl, t);
4283 /* If this type was previously laid out as a forward reference,
4284 make sure we lay it out again. */
4286 TYPE_SIZE (t) = NULL_TREE;
4287 CLASSTYPE_GOT_SEMICOLON (t) = 0;
4288 CLASSTYPE_VFIELD_PARENT (t) = -1;
4290 max_has_virtual = 0;
4291 CLASSTYPE_RTTI (t) = NULL_TREE;
4293 /* Do end-of-class semantic processing: checking the validity of the
4294 bases and members and add implicitly generated methods. */
4295 check_bases_and_members (t, &empty);
4297 /* Layout the class itself. */
4298 layout_class_type (t, &empty, &has_virtual, &max_has_virtual,
4299 &pending_virtuals, &pending_hard_virtuals);
4301 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
4305 vbases = CLASSTYPE_VBASECLASSES (t);
4308 /* Now fixup overrides of all functions in vtables from all
4309 direct or indirect virtual base classes. */
4310 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
4311 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
4313 for (i = 0; i < n_baseclasses; i++)
4315 tree base_binfo = TREE_VEC_ELT (binfos, i);
4316 tree basetype = BINFO_TYPE (base_binfo);
4319 vbases = CLASSTYPE_VBASECLASSES (basetype);
4322 merge_overrides (binfo_member (BINFO_TYPE (vbases),
4323 CLASSTYPE_VBASECLASSES (t)),
4325 vbases = TREE_CHAIN (vbases);
4331 /* Set up the DECL_FIELD_BITPOS of the vfield if we need to, as we
4332 might need to know it for setting up the offsets in the vtable
4333 (or in thunks) below. */
4334 vfield = TYPE_VFIELD (t);
4335 if (vfield != NULL_TREE
4336 && DECL_FIELD_CONTEXT (vfield) != t)
4338 tree binfo = get_binfo (DECL_FIELD_CONTEXT (vfield), t, 0);
4339 tree offset = BINFO_OFFSET (binfo);
4341 vfield = copy_node (vfield);
4342 copy_lang_decl (vfield);
4344 if (! integer_zerop (offset))
4345 offset = size_binop (MULT_EXPR, offset, size_int (BITS_PER_UNIT));
4346 DECL_FIELD_CONTEXT (vfield) = t;
4347 DECL_CLASS_CONTEXT (vfield) = t;
4348 DECL_FIELD_BITPOS (vfield)
4349 = size_binop (PLUS_EXPR, offset, DECL_FIELD_BITPOS (vfield));
4350 TYPE_VFIELD (t) = vfield;
4353 if (has_virtual > max_has_virtual)
4354 max_has_virtual = has_virtual;
4355 if (max_has_virtual > 0)
4356 TYPE_POLYMORPHIC_P (t) = 1;
4358 if (flag_rtti && TYPE_POLYMORPHIC_P (t) && !pending_hard_virtuals)
4359 modify_all_vtables (t, NULL_TREE);
4361 for (pending_hard_virtuals = nreverse (pending_hard_virtuals);
4362 pending_hard_virtuals;
4363 pending_hard_virtuals = TREE_CHAIN (pending_hard_virtuals))
4364 modify_all_vtables (t, TREE_VALUE (pending_hard_virtuals));
4366 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
4369 /* Now fixup any virtual function entries from virtual bases
4370 that have different deltas. This has to come after we do the
4371 pending hard virtuals, as we might have a function that comes
4372 from multiple virtual base instances that is only overridden
4373 by a hard virtual above. */
4374 vbases = CLASSTYPE_VBASECLASSES (t);
4377 /* We might be able to shorten the amount of work we do by
4378 only doing this for vtables that come from virtual bases
4379 that have differing offsets, but don't want to miss any
4381 fixup_vtable_deltas (vbases, 1, t);
4382 vbases = TREE_CHAIN (vbases);
4386 /* Under our model of GC, every C++ class gets its own virtual
4387 function table, at least virtually. */
4388 if (pending_virtuals)
4390 pending_virtuals = nreverse (pending_virtuals);
4391 /* We must enter these virtuals into the table. */
4392 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4394 if (! CLASSTYPE_COM_INTERFACE (t))
4396 /* The second slot is for the tdesc pointer when thunks are used. */
4397 if (flag_vtable_thunks)
4398 pending_virtuals = tree_cons (NULL_TREE, NULL_TREE, pending_virtuals);
4400 /* The first slot is for the rtti offset. */
4401 pending_virtuals = tree_cons (NULL_TREE, NULL_TREE, pending_virtuals);
4403 set_rtti_entry (pending_virtuals,
4404 convert (ssizetype, integer_zero_node), t);
4406 build_vtable (NULL_TREE, t);
4410 /* Here we know enough to change the type of our virtual
4411 function table, but we will wait until later this function. */
4413 if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
4414 build_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
4417 /* If this type has basetypes with constructors, then those
4418 constructors might clobber the virtual function table. But
4419 they don't if the derived class shares the exact vtable of the base
4422 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t) = 1;
4424 else if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4426 tree binfo = CLASSTYPE_PRIMARY_BINFO (t);
4428 /* This class contributes nothing new to the virtual function
4429 table. However, it may have declared functions which
4430 went into the virtual function table "inherited" from the
4431 base class. If so, we grab a copy of those updated functions,
4432 and pretend they are ours. */
4434 /* See if we should steal the virtual info from base class. */
4435 if (TYPE_BINFO_VTABLE (t) == NULL_TREE)
4436 TYPE_BINFO_VTABLE (t) = BINFO_VTABLE (binfo);
4437 if (TYPE_BINFO_VIRTUALS (t) == NULL_TREE)
4438 TYPE_BINFO_VIRTUALS (t) = BINFO_VIRTUALS (binfo);
4439 if (TYPE_BINFO_VTABLE (t) != BINFO_VTABLE (binfo))
4440 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t) = 1;
4443 if (max_has_virtual || CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4445 CLASSTYPE_VSIZE (t) = has_virtual;
4446 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4448 if (pending_virtuals)
4449 TYPE_BINFO_VIRTUALS (t) = chainon (TYPE_BINFO_VIRTUALS (t),
4452 else if (has_virtual)
4454 TYPE_BINFO_VIRTUALS (t) = pending_virtuals;
4455 DECL_VIRTUAL_P (TYPE_BINFO_VTABLE (t)) = 1;
4459 /* Now lay out the virtual function table. */
4462 /* Use size_int so values are memoized in common cases. */
4463 tree itype = build_index_type (size_int (has_virtual));
4464 tree atype = build_cplus_array_type (vtable_entry_type, itype);
4466 layout_type (atype);
4468 /* We may have to grow the vtable. */
4469 if (TREE_TYPE (TYPE_BINFO_VTABLE (t)) != atype)
4471 TREE_TYPE (TYPE_BINFO_VTABLE (t)) = atype;
4472 DECL_SIZE (TYPE_BINFO_VTABLE (t)) = 0;
4473 layout_decl (TYPE_BINFO_VTABLE (t), 0);
4474 /* At one time the vtable info was grabbed 2 words at a time. This
4475 fails on sparc unless you have 8-byte alignment. (tiemann) */
4476 DECL_ALIGN (TYPE_BINFO_VTABLE (t))
4477 = MAX (TYPE_ALIGN (double_type_node),
4478 DECL_ALIGN (TYPE_BINFO_VTABLE (t)));
4482 /* If we created a new vtbl pointer for this class, add it to the
4484 if (TYPE_VFIELD (t) && CLASSTYPE_VFIELD_PARENT (t) == -1)
4485 CLASSTYPE_VFIELDS (t)
4486 = chainon (CLASSTYPE_VFIELDS (t), build_tree_list (NULL_TREE, t));
4488 finish_struct_bits (t, max_has_virtual);
4490 /* Complete the rtl for any static member objects of the type we're
4492 for (x = TYPE_FIELDS (t); x; x = TREE_CHAIN (x))
4494 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
4495 && TREE_TYPE (x) == t)
4497 DECL_MODE (x) = TYPE_MODE (t);
4498 make_decl_rtl (x, NULL, 0);
4502 /* Done with FIELDS...now decide whether to sort these for
4503 faster lookups later.
4505 The C front-end only does this when n_fields > 15. We use
4506 a smaller number because most searches fail (succeeding
4507 ultimately as the search bores through the inheritance
4508 hierarchy), and we want this failure to occur quickly. */
4510 n_fields = count_fields (TYPE_FIELDS (t));
4513 tree field_vec = make_tree_vec (n_fields);
4514 add_fields_to_vec (TYPE_FIELDS (t), field_vec, 0);
4515 qsort (&TREE_VEC_ELT (field_vec, 0), n_fields, sizeof (tree),
4516 (int (*)(const void *, const void *))field_decl_cmp);
4517 if (! DECL_LANG_SPECIFIC (TYPE_MAIN_DECL (t)))
4518 retrofit_lang_decl (TYPE_MAIN_DECL (t));
4519 DECL_SORTED_FIELDS (TYPE_MAIN_DECL (t)) = field_vec;
4522 if (TYPE_HAS_CONSTRUCTOR (t))
4524 tree vfields = CLASSTYPE_VFIELDS (t);
4528 /* Mark the fact that constructor for T
4529 could affect anybody inheriting from T
4530 who wants to initialize vtables for VFIELDS's type. */
4531 if (VF_DERIVED_VALUE (vfields))
4532 TREE_ADDRESSABLE (vfields) = 1;
4533 vfields = TREE_CHAIN (vfields);
4537 if (CLASSTYPE_VSIZE (t) != 0)
4539 /* In addition to this one, all the other vfields should be listed. */
4540 /* Before that can be done, we have to have FIELD_DECLs for them, and
4541 a place to find them. */
4542 TYPE_NONCOPIED_PARTS (t)
4543 = tree_cons (default_conversion (TYPE_BINFO_VTABLE (t)),
4544 TYPE_VFIELD (t), TYPE_NONCOPIED_PARTS (t));
4546 if (warn_nonvdtor && TYPE_HAS_DESTRUCTOR (t)
4547 && DECL_VINDEX (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (t), 1)) == NULL_TREE)
4548 cp_warning ("`%#T' has virtual functions but non-virtual destructor",
4552 /* Make the rtl for any new vtables we have created, and unmark
4553 the base types we marked. */
4554 finish_vtbls (TYPE_BINFO (t), 1, t);
4555 hack_incomplete_structures (t);
4557 if (warn_overloaded_virtual)
4560 maybe_suppress_debug_info (t);
4562 /* Finish debugging output for this type. */
4563 rest_of_type_compilation (t, toplevel_bindings_p ());
4566 /* When T was built up, the member declarations were added in reverse
4567 order. Rearrange them to declaration order. */
4570 unreverse_member_declarations (t)
4577 /* The TYPE_FIELDS, TYPE_METHODS, and CLASSTYPE_TAGS are all in
4578 reverse order. Put them in declaration order now. */
4579 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
4580 CLASSTYPE_TAGS (t) = nreverse (CLASSTYPE_TAGS (t));
4582 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
4583 reverse order, so we can't just use nreverse. */
4585 for (x = TYPE_FIELDS (t);
4586 x && TREE_CODE (x) != TYPE_DECL;
4589 next = TREE_CHAIN (x);
4590 TREE_CHAIN (x) = prev;
4595 TREE_CHAIN (TYPE_FIELDS (t)) = x;
4597 TYPE_FIELDS (t) = prev;
4602 finish_struct (t, attributes)
4605 /* Now that we've got all the field declarations, reverse everything
4607 unreverse_member_declarations (t);
4609 cplus_decl_attributes (t, attributes, NULL_TREE);
4611 if (processing_template_decl)
4613 finish_struct_methods (t);
4614 TYPE_SIZE (t) = integer_zero_node;
4617 finish_struct_1 (t);
4619 TYPE_BEING_DEFINED (t) = 0;
4621 if (current_class_type)
4624 error ("trying to finish struct, but kicked out due to previous parse errors.");
4626 if (processing_template_decl)
4628 tree scope = current_scope ();
4629 if (scope && TREE_CODE (scope) == FUNCTION_DECL)
4630 add_tree (build_min (TAG_DEFN, t));
4636 /* Return the dynamic type of INSTANCE, if known.
4637 Used to determine whether the virtual function table is needed
4640 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
4641 of our knowledge of its type. */
4644 fixed_type_or_null (instance, nonnull)
4651 switch (TREE_CODE (instance))
4654 /* Check that we are not going through a cast of some sort. */
4655 if (TREE_TYPE (instance)
4656 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (instance, 0))))
4657 instance = TREE_OPERAND (instance, 0);
4658 /* fall through... */
4660 /* This is a call to a constructor, hence it's never zero. */
4661 if (TREE_HAS_CONSTRUCTOR (instance))
4665 return TREE_TYPE (instance);
4670 /* This is a call to a constructor, hence it's never zero. */
4671 if (TREE_HAS_CONSTRUCTOR (instance))
4675 return TREE_TYPE (instance);
4677 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
4684 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
4685 /* Propagate nonnull. */
4686 fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
4687 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
4688 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
4693 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
4698 return fixed_type_or_null (TREE_OPERAND (instance, 0), nonnull);
4701 return fixed_type_or_null (TREE_OPERAND (instance, 1), nonnull);
4705 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
4706 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
4710 return TREE_TYPE (TREE_TYPE (instance));
4712 /* fall through... */
4715 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
4719 return TREE_TYPE (instance);
4723 if (instance == current_class_ptr
4724 && flag_this_is_variable <= 0)
4726 /* Normally, 'this' must be non-null. */
4727 if (flag_this_is_variable == 0)
4730 /* <0 means we're in a constructor and we know our type. */
4731 if (flag_this_is_variable < 0)
4732 return TREE_TYPE (TREE_TYPE (instance));
4734 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
4735 /* Reference variables should be references to objects. */
4745 /* Return non-zero if the dynamic type of INSTANCE is known, and equivalent
4746 to the static type. We also handle the case where INSTANCE is really
4749 Used to determine whether the virtual function table is needed
4752 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
4753 of our knowledge of its type. */
4756 resolves_to_fixed_type_p (instance, nonnull)
4760 tree t = TREE_TYPE (instance);
4761 tree fixed = fixed_type_or_null (instance, nonnull);
4762 if (fixed == NULL_TREE)
4764 if (POINTER_TYPE_P (t))
4766 return same_type_p (TYPE_MAIN_VARIANT (t), TYPE_MAIN_VARIANT (fixed));
4771 init_class_processing ()
4773 current_class_depth = 0;
4774 current_class_stack_size = 10;
4776 = (class_stack_node_t) xmalloc (current_class_stack_size
4777 * sizeof (struct class_stack_node));
4779 access_default_node = build_int_2 (0, 0);
4780 access_public_node = build_int_2 (1, 0);
4781 access_protected_node = build_int_2 (2, 0);
4782 access_private_node = build_int_2 (3, 0);
4783 access_default_virtual_node = build_int_2 (4, 0);
4784 access_public_virtual_node = build_int_2 (5, 0);
4785 access_protected_virtual_node = build_int_2 (6, 0);
4786 access_private_virtual_node = build_int_2 (7, 0);
4789 /* Set current scope to NAME. CODE tells us if this is a
4790 STRUCT, UNION, or ENUM environment.
4792 NAME may end up being NULL_TREE if this is an anonymous or
4793 late-bound struct (as in "struct { ... } foo;") */
4795 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE to
4796 appropriate values, found by looking up the type definition of
4799 If MODIFY is 1, we set IDENTIFIER_CLASS_VALUE's of names
4800 which can be seen locally to the class. They are shadowed by
4801 any subsequent local declaration (including parameter names).
4803 If MODIFY is 2, we set IDENTIFIER_CLASS_VALUE's of names
4804 which have static meaning (i.e., static members, static
4805 member functions, enum declarations, etc).
4807 If MODIFY is 3, we set IDENTIFIER_CLASS_VALUE of names
4808 which can be seen locally to the class (as in 1), but
4809 know that we are doing this for declaration purposes
4810 (i.e. friend foo::bar (int)).
4812 So that we may avoid calls to lookup_name, we cache the _TYPE
4813 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
4815 For multiple inheritance, we perform a two-pass depth-first search
4816 of the type lattice. The first pass performs a pre-order search,
4817 marking types after the type has had its fields installed in
4818 the appropriate IDENTIFIER_CLASS_VALUE slot. The second pass merely
4819 unmarks the marked types. If a field or member function name
4820 appears in an ambiguous way, the IDENTIFIER_CLASS_VALUE of
4821 that name becomes `error_mark_node'. */
4824 pushclass (type, modify)
4828 type = TYPE_MAIN_VARIANT (type);
4830 /* Make sure there is enough room for the new entry on the stack. */
4831 if (current_class_depth + 1 >= current_class_stack_size)
4833 current_class_stack_size *= 2;
4835 = (class_stack_node_t) xrealloc (current_class_stack,
4836 current_class_stack_size
4837 * sizeof (struct class_stack_node));
4840 /* Insert a new entry on the class stack. */
4841 current_class_stack[current_class_depth].name = current_class_name;
4842 current_class_stack[current_class_depth].type = current_class_type;
4843 current_class_stack[current_class_depth].access = current_access_specifier;
4844 current_class_stack[current_class_depth].names_used = 0;
4845 current_class_depth++;
4847 /* Now set up the new type. */
4848 current_class_name = TYPE_NAME (type);
4849 if (TREE_CODE (current_class_name) == TYPE_DECL)
4850 current_class_name = DECL_NAME (current_class_name);
4851 current_class_type = type;
4853 /* By default, things in classes are private, while things in
4854 structures or unions are public. */
4855 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
4856 ? access_private_node
4857 : access_public_node);
4859 if (previous_class_type != NULL_TREE
4860 && (type != previous_class_type
4861 || TYPE_SIZE (previous_class_type) == NULL_TREE)
4862 && current_class_depth == 1)
4864 /* Forcibly remove any old class remnants. */
4865 invalidate_class_lookup_cache ();
4868 /* If we're about to enter a nested class, clear
4869 IDENTIFIER_CLASS_VALUE for the enclosing classes. */
4870 if (modify && current_class_depth > 1)
4871 clear_identifier_class_values ();
4876 if (CLASSTYPE_TEMPLATE_INFO (type))
4877 overload_template_name (type);
4882 if (type != previous_class_type || current_class_depth > 1)
4883 push_class_decls (type);
4888 /* We are re-entering the same class we just left, so we
4889 don't have to search the whole inheritance matrix to find
4890 all the decls to bind again. Instead, we install the
4891 cached class_shadowed list, and walk through it binding
4892 names and setting up IDENTIFIER_TYPE_VALUEs. */
4893 set_class_shadows (previous_class_values);
4894 for (item = previous_class_values; item; item = TREE_CHAIN (item))
4896 tree id = TREE_PURPOSE (item);
4897 tree decl = TREE_TYPE (item);
4899 push_class_binding (id, decl);
4900 if (TREE_CODE (decl) == TYPE_DECL)
4901 set_identifier_type_value (id, TREE_TYPE (decl));
4903 unuse_fields (type);
4906 storetags (CLASSTYPE_TAGS (type));
4910 /* When we exit a toplevel class scope, we save the
4911 IDENTIFIER_CLASS_VALUEs so that we can restore them quickly if we
4912 reenter the class. Here, we've entered some other class, so we
4913 must invalidate our cache. */
4916 invalidate_class_lookup_cache ()
4920 /* This code can be seen as a cache miss. When we've cached a
4921 class' scope's bindings and we can't use them, we need to reset
4922 them. This is it! */
4923 for (t = previous_class_values; t; t = TREE_CHAIN (t))
4924 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
4926 previous_class_type = NULL_TREE;
4929 /* Get out of the current class scope. If we were in a class scope
4930 previously, that is the one popped to. */
4936 /* Since poplevel_class does the popping of class decls nowadays,
4937 this really only frees the obstack used for these decls. */
4940 current_class_depth--;
4941 current_class_name = current_class_stack[current_class_depth].name;
4942 current_class_type = current_class_stack[current_class_depth].type;
4943 current_access_specifier = current_class_stack[current_class_depth].access;
4944 if (current_class_stack[current_class_depth].names_used)
4945 splay_tree_delete (current_class_stack[current_class_depth].names_used);
4948 /* Returns 1 if current_class_type is either T or a nested type of T. */
4951 currently_open_class (t)
4955 if (t == current_class_type)
4957 for (i = 0; i < current_class_depth; ++i)
4958 if (current_class_stack [i].type == t)
4963 /* When entering a class scope, all enclosing class scopes' names with
4964 static meaning (static variables, static functions, types and enumerators)
4965 have to be visible. This recursive function calls pushclass for all
4966 enclosing class contexts until global or a local scope is reached.
4967 TYPE is the enclosed class and MODIFY is equivalent with the pushclass
4968 formal of the same name. */
4971 push_nested_class (type, modify)
4977 /* A namespace might be passed in error cases, like A::B:C. */
4978 if (type == NULL_TREE || type == error_mark_node || ! IS_AGGR_TYPE (type)
4979 || TREE_CODE (type) == NAMESPACE_DECL
4980 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
4981 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
4984 context = DECL_CONTEXT (TYPE_MAIN_DECL (type));
4986 if (context && CLASS_TYPE_P (context))
4987 push_nested_class (context, 2);
4988 pushclass (type, modify);
4991 /* Undoes a push_nested_class call. MODIFY is passed on to popclass. */
4996 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
4999 if (context && CLASS_TYPE_P (context))
5000 pop_nested_class ();
5003 /* Set global variables CURRENT_LANG_NAME to appropriate value
5004 so that behavior of name-mangling machinery is correct. */
5007 push_lang_context (name)
5010 *current_lang_stack++ = current_lang_name;
5011 if (current_lang_stack - &VARRAY_TREE (current_lang_base, 0)
5012 >= (ptrdiff_t) VARRAY_SIZE (current_lang_base))
5014 size_t old_size = VARRAY_SIZE (current_lang_base);
5016 VARRAY_GROW (current_lang_base, old_size + 10);
5017 current_lang_stack = &VARRAY_TREE (current_lang_base, old_size);
5020 if (name == lang_name_cplusplus)
5022 strict_prototype = strict_prototypes_lang_cplusplus;
5023 current_lang_name = name;
5025 else if (name == lang_name_java)
5027 strict_prototype = strict_prototypes_lang_cplusplus;
5028 current_lang_name = name;
5029 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5030 (See record_builtin_java_type in decl.c.) However, that causes
5031 incorrect debug entries if these types are actually used.
5032 So we re-enable debug output after extern "Java". */
5033 DECL_IGNORED_P (java_byte_type_node) = 0;
5034 DECL_IGNORED_P (java_short_type_node) = 0;
5035 DECL_IGNORED_P (java_int_type_node) = 0;
5036 DECL_IGNORED_P (java_long_type_node) = 0;
5037 DECL_IGNORED_P (java_float_type_node) = 0;
5038 DECL_IGNORED_P (java_double_type_node) = 0;
5039 DECL_IGNORED_P (java_char_type_node) = 0;
5040 DECL_IGNORED_P (java_boolean_type_node) = 0;
5042 else if (name == lang_name_c)
5044 strict_prototype = strict_prototypes_lang_c;
5045 current_lang_name = name;
5048 error ("language string `\"%s\"' not recognized", IDENTIFIER_POINTER (name));
5051 /* Get out of the current language scope. */
5056 /* Clear the current entry so that garbage collector won't hold on
5058 *current_lang_stack = NULL_TREE;
5059 current_lang_name = *--current_lang_stack;
5060 if (current_lang_name == lang_name_cplusplus
5061 || current_lang_name == lang_name_java)
5062 strict_prototype = strict_prototypes_lang_cplusplus;
5063 else if (current_lang_name == lang_name_c)
5064 strict_prototype = strict_prototypes_lang_c;
5067 /* Type instantiation routines. */
5069 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5070 matches the TARGET_TYPE. If there is no satisfactory match, return
5071 error_mark_node, and issue an error message if COMPLAIN is
5072 non-zero. If TEMPLATE_ONLY, the name of the overloaded function
5073 was a template-id, and EXPLICIT_TARGS are the explicitly provided
5074 template arguments. */
5077 resolve_address_of_overloaded_function (target_type,
5086 tree explicit_targs;
5088 /* Here's what the standard says:
5092 If the name is a function template, template argument deduction
5093 is done, and if the argument deduction succeeds, the deduced
5094 arguments are used to generate a single template function, which
5095 is added to the set of overloaded functions considered.
5097 Non-member functions and static member functions match targets of
5098 type "pointer-to-function" or "reference-to-function." Nonstatic
5099 member functions match targets of type "pointer-to-member
5100 function;" the function type of the pointer to member is used to
5101 select the member function from the set of overloaded member
5102 functions. If a nonstatic member function is selected, the
5103 reference to the overloaded function name is required to have the
5104 form of a pointer to member as described in 5.3.1.
5106 If more than one function is selected, any template functions in
5107 the set are eliminated if the set also contains a non-template
5108 function, and any given template function is eliminated if the
5109 set contains a second template function that is more specialized
5110 than the first according to the partial ordering rules 14.5.5.2.
5111 After such eliminations, if any, there shall remain exactly one
5112 selected function. */
5115 int is_reference = 0;
5116 /* We store the matches in a TREE_LIST rooted here. The functions
5117 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5118 interoperability with most_specialized_instantiation. */
5119 tree matches = NULL_TREE;
5122 /* By the time we get here, we should be seeing only real
5123 pointer-to-member types, not the internal POINTER_TYPE to
5124 METHOD_TYPE representation. */
5125 my_friendly_assert (!(TREE_CODE (target_type) == POINTER_TYPE
5126 && (TREE_CODE (TREE_TYPE (target_type))
5127 == METHOD_TYPE)), 0);
5129 /* Check that the TARGET_TYPE is reasonable. */
5130 if (TYPE_PTRFN_P (target_type))
5133 else if (TYPE_PTRMEMFUNC_P (target_type))
5134 /* This is OK, too. */
5136 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
5138 /* This is OK, too. This comes from a conversion to reference
5140 target_type = build_reference_type (target_type);
5146 cp_error("cannot resolve overloaded function `%D' based on conversion to type `%T'",
5147 DECL_NAME (OVL_FUNCTION (overload)), target_type);
5148 return error_mark_node;
5151 /* If we can find a non-template function that matches, we can just
5152 use it. There's no point in generating template instantiations
5153 if we're just going to throw them out anyhow. But, of course, we
5154 can only do this when we don't *need* a template function. */
5159 for (fns = overload; fns; fns = OVL_CHAIN (fns))
5161 tree fn = OVL_FUNCTION (fns);
5164 if (TREE_CODE (fn) == TEMPLATE_DECL)
5165 /* We're not looking for templates just yet. */
5168 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5170 /* We're looking for a non-static member, and this isn't
5171 one, or vice versa. */
5174 /* See if there's a match. */
5175 fntype = TREE_TYPE (fn);
5177 fntype = build_ptrmemfunc_type (build_pointer_type (fntype));
5178 else if (!is_reference)
5179 fntype = build_pointer_type (fntype);
5181 if (can_convert_arg (target_type, fntype, fn))
5182 matches = tree_cons (fn, NULL_TREE, matches);
5186 /* Now, if we've already got a match (or matches), there's no need
5187 to proceed to the template functions. But, if we don't have a
5188 match we need to look at them, too. */
5191 tree target_fn_type;
5192 tree target_arg_types;
5197 = TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (target_type));
5199 target_fn_type = TREE_TYPE (target_type);
5200 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
5202 for (fns = overload; fns; fns = OVL_CHAIN (fns))
5204 tree fn = OVL_FUNCTION (fns);
5206 tree instantiation_type;
5209 if (TREE_CODE (fn) != TEMPLATE_DECL)
5210 /* We're only looking for templates. */
5213 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
5215 /* We're not looking for a non-static member, and this is
5216 one, or vice versa. */
5219 /* Try to do argument deduction. */
5220 targs = make_tree_vec (DECL_NTPARMS (fn));
5221 if (fn_type_unification (fn, explicit_targs, targs,
5222 target_arg_types, NULL_TREE,
5224 /* Argument deduction failed. */
5227 /* Instantiate the template. */
5228 instantiation = instantiate_template (fn, targs);
5229 if (instantiation == error_mark_node)
5230 /* Instantiation failed. */
5233 /* See if there's a match. */
5234 instantiation_type = TREE_TYPE (instantiation);
5236 instantiation_type =
5237 build_ptrmemfunc_type (build_pointer_type (instantiation_type));
5238 else if (!is_reference)
5239 instantiation_type = build_pointer_type (instantiation_type);
5240 if (can_convert_arg (target_type, instantiation_type, instantiation))
5241 matches = tree_cons (instantiation, fn, matches);
5244 /* Now, remove all but the most specialized of the matches. */
5247 tree match = most_specialized_instantiation (matches,
5250 if (match != error_mark_node)
5251 matches = tree_cons (match, NULL_TREE, NULL_TREE);
5255 /* Now we should have exactly one function in MATCHES. */
5256 if (matches == NULL_TREE)
5258 /* There were *no* matches. */
5261 cp_error ("no matches converting function `%D' to type `%#T'",
5262 DECL_NAME (OVL_FUNCTION (overload)),
5265 /* print_candidates expects a chain with the functions in
5266 TREE_VALUE slots, so we cons one up here (we're losing anyway,
5267 so why be clever?). */
5268 for (; overload; overload = OVL_NEXT (overload))
5269 matches = tree_cons (NULL_TREE, OVL_CURRENT (overload),
5272 print_candidates (matches);
5274 return error_mark_node;
5276 else if (TREE_CHAIN (matches))
5278 /* There were too many matches. */
5284 cp_error ("converting overloaded function `%D' to type `%#T' is ambiguous",
5285 DECL_NAME (OVL_FUNCTION (overload)),
5288 /* Since print_candidates expects the functions in the
5289 TREE_VALUE slot, we flip them here. */
5290 for (match = matches; match; match = TREE_CHAIN (match))
5291 TREE_VALUE (match) = TREE_PURPOSE (match);
5293 print_candidates (matches);
5296 return error_mark_node;
5299 /* Good, exactly one match. Now, convert it to the correct type. */
5300 fn = TREE_PURPOSE (matches);
5304 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
5305 return build_unary_op (ADDR_EXPR, fn, 0);
5308 /* The target must be a REFERENCE_TYPE. Above, build_unary_op
5309 will mark the function as addressed, but here we must do it
5311 mark_addressable (fn);
5317 /* This function will instantiate the type of the expression given in
5318 RHS to match the type of LHSTYPE. If errors exist, then return
5319 error_mark_node. We only complain is COMPLAIN is set. If we are
5320 not complaining, never modify rhs, as overload resolution wants to
5321 try many possible instantiations, in hopes that at least one will
5324 FLAGS is a bitmask, as we see at the top of the function.
5326 For non-recursive calls, LHSTYPE should be a function, pointer to
5327 function, or a pointer to member function. */
5330 instantiate_type (lhstype, rhs, flags)
5334 int complain = (flags & 1);
5335 int strict = (flags & 2) ? COMPARE_NO_ATTRIBUTES : COMPARE_STRICT;
5337 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
5340 error ("not enough type information");
5341 return error_mark_node;
5344 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
5346 if (comptypes (lhstype, TREE_TYPE (rhs), strict))
5349 cp_error ("argument of type `%T' does not match `%T'",
5350 TREE_TYPE (rhs), lhstype);
5351 return error_mark_node;
5354 /* We don't overwrite rhs if it is an overloaded function.
5355 Copying it would destroy the tree link. */
5356 if (TREE_CODE (rhs) != OVERLOAD)
5357 rhs = copy_node (rhs);
5359 /* This should really only be used when attempting to distinguish
5360 what sort of a pointer to function we have. For now, any
5361 arithmetic operation which is not supported on pointers
5362 is rejected as an error. */
5364 switch (TREE_CODE (rhs))
5371 my_friendly_abort (177);
5372 return error_mark_node;
5379 new_rhs = instantiate_type (build_pointer_type (lhstype),
5380 TREE_OPERAND (rhs, 0), flags);
5381 if (new_rhs == error_mark_node)
5382 return error_mark_node;
5384 TREE_TYPE (rhs) = lhstype;
5385 TREE_OPERAND (rhs, 0) = new_rhs;
5390 rhs = copy_node (TREE_OPERAND (rhs, 0));
5391 TREE_TYPE (rhs) = unknown_type_node;
5392 return instantiate_type (lhstype, rhs, flags);
5396 tree r = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
5398 if (r != error_mark_node && TYPE_PTRMEMFUNC_P (lhstype)
5399 && complain && !flag_ms_extensions)
5401 /* Note: we check this after the recursive call to avoid
5402 complaining about cases where overload resolution fails. */
5404 tree t = TREE_TYPE (TREE_OPERAND (rhs, 0));
5405 tree fn = PTRMEM_CST_MEMBER (r);
5407 my_friendly_assert (TREE_CODE (r) == PTRMEM_CST, 990811);
5410 ("object-dependent reference to `%E' can only be used in a call",
5413 (" to form a pointer to member function, say `&%T::%E'",
5421 rhs = TREE_OPERAND (rhs, 1);
5422 if (BASELINK_P (rhs))
5423 return instantiate_type (lhstype, TREE_VALUE (rhs), flags);
5425 /* This can happen if we are forming a pointer-to-member for a
5427 my_friendly_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR, 0);
5431 case TEMPLATE_ID_EXPR:
5433 resolve_address_of_overloaded_function (lhstype,
5434 TREE_OPERAND (rhs, 0),
5436 /*template_only=*/1,
5437 TREE_OPERAND (rhs, 1));
5441 resolve_address_of_overloaded_function (lhstype,
5444 /*template_only=*/0,
5445 /*explicit_targs=*/NULL_TREE);
5448 /* Now we should have a baselink. */
5449 my_friendly_assert (BASELINK_P (rhs), 990412);
5451 return instantiate_type (lhstype, TREE_VALUE (rhs), flags);
5454 /* This is too hard for now. */
5455 my_friendly_abort (183);
5456 return error_mark_node;
5461 TREE_OPERAND (rhs, 0)
5462 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
5463 if (TREE_OPERAND (rhs, 0) == error_mark_node)
5464 return error_mark_node;
5465 TREE_OPERAND (rhs, 1)
5466 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
5467 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5468 return error_mark_node;
5470 TREE_TYPE (rhs) = lhstype;
5474 case TRUNC_DIV_EXPR:
5475 case FLOOR_DIV_EXPR:
5477 case ROUND_DIV_EXPR:
5479 case TRUNC_MOD_EXPR:
5480 case FLOOR_MOD_EXPR:
5482 case ROUND_MOD_EXPR:
5483 case FIX_ROUND_EXPR:
5484 case FIX_FLOOR_EXPR:
5486 case FIX_TRUNC_EXPR:
5502 case PREINCREMENT_EXPR:
5503 case PREDECREMENT_EXPR:
5504 case POSTINCREMENT_EXPR:
5505 case POSTDECREMENT_EXPR:
5507 error ("invalid operation on uninstantiated type");
5508 return error_mark_node;
5510 case TRUTH_AND_EXPR:
5512 case TRUTH_XOR_EXPR:
5519 case TRUTH_ANDIF_EXPR:
5520 case TRUTH_ORIF_EXPR:
5521 case TRUTH_NOT_EXPR:
5523 error ("not enough type information");
5524 return error_mark_node;
5527 if (type_unknown_p (TREE_OPERAND (rhs, 0)))
5530 error ("not enough type information");
5531 return error_mark_node;
5533 TREE_OPERAND (rhs, 1)
5534 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
5535 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5536 return error_mark_node;
5537 TREE_OPERAND (rhs, 2)
5538 = instantiate_type (lhstype, TREE_OPERAND (rhs, 2), flags);
5539 if (TREE_OPERAND (rhs, 2) == error_mark_node)
5540 return error_mark_node;
5542 TREE_TYPE (rhs) = lhstype;
5546 TREE_OPERAND (rhs, 1)
5547 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), flags);
5548 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5549 return error_mark_node;
5551 TREE_TYPE (rhs) = lhstype;
5555 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
5557 case ENTRY_VALUE_EXPR:
5558 my_friendly_abort (184);
5559 return error_mark_node;
5562 return error_mark_node;
5565 my_friendly_abort (185);
5566 return error_mark_node;
5570 /* Return the name of the virtual function pointer field
5571 (as an IDENTIFIER_NODE) for the given TYPE. Note that
5572 this may have to look back through base types to find the
5573 ultimate field name. (For single inheritance, these could
5574 all be the same name. Who knows for multiple inheritance). */
5577 get_vfield_name (type)
5580 tree binfo = TYPE_BINFO (type);
5583 while (BINFO_BASETYPES (binfo)
5584 && TYPE_POLYMORPHIC_P (BINFO_TYPE (BINFO_BASETYPE (binfo, 0)))
5585 && ! TREE_VIA_VIRTUAL (BINFO_BASETYPE (binfo, 0)))
5586 binfo = BINFO_BASETYPE (binfo, 0);
5588 type = BINFO_TYPE (binfo);
5589 buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT)
5590 + TYPE_NAME_LENGTH (type) + 2);
5591 sprintf (buf, VFIELD_NAME_FORMAT, TYPE_NAME_STRING (type));
5592 return get_identifier (buf);
5596 print_class_statistics ()
5598 #ifdef GATHER_STATISTICS
5599 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
5600 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
5601 fprintf (stderr, "build_method_call = %d (inner = %d)\n",
5602 n_build_method_call, n_inner_fields_searched);
5605 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
5606 n_vtables, n_vtable_searches);
5607 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
5608 n_vtable_entries, n_vtable_elems);
5613 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
5614 according to [class]:
5615 The class-name is also inserted
5616 into the scope of the class itself. For purposes of access checking,
5617 the inserted class name is treated as if it were a public member name. */
5620 build_self_reference ()
5622 tree name = constructor_name (current_class_type);
5623 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
5626 DECL_NONLOCAL (value) = 1;
5627 DECL_CONTEXT (value) = current_class_type;
5628 DECL_CLASS_CONTEXT (value) = current_class_type;
5629 DECL_ARTIFICIAL (value) = 1;
5631 if (processing_template_decl)
5632 value = push_template_decl (value);
5634 saved_cas = current_access_specifier;
5635 current_access_specifier = access_public_node;
5636 finish_member_declaration (value);
5637 current_access_specifier = saved_cas;
5640 /* Returns 1 if TYPE contains only padding bytes. */
5643 is_empty_class (type)
5648 if (type == error_mark_node)
5651 if (! IS_AGGR_TYPE (type))
5655 return CLASSTYPE_SIZE (type) == integer_zero_node;
5657 if (TYPE_BINFO_BASETYPES (type))
5659 t = TYPE_FIELDS (type);
5660 while (t && TREE_CODE (t) != FIELD_DECL)
5662 return (t == NULL_TREE);
5665 /* Find the enclosing class of the given NODE. NODE can be a *_DECL or
5666 a *_TYPE node. NODE can also be a local class. */
5669 get_enclosing_class (type)
5674 while (node && TREE_CODE (node) != NAMESPACE_DECL)
5676 switch (TREE_CODE_CLASS (TREE_CODE (node)))
5679 node = DECL_CONTEXT (node);
5685 node = TYPE_CONTEXT (node);
5689 my_friendly_abort (0);
5695 /* Return 1 if TYPE or one of its enclosing classes is derived from BASE. */
5698 is_base_of_enclosing_class (base, type)
5703 if (get_binfo (base, type, 0))
5706 type = get_enclosing_class (type);
5711 /* Note that NAME was looked up while the current class was being
5712 defined and that the result of that lookup was DECL. */
5715 maybe_note_name_used_in_class (name, decl)
5719 splay_tree names_used;
5721 /* If we're not defining a class, there's nothing to do. */
5722 if (!current_class_type || !TYPE_BEING_DEFINED (current_class_type))
5725 /* If there's already a binding for this NAME, then we don't have
5726 anything to worry about. */
5727 if (IDENTIFIER_CLASS_VALUE (name))
5730 if (!current_class_stack[current_class_depth - 1].names_used)
5731 current_class_stack[current_class_depth - 1].names_used
5732 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
5733 names_used = current_class_stack[current_class_depth - 1].names_used;
5735 splay_tree_insert (names_used,
5736 (splay_tree_key) name,
5737 (splay_tree_value) decl);
5740 /* Note that NAME was declared (as DECL) in the current class. Check
5741 to see that the declaration is legal. */
5744 note_name_declared_in_class (name, decl)
5748 splay_tree names_used;
5751 /* Look to see if we ever used this name. */
5753 = current_class_stack[current_class_depth - 1].names_used;
5757 n = splay_tree_lookup (names_used, (splay_tree_key) name);
5760 /* [basic.scope.class]
5762 A name N used in a class S shall refer to the same declaration
5763 in its context and when re-evaluated in the completed scope of
5765 cp_error ("declaration of `%#D'", decl);
5766 cp_error_at ("changes meaning of `%s' from `%+#D'",
5767 IDENTIFIER_POINTER (DECL_NAME (decl)),