1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 92, 93, 94, 95, 96, 1997 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. */
35 #define obstack_chunk_alloc xmalloc
36 #define obstack_chunk_free free
38 extern struct obstack permanent_obstack;
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 /* Way of stacking class types. */
47 static tree *current_class_base, *current_class_stack;
48 static int current_class_stacksize;
49 int current_class_depth;
53 /* The previous class level. */
54 struct class_level *level_chain;
56 /* The class instance variable, as a PARM_DECL. */
58 /* The class instance variable, as an object. */
60 /* The virtual function table pointer
61 for the class instance variable. */
64 /* Name of the current class. */
66 /* Type of the current class. */
69 /* Flags for this class level. */
76 /* The current_class_ptr is the pointer to the current class.
77 current_class_ref is the actual current class. */
78 tree current_class_ptr, current_class_ref;
80 /* The following two can be derived from the previous one */
81 tree current_class_name; /* IDENTIFIER_NODE: name of current class */
82 tree current_class_type; /* _TYPE: the type of the current class */
83 tree previous_class_type; /* _TYPE: the previous type that was a class */
84 tree previous_class_values; /* TREE_LIST: copy of the class_shadowed list
85 when leaving an outermost class scope. */
89 static tree get_vfield_name PROTO((tree));
90 static void finish_struct_anon PROTO((tree));
91 static tree build_vbase_pointer PROTO((tree, tree));
92 static int complete_type_p PROTO((tree));
93 static int typecode_p PROTO((tree, enum tree_code));
94 static tree build_vtable_entry PROTO((tree, tree));
95 static tree get_vtable_name PROTO((tree));
96 static tree get_derived_offset PROTO((tree, tree));
97 static tree get_basefndecls PROTO((tree, tree));
98 static void set_rtti_entry PROTO((tree, tree, tree));
99 static tree build_vtable PROTO((tree, tree));
100 static void prepare_fresh_vtable PROTO((tree, tree));
101 static void fixup_vtable_deltas1 PROTO((tree, tree));
102 static void fixup_vtable_deltas PROTO((tree, int, tree));
103 static void grow_method PROTO((tree, tree *));
104 static void finish_vtbls PROTO((tree, int, tree));
105 static void modify_vtable_entry PROTO((tree, tree, tree));
106 static tree get_vtable_entry_n PROTO((tree, unsigned HOST_WIDE_INT));
107 static void add_virtual_function PROTO((tree *, tree *, int *, tree, tree));
108 static tree delete_duplicate_fields_1 PROTO((tree, tree));
109 static void delete_duplicate_fields PROTO((tree));
110 static void finish_struct_bits PROTO((tree, int));
111 static int alter_access PROTO((tree, tree, tree));
112 static int overrides PROTO((tree, tree));
113 static int strictly_overrides PROTO((tree, tree));
114 static void merge_overrides PROTO((tree, tree, int, tree));
115 static void override_one_vtable PROTO((tree, tree, tree));
116 static void mark_overriders PROTO((tree, tree));
117 static void check_for_override PROTO((tree, tree));
118 static tree maybe_fixup_vptrs PROTO((tree, tree, tree));
119 static tree get_class_offset_1 PROTO((tree, tree, tree, tree, tree));
120 static tree get_class_offset PROTO((tree, tree, tree, tree));
121 static void modify_one_vtable PROTO((tree, tree, tree, tree));
122 static void modify_all_vtables PROTO((tree, tree, tree));
123 static void modify_all_direct_vtables PROTO((tree, int, tree, tree,
125 static void modify_all_indirect_vtables PROTO((tree, int, int, tree,
127 static void build_class_init_list PROTO((tree));
128 static int finish_base_struct PROTO((tree, struct base_info *));
130 /* Way of stacking language names. */
131 tree *current_lang_base, *current_lang_stack;
132 int current_lang_stacksize;
134 /* Names of languages we recognize. */
135 tree lang_name_c, lang_name_cplusplus, lang_name_java;
136 tree current_lang_name;
138 /* When layout out an aggregate type, the size of the
139 basetypes (virtual and non-virtual) is passed to layout_record
141 static tree base_layout_decl;
143 /* Constants used for access control. */
144 tree access_default_node; /* 0 */
145 tree access_public_node; /* 1 */
146 tree access_protected_node; /* 2 */
147 tree access_private_node; /* 3 */
148 tree access_default_virtual_node; /* 4 */
149 tree access_public_virtual_node; /* 5 */
150 tree access_protected_virtual_node; /* 6 */
151 tree access_private_virtual_node; /* 7 */
153 /* Variables shared between class.c and call.c. */
155 #ifdef GATHER_STATISTICS
157 int n_vtable_entries = 0;
158 int n_vtable_searches = 0;
159 int n_vtable_elems = 0;
160 int n_convert_harshness = 0;
161 int n_compute_conversion_costs = 0;
162 int n_build_method_call = 0;
163 int n_inner_fields_searched = 0;
166 /* Virtual baseclass things. */
169 build_vbase_pointer (exp, type)
174 name = (char *) alloca (TYPE_NAME_LENGTH (type) + sizeof (VBASE_NAME) + 1);
175 sprintf (name, VBASE_NAME_FORMAT, TYPE_NAME_STRING (type));
176 return build_component_ref (exp, get_identifier (name), NULL_TREE, 0);
179 /* Is the type of the EXPR, the complete type of the object?
180 If we are going to be wrong, we must be conservative, and return 0. */
183 complete_type_p (expr)
186 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
189 switch (TREE_CODE (expr))
196 expr = TREE_OPERAND (expr, 0);
200 if (! TREE_HAS_CONSTRUCTOR (expr))
202 /* fall through... */
205 if (TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
206 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (expr)))
207 && TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type)
209 /* fall through... */
212 if (IS_AGGR_TYPE (TREE_TYPE (expr))
213 && TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type)
215 /* fall through... */
225 /* Build multi-level access to EXPR using hierarchy path PATH.
226 CODE is PLUS_EXPR if we are going with the grain,
227 and MINUS_EXPR if we are not (in which case, we cannot traverse
228 virtual baseclass links).
230 TYPE is the type we want this path to have on exit.
232 ALIAS_THIS is non-zero if EXPR in an expression involving `this'. */
235 build_vbase_path (code, type, expr, path, alias_this)
237 tree type, expr, path;
240 register int changed = 0;
241 tree last = NULL_TREE, last_virtual = NULL_TREE;
244 tree null_expr = 0, nonnull_expr;
246 tree offset = integer_zero_node;
248 if (BINFO_INHERITANCE_CHAIN (path) == NULL_TREE)
249 return build1 (NOP_EXPR, type, expr);
251 if (nonnull == 0 && (alias_this && flag_this_is_variable <= 0))
255 /* We need additional logic to convert back to the unconverted type
256 (the static type of the complete object), and then convert back
257 to the type we want. Until that is done, or until we can
258 recognize when that is, we cannot do the short cut logic. (mrs) */
259 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
261 /* Do this, until we can undo any previous conversions. See net35.C
263 fixed_type_p = complete_type_p (expr);
266 if (!fixed_type_p && TREE_SIDE_EFFECTS (expr))
267 expr = save_expr (expr);
270 if (BINFO_INHERITANCE_CHAIN (path))
272 tree reverse_path = NULL_TREE;
274 push_expression_obstack ();
277 tree r = copy_node (path);
278 BINFO_INHERITANCE_CHAIN (r) = reverse_path;
280 path = BINFO_INHERITANCE_CHAIN (path);
286 basetype = BINFO_TYPE (path);
290 if (TREE_VIA_VIRTUAL (path))
292 last_virtual = BINFO_TYPE (path);
293 if (code == PLUS_EXPR)
295 changed = ! fixed_type_p;
301 /* We already check for ambiguous things in the caller, just
305 tree binfo = get_binfo (last, TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (nonnull_expr))), 0);
306 nonnull_expr = convert_pointer_to_real (binfo, nonnull_expr);
308 ind = build_indirect_ref (nonnull_expr, NULL_PTR);
309 nonnull_expr = build_vbase_pointer (ind, last_virtual);
311 && (TREE_CODE (type) == POINTER_TYPE
312 || !flag_assume_nonnull_objects)
313 && null_expr == NULL_TREE)
315 null_expr = build1 (NOP_EXPR, build_pointer_type (last_virtual), integer_zero_node);
316 expr = build (COND_EXPR, build_pointer_type (last_virtual),
317 build (EQ_EXPR, boolean_type_node, expr,
319 null_expr, nonnull_expr);
322 /* else we'll figure out the offset below. */
324 /* Happens in the case of parse errors. */
325 if (nonnull_expr == error_mark_node)
326 return error_mark_node;
330 cp_error ("cannot cast up from virtual baseclass `%T'",
332 return error_mark_node;
336 path = BINFO_INHERITANCE_CHAIN (path);
338 /* LAST is now the last basetype assoc on the path. */
340 /* A pointer to a virtual base member of a non-null object
341 is non-null. Therefore, we only need to test for zeroness once.
342 Make EXPR the canonical expression to deal with here. */
345 TREE_OPERAND (expr, 2) = nonnull_expr;
346 TREE_TYPE (expr) = TREE_TYPE (TREE_OPERAND (expr, 1))
347 = TREE_TYPE (nonnull_expr);
352 /* If we go through any virtual base pointers, make sure that
353 casts to BASETYPE from the last virtual base class use
354 the right value for BASETYPE. */
357 tree intype = TREE_TYPE (TREE_TYPE (expr));
358 if (TYPE_MAIN_VARIANT (intype) != BINFO_TYPE (last))
360 tree binfo = get_binfo (last, TYPE_MAIN_VARIANT (intype), 0);
361 offset = BINFO_OFFSET (binfo);
368 offset = BINFO_OFFSET (binfo_member (last_virtual,
369 CLASSTYPE_VBASECLASSES (basetype)));
370 offset = size_binop (PLUS_EXPR, offset, BINFO_OFFSET (last));
373 offset = BINFO_OFFSET (last);
376 if (TREE_INT_CST_LOW (offset))
378 /* Bash types to make the backend happy. */
379 offset = cp_convert (type, offset);
381 /* This shouldn't be necessary. (mrs) */
382 expr = build1 (NOP_EXPR, type, expr);
385 /* For multiple inheritance: if `this' can be set by any
386 function, then it could be 0 on entry to any function.
387 Preserve such zeroness here. Otherwise, only in the
388 case of constructors need we worry, and in those cases,
389 it will be zero, or initialized to some valid value to
394 TREE_TYPE (null_expr) = type;
396 null_expr = build1 (NOP_EXPR, type, integer_zero_node);
397 if (TREE_SIDE_EFFECTS (expr))
398 expr = save_expr (expr);
400 return build (COND_EXPR, type,
401 build (EQ_EXPR, boolean_type_node, expr, integer_zero_node),
403 build (code, type, expr, offset));
405 else return build (code, type, expr, offset);
408 /* Cannot change the TREE_TYPE of a NOP_EXPR here, since it may
409 be used multiple times in initialization of multiple inheritance. */
412 TREE_TYPE (expr) = type;
416 return build1 (NOP_EXPR, type, expr);
419 /* Virtual function things. */
421 /* Build an entry in the virtual function table.
422 DELTA is the offset for the `this' pointer.
423 PFN is an ADDR_EXPR containing a pointer to the virtual function.
424 Note that the index (DELTA2) in the virtual function table
428 build_vtable_entry (delta, pfn)
431 if (flag_vtable_thunks)
433 HOST_WIDE_INT idelta = TREE_INT_CST_LOW (delta);
434 if (idelta && ! DECL_ABSTRACT_VIRTUAL_P (TREE_OPERAND (pfn, 0)))
436 pfn = build1 (ADDR_EXPR, vtable_entry_type,
437 make_thunk (pfn, idelta));
438 TREE_READONLY (pfn) = 1;
439 TREE_CONSTANT (pfn) = 1;
441 #ifdef GATHER_STATISTICS
442 n_vtable_entries += 1;
448 extern int flag_huge_objects;
449 tree elems = expr_tree_cons (NULL_TREE, delta,
450 expr_tree_cons (NULL_TREE, integer_zero_node,
451 build_expr_list (NULL_TREE, pfn)));
452 tree entry = build (CONSTRUCTOR, vtable_entry_type, NULL_TREE, elems);
454 /* DELTA is constructed by `size_int', which means it may be an
455 unsigned quantity on some platforms. Therefore, we cannot use
456 `int_fits_type_p', because when DELTA is really negative,
457 `force_fit_type' will make it look like a very large number. */
459 if ((TREE_INT_CST_LOW (TYPE_MAX_VALUE (delta_type_node))
460 < TREE_INT_CST_LOW (delta))
461 || (TREE_INT_CST_LOW (delta)
462 < TREE_INT_CST_LOW (TYPE_MIN_VALUE (delta_type_node))))
464 if (flag_huge_objects)
465 sorry ("object size exceeds built-in limit for virtual function table implementation");
467 sorry ("object size exceeds normal limit for virtual function table implementation, recompile all source and use -fhuge-objects");
470 TREE_CONSTANT (entry) = 1;
471 TREE_STATIC (entry) = 1;
472 TREE_READONLY (entry) = 1;
474 #ifdef GATHER_STATISTICS
475 n_vtable_entries += 1;
482 /* Given an object INSTANCE, return an expression which yields the
483 virtual function vtable element corresponding to INDEX. There are
484 many special cases for INSTANCE which we take care of here, mainly
485 to avoid creating extra tree nodes when we don't have to. */
488 build_vtbl_ref (instance, idx)
492 tree basetype = TREE_TYPE (instance);
494 if (TREE_CODE (basetype) == REFERENCE_TYPE)
495 basetype = TREE_TYPE (basetype);
497 if (instance == current_class_ref)
498 vtbl = build_indirect_ref (build_vfield_ref (instance, basetype),
504 /* Try to figure out what a reference refers to, and
505 access its virtual function table directly. */
506 tree ref = NULL_TREE;
508 if (TREE_CODE (instance) == INDIRECT_REF
509 && TREE_CODE (TREE_TYPE (TREE_OPERAND (instance, 0))) == REFERENCE_TYPE)
510 ref = TREE_OPERAND (instance, 0);
511 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
514 if (ref && TREE_CODE (ref) == VAR_DECL
515 && DECL_INITIAL (ref))
517 tree init = DECL_INITIAL (ref);
519 while (TREE_CODE (init) == NOP_EXPR
520 || TREE_CODE (init) == NON_LVALUE_EXPR)
521 init = TREE_OPERAND (init, 0);
522 if (TREE_CODE (init) == ADDR_EXPR)
524 init = TREE_OPERAND (init, 0);
525 if (IS_AGGR_TYPE (TREE_TYPE (init))
526 && (TREE_CODE (init) == PARM_DECL
527 || TREE_CODE (init) == VAR_DECL))
533 if (IS_AGGR_TYPE (TREE_TYPE (instance))
534 && (TREE_CODE (instance) == RESULT_DECL
535 || TREE_CODE (instance) == PARM_DECL
536 || TREE_CODE (instance) == VAR_DECL))
537 vtbl = TYPE_BINFO_VTABLE (basetype);
539 vtbl = build_indirect_ref (build_vfield_ref (instance, basetype),
542 assemble_external (vtbl);
543 aref = build_array_ref (vtbl, idx);
548 /* Given an object INSTANCE, return an expression which yields the
549 virtual function corresponding to INDEX. There are many special
550 cases for INSTANCE which we take care of here, mainly to avoid
551 creating extra tree nodes when we don't have to. */
554 build_vfn_ref (ptr_to_instptr, instance, idx)
555 tree *ptr_to_instptr, instance;
558 tree aref = build_vtbl_ref (instance, idx);
560 /* When using thunks, there is no extra delta, and we get the pfn
562 if (flag_vtable_thunks)
567 /* Save the intermediate result in a SAVE_EXPR so we don't have to
568 compute each component of the virtual function pointer twice. */
569 if (TREE_CODE (aref) == INDIRECT_REF)
570 TREE_OPERAND (aref, 0) = save_expr (TREE_OPERAND (aref, 0));
573 = build (PLUS_EXPR, TREE_TYPE (*ptr_to_instptr),
575 cp_convert (ptrdiff_type_node,
576 build_component_ref (aref, delta_identifier, NULL_TREE, 0)));
579 return build_component_ref (aref, pfn_identifier, NULL_TREE, 0);
582 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
583 for the given TYPE. */
586 get_vtable_name (type)
589 tree type_id = build_typename_overload (type);
590 char *buf = (char *) alloca (strlen (VTABLE_NAME_FORMAT)
591 + IDENTIFIER_LENGTH (type_id) + 2);
592 char *ptr = IDENTIFIER_POINTER (type_id);
594 for (i = 0; ptr[i] == OPERATOR_TYPENAME_FORMAT[i]; i++) ;
596 /* We don't take off the numbers; prepare_fresh_vtable uses the
597 DECL_ASSEMBLER_NAME for the type, which includes the number
598 in `3foo'. If we were to pull them off here, we'd end up with
599 something like `_vt.foo.3bar', instead of a uniform definition. */
600 while (ptr[i] >= '0' && ptr[i] <= '9')
603 sprintf (buf, VTABLE_NAME_FORMAT, ptr+i);
604 return get_identifier (buf);
607 /* Return the offset to the main vtable for a given base BINFO. */
610 get_vfield_offset (binfo)
614 = size_binop (FLOOR_DIV_EXPR,
615 DECL_FIELD_BITPOS (CLASSTYPE_VFIELD (BINFO_TYPE (binfo))),
616 size_int (BITS_PER_UNIT));
617 tmp = convert (sizetype, tmp);
618 return size_binop (PLUS_EXPR, tmp, BINFO_OFFSET (binfo));
621 /* Get the offset to the start of the original binfo that we derived
622 this binfo from. If we find TYPE first, return the offset only
623 that far. The shortened search is useful because the this pointer
624 on method calling is expected to point to a DECL_CONTEXT (fndecl)
625 object, and not a baseclass of it. */
628 get_derived_offset (binfo, type)
631 tree offset1 = get_vfield_offset (TYPE_BINFO (BINFO_TYPE (binfo)));
634 while (BINFO_BASETYPES (binfo)
635 && (i=CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo))) != -1)
637 tree binfos = BINFO_BASETYPES (binfo);
638 if (BINFO_TYPE (binfo) == type)
640 binfo = TREE_VEC_ELT (binfos, i);
642 offset2 = get_vfield_offset (TYPE_BINFO (BINFO_TYPE (binfo)));
643 return size_binop (MINUS_EXPR, offset1, offset2);
646 /* Update the rtti info for this class. */
649 set_rtti_entry (virtuals, offset, type)
650 tree virtuals, offset, type;
655 vfn = build1 (ADDR_EXPR, vfunc_ptr_type_node, get_tinfo_fn (type));
657 vfn = build1 (NOP_EXPR, vfunc_ptr_type_node, size_zero_node);
658 TREE_CONSTANT (vfn) = 1;
660 if (! flag_vtable_thunks)
661 TREE_VALUE (virtuals) = build_vtable_entry (offset, vfn);
664 tree voff = build1 (NOP_EXPR, vfunc_ptr_type_node, offset);
665 TREE_CONSTANT (voff) = 1;
667 TREE_VALUE (virtuals) = build_vtable_entry (size_zero_node, voff);
669 /* The second slot is for the tdesc pointer when thunks are used. */
670 TREE_VALUE (TREE_CHAIN (virtuals))
671 = build_vtable_entry (size_zero_node, vfn);
675 /* Build a virtual function for type TYPE.
676 If BINFO is non-NULL, build the vtable starting with the initial
677 approximation that it is the same as the one which is the head of
678 the association list. */
681 build_vtable (binfo, type)
684 tree name = get_vtable_name (type);
691 virtuals = copy_list (BINFO_VIRTUALS (binfo));
692 decl = build_decl (VAR_DECL, name, TREE_TYPE (BINFO_VTABLE (binfo)));
694 /* Now do rtti stuff. */
695 offset = get_derived_offset (TYPE_BINFO (type), NULL_TREE);
696 offset = size_binop (MINUS_EXPR, size_zero_node, offset);
697 set_rtti_entry (virtuals, offset, type);
701 virtuals = NULL_TREE;
702 decl = build_decl (VAR_DECL, name, void_type_node);
705 #ifdef GATHER_STATISTICS
707 n_vtable_elems += list_length (virtuals);
710 /* Set TREE_PUBLIC and TREE_EXTERN as appropriate. */
711 import_export_vtable (decl, type, 0);
713 decl = pushdecl_top_level (decl);
714 SET_IDENTIFIER_GLOBAL_VALUE (name, decl);
715 /* Initialize the association list for this type, based
716 on our first approximation. */
717 TYPE_BINFO_VTABLE (type) = decl;
718 TYPE_BINFO_VIRTUALS (type) = virtuals;
720 DECL_ARTIFICIAL (decl) = 1;
721 TREE_STATIC (decl) = 1;
722 #ifndef WRITABLE_VTABLES
723 /* Make them READONLY by default. (mrs) */
724 TREE_READONLY (decl) = 1;
726 /* At one time the vtable info was grabbed 2 words at a time. This
727 fails on sparc unless you have 8-byte alignment. (tiemann) */
728 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
731 /* Why is this conditional? (mrs) */
732 if (binfo && write_virtuals >= 0)
733 DECL_VIRTUAL_P (decl) = 1;
734 DECL_CONTEXT (decl) = type;
736 binfo = TYPE_BINFO (type);
737 SET_BINFO_NEW_VTABLE_MARKED (binfo);
741 extern tree signed_size_zero_node;
743 /* Give TYPE a new virtual function table which is initialized
744 with a skeleton-copy of its original initialization. The only
745 entry that changes is the `delta' entry, so we can really
746 share a lot of structure.
748 FOR_TYPE is the derived type which caused this table to
751 BINFO is the type association which provided TYPE for FOR_TYPE.
753 The order in which vtables are built (by calling this function) for
754 an object must remain the same, otherwise a binary incompatibility
758 prepare_fresh_vtable (binfo, for_type)
759 tree binfo, for_type;
762 tree orig_decl = BINFO_VTABLE (binfo);
775 basetype = TYPE_MAIN_VARIANT (BINFO_TYPE (binfo));
777 buf2 = TYPE_ASSEMBLER_NAME_STRING (basetype);
778 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1;
780 /* We know that the vtable that we are going to create doesn't exist
781 yet in the global namespace, and when we finish, it will be
782 pushed into the global namespace. In complex MI hierarchies, we
783 have to loop while the name we are thinking of adding is globally
784 defined, adding more name components to the vtable name as we
785 loop, until the name is unique. This is because in complex MI
786 cases, we might have the same base more than once. This means
787 that the order in which this function is called for vtables must
788 remain the same, otherwise binary compatibility can be
793 char *buf1 = (char *) alloca (TYPE_ASSEMBLER_NAME_LENGTH (for_type)
797 sprintf (buf1, "%s%c%s", TYPE_ASSEMBLER_NAME_STRING (for_type), joiner,
799 buf = (char *) alloca (strlen (VTABLE_NAME_FORMAT) + strlen (buf1) + 1);
800 sprintf (buf, VTABLE_NAME_FORMAT, buf1);
801 name = get_identifier (buf);
803 /* If this name doesn't clash, then we can use it, otherwise
804 we add more to the name until it is unique. */
806 if (! IDENTIFIER_GLOBAL_VALUE (name))
809 /* Set values for next loop through, if the name isn't unique. */
811 path = BINFO_INHERITANCE_CHAIN (path);
813 /* We better not run out of stuff to make it unique. */
814 my_friendly_assert (path != NULL_TREE, 368);
816 basetype = TYPE_MAIN_VARIANT (BINFO_TYPE (path));
818 if (for_type == basetype)
820 /* If we run out of basetypes in the path, we have already
821 found created a vtable with that name before, we now
822 resort to tacking on _%d to distinguish them. */
824 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1 + i + 1 + 3;
825 buf1 = (char *) alloca (i);
827 sprintf (buf1, "%s%c%s%c%d",
828 TYPE_ASSEMBLER_NAME_STRING (basetype), joiner,
830 buf = (char *) alloca (strlen (VTABLE_NAME_FORMAT)
831 + strlen (buf1) + 1);
832 sprintf (buf, VTABLE_NAME_FORMAT, buf1);
833 name = get_identifier (buf);
835 /* If this name doesn't clash, then we can use it,
836 otherwise we add something different to the name until
838 } while (++j <= 999 && IDENTIFIER_GLOBAL_VALUE (name));
840 /* Hey, they really like MI don't they? Increase the 3
841 above to 6, and the 999 to 999999. :-) */
842 my_friendly_assert (j <= 999, 369);
847 i = TYPE_ASSEMBLER_NAME_LENGTH (basetype) + 1 + i;
848 new_buf2 = (char *) alloca (i);
849 sprintf (new_buf2, "%s%c%s",
850 TYPE_ASSEMBLER_NAME_STRING (basetype), joiner, buf2);
854 new_decl = build_decl (VAR_DECL, name, TREE_TYPE (orig_decl));
855 /* Remember which class this vtable is really for. */
856 DECL_CONTEXT (new_decl) = for_type;
858 DECL_ARTIFICIAL (new_decl) = 1;
859 TREE_STATIC (new_decl) = 1;
860 BINFO_VTABLE (binfo) = pushdecl_top_level (new_decl);
861 DECL_VIRTUAL_P (new_decl) = 1;
862 #ifndef WRITABLE_VTABLES
863 /* Make them READONLY by default. (mrs) */
864 TREE_READONLY (new_decl) = 1;
866 DECL_ALIGN (new_decl) = DECL_ALIGN (orig_decl);
868 /* Make fresh virtual list, so we can smash it later. */
869 BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo));
871 if (TREE_VIA_VIRTUAL (binfo))
873 tree binfo1 = binfo_member (BINFO_TYPE (binfo),
874 CLASSTYPE_VBASECLASSES (for_type));
876 /* XXX - This should never happen, if it does, the caller should
877 ensure that the binfo is from for_type's binfos, not from any
878 base type's. We can remove all this code after a while. */
880 warning ("internal inconsistency: binfo offset error for rtti");
882 offset = BINFO_OFFSET (binfo1);
885 offset = BINFO_OFFSET (binfo);
887 set_rtti_entry (BINFO_VIRTUALS (binfo),
888 size_binop (MINUS_EXPR, signed_size_zero_node, offset),
891 #ifdef GATHER_STATISTICS
893 n_vtable_elems += list_length (BINFO_VIRTUALS (binfo));
896 /* Set TREE_PUBLIC and TREE_EXTERN as appropriate. */
897 import_export_vtable (new_decl, for_type, 0);
899 if (TREE_VIA_VIRTUAL (binfo))
900 my_friendly_assert (binfo == binfo_member (BINFO_TYPE (binfo),
901 CLASSTYPE_VBASECLASSES (current_class_type)),
903 SET_BINFO_NEW_VTABLE_MARKED (binfo);
907 /* Access the virtual function table entry that logically
908 contains BASE_FNDECL. VIRTUALS is the virtual function table's
909 initializer. We can run off the end, when dealing with virtual
910 destructors in MI situations, return NULL_TREE in that case. */
913 get_vtable_entry (virtuals, base_fndecl)
914 tree virtuals, base_fndecl;
916 unsigned HOST_WIDE_INT n = (HOST_BITS_PER_WIDE_INT >= BITS_PER_WORD
917 ? (TREE_INT_CST_LOW (DECL_VINDEX (base_fndecl))
918 & (((unsigned HOST_WIDE_INT)1<<(BITS_PER_WORD-1))-1))
919 : TREE_INT_CST_LOW (DECL_VINDEX (base_fndecl)));
921 #ifdef GATHER_STATISTICS
922 n_vtable_searches += n;
925 while (n > 0 && virtuals)
928 virtuals = TREE_CHAIN (virtuals);
934 /* Put new entry ENTRY into virtual function table initializer
937 Also update DECL_VINDEX (FNDECL). */
940 modify_vtable_entry (old_entry_in_list, new_entry, fndecl)
941 tree old_entry_in_list, new_entry, fndecl;
943 tree base_fndecl = TREE_OPERAND (FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (old_entry_in_list)), 0);
946 cp_warning ("replaced %D with %D", DECL_ASSEMBLER_NAME (base_fndecl),
947 DECL_ASSEMBLER_NAME (fndecl));
949 TREE_VALUE (old_entry_in_list) = new_entry;
951 /* Now assign virtual dispatch information, if unset. */
952 /* We can dispatch this, through any overridden base function. */
953 if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
955 DECL_VINDEX (fndecl) = DECL_VINDEX (base_fndecl);
956 DECL_CONTEXT (fndecl) = DECL_CONTEXT (base_fndecl);
960 /* Access the virtual function table entry N. VIRTUALS is the virtual
961 function table's initializer. */
964 get_vtable_entry_n (virtuals, n)
966 unsigned HOST_WIDE_INT n;
971 virtuals = TREE_CHAIN (virtuals);
976 /* Add a virtual function to all the appropriate vtables for the class
977 T. DECL_VINDEX(X) should be error_mark_node, if we want to
978 allocate a new slot in our table. If it is error_mark_node, we
979 know that no other function from another vtable is overridden by X.
980 HAS_VIRTUAL keeps track of how many virtuals there are in our main
981 vtable for the type, and we build upon the PENDING_VIRTUALS list
985 add_virtual_function (pv, phv, has_virtual, fndecl, t)
989 tree t; /* Structure type. */
991 tree pending_virtuals = *pv;
992 tree pending_hard_virtuals = *phv;
994 /* FUNCTION_TYPEs and OFFSET_TYPEs no longer freely
995 convert to void *. Make such a conversion here. */
996 tree vfn = build1 (ADDR_EXPR, vfunc_ptr_type_node, fndecl);
997 TREE_CONSTANT (vfn) = 1;
1000 if (current_class_type == 0)
1001 cp_warning ("internal problem, current_class_type is zero when adding `%D', please report",
1003 if (current_class_type && t != current_class_type)
1004 cp_warning ("internal problem, current_class_type differs when adding `%D', please report",
1008 /* If the virtual function is a redefinition of a prior one,
1009 figure out in which base class the new definition goes,
1010 and if necessary, make a fresh virtual function table
1011 to hold that entry. */
1012 if (DECL_VINDEX (fndecl) == error_mark_node)
1016 /* We remember that this was the base sub-object for rtti. */
1017 CLASSTYPE_RTTI (t) = t;
1019 /* If we are using thunks, use two slots at the front, one
1020 for the offset pointer, one for the tdesc pointer. */
1021 if (*has_virtual == 0 && flag_vtable_thunks)
1026 /* Build a new INT_CST for this DECL_VINDEX. */
1028 static tree index_table[256];
1030 /* We skip a slot for the offset/tdesc entry. */
1031 int i = ++(*has_virtual);
1033 if (i >= 256 || index_table[i] == 0)
1035 idx = build_int_2 (i, 0);
1037 index_table[i] = idx;
1040 idx = index_table[i];
1042 /* Now assign virtual dispatch information. */
1043 DECL_VINDEX (fndecl) = idx;
1044 DECL_CONTEXT (fndecl) = t;
1046 entry = build_vtable_entry (integer_zero_node, vfn);
1047 pending_virtuals = tree_cons (DECL_VINDEX (fndecl), entry, pending_virtuals);
1049 /* Might already be INTEGER_CST if declared twice in class. We will
1050 give error later or we've already given it. */
1051 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
1053 /* Need an entry in some other virtual function table.
1054 Deal with this after we have laid out our virtual base classes. */
1055 pending_hard_virtuals = temp_tree_cons (fndecl, vfn, pending_hard_virtuals);
1057 *pv = pending_virtuals;
1058 *phv = pending_hard_virtuals;
1061 /* Obstack on which to build the vector of class methods. */
1062 struct obstack class_obstack;
1063 extern struct obstack *current_obstack;
1065 /* Add method METHOD to class TYPE. This is used when a method
1066 has been defined which did not initially appear in the class definition,
1067 and helps cut down on spurious error messages.
1069 FIELDS is the entry in the METHOD_VEC vector entry of the class type where
1070 the method should be added. */
1073 add_method (type, fields, method)
1074 tree type, *fields, method;
1076 push_obstacks (&permanent_obstack, &permanent_obstack);
1078 if (fields && *fields)
1079 *fields = build_overload (method, *fields);
1080 else if (CLASSTYPE_METHOD_VEC (type) == 0)
1082 tree method_vec = make_node (TREE_VEC);
1083 if (TYPE_IDENTIFIER (type) == DECL_NAME (method))
1085 /* ??? Is it possible for there to have been enough room in the
1086 current chunk for the tree_vec structure but not a tree_vec
1087 plus a tree*? Will this work in that case? */
1088 obstack_free (current_obstack, method_vec);
1089 obstack_blank (current_obstack, sizeof (struct tree_vec) + sizeof (tree *));
1090 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (method)))
1091 TREE_VEC_ELT (method_vec, 1) = method;
1093 TREE_VEC_ELT (method_vec, 0) = method;
1094 TREE_VEC_LENGTH (method_vec) = 2;
1098 /* ??? Is it possible for there to have been enough room in the
1099 current chunk for the tree_vec structure but not a tree_vec
1100 plus a tree*? Will this work in that case? */
1101 obstack_free (current_obstack, method_vec);
1102 obstack_blank (current_obstack, sizeof (struct tree_vec) + 2*sizeof (tree *));
1103 TREE_VEC_ELT (method_vec, 2) = method;
1104 TREE_VEC_LENGTH (method_vec) = 3;
1105 obstack_finish (current_obstack);
1107 CLASSTYPE_METHOD_VEC (type) = method_vec;
1111 tree method_vec = CLASSTYPE_METHOD_VEC (type);
1112 int len = TREE_VEC_LENGTH (method_vec);
1114 /* Adding a new ctor or dtor. This is easy because our
1115 METHOD_VEC always has a slot for such entries. */
1116 if (TYPE_IDENTIFIER (type) == DECL_NAME (method))
1118 int idx = !!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (method));
1119 /* TREE_VEC_ELT (method_vec, idx) = method; */
1120 if (method != TREE_VEC_ELT (method_vec, idx))
1121 TREE_VEC_ELT (method_vec, idx) =
1122 build_overload (method, TREE_VEC_ELT (method_vec, idx));
1126 /* This is trickier. We try to extend the TREE_VEC in-place,
1127 but if that does not work, we copy all its data to a new
1128 TREE_VEC that's large enough. */
1129 struct obstack *ob = &class_obstack;
1130 tree *end = (tree *)obstack_next_free (ob);
1132 if (end != TREE_VEC_END (method_vec))
1134 ob = current_obstack;
1135 TREE_VEC_LENGTH (method_vec) += 1;
1136 TREE_VEC_ELT (method_vec, len) = NULL_TREE;
1137 method_vec = copy_node (method_vec);
1138 TREE_VEC_LENGTH (method_vec) -= 1;
1142 tree tmp_vec = (tree) obstack_base (ob);
1143 if (obstack_room (ob) < sizeof (tree))
1145 obstack_blank (ob, sizeof (struct tree_common)
1146 + tree_code_length[(int) TREE_VEC]
1148 + len * sizeof (tree));
1149 tmp_vec = (tree) obstack_base (ob);
1150 bcopy ((char *) method_vec, (char *) tmp_vec,
1151 (sizeof (struct tree_common)
1152 + tree_code_length[(int) TREE_VEC] * sizeof (char *)
1153 + (len-1) * sizeof (tree)));
1154 method_vec = tmp_vec;
1157 obstack_blank (ob, sizeof (tree));
1160 obstack_finish (ob);
1161 TREE_VEC_ELT (method_vec, len) = method;
1162 TREE_VEC_LENGTH (method_vec) = len + 1;
1163 CLASSTYPE_METHOD_VEC (type) = method_vec;
1165 if (TYPE_BINFO_BASETYPES (type) && CLASSTYPE_BASELINK_VEC (type))
1167 /* ??? May be better to know whether these can be extended? */
1168 tree baselink_vec = CLASSTYPE_BASELINK_VEC (type);
1170 TREE_VEC_LENGTH (baselink_vec) += 1;
1171 CLASSTYPE_BASELINK_VEC (type) = copy_node (baselink_vec);
1172 TREE_VEC_LENGTH (baselink_vec) -= 1;
1174 TREE_VEC_ELT (CLASSTYPE_BASELINK_VEC (type), len) = 0;
1178 DECL_CONTEXT (method) = type;
1179 DECL_CLASS_CONTEXT (method) = type;
1184 /* Subroutines of finish_struct. */
1186 /* Look through the list of fields for this struct, deleting
1187 duplicates as we go. This must be recursive to handle
1190 FIELD is the field which may not appear anywhere in FIELDS.
1191 FIELD_PTR, if non-null, is the starting point at which
1192 chained deletions may take place.
1193 The value returned is the first acceptable entry found
1196 Note that anonymous fields which are not of UNION_TYPE are
1197 not duplicates, they are just anonymous fields. This happens
1198 when we have unnamed bitfields, for example. */
1201 delete_duplicate_fields_1 (field, fields)
1206 if (DECL_NAME (field) == 0)
1208 if (TREE_CODE (TREE_TYPE (field)) != UNION_TYPE)
1211 for (x = TYPE_FIELDS (TREE_TYPE (field)); x; x = TREE_CHAIN (x))
1212 fields = delete_duplicate_fields_1 (x, fields);
1217 for (x = fields; x; prev = x, x = TREE_CHAIN (x))
1219 if (DECL_NAME (x) == 0)
1221 if (TREE_CODE (TREE_TYPE (x)) != UNION_TYPE)
1223 TYPE_FIELDS (TREE_TYPE (x))
1224 = delete_duplicate_fields_1 (field, TYPE_FIELDS (TREE_TYPE (x)));
1225 if (TYPE_FIELDS (TREE_TYPE (x)) == 0)
1228 fields = TREE_CHAIN (fields);
1230 TREE_CHAIN (prev) = TREE_CHAIN (x);
1235 if (DECL_NAME (field) == DECL_NAME (x))
1237 if (TREE_CODE (field) == CONST_DECL
1238 && TREE_CODE (x) == CONST_DECL)
1239 cp_error_at ("duplicate enum value `%D'", x);
1240 else if (TREE_CODE (field) == CONST_DECL
1241 || TREE_CODE (x) == CONST_DECL)
1242 cp_error_at ("duplicate field `%D' (as enum and non-enum)",
1244 else if (TREE_CODE (field) == TYPE_DECL
1245 && TREE_CODE (x) == TYPE_DECL)
1247 if (TREE_TYPE (field) == TREE_TYPE (x))
1249 cp_error_at ("duplicate nested type `%D'", x);
1251 else if (TREE_CODE (field) == TYPE_DECL
1252 || TREE_CODE (x) == TYPE_DECL)
1254 /* Hide tag decls. */
1255 if ((TREE_CODE (field) == TYPE_DECL
1256 && DECL_ARTIFICIAL (field))
1257 || (TREE_CODE (x) == TYPE_DECL
1258 && DECL_ARTIFICIAL (x)))
1260 cp_error_at ("duplicate field `%D' (as type and non-type)",
1264 cp_error_at ("duplicate member `%D'", x);
1266 fields = TREE_CHAIN (fields);
1268 TREE_CHAIN (prev) = TREE_CHAIN (x);
1277 delete_duplicate_fields (fields)
1281 for (x = fields; x && TREE_CHAIN (x); x = TREE_CHAIN (x))
1282 TREE_CHAIN (x) = delete_duplicate_fields_1 (x, TREE_CHAIN (x));
1285 /* Change the access of FDECL to ACCESS in T.
1286 Return 1 if change was legit, otherwise return 0. */
1289 alter_access (t, fdecl, access)
1294 tree elem = purpose_member (t, DECL_ACCESS (fdecl));
1297 if (TREE_VALUE (elem) != access)
1299 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1300 cp_error_at ("conflicting access specifications for method `%D', ignored", TREE_TYPE (fdecl));
1302 error ("conflicting access specifications for field `%s', ignored",
1303 IDENTIFIER_POINTER (DECL_NAME (fdecl)));
1307 /* They're changing the access to the same thing they changed
1308 it to before. That's OK. */
1314 enforce_access (TYPE_BINFO (t), fdecl);
1316 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1322 /* If FOR_TYPE needs to reinitialize virtual function table pointers
1323 for TYPE's sub-objects, add such reinitializations to BASE_INIT_LIST.
1324 Returns BASE_INIT_LIST appropriately modified. */
1327 maybe_fixup_vptrs (for_type, binfo, base_init_list)
1328 tree for_type, binfo, base_init_list;
1330 /* Now reinitialize any slots that don't fall under our virtual
1331 function table pointer. */
1332 tree vfields = CLASSTYPE_VFIELDS (BINFO_TYPE (binfo));
1335 tree basetype = VF_NORMAL_VALUE (vfields)
1336 ? TYPE_MAIN_VARIANT (VF_NORMAL_VALUE (vfields))
1337 : VF_BASETYPE_VALUE (vfields);
1339 tree base_binfo = get_binfo (basetype, for_type, 0);
1340 /* Punt until this is implemented. */
1341 if (1 /* BINFO_MODIFIED (base_binfo) */)
1343 tree base_offset = get_vfield_offset (base_binfo);
1344 if (! tree_int_cst_equal (base_offset, get_vfield_offset (TYPE_BINFO (for_type)))
1345 && ! tree_int_cst_equal (base_offset, get_vfield_offset (binfo)))
1346 base_init_list = tree_cons (error_mark_node, base_binfo,
1349 vfields = TREE_CHAIN (vfields);
1351 return base_init_list;
1354 /* If TYPE does not have a constructor, then the compiler must
1355 manually deal with all of the initialization this type requires.
1357 If a base initializer exists only to fill in the virtual function
1358 table pointer, then we mark that fact with the TREE_VIRTUAL bit.
1359 This way, we avoid multiple initializations of the same field by
1360 each virtual function table up the class hierarchy.
1362 Virtual base class pointers are not initialized here. They are
1363 initialized only at the "top level" of object creation. If we
1364 initialized them here, we would have to skip a lot of work. */
1367 build_class_init_list (type)
1370 tree base_init_list = NULL_TREE;
1371 tree member_init_list = NULL_TREE;
1373 /* Since we build member_init_list and base_init_list using
1374 tree_cons, backwards fields the all through work. */
1376 tree binfos = BINFO_BASETYPES (TYPE_BINFO (type));
1377 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
1379 for (x = TYPE_FIELDS (type); x; x = TREE_CHAIN (x))
1381 if (TREE_CODE (x) != FIELD_DECL)
1384 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (x))
1385 || DECL_INITIAL (x) != NULL_TREE)
1386 member_init_list = tree_cons (x, type, member_init_list);
1388 member_init_list = nreverse (member_init_list);
1390 /* We will end up doing this last. Need special marker
1391 to avoid infinite regress. */
1392 if (TYPE_VIRTUAL_P (type))
1394 base_init_list = build_tree_list (error_mark_node, TYPE_BINFO (type));
1395 if (CLASSTYPE_NEEDS_VIRTUAL_REINIT (type) == 0)
1396 TREE_VALUE (base_init_list) = NULL_TREE;
1397 TREE_ADDRESSABLE (base_init_list) = 1;
1400 /* Each base class which needs to have initialization
1401 of some kind gets to make such requests known here. */
1402 for (i = n_baseclasses-1; i >= 0; i--)
1404 tree base_binfo = TREE_VEC_ELT (binfos, i);
1407 /* Don't initialize virtual baseclasses this way. */
1408 if (TREE_VIA_VIRTUAL (base_binfo))
1411 if (TYPE_HAS_CONSTRUCTOR (BINFO_TYPE (base_binfo)))
1413 /* ...and the last shall come first... */
1414 base_init_list = maybe_fixup_vptrs (type, base_binfo, base_init_list);
1415 base_init_list = tree_cons (NULL_TREE, base_binfo, base_init_list);
1419 if ((blist = CLASSTYPE_BASE_INIT_LIST (BINFO_TYPE (base_binfo))) == NULL_TREE)
1420 /* Nothing to initialize. */
1424 base_init_list = maybe_fixup_vptrs (type, base_binfo, base_init_list);
1426 /* This is normally true for single inheritance.
1427 The win is we can shrink the chain of initializations
1428 to be done by only converting to the actual type
1429 we are interested in. */
1430 if (TREE_VALUE (blist)
1431 && TREE_CODE (TREE_VALUE (blist)) == TREE_VEC
1432 && tree_int_cst_equal (BINFO_OFFSET (base_binfo),
1433 BINFO_OFFSET (TREE_VALUE (blist))))
1437 /* Does it do more than just fill in a
1438 virtual function table pointer? */
1439 if (! TREE_ADDRESSABLE (blist))
1440 base_init_list = build_tree_list (blist, base_init_list);
1441 /* Can we get by just with the virtual function table
1442 pointer that it fills in? */
1443 else if (TREE_ADDRESSABLE (base_init_list)
1444 && TREE_VALUE (base_init_list) == 0)
1445 base_init_list = blist;
1446 /* Maybe, but it is not obvious as the previous case. */
1447 else if (! CLASSTYPE_NEEDS_VIRTUAL_REINIT (type))
1449 tree last = tree_last (base_init_list);
1450 while (TREE_VALUE (last)
1451 && TREE_CODE (TREE_VALUE (last)) == TREE_LIST)
1452 last = tree_last (TREE_VALUE (last));
1453 if (TREE_VALUE (last) == 0)
1454 base_init_list = build_tree_list (blist, base_init_list);
1458 base_init_list = blist;
1462 /* The function expand_aggr_init knows how to do the
1463 initialization of `basetype' without getting
1464 an explicit `blist'. */
1466 base_init_list = tree_cons (NULL_TREE, base_binfo, base_init_list);
1468 base_init_list = CLASSTYPE_BINFO_AS_LIST (BINFO_TYPE (base_binfo));
1474 if (member_init_list)
1475 CLASSTYPE_BASE_INIT_LIST (type) =
1476 build_tree_list (base_init_list, member_init_list);
1478 CLASSTYPE_BASE_INIT_LIST (type) = base_init_list;
1480 else if (member_init_list)
1481 CLASSTYPE_BASE_INIT_LIST (type) = member_init_list;
1487 int max_has_virtual;
1492 char cant_have_default_ctor;
1493 char cant_have_const_ctor;
1494 char no_const_asn_ref;
1497 /* Record information about type T derived from its base classes.
1498 Store most of that information in T itself, and place the
1499 remaining information in the struct BASE_INFO.
1501 Propagate basetype offsets throughout the lattice. Note that the
1502 lattice topped by T is really a pair: it's a DAG that gives the
1503 structure of the derivation hierarchy, and it's a list of the
1504 virtual baseclasses that appear anywhere in the DAG. When a vbase
1505 type appears in the DAG, it's offset is 0, and it's children start
1506 their offsets from that point. When a vbase type appears in the list,
1507 its offset is the offset it has in the hierarchy, and its children's
1508 offsets include that offset in theirs.
1510 Returns the index of the first base class to have virtual functions,
1511 or -1 if no such base class. */
1514 finish_base_struct (t, b)
1516 struct base_info *b;
1518 tree binfos = TYPE_BINFO_BASETYPES (t);
1519 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
1520 int first_vfn_base_index = -1;
1521 bzero ((char *) b, sizeof (struct base_info));
1523 for (i = 0; i < n_baseclasses; i++)
1525 tree base_binfo = TREE_VEC_ELT (binfos, i);
1526 tree basetype = BINFO_TYPE (base_binfo);
1528 /* Effective C++ rule 14. We only need to check TYPE_VIRTUAL_P
1529 here because the case of virtual functions but non-virtual
1530 dtor is handled in finish_struct_1. */
1531 if (warn_ecpp && ! TYPE_VIRTUAL_P (basetype)
1532 && TYPE_HAS_DESTRUCTOR (basetype))
1533 cp_warning ("base class `%#T' has a non-virtual destructor", basetype);
1535 /* If the type of basetype is incomplete, then
1536 we already complained about that fact
1537 (and we should have fixed it up as well). */
1538 if (TYPE_SIZE (basetype) == 0)
1541 /* The base type is of incomplete type. It is
1542 probably best to pretend that it does not
1544 if (i == n_baseclasses-1)
1545 TREE_VEC_ELT (binfos, i) = NULL_TREE;
1546 TREE_VEC_LENGTH (binfos) -= 1;
1548 for (j = i; j+1 < n_baseclasses; j++)
1549 TREE_VEC_ELT (binfos, j) = TREE_VEC_ELT (binfos, j+1);
1552 if (! TYPE_HAS_CONST_INIT_REF (basetype))
1553 b->cant_have_const_ctor = 1;
1555 if (TYPE_HAS_CONSTRUCTOR (basetype)
1556 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype))
1558 b->cant_have_default_ctor = 1;
1559 if (! TYPE_HAS_CONSTRUCTOR (t))
1561 cp_pedwarn ("base `%T' with only non-default constructor",
1563 cp_pedwarn ("in class without a constructor");
1567 if (TYPE_HAS_ASSIGN_REF (basetype)
1568 && !TYPE_HAS_CONST_ASSIGN_REF (basetype))
1569 b->no_const_asn_ref = 1;
1571 b->n_ancestors += CLASSTYPE_N_SUPERCLASSES (basetype);
1572 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1573 TYPE_NEEDS_DESTRUCTOR (t) |= TYPE_NEEDS_DESTRUCTOR (basetype);
1574 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (basetype);
1575 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (basetype);
1577 TYPE_OVERLOADS_CALL_EXPR (t) |= TYPE_OVERLOADS_CALL_EXPR (basetype);
1578 TYPE_OVERLOADS_ARRAY_REF (t) |= TYPE_OVERLOADS_ARRAY_REF (basetype);
1579 TYPE_OVERLOADS_ARROW (t) |= TYPE_OVERLOADS_ARROW (basetype);
1581 if (! TREE_VIA_VIRTUAL (base_binfo))
1582 CLASSTYPE_N_SUPERCLASSES (t) += 1;
1584 if (TYPE_VIRTUAL_P (basetype))
1586 /* Ensure that this is set from at least a virtual base
1588 if (b->rtti == NULL_TREE)
1589 b->rtti = CLASSTYPE_RTTI (basetype);
1591 /* Don't borrow virtuals from virtual baseclasses. */
1592 if (TREE_VIA_VIRTUAL (base_binfo))
1595 if (first_vfn_base_index < 0)
1598 first_vfn_base_index = i;
1600 /* Update these two, now that we know what vtable we are
1601 going to extend. This is so that we can add virtual
1602 functions, and override them properly. */
1603 TYPE_BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (basetype);
1604 TYPE_BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (basetype);
1605 b->has_virtual = CLASSTYPE_VSIZE (basetype);
1606 b->vfield = CLASSTYPE_VFIELD (basetype);
1607 b->vfields = copy_list (CLASSTYPE_VFIELDS (basetype));
1608 vfields = b->vfields;
1611 if (VF_BINFO_VALUE (vfields) == NULL_TREE
1612 || ! TREE_VIA_VIRTUAL (VF_BINFO_VALUE (vfields)))
1614 tree value = VF_BASETYPE_VALUE (vfields);
1615 if (DECL_NAME (CLASSTYPE_VFIELD (value))
1616 == DECL_NAME (CLASSTYPE_VFIELD (basetype)))
1617 VF_NORMAL_VALUE (b->vfields) = basetype;
1619 VF_NORMAL_VALUE (b->vfields) = VF_NORMAL_VALUE (vfields);
1621 vfields = TREE_CHAIN (vfields);
1623 CLASSTYPE_VFIELD (t) = b->vfield;
1627 /* Only add unique vfields, and flatten them out as we go. */
1628 tree vfields = CLASSTYPE_VFIELDS (basetype);
1631 if (VF_BINFO_VALUE (vfields) == NULL_TREE
1632 || ! TREE_VIA_VIRTUAL (VF_BINFO_VALUE (vfields)))
1634 tree value = VF_BASETYPE_VALUE (vfields);
1635 b->vfields = tree_cons (base_binfo, value, b->vfields);
1636 if (DECL_NAME (CLASSTYPE_VFIELD (value))
1637 == DECL_NAME (CLASSTYPE_VFIELD (basetype)))
1638 VF_NORMAL_VALUE (b->vfields) = basetype;
1640 VF_NORMAL_VALUE (b->vfields) = VF_NORMAL_VALUE (vfields);
1642 vfields = TREE_CHAIN (vfields);
1645 if (b->has_virtual == 0)
1647 first_vfn_base_index = i;
1649 /* Update these two, now that we know what vtable we are
1650 going to extend. This is so that we can add virtual
1651 functions, and override them properly. */
1652 TYPE_BINFO_VTABLE (t) = TYPE_BINFO_VTABLE (basetype);
1653 TYPE_BINFO_VIRTUALS (t) = TYPE_BINFO_VIRTUALS (basetype);
1654 b->has_virtual = CLASSTYPE_VSIZE (basetype);
1655 b->vfield = CLASSTYPE_VFIELD (basetype);
1656 CLASSTYPE_VFIELD (t) = b->vfield;
1657 /* When we install the first one, set the VF_NORMAL_VALUE
1658 to be the current class, as this it is the most derived
1659 class. Hopefully, this is not set to something else
1661 vfields = b->vfields;
1664 if (DECL_NAME (CLASSTYPE_VFIELD (t))
1665 == DECL_NAME (CLASSTYPE_VFIELD (basetype)))
1667 VF_NORMAL_VALUE (vfields) = t;
1668 /* There should only be one of them! And it should
1669 always be found, if we get into here. (mrs) */
1672 vfields = TREE_CHAIN (vfields);
1679 /* This comment said "Must come after offsets are fixed for all bases."
1680 Well, now this happens before the offsets are fixed, but it seems to
1681 work fine. Guess we'll see... */
1682 for (i = 0; i < n_baseclasses; i++)
1684 tree base_binfo = TREE_VEC_ELT (binfos, i);
1685 tree basetype = BINFO_TYPE (base_binfo);
1687 if (get_base_distance (basetype, t, 0, (tree*)0) == -2)
1689 cp_warning ("direct base `%T' inaccessible in `%T' due to ambiguity",
1694 tree v = get_vbase_types (t);
1696 for (; v; v = TREE_CHAIN (v))
1698 tree basetype = BINFO_TYPE (v);
1699 if (get_base_distance (basetype, t, 0, (tree*)0) == -2)
1702 cp_warning ("virtual base `%T' inaccessible in `%T' due to ambiguity",
1710 /* Find the base class with the largest number of virtual functions. */
1711 for (vfields = b->vfields; vfields; vfields = TREE_CHAIN (vfields))
1713 if (CLASSTYPE_VSIZE (VF_BASETYPE_VALUE (vfields)) > b->max_has_virtual)
1714 b->max_has_virtual = CLASSTYPE_VSIZE (VF_BASETYPE_VALUE (vfields));
1715 if (VF_DERIVED_VALUE (vfields)
1716 && CLASSTYPE_VSIZE (VF_DERIVED_VALUE (vfields)) > b->max_has_virtual)
1717 b->max_has_virtual = CLASSTYPE_VSIZE (VF_DERIVED_VALUE (vfields));
1722 /* If all virtual functions come only from virtual baseclasses. */
1725 /* Update the rtti base if we have a non-virtual base class version
1727 b->rtti = CLASSTYPE_RTTI (BINFO_TYPE (TREE_VEC_ELT (binfos, first_vfn_base_index)));
1729 return first_vfn_base_index;
1733 typecode_p (type, code)
1735 enum tree_code code;
1737 return (TREE_CODE (type) == code
1738 || (TREE_CODE (type) == REFERENCE_TYPE
1739 && TREE_CODE (TREE_TYPE (type)) == code));
1742 /* Set memoizing fields and bits of T (and its variants) for later use.
1743 MAX_HAS_VIRTUAL is the largest size of any T's virtual function tables. */
1746 finish_struct_bits (t, max_has_virtual)
1748 int max_has_virtual;
1750 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1752 /* Fix up variants (if any). */
1753 tree variants = TYPE_NEXT_VARIANT (t);
1756 /* These fields are in the _TYPE part of the node, not in
1757 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1758 TYPE_HAS_CONSTRUCTOR (variants) = TYPE_HAS_CONSTRUCTOR (t);
1759 TYPE_HAS_DESTRUCTOR (variants) = TYPE_HAS_DESTRUCTOR (t);
1760 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1761 TYPE_NEEDS_DESTRUCTOR (variants) = TYPE_NEEDS_DESTRUCTOR (t);
1763 TYPE_USES_COMPLEX_INHERITANCE (variants) = TYPE_USES_COMPLEX_INHERITANCE (t);
1764 TYPE_VIRTUAL_P (variants) = TYPE_VIRTUAL_P (t);
1765 TYPE_USES_VIRTUAL_BASECLASSES (variants) = TYPE_USES_VIRTUAL_BASECLASSES (t);
1766 /* Copy whatever these are holding today. */
1767 TYPE_MIN_VALUE (variants) = TYPE_MIN_VALUE (t);
1768 TYPE_MAX_VALUE (variants) = TYPE_MAX_VALUE (t);
1769 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1770 TYPE_SIZE (variants) = TYPE_SIZE (t);
1771 variants = TYPE_NEXT_VARIANT (variants);
1774 if (n_baseclasses && max_has_virtual)
1776 /* Done by `finish_struct' for classes without baseclasses. */
1777 int might_have_abstract_virtuals = CLASSTYPE_ABSTRACT_VIRTUALS (t) != 0;
1778 tree binfos = TYPE_BINFO_BASETYPES (t);
1779 for (i = n_baseclasses-1; i >= 0; i--)
1781 might_have_abstract_virtuals
1782 |= (CLASSTYPE_ABSTRACT_VIRTUALS (BINFO_TYPE (TREE_VEC_ELT (binfos, i))) != 0);
1783 if (might_have_abstract_virtuals)
1786 if (might_have_abstract_virtuals)
1788 /* We use error_mark_node from override_one_vtable to signal
1789 an artificial abstract. */
1790 if (CLASSTYPE_ABSTRACT_VIRTUALS (t) == error_mark_node)
1791 CLASSTYPE_ABSTRACT_VIRTUALS (t) = NULL_TREE;
1792 CLASSTYPE_ABSTRACT_VIRTUALS (t) = get_abstract_virtuals (t);
1798 /* Notice whether this class has type conversion functions defined. */
1799 tree binfo = TYPE_BINFO (t);
1800 tree binfos = BINFO_BASETYPES (binfo);
1803 for (i = n_baseclasses-1; i >= 0; i--)
1805 basetype = BINFO_TYPE (TREE_VEC_ELT (binfos, i));
1807 TYPE_HAS_CONVERSION (t) |= TYPE_HAS_CONVERSION (basetype);
1808 if (CLASSTYPE_MAX_DEPTH (basetype) >= CLASSTYPE_MAX_DEPTH (t))
1809 CLASSTYPE_MAX_DEPTH (t) = CLASSTYPE_MAX_DEPTH (basetype) + 1;
1813 /* If this type has a copy constructor, force its mode to be BLKmode, and
1814 force its TREE_ADDRESSABLE bit to be nonzero. This will cause it to
1815 be passed by invisible reference and prevent it from being returned in
1818 Also do this if the class has BLKmode but can still be returned in
1819 registers, since function_cannot_inline_p won't let us inline
1820 functions returning such a type. This affects the HP-PA. */
1821 if (! TYPE_HAS_TRIVIAL_INIT_REF (t)
1822 || (TYPE_MODE (t) == BLKmode && ! aggregate_value_p (t)
1823 && CLASSTYPE_NON_AGGREGATE (t)))
1826 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1827 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1829 TYPE_MODE (variants) = BLKmode;
1830 TREE_ADDRESSABLE (variants) = 1;
1835 /* Add FNDECL to the method_vec growing on the class_obstack. Used by
1836 finish_struct_methods. Note, FNDECL cannot be a constructor or
1837 destructor, those cases are handled by the caller. */
1840 grow_method (fndecl, method_vec_ptr)
1842 tree *method_vec_ptr;
1844 tree method_vec = (tree)obstack_base (&class_obstack);
1846 /* Start off past the constructors and destructor. */
1847 tree *testp = &TREE_VEC_ELT (method_vec, 2);
1849 while (testp < (tree *) obstack_next_free (&class_obstack)
1850 && (*testp == NULL_TREE || DECL_NAME (OVL_CURRENT (*testp)) != DECL_NAME (fndecl)))
1853 if (testp < (tree *) obstack_next_free (&class_obstack))
1854 *testp = build_overload (fndecl, *testp);
1857 obstack_ptr_grow (&class_obstack, fndecl);
1858 *method_vec_ptr = (tree)obstack_base (&class_obstack);
1862 /* Warn about duplicate methods in fn_fields. Also compact method
1863 lists so that lookup can be made faster.
1865 Algorithm: Outer loop builds lists by method name. Inner loop
1866 checks for redundant method names within a list.
1868 Data Structure: List of method lists. The outer list is a
1869 TREE_LIST, whose TREE_PURPOSE field is the field name and the
1870 TREE_VALUE is the DECL_CHAIN of the FUNCTION_DECLs. TREE_CHAIN
1871 links the entire list of methods for TYPE_METHODS. Friends are
1872 chained in the same way as member functions (? TREE_CHAIN or
1873 DECL_CHAIN), but they live in the TREE_TYPE field of the outer
1874 list. That allows them to be quickly deleted, and requires no
1877 If there are any constructors/destructors, they are moved to the
1878 front of the list. This makes pushclass more efficient.
1880 We also link each field which has shares a name with its baseclass
1881 to the head of the list of fields for that base class. This allows
1882 us to reduce search time in places like `build_method_call' to
1883 consider only reasonably likely functions. */
1886 finish_struct_methods (t, fn_fields, nonprivate_method)
1889 int nonprivate_method;
1892 tree save_fn_fields = fn_fields;
1893 tree ctor_name = constructor_name (t);
1894 int i, n_baseclasses = CLASSTYPE_N_BASECLASSES (t);
1896 /* Now prepare to gather fn_fields into vector. */
1897 struct obstack *ambient_obstack = current_obstack;
1898 current_obstack = &class_obstack;
1899 method_vec = make_tree_vec (2);
1900 current_obstack = ambient_obstack;
1902 /* Now make this a live vector. */
1903 obstack_free (&class_obstack, method_vec);
1905 /* Save room for constructors and destructors. */
1906 obstack_blank (&class_obstack, sizeof (struct tree_vec) + sizeof (struct tree *));
1908 /* First fill in entry 0 with the constructors, entry 1 with destructors,
1909 and the next few with type conversion operators (if any). */
1911 for (; fn_fields; fn_fields = TREE_CHAIN (fn_fields))
1913 tree fn_name = DECL_NAME (fn_fields);
1915 /* Clear out this flag.
1917 @@ Doug may figure out how to break
1918 @@ this with nested classes and friends. */
1919 DECL_IN_AGGR_P (fn_fields) = 0;
1921 /* Note here that a copy ctor is private, so we don't dare generate
1922 a default copy constructor for a class that has a member
1923 of this type without making sure they have access to it. */
1924 if (fn_name == ctor_name)
1926 tree parmtypes = FUNCTION_ARG_CHAIN (fn_fields);
1927 tree parmtype = parmtypes ? TREE_VALUE (parmtypes) : void_type_node;
1929 if (TREE_CODE (parmtype) == REFERENCE_TYPE
1930 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype)) == t)
1932 if (TREE_CHAIN (parmtypes) == NULL_TREE
1933 || TREE_CHAIN (parmtypes) == void_list_node
1934 || TREE_PURPOSE (TREE_CHAIN (parmtypes)))
1936 if (TREE_PROTECTED (fn_fields))
1937 TYPE_HAS_NONPUBLIC_CTOR (t) = 1;
1938 else if (TREE_PRIVATE (fn_fields))
1939 TYPE_HAS_NONPUBLIC_CTOR (t) = 2;
1942 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (fn_fields)))
1944 /* Destructors go in slot 1. */
1945 TREE_VEC_ELT (method_vec, 1) =
1946 build_overload (fn_fields, TREE_VEC_ELT (method_vec, 1));
1950 /* Constructors go in slot 0. */
1951 TREE_VEC_ELT (method_vec, 0) =
1952 build_overload (fn_fields, TREE_VEC_ELT (method_vec, 0));
1955 else if (IDENTIFIER_TYPENAME_P (fn_name))
1956 grow_method (fn_fields, &method_vec);
1959 fn_fields = save_fn_fields;
1960 for (; fn_fields; fn_fields = TREE_CHAIN (fn_fields))
1962 tree fn_name = DECL_NAME (fn_fields);
1964 if (fn_name == ctor_name || IDENTIFIER_TYPENAME_P (fn_name))
1967 if (fn_name == ansi_opname[(int) MODIFY_EXPR])
1969 tree parmtype = TREE_VALUE (FUNCTION_ARG_CHAIN (fn_fields));
1971 if (copy_assignment_arg_p (parmtype, DECL_VIRTUAL_P (fn_fields)))
1973 if (TREE_PROTECTED (fn_fields))
1974 TYPE_HAS_NONPUBLIC_ASSIGN_REF (t) = 1;
1975 else if (TREE_PRIVATE (fn_fields))
1976 TYPE_HAS_NONPUBLIC_ASSIGN_REF (t) = 2;
1980 grow_method (fn_fields, &method_vec);
1983 TREE_VEC_LENGTH (method_vec) = (tree *)obstack_next_free (&class_obstack)
1984 - (&TREE_VEC_ELT (method_vec, 0));
1985 obstack_finish (&class_obstack);
1986 CLASSTYPE_METHOD_VEC (t) = method_vec;
1988 if (nonprivate_method == 0
1989 && CLASSTYPE_FRIEND_CLASSES (t) == NULL_TREE
1990 && DECL_FRIENDLIST (TYPE_MAIN_DECL (t)) == NULL_TREE)
1992 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
1993 for (i = 0; i < n_baseclasses; i++)
1994 if (TREE_VIA_PUBLIC (TREE_VEC_ELT (binfos, i))
1995 || TREE_VIA_PROTECTED (TREE_VEC_ELT (binfos, i)))
1997 nonprivate_method = 1;
2000 if (nonprivate_method == 0
2001 && warn_ctor_dtor_privacy)
2002 cp_warning ("all member functions in class `%T' are private", t);
2005 /* Warn if all destructors are private (in which case this class is
2006 effectively unusable. */
2007 if (TYPE_HAS_DESTRUCTOR (t))
2009 tree dtor = TREE_VEC_ELT (method_vec, 1);
2011 /* Wild parse errors can cause this to happen. */
2012 if (dtor == NULL_TREE)
2013 TYPE_HAS_DESTRUCTOR (t) = 0;
2014 else if (TREE_PRIVATE (dtor)
2015 && CLASSTYPE_FRIEND_CLASSES (t) == NULL_TREE
2016 && DECL_FRIENDLIST (TYPE_MAIN_DECL (t)) == NULL_TREE
2017 && warn_ctor_dtor_privacy)
2018 cp_warning ("`%#T' only defines a private destructor and has no friends",
2022 /* Now for each member function (except for constructors and
2023 destructors), compute where member functions of the same
2024 name reside in base classes. */
2025 if (n_baseclasses != 0
2026 && TREE_VEC_LENGTH (method_vec) > 2)
2028 int len = TREE_VEC_LENGTH (method_vec);
2029 tree baselink_vec = make_tree_vec (len);
2031 tree baselink_binfo = build_tree_list (NULL_TREE, TYPE_BINFO (t));
2033 for (i = 2; i < len; i++)
2035 TREE_VEC_ELT (baselink_vec, i)
2036 = get_baselinks (baselink_binfo, t,
2037 DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec, i))));
2038 if (TREE_VEC_ELT (baselink_vec, i) != 0)
2042 CLASSTYPE_BASELINK_VEC (t) = baselink_vec;
2044 obstack_free (current_obstack, baselink_vec);
2050 /* Emit error when a duplicate definition of a type is seen. Patch up. */
2053 duplicate_tag_error (t)
2056 cp_error ("redefinition of `%#T'", t);
2057 cp_error_at ("previous definition here", t);
2059 /* Pretend we haven't defined this type. */
2061 /* All of the component_decl's were TREE_CHAINed together in the parser.
2062 finish_struct_methods walks these chains and assembles all methods with
2063 the same base name into DECL_CHAINs. Now we don't need the parser chains
2064 anymore, so we unravel them. */
2066 /* This used to be in finish_struct, but it turns out that the
2067 TREE_CHAIN is used by dbxout_type_methods and perhaps some other
2069 if (CLASSTYPE_METHOD_VEC (t))
2071 tree method_vec = CLASSTYPE_METHOD_VEC (t);
2072 int i, len = TREE_VEC_LENGTH (method_vec);
2073 for (i = 0; i < len; i++)
2075 tree unchain = TREE_VEC_ELT (method_vec, i);
2076 while (unchain != NULL_TREE)
2078 TREE_CHAIN (OVL_CURRENT (unchain)) = NULL_TREE;
2079 unchain = OVL_NEXT (unchain);
2084 if (TYPE_LANG_SPECIFIC (t))
2086 tree as_list = CLASSTYPE_AS_LIST (t);
2087 tree binfo = TYPE_BINFO (t);
2088 tree binfo_as_list = CLASSTYPE_BINFO_AS_LIST (t);
2089 int interface_only = CLASSTYPE_INTERFACE_ONLY (t);
2090 int interface_unknown = CLASSTYPE_INTERFACE_UNKNOWN (t);
2092 bzero ((char *) TYPE_LANG_SPECIFIC (t), sizeof (struct lang_type));
2093 BINFO_BASETYPES(binfo) = NULL_TREE;
2095 CLASSTYPE_AS_LIST (t) = as_list;
2096 TYPE_BINFO (t) = binfo;
2097 CLASSTYPE_BINFO_AS_LIST (t) = binfo_as_list;
2098 CLASSTYPE_INTERFACE_ONLY (t) = interface_only;
2099 SET_CLASSTYPE_INTERFACE_UNKNOWN_X (t, interface_unknown);
2100 TYPE_REDEFINED (t) = 1;
2102 TYPE_SIZE (t) = NULL_TREE;
2103 TYPE_MODE (t) = VOIDmode;
2104 TYPE_FIELDS (t) = NULL_TREE;
2105 TYPE_METHODS (t) = NULL_TREE;
2106 TYPE_VFIELD (t) = NULL_TREE;
2107 TYPE_CONTEXT (t) = NULL_TREE;
2110 /* finish up all new vtables. */
2113 finish_vtbls (binfo, do_self, t)
2118 tree binfos = BINFO_BASETYPES (binfo);
2119 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2121 /* Should we use something besides CLASSTYPE_VFIELDS? */
2122 if (do_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2124 if (BINFO_NEW_VTABLE_MARKED (binfo))
2128 decl = BINFO_VTABLE (binfo);
2129 context = DECL_CONTEXT (decl);
2130 DECL_CONTEXT (decl) = 0;
2131 if (write_virtuals >= 0
2132 && DECL_INITIAL (decl) != BINFO_VIRTUALS (binfo))
2133 DECL_INITIAL (decl) = build_nt (CONSTRUCTOR, NULL_TREE,
2134 BINFO_VIRTUALS (binfo));
2135 cp_finish_decl (decl, DECL_INITIAL (decl), NULL_TREE, 0, 0);
2136 DECL_CONTEXT (decl) = context;
2138 CLEAR_BINFO_NEW_VTABLE_MARKED (binfo);
2141 for (i = 0; i < n_baselinks; i++)
2143 tree base_binfo = TREE_VEC_ELT (binfos, i);
2144 int is_not_base_vtable
2145 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2146 if (TREE_VIA_VIRTUAL (base_binfo))
2148 base_binfo = binfo_member (BINFO_TYPE (base_binfo), CLASSTYPE_VBASECLASSES (t));
2150 finish_vtbls (base_binfo, is_not_base_vtable, t);
2154 /* True if we should override the given BASE_FNDECL with the given
2158 overrides (fndecl, base_fndecl)
2159 tree fndecl, base_fndecl;
2161 /* Destructors have special names. */
2162 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (base_fndecl))
2163 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (fndecl)))
2165 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (base_fndecl))
2166 || DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (fndecl)))
2168 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl))
2170 tree types, base_types;
2172 retypes = TREE_TYPE (TREE_TYPE (fndecl));
2173 base_retypes = TREE_TYPE (TREE_TYPE (base_fndecl));
2175 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2176 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
2177 if ((TYPE_READONLY (TREE_TYPE (TREE_VALUE (base_types)))
2178 == TYPE_READONLY (TREE_TYPE (TREE_VALUE (types))))
2179 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types), 3))
2186 get_class_offset_1 (parent, binfo, context, t, fndecl)
2187 tree parent, binfo, context, t, fndecl;
2189 tree binfos = BINFO_BASETYPES (binfo);
2190 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2191 tree rval = NULL_TREE;
2193 if (binfo == parent)
2194 return error_mark_node;
2196 for (i = 0; i < n_baselinks; i++)
2198 tree base_binfo = TREE_VEC_ELT (binfos, i);
2201 if (TREE_VIA_VIRTUAL (base_binfo))
2202 base_binfo = binfo_member (BINFO_TYPE (base_binfo),
2203 CLASSTYPE_VBASECLASSES (t));
2204 nrval = get_class_offset_1 (parent, base_binfo, context, t, fndecl);
2205 /* See if we have a new value */
2206 if (nrval && (nrval != error_mark_node || rval==0))
2208 /* Only compare if we have two offsets */
2209 if (rval && rval != error_mark_node
2210 && ! tree_int_cst_equal (nrval, rval))
2212 /* Only give error if the two offsets are different */
2213 error ("every virtual function must have a unique final overrider");
2214 cp_error (" found two (or more) `%T' class subobjects in `%T'", context, t);
2215 cp_error (" with virtual `%D' from virtual base class", fndecl);
2221 if (rval && BINFO_TYPE (binfo) == context)
2223 my_friendly_assert (rval == error_mark_node
2224 || tree_int_cst_equal (rval, BINFO_OFFSET (binfo)), 999);
2225 rval = BINFO_OFFSET (binfo);
2231 /* Get the offset to the CONTEXT subobject that is related to the
2235 get_class_offset (context, t, binfo, fndecl)
2236 tree context, t, binfo, fndecl;
2238 tree first_binfo = binfo;
2243 return integer_zero_node;
2245 if (BINFO_TYPE (binfo) == context)
2246 return BINFO_OFFSET (binfo);
2248 /* Check less derived binfos first. */
2249 while (BINFO_BASETYPES (binfo)
2250 && (i=CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo))) != -1)
2252 tree binfos = BINFO_BASETYPES (binfo);
2253 binfo = TREE_VEC_ELT (binfos, i);
2254 if (BINFO_TYPE (binfo) == context)
2255 return BINFO_OFFSET (binfo);
2258 /* Ok, not found in the less derived binfos, now check the more
2260 offset = get_class_offset_1 (first_binfo, TYPE_BINFO (t), context, t, fndecl);
2261 if (offset==0 || TREE_CODE (offset) != INTEGER_CST)
2262 my_friendly_abort (999); /* we have to find it. */
2266 /* Skip RTTI information at the front of the virtual list. */
2268 unsigned HOST_WIDE_INT
2269 skip_rtti_stuff (virtuals)
2277 /* We always reserve a slot for the offset/tdesc entry. */
2279 *virtuals = TREE_CHAIN (*virtuals);
2281 if (flag_vtable_thunks && *virtuals)
2283 /* The second slot is reserved for the tdesc pointer when thunks
2286 *virtuals = TREE_CHAIN (*virtuals);
2292 modify_one_vtable (binfo, t, fndecl, pfn)
2293 tree binfo, t, fndecl, pfn;
2295 tree virtuals = BINFO_VIRTUALS (binfo);
2296 unsigned HOST_WIDE_INT n;
2298 /* update rtti entry */
2301 if (binfo == TYPE_BINFO (t))
2303 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2304 build_vtable (TYPE_BINFO (DECL_CONTEXT (CLASSTYPE_VFIELD (t))), t);
2308 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2309 prepare_fresh_vtable (binfo, t);
2312 if (fndecl == NULL_TREE)
2315 n = skip_rtti_stuff (&virtuals);
2319 tree current_fndecl = TREE_VALUE (virtuals);
2320 current_fndecl = FNADDR_FROM_VTABLE_ENTRY (current_fndecl);
2321 current_fndecl = TREE_OPERAND (current_fndecl, 0);
2322 if (current_fndecl && overrides (fndecl, current_fndecl))
2324 tree base_offset, offset;
2325 tree context = DECL_CLASS_CONTEXT (fndecl);
2326 tree vfield = CLASSTYPE_VFIELD (t);
2329 offset = get_class_offset (context, t, binfo, fndecl);
2331 /* Find the right offset for the this pointer based on the
2332 base class we just found. We have to take into
2333 consideration the virtual base class pointers that we
2334 stick in before the virtual function table pointer.
2336 Also, we want just the delta between the most base class
2337 that we derived this vfield from and us. */
2338 base_offset = size_binop (PLUS_EXPR,
2339 get_derived_offset (binfo, DECL_CONTEXT (current_fndecl)),
2340 BINFO_OFFSET (binfo));
2341 this_offset = size_binop (MINUS_EXPR, offset, base_offset);
2343 /* Make sure we can modify the derived association with immunity. */
2344 if (TREE_USED (binfo))
2345 my_friendly_assert (0, 999);
2347 if (binfo == TYPE_BINFO (t))
2349 /* In this case, it is *type*'s vtable we are modifying.
2350 We start with the approximation that it's vtable is that
2351 of the immediate base class. */
2352 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2353 build_vtable (TYPE_BINFO (DECL_CONTEXT (vfield)), t);
2357 /* This is our very own copy of `basetype' to play with.
2358 Later, we will fill in all the virtual functions
2359 that override the virtual functions in these base classes
2360 which are not defined by the current type. */
2361 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2362 prepare_fresh_vtable (binfo, t);
2366 cp_warning ("in %D", DECL_NAME (BINFO_VTABLE (binfo)));
2368 modify_vtable_entry (get_vtable_entry_n (BINFO_VIRTUALS (binfo), n),
2369 build_vtable_entry (this_offset, pfn),
2373 virtuals = TREE_CHAIN (virtuals);
2377 /* These are the ones that are not through virtual base classes. */
2380 modify_all_direct_vtables (binfo, do_self, t, fndecl, pfn)
2383 tree t, fndecl, pfn;
2385 tree binfos = BINFO_BASETYPES (binfo);
2386 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2388 /* Should we use something besides CLASSTYPE_VFIELDS? */
2389 if (do_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2391 modify_one_vtable (binfo, t, fndecl, pfn);
2394 for (i = 0; i < n_baselinks; i++)
2396 tree base_binfo = TREE_VEC_ELT (binfos, i);
2397 int is_not_base_vtable
2398 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2399 if (! TREE_VIA_VIRTUAL (base_binfo))
2400 modify_all_direct_vtables (base_binfo, is_not_base_vtable, t, fndecl, pfn);
2404 /* Fixup all the delta entries in this one vtable that need updating. */
2407 fixup_vtable_deltas1 (binfo, t)
2410 tree virtuals = BINFO_VIRTUALS (binfo);
2411 unsigned HOST_WIDE_INT n;
2413 n = skip_rtti_stuff (&virtuals);
2417 tree fndecl = TREE_VALUE (virtuals);
2418 tree pfn = FNADDR_FROM_VTABLE_ENTRY (fndecl);
2419 tree delta = DELTA_FROM_VTABLE_ENTRY (fndecl);
2420 fndecl = TREE_OPERAND (pfn, 0);
2423 tree base_offset, offset;
2424 tree context = DECL_CLASS_CONTEXT (fndecl);
2425 tree vfield = CLASSTYPE_VFIELD (t);
2428 offset = get_class_offset (context, t, binfo, fndecl);
2430 /* Find the right offset for the this pointer based on the
2431 base class we just found. We have to take into
2432 consideration the virtual base class pointers that we
2433 stick in before the virtual function table pointer.
2435 Also, we want just the delta between the most base class
2436 that we derived this vfield from and us. */
2437 base_offset = size_binop (PLUS_EXPR,
2438 get_derived_offset (binfo, DECL_CONTEXT (fndecl)),
2439 BINFO_OFFSET (binfo));
2440 this_offset = size_binop (MINUS_EXPR, offset, base_offset);
2442 if (! tree_int_cst_equal (this_offset, delta))
2444 /* Make sure we can modify the derived association with immunity. */
2445 if (TREE_USED (binfo))
2446 my_friendly_assert (0, 999);
2448 if (binfo == TYPE_BINFO (t))
2450 /* In this case, it is *type*'s vtable we are modifying.
2451 We start with the approximation that it's vtable is that
2452 of the immediate base class. */
2453 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2454 build_vtable (TYPE_BINFO (DECL_CONTEXT (vfield)), t);
2458 /* This is our very own copy of `basetype' to play with.
2459 Later, we will fill in all the virtual functions
2460 that override the virtual functions in these base classes
2461 which are not defined by the current type. */
2462 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2463 prepare_fresh_vtable (binfo, t);
2466 modify_vtable_entry (get_vtable_entry_n (BINFO_VIRTUALS (binfo), n),
2467 build_vtable_entry (this_offset, pfn),
2472 virtuals = TREE_CHAIN (virtuals);
2476 /* Fixup all the delta entries in all the direct vtables that need updating.
2477 This happens when we have non-overridden virtual functions from a
2478 virtual base class, that are at a different offset, in the new
2479 hierarchy, because the layout of the virtual bases has changed. */
2482 fixup_vtable_deltas (binfo, init_self, t)
2487 tree binfos = BINFO_BASETYPES (binfo);
2488 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2490 for (i = 0; i < n_baselinks; i++)
2492 tree base_binfo = TREE_VEC_ELT (binfos, i);
2493 int is_not_base_vtable
2494 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2495 if (! TREE_VIA_VIRTUAL (base_binfo))
2496 fixup_vtable_deltas (base_binfo, is_not_base_vtable, t);
2498 /* Should we use something besides CLASSTYPE_VFIELDS? */
2499 if (init_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2501 fixup_vtable_deltas1 (binfo, t);
2505 /* These are the ones that are through virtual base classes. */
2508 modify_all_indirect_vtables (binfo, do_self, via_virtual, t, fndecl, pfn)
2510 int do_self, via_virtual;
2511 tree t, fndecl, pfn;
2513 tree binfos = BINFO_BASETYPES (binfo);
2514 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2516 /* Should we use something besides CLASSTYPE_VFIELDS? */
2517 if (do_self && via_virtual && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2519 modify_one_vtable (binfo, t, fndecl, pfn);
2522 for (i = 0; i < n_baselinks; i++)
2524 tree base_binfo = TREE_VEC_ELT (binfos, i);
2525 int is_not_base_vtable
2526 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2527 if (TREE_VIA_VIRTUAL (base_binfo))
2530 base_binfo = binfo_member (BINFO_TYPE (base_binfo), CLASSTYPE_VBASECLASSES (t));
2532 modify_all_indirect_vtables (base_binfo, is_not_base_vtable, via_virtual, t, fndecl, pfn);
2537 modify_all_vtables (t, fndecl, vfn)
2538 tree t, fndecl, vfn;
2540 /* Do these first, so that we will make use of any non-virtual class's
2541 vtable, over a virtual classes vtable. */
2542 modify_all_direct_vtables (TYPE_BINFO (t), 1, t, fndecl, vfn);
2543 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
2544 modify_all_indirect_vtables (TYPE_BINFO (t), 1, 0, t, fndecl, vfn);
2547 /* Here, we already know that they match in every respect.
2548 All we have to check is where they had their declarations. */
2551 strictly_overrides (fndecl1, fndecl2)
2552 tree fndecl1, fndecl2;
2554 int distance = get_base_distance (DECL_CLASS_CONTEXT (fndecl2),
2555 DECL_CLASS_CONTEXT (fndecl1),
2557 if (distance == -2 || distance > 0)
2562 /* Merge overrides for one vtable.
2563 If we want to merge in same function, we are fine.
2565 if one has a DECL_CLASS_CONTEXT that is a parent of the
2566 other, than choose the more derived one
2568 potentially ill-formed (see 10.3 [class.virtual])
2569 we have to check later to see if there was an
2570 override in this class. If there was ok, if not
2571 then it is ill-formed. (mrs)
2573 We take special care to reuse a vtable, if we can. */
2576 override_one_vtable (binfo, old, t)
2579 tree virtuals = BINFO_VIRTUALS (binfo);
2580 tree old_virtuals = BINFO_VIRTUALS (old);
2581 enum { REUSE_NEW, REUSE_OLD, UNDECIDED, NEITHER } choose = UNDECIDED;
2583 /* If we have already committed to modifying it, then don't try and
2584 reuse another vtable. */
2585 if (BINFO_NEW_VTABLE_MARKED (binfo))
2588 skip_rtti_stuff (&virtuals);
2589 skip_rtti_stuff (&old_virtuals);
2593 tree fndecl = TREE_VALUE (virtuals);
2594 tree old_fndecl = TREE_VALUE (old_virtuals);
2595 fndecl = FNADDR_FROM_VTABLE_ENTRY (fndecl);
2596 old_fndecl = FNADDR_FROM_VTABLE_ENTRY (old_fndecl);
2597 fndecl = TREE_OPERAND (fndecl, 0);
2598 old_fndecl = TREE_OPERAND (old_fndecl, 0);
2599 /* First check to see if they are the same. */
2600 if (DECL_ASSEMBLER_NAME (fndecl) == DECL_ASSEMBLER_NAME (old_fndecl))
2602 /* No need to do anything. */
2604 else if (strictly_overrides (fndecl, old_fndecl))
2606 if (choose == UNDECIDED)
2608 else if (choose == REUSE_OLD)
2611 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2613 prepare_fresh_vtable (binfo, t);
2614 override_one_vtable (binfo, old, t);
2619 else if (strictly_overrides (old_fndecl, fndecl))
2621 if (choose == UNDECIDED)
2623 else if (choose == REUSE_NEW)
2626 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2628 prepare_fresh_vtable (binfo, t);
2629 override_one_vtable (binfo, old, t);
2632 TREE_VALUE (virtuals) = TREE_VALUE (old_virtuals);
2634 else if (choose == NEITHER)
2636 TREE_VALUE (virtuals) = TREE_VALUE (old_virtuals);
2642 if (! BINFO_NEW_VTABLE_MARKED (binfo))
2644 prepare_fresh_vtable (binfo, t);
2645 override_one_vtable (binfo, old, t);
2649 /* This MUST be overridden, or the class is ill-formed. */
2650 /* For now, we just make it abstract. */
2651 tree fndecl = TREE_OPERAND (FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (virtuals)), 0);
2654 fndecl = copy_node (fndecl);
2655 copy_lang_decl (fndecl);
2656 DECL_ABSTRACT_VIRTUAL_P (fndecl) = 1;
2657 DECL_NEEDS_FINAL_OVERRIDER_P (fndecl) = 1;
2658 /* Make sure we search for it later. */
2659 if (! CLASSTYPE_ABSTRACT_VIRTUALS (t))
2660 CLASSTYPE_ABSTRACT_VIRTUALS (t) = error_mark_node;
2662 vfn = build1 (ADDR_EXPR, vfunc_ptr_type_node, fndecl);
2663 TREE_CONSTANT (vfn) = 1;
2665 /* We can use integer_zero_node, as we will core dump
2666 if this is used anyway. */
2667 TREE_VALUE (virtuals) = build_vtable_entry (integer_zero_node, vfn);
2670 virtuals = TREE_CHAIN (virtuals);
2671 old_virtuals = TREE_CHAIN (old_virtuals);
2674 /* Let's reuse the old vtable. */
2675 if (choose == REUSE_OLD)
2677 BINFO_VTABLE (binfo) = BINFO_VTABLE (old);
2678 BINFO_VIRTUALS (binfo) = BINFO_VIRTUALS (old);
2682 /* Merge in overrides for virtual bases.
2683 BINFO is the hierarchy we want to modify, and OLD has the potential
2687 merge_overrides (binfo, old, do_self, t)
2692 tree binfos = BINFO_BASETYPES (binfo);
2693 tree old_binfos = BINFO_BASETYPES (old);
2694 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2696 /* Should we use something besides CLASSTYPE_VFIELDS? */
2697 if (do_self && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
2699 override_one_vtable (binfo, old, t);
2702 for (i = 0; i < n_baselinks; i++)
2704 tree base_binfo = TREE_VEC_ELT (binfos, i);
2705 tree old_base_binfo = TREE_VEC_ELT (old_binfos, i);
2706 int is_not_base_vtable
2707 = i != CLASSTYPE_VFIELD_PARENT (BINFO_TYPE (binfo));
2708 if (! TREE_VIA_VIRTUAL (base_binfo))
2709 merge_overrides (base_binfo, old_base_binfo, is_not_base_vtable, t);
2713 /* Get the base virtual function declarations in T that are either
2714 overridden or hidden by FNDECL as a list. We set TREE_PURPOSE with
2715 the overrider/hider. */
2718 get_basefndecls (fndecl, t)
2721 tree methods = TYPE_METHODS (t);
2722 tree base_fndecls = NULL_TREE;
2723 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
2724 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2728 if (TREE_CODE (methods) == FUNCTION_DECL
2729 && DECL_VINDEX (methods) != NULL_TREE
2730 && DECL_NAME (fndecl) == DECL_NAME (methods))
2731 base_fndecls = temp_tree_cons (fndecl, methods, base_fndecls);
2733 methods = TREE_CHAIN (methods);
2737 return base_fndecls;
2739 for (i = 0; i < n_baseclasses; i++)
2741 tree base_binfo = TREE_VEC_ELT (binfos, i);
2742 tree basetype = BINFO_TYPE (base_binfo);
2744 base_fndecls = chainon (get_basefndecls (fndecl, basetype),
2748 return base_fndecls;
2751 /* Mark the functions that have been hidden with their overriders.
2752 Since we start out with all functions already marked with a hider,
2753 no need to mark functions that are just hidden. */
2756 mark_overriders (fndecl, base_fndecls)
2757 tree fndecl, base_fndecls;
2759 while (base_fndecls)
2761 if (overrides (TREE_VALUE (base_fndecls), fndecl))
2762 TREE_PURPOSE (base_fndecls) = fndecl;
2764 base_fndecls = TREE_CHAIN (base_fndecls);
2768 /* If this declaration supersedes the declaration of
2769 a method declared virtual in the base class, then
2770 mark this field as being virtual as well. */
2773 check_for_override (decl, ctype)
2776 tree binfos = BINFO_BASETYPES (TYPE_BINFO (ctype));
2777 int i, n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2778 int virtualp = DECL_VIRTUAL_P (decl);
2780 for (i = 0; i < n_baselinks; i++)
2782 tree base_binfo = TREE_VEC_ELT (binfos, i);
2783 if (TYPE_VIRTUAL_P (BINFO_TYPE (base_binfo))
2784 || flag_all_virtual == 1)
2786 tree tmp = get_matching_virtual
2788 DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)));
2791 /* If this function overrides some virtual in some base
2792 class, then the function itself is also necessarily
2793 virtual, even if the user didn't explicitly say so. */
2794 DECL_VIRTUAL_P (decl) = 1;
2796 /* The TMP we really want is the one from the deepest
2797 baseclass on this path, taking care not to
2798 duplicate if we have already found it (via another
2799 path to its virtual baseclass. */
2800 if (TREE_CODE (TREE_TYPE (decl)) == FUNCTION_TYPE)
2802 cp_error_at ("method `%D' may not be declared static",
2804 cp_error_at ("(since `%D' declared virtual in base class.)",
2810 #if 0 /* The signature of an overriding function is not changed. */
2812 /* The argument types may have changed... */
2813 tree type = TREE_TYPE (decl);
2814 tree argtypes = TYPE_ARG_TYPES (type);
2815 tree base_variant = TREE_TYPE (TREE_VALUE (argtypes));
2816 tree raises = TYPE_RAISES_EXCEPTIONS (type);
2818 argtypes = commonparms (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (tmp))),
2819 TREE_CHAIN (argtypes));
2820 /* But the return type has not. */
2821 type = build_cplus_method_type (base_variant, TREE_TYPE (type), argtypes);
2823 type = build_exception_variant (type, raises);
2824 TREE_TYPE (decl) = type;
2828 = tree_cons (NULL_TREE, tmp, DECL_VINDEX (decl));
2835 if (DECL_VINDEX (decl) == NULL_TREE)
2836 DECL_VINDEX (decl) = error_mark_node;
2837 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2841 /* Warn about hidden virtual functions that are not overridden in t.
2842 We know that constructors and destructors don't apply. */
2848 tree method_vec = CLASSTYPE_METHOD_VEC (t);
2849 int n_methods = method_vec ? TREE_VEC_LENGTH (method_vec) : 0;
2852 /* We go through each separately named virtual function. */
2853 for (i = 2; i < n_methods; ++i)
2855 tree fndecl = TREE_VEC_ELT (method_vec, i);
2857 tree base_fndecls = NULL_TREE;
2858 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
2859 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
2861 if (DECL_VINDEX (fndecl) == NULL_TREE)
2864 /* First we get a list of all possible functions that might be
2865 hidden from each base class. */
2866 for (i = 0; i < n_baseclasses; i++)
2868 tree base_binfo = TREE_VEC_ELT (binfos, i);
2869 tree basetype = BINFO_TYPE (base_binfo);
2871 base_fndecls = chainon (get_basefndecls (fndecl, basetype),
2875 if (TREE_CHAIN (fndecl)
2876 && DECL_NAME (TREE_CHAIN (fndecl)) == DECL_NAME (fndecl))
2877 fndecl = TREE_CHAIN (fndecl);
2881 /* ...then mark up all the base functions with overriders, preferring
2882 overriders to hiders. */
2886 mark_overriders (fndecl, base_fndecls);
2888 if (TREE_CHAIN (fndecl)
2889 && DECL_NAME (TREE_CHAIN (fndecl)) == DECL_NAME (fndecl))
2890 fndecl = TREE_CHAIN (fndecl);
2895 /* Now give a warning for all base functions without overriders,
2896 as they are hidden. */
2897 while (base_fndecls)
2899 if (! overrides (TREE_VALUE (base_fndecls),
2900 TREE_PURPOSE (base_fndecls)))
2902 /* Here we know it is a hider, and no overrider exists. */
2903 cp_warning_at ("`%D' was hidden", TREE_VALUE (base_fndecls));
2904 cp_warning_at (" by `%D'", TREE_PURPOSE (base_fndecls));
2907 base_fndecls = TREE_CHAIN (base_fndecls);
2912 /* Check for things that are invalid. There are probably plenty of other
2913 things we should check for also. */
2916 finish_struct_anon (t)
2920 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
2922 if (TREE_STATIC (field))
2924 if (TREE_CODE (field) != FIELD_DECL)
2927 if (DECL_NAME (field) == NULL_TREE
2928 && TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
2930 tree* uelt = &TYPE_FIELDS (TREE_TYPE (field));
2931 for (; *uelt; uelt = &TREE_CHAIN (*uelt))
2933 if (TREE_CODE (*uelt) != FIELD_DECL)
2936 if (TREE_PRIVATE (*uelt))
2937 cp_pedwarn_at ("private member `%#D' in anonymous union",
2939 else if (TREE_PROTECTED (*uelt))
2940 cp_pedwarn_at ("protected member `%#D' in anonymous union",
2943 TREE_PRIVATE (*uelt) = TREE_PRIVATE (field);
2944 TREE_PROTECTED (*uelt) = TREE_PROTECTED (field);
2950 extern int interface_only, interface_unknown;
2952 /* Create a RECORD_TYPE or UNION_TYPE node for a C struct or union declaration
2953 (or C++ class declaration).
2955 For C++, we must handle the building of derived classes.
2956 Also, C++ allows static class members. The way that this is
2957 handled is to keep the field name where it is (as the DECL_NAME
2958 of the field), and place the overloaded decl in the DECL_FIELD_BITPOS
2959 of the field. layout_record and layout_union will know about this.
2961 More C++ hair: inline functions have text in their
2962 DECL_PENDING_INLINE_INFO nodes which must somehow be parsed into
2963 meaningful tree structure. After the struct has been laid out, set
2964 things up so that this can happen.
2966 And still more: virtual functions. In the case of single inheritance,
2967 when a new virtual function is seen which redefines a virtual function
2968 from the base class, the new virtual function is placed into
2969 the virtual function table at exactly the same address that
2970 it had in the base class. When this is extended to multiple
2971 inheritance, the same thing happens, except that multiple virtual
2972 function tables must be maintained. The first virtual function
2973 table is treated in exactly the same way as in the case of single
2974 inheritance. Additional virtual function tables have different
2975 DELTAs, which tell how to adjust `this' to point to the right thing.
2977 LIST_OF_FIELDLISTS is just that. The elements of the list are
2978 TREE_LIST elements, whose TREE_PURPOSE field tells what access
2979 the list has, and the TREE_VALUE slot gives the actual fields.
2981 ATTRIBUTES is the set of decl attributes to be applied, if any.
2983 If flag_all_virtual == 1, then we lay all functions into
2984 the virtual function table, as though they were declared
2985 virtual. Constructors do not lay down in the virtual function table.
2987 If flag_all_virtual == 2, then we lay all functions into
2988 the virtual function table, such that virtual functions
2989 occupy a space by themselves, and then all functions
2990 of the class occupy a space by themselves. This is illustrated
2991 in the following diagram:
2993 class A; class B : A;
2995 Class A's vtbl: Class B's vtbl:
2996 --------------------------------------------------------------------
2997 | A's virtual functions| | B's virtual functions |
2998 | | | (may inherit some from A). |
2999 --------------------------------------------------------------------
3000 | All of A's functions | | All of A's functions |
3001 | (such as a->A::f). | | (such as b->A::f) |
3002 --------------------------------------------------------------------
3003 | B's new virtual functions |
3004 | (not defined in A.) |
3005 -------------------------------
3006 | All of B's functions |
3007 | (such as b->B::f) |
3008 -------------------------------
3010 this allows the program to make references to any function, virtual
3011 or otherwise in a type-consistent manner. */
3014 finish_struct_1 (t, warn_anon)
3019 tree name = TYPE_IDENTIFIER (t);
3020 enum tree_code code = TREE_CODE (t);
3021 tree fields = TYPE_FIELDS (t);
3022 tree fn_fields = TYPE_METHODS (t);
3023 tree x, last_x, method_vec;
3026 int max_has_virtual;
3027 tree pending_virtuals = NULL_TREE;
3028 tree pending_hard_virtuals = NULL_TREE;
3029 tree abstract_virtuals = NULL_TREE;
3032 int cant_have_default_ctor;
3033 int cant_have_const_ctor;
3034 int no_const_asn_ref;
3036 /* The index of the first base class which has virtual
3037 functions. Only applied to non-virtual baseclasses. */
3038 int first_vfn_base_index;
3041 int any_default_members = 0;
3042 int const_sans_init = 0;
3043 int ref_sans_init = 0;
3044 int nonprivate_method = 0;
3045 tree access_decls = NULL_TREE;
3048 int has_pointers = 0;
3050 if (warn_anon && code != UNION_TYPE && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t)))
3051 pedwarn ("anonymous class type not used to declare any objects");
3055 if (IS_AGGR_TYPE (t))
3056 cp_error ("redefinition of `%#T'", t);
3058 my_friendly_abort (172);
3063 GNU_xref_decl (current_function_decl, t);
3065 /* If this type was previously laid out as a forward reference,
3066 make sure we lay it out again. */
3068 TYPE_SIZE (t) = NULL_TREE;
3069 CLASSTYPE_GOT_SEMICOLON (t) = 0;
3072 /* This is in general too late to do this. I moved the main case up to
3073 left_curly, what else needs to move? */
3074 if (! IS_SIGNATURE (t))
3076 my_friendly_assert (CLASSTYPE_INTERFACE_ONLY (t) == interface_only, 999);
3077 my_friendly_assert (CLASSTYPE_INTERFACE_KNOWN (t) == ! interface_unknown, 999);
3081 old = suspend_momentary ();
3083 /* Install struct as DECL_FIELD_CONTEXT of each field decl.
3084 Also process specified field sizes.
3085 Set DECL_FIELD_SIZE to the specified size, or 0 if none specified.
3086 The specified size is found in the DECL_INITIAL.
3087 Store 0 there, except for ": 0" fields (so we can find them
3088 and delete them, below). */
3090 if (TYPE_BINFO_BASETYPES (t))
3091 n_baseclasses = TREE_VEC_LENGTH (TYPE_BINFO_BASETYPES (t));
3095 if (n_baseclasses > 0)
3097 struct base_info base_info;
3099 first_vfn_base_index = finish_base_struct (t, &base_info);
3100 /* Remember where we got our vfield from. */
3101 CLASSTYPE_VFIELD_PARENT (t) = first_vfn_base_index;
3102 has_virtual = base_info.has_virtual;
3103 max_has_virtual = base_info.max_has_virtual;
3104 CLASSTYPE_N_SUPERCLASSES (t) += base_info.n_ancestors;
3105 vfield = base_info.vfield;
3106 vfields = base_info.vfields;
3107 CLASSTYPE_RTTI (t) = base_info.rtti;
3108 cant_have_default_ctor = base_info.cant_have_default_ctor;
3109 cant_have_const_ctor = base_info.cant_have_const_ctor;
3110 no_const_asn_ref = base_info.no_const_asn_ref;
3115 first_vfn_base_index = -1;
3117 max_has_virtual = has_virtual;
3119 vfields = NULL_TREE;
3120 CLASSTYPE_RTTI (t) = NULL_TREE;
3121 cant_have_default_ctor = 0;
3122 cant_have_const_ctor = 0;
3123 no_const_asn_ref = 0;
3127 /* Both of these should be done before now. */
3128 if (write_virtuals == 3 && CLASSTYPE_INTERFACE_KNOWN (t)
3129 && ! IS_SIGNATURE (t))
3131 my_friendly_assert (CLASSTYPE_INTERFACE_ONLY (t) == interface_only, 999);
3132 my_friendly_assert (CLASSTYPE_VTABLE_NEEDS_WRITING (t) == ! interface_only, 999);
3136 /* The three of these are approximations which may later be
3137 modified. Needed at this point to make add_virtual_function
3138 and modify_vtable_entries work. */
3139 CLASSTYPE_VFIELDS (t) = vfields;
3140 CLASSTYPE_VFIELD (t) = vfield;
3142 if (IS_SIGNATURE (t))
3144 else if (flag_all_virtual == 1)
3149 for (x = TYPE_METHODS (t); x; x = TREE_CHAIN (x))
3151 GNU_xref_member (current_class_name, x);
3153 nonprivate_method |= ! TREE_PRIVATE (x);
3155 /* If this was an evil function, don't keep it in class. */
3156 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (x)))
3159 DECL_CLASS_CONTEXT (x) = t;
3161 /* Do both of these, even though they're in the same union;
3162 if the insn `r' member and the size `i' member are
3163 different sizes, as on the alpha, the larger of the two
3164 will end up with garbage in it. */
3165 DECL_SAVED_INSNS (x) = NULL_RTX;
3166 DECL_FIELD_SIZE (x) = 0;
3168 check_for_override (x, t);
3169 if (DECL_ABSTRACT_VIRTUAL_P (x) && ! DECL_VINDEX (x))
3170 cp_error_at ("initializer specified for non-virtual method `%D'", x);
3172 /* The name of the field is the original field name
3173 Save this in auxiliary field for later overloading. */
3175 || (all_virtual == 1 && ! DECL_CONSTRUCTOR_P (x)))
3177 add_virtual_function (&pending_virtuals, &pending_hard_virtuals,
3178 &has_virtual, x, t);
3179 if (DECL_ABSTRACT_VIRTUAL_P (x))
3180 abstract_virtuals = tree_cons (NULL_TREE, x, abstract_virtuals);
3182 /* XXX Why did I comment this out? (jason) */
3190 fields = chainon (build_vbase_pointer_fields (t), fields);
3193 for (x = fields; x; x = TREE_CHAIN (x))
3195 GNU_xref_member (current_class_name, x);
3197 if (TREE_CODE (x) == FIELD_DECL)
3199 DECL_PACKED (x) |= TYPE_PACKED (t);
3203 /* Handle access declarations. */
3204 if (TREE_CODE (x) == USING_DECL)
3206 tree ctype = DECL_INITIAL (x);
3207 tree sname = DECL_NAME (x);
3209 = TREE_PRIVATE (x) ? access_private_node
3210 : TREE_PROTECTED (x) ? access_protected_node
3211 : access_public_node;
3215 TREE_CHAIN (last_x) = TREE_CHAIN (x);
3217 fields = TREE_CHAIN (x);
3219 binfo = binfo_or_else (ctype, t);
3223 if (sname == constructor_name (ctype)
3224 || sname == constructor_name_full (ctype))
3225 cp_error_at ("using-declaration for constructor", x);
3227 fdecl = lookup_field (binfo, sname, 0, 0);
3229 fdecl = lookup_fnfields (binfo, sname, 0);
3232 access_decls = scratch_tree_cons (access, fdecl, access_decls);
3234 cp_error_at ("no members matching `%D' in `%#T'", x, ctype);
3240 if (TREE_CODE (x) == TYPE_DECL
3241 || TREE_CODE (x) == TEMPLATE_DECL)
3244 /* If we've gotten this far, it's a data member, possibly static,
3245 or an enumerator. */
3247 DECL_FIELD_CONTEXT (x) = t;
3249 /* ``A local class cannot have static data members.'' ARM 9.4 */
3250 if (current_function_decl && TREE_STATIC (x))
3251 cp_error_at ("field `%D' in local class cannot be static", x);
3253 /* Perform error checking that did not get done in
3255 if (TREE_CODE (TREE_TYPE (x)) == FUNCTION_TYPE)
3257 cp_error_at ("field `%D' invalidly declared function type",
3259 TREE_TYPE (x) = build_pointer_type (TREE_TYPE (x));
3261 else if (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE)
3263 cp_error_at ("field `%D' invalidly declared method type", x);
3264 TREE_TYPE (x) = build_pointer_type (TREE_TYPE (x));
3266 else if (TREE_CODE (TREE_TYPE (x)) == OFFSET_TYPE)
3268 cp_error_at ("field `%D' invalidly declared offset type", x);
3269 TREE_TYPE (x) = build_pointer_type (TREE_TYPE (x));
3273 if (DECL_NAME (x) == constructor_name (t))
3274 cant_have_default_ctor = 1;
3277 if (TREE_TYPE (x) == error_mark_node)
3280 DECL_SAVED_INSNS (x) = NULL_RTX;
3281 DECL_FIELD_SIZE (x) = 0;
3283 /* When this goes into scope, it will be a non-local reference. */
3284 DECL_NONLOCAL (x) = 1;
3286 if (TREE_CODE (x) == CONST_DECL)
3289 if (TREE_CODE (x) == VAR_DECL)
3291 if (TREE_CODE (t) == UNION_TYPE)
3292 /* Unions cannot have static members. */
3293 cp_error_at ("field `%D' declared static in union", x);
3298 /* Now it can only be a FIELD_DECL. */
3300 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
3303 /* If this is of reference type, check if it needs an init.
3304 Also do a little ANSI jig if necessary. */
3305 if (TREE_CODE (TREE_TYPE (x)) == REFERENCE_TYPE)
3307 if (DECL_INITIAL (x) == NULL_TREE)
3310 /* ARM $12.6.2: [A member initializer list] (or, for an
3311 aggregate, initialization by a brace-enclosed list) is the
3312 only way to initialize nonstatic const and reference
3314 cant_have_default_ctor = 1;
3315 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3317 if (! TYPE_HAS_CONSTRUCTOR (t) && extra_warnings)
3320 cp_warning_at ("non-static reference `%#D' in class without a constructor", x);
3322 cp_warning_at ("non-static reference in class without a constructor", x);
3326 if (TREE_CODE (TREE_TYPE (x)) == POINTER_TYPE)
3329 /* If any field is const, the structure type is pseudo-const. */
3330 if (TREE_READONLY (x))
3332 C_TYPE_FIELDS_READONLY (t) = 1;
3333 if (DECL_INITIAL (x) == NULL_TREE)
3334 const_sans_init = 1;
3336 /* ARM $12.6.2: [A member initializer list] (or, for an
3337 aggregate, initialization by a brace-enclosed list) is the
3338 only way to initialize nonstatic const and reference
3340 cant_have_default_ctor = 1;
3341 TYPE_HAS_COMPLEX_ASSIGN_REF (t) = 1;
3343 if (! TYPE_HAS_CONSTRUCTOR (t) && !IS_SIGNATURE (t)
3347 cp_warning_at ("non-static const member `%#D' in class without a constructor", x);
3349 cp_warning_at ("non-static const member in class without a constructor", x);
3354 /* A field that is pseudo-const makes the structure
3356 tree t1 = TREE_TYPE (x);
3357 while (TREE_CODE (t1) == ARRAY_TYPE)
3358 t1 = TREE_TYPE (t1);
3359 if (IS_AGGR_TYPE (t1))
3361 if (C_TYPE_FIELDS_READONLY (t1))
3362 C_TYPE_FIELDS_READONLY (t) = 1;
3363 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (t1))
3364 const_sans_init = 1;
3368 /* We set DECL_BIT_FIELD tentatively in grokbitfield.
3369 If the type and width are valid, we'll keep it set.
3370 Otherwise, the flag is cleared. */
3371 if (DECL_BIT_FIELD (x))
3373 DECL_BIT_FIELD (x) = 0;
3374 /* Invalid bit-field size done by grokfield. */
3375 /* Detect invalid bit-field type. */
3376 if (DECL_INITIAL (x)
3377 && ! INTEGRAL_TYPE_P (TREE_TYPE (x)))
3379 cp_error_at ("bit-field `%#D' with non-integral type", x);
3380 DECL_INITIAL (x) = NULL;
3383 /* Detect and ignore out of range field width. */
3384 if (DECL_INITIAL (x))
3386 tree w = DECL_INITIAL (x);
3387 register int width = 0;
3389 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3392 /* detect invalid field size. */
3393 if (TREE_CODE (w) == CONST_DECL)
3394 w = DECL_INITIAL (w);
3395 else if (TREE_READONLY_DECL_P (w))
3396 w = decl_constant_value (w);
3398 if (TREE_CODE (w) != INTEGER_CST)
3400 cp_error_at ("bit-field `%D' width not an integer constant",
3402 DECL_INITIAL (x) = NULL_TREE;
3404 else if (width = TREE_INT_CST_LOW (w),
3407 DECL_INITIAL (x) = NULL;
3408 cp_error_at ("negative width in bit-field `%D'", x);
3410 else if (width == 0 && DECL_NAME (x) != 0)
3412 DECL_INITIAL (x) = NULL;
3413 cp_error_at ("zero width for bit-field `%D'", x);
3416 > TYPE_PRECISION (long_long_unsigned_type_node))
3418 /* The backend will dump if you try to use something
3419 too big; avoid that. */
3420 DECL_INITIAL (x) = NULL;
3421 sorry ("bit-fields larger than %d bits",
3422 TYPE_PRECISION (long_long_unsigned_type_node));
3423 cp_error_at (" in declaration of `%D'", x);
3425 else if (width > TYPE_PRECISION (TREE_TYPE (x))
3426 && TREE_CODE (TREE_TYPE (x)) != ENUMERAL_TYPE
3427 && TREE_CODE (TREE_TYPE (x)) != BOOLEAN_TYPE)
3429 cp_warning_at ("width of `%D' exceeds its type", x);
3431 else if (TREE_CODE (TREE_TYPE (x)) == ENUMERAL_TYPE
3432 && ((min_precision (TYPE_MIN_VALUE (TREE_TYPE (x)),
3433 TREE_UNSIGNED (TREE_TYPE (x))) > width)
3434 || (min_precision (TYPE_MAX_VALUE (TREE_TYPE (x)),
3435 TREE_UNSIGNED (TREE_TYPE (x))) > width)))
3437 cp_warning_at ("`%D' is too small to hold all values of `%#T'",
3441 if (DECL_INITIAL (x) == NULL_TREE)
3443 else if (width == 0)
3445 #ifdef EMPTY_FIELD_BOUNDARY
3446 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), EMPTY_FIELD_BOUNDARY);
3448 #ifdef PCC_BITFIELD_TYPE_MATTERS
3449 DECL_ALIGN (x) = MAX (DECL_ALIGN (x),
3450 TYPE_ALIGN (TREE_TYPE (x)));
3455 DECL_INITIAL (x) = NULL_TREE;
3456 DECL_FIELD_SIZE (x) = width;
3457 DECL_BIT_FIELD (x) = 1;
3461 /* Non-bit-fields are aligned for their type. */
3462 DECL_ALIGN (x) = MAX (DECL_ALIGN (x), TYPE_ALIGN (TREE_TYPE (x)));
3466 tree type = TREE_TYPE (x);
3468 while (TREE_CODE (type) == ARRAY_TYPE)
3469 type = TREE_TYPE (type);
3471 if (TYPE_LANG_SPECIFIC (type) && ! ANON_UNION_P (x)
3472 && ! TYPE_PTRMEMFUNC_P (type))
3474 /* Never let anything with uninheritable virtuals
3475 make it through without complaint. */
3476 if (CLASSTYPE_ABSTRACT_VIRTUALS (type))
3477 abstract_virtuals_error (x, type);
3479 /* Don't let signatures make it through either. */
3480 if (IS_SIGNATURE (type))
3481 signature_error (x, type);
3483 if (code == UNION_TYPE)
3486 if (TYPE_NEEDS_CONSTRUCTING (type))
3487 fie = "constructor";
3488 else if (TYPE_NEEDS_DESTRUCTOR (type))
3490 else if (TYPE_HAS_REAL_ASSIGNMENT (type))
3491 fie = "assignment operator";
3493 cp_error_at ("member `%#D' with %s not allowed in union", x,
3498 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
3499 TYPE_NEEDS_DESTRUCTOR (t) |= TYPE_NEEDS_DESTRUCTOR (type);
3500 TYPE_HAS_COMPLEX_ASSIGN_REF (t) |= TYPE_HAS_COMPLEX_ASSIGN_REF (type);
3501 TYPE_HAS_COMPLEX_INIT_REF (t) |= TYPE_HAS_COMPLEX_INIT_REF (type);
3504 if (!TYPE_HAS_CONST_INIT_REF (type))
3505 cant_have_const_ctor = 1;
3507 if (!TYPE_HAS_CONST_ASSIGN_REF (type))
3508 no_const_asn_ref = 1;
3510 if (TYPE_HAS_CONSTRUCTOR (type)
3511 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
3513 cant_have_default_ctor = 1;
3515 /* This is wrong for aggregates. */
3516 if (! TYPE_HAS_CONSTRUCTOR (t))
3519 cp_pedwarn_at ("member `%#D' with only non-default constructor", x);
3521 cp_pedwarn_at ("member with only non-default constructor", x);
3522 cp_pedwarn_at ("in class without a constructor",
3528 if (DECL_INITIAL (x) != NULL_TREE)
3530 /* `build_class_init_list' does not recognize
3532 if (code == UNION_TYPE && any_default_members != 0)
3533 cp_error_at ("multiple fields in union `%T' initialized");
3534 any_default_members = 1;
3539 /* If this type has any constant members which did not come
3540 with their own initialization, mark that fact here. It is
3541 not an error here, since such types can be saved either by their
3542 constructors, or by fortuitous initialization. */
3543 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) = const_sans_init;
3544 CLASSTYPE_REF_FIELDS_NEED_INIT (t) = ref_sans_init;
3545 CLASSTYPE_ABSTRACT_VIRTUALS (t) = abstract_virtuals;
3547 /* Synthesize any needed methods. Note that methods will be synthesized
3548 for anonymous unions; grok_x_components undoes that. */
3551 nonprivate_method = 1;
3553 if (TYPE_NEEDS_DESTRUCTOR (t) && !TYPE_HAS_DESTRUCTOR (t)
3554 && !IS_SIGNATURE (t))
3556 /* Here we must cons up a destructor on the fly. */
3557 tree dtor = cons_up_default_function (t, name, 0);
3558 check_for_override (dtor, t);
3560 /* If we couldn't make it work, then pretend we didn't need it. */
3561 if (dtor == void_type_node)
3562 TYPE_NEEDS_DESTRUCTOR (t) = 0;
3565 /* Link dtor onto end of fn_fields. */
3567 TREE_CHAIN (dtor) = fn_fields;
3570 if (DECL_VINDEX (dtor))
3571 add_virtual_function (&pending_virtuals, &pending_hard_virtuals,
3572 &has_virtual, dtor, t);
3573 nonprivate_method = 1;
3577 /* Effective C++ rule 11. */
3578 if (has_pointers && warn_ecpp && TYPE_HAS_CONSTRUCTOR (t)
3579 && ! (TYPE_HAS_INIT_REF (t) && TYPE_HAS_ASSIGN_REF (t)))
3581 cp_warning ("`%#T' has pointer data members", t);
3583 if (! TYPE_HAS_INIT_REF (t))
3585 cp_warning (" but does not override `%T(const %T&)'", t, t);
3586 if (! TYPE_HAS_ASSIGN_REF (t))
3587 cp_warning (" or `operator=(const %T&)'", t);
3589 else if (! TYPE_HAS_ASSIGN_REF (t))
3590 cp_warning (" but does not override `operator=(const %T&)'", t);
3593 TYPE_NEEDS_DESTRUCTOR (t) |= TYPE_HAS_DESTRUCTOR (t);
3595 TYPE_HAS_COMPLEX_INIT_REF (t)
3596 |= (TYPE_HAS_INIT_REF (t) || TYPE_USES_VIRTUAL_BASECLASSES (t)
3597 || has_virtual || any_default_members);
3598 TYPE_NEEDS_CONSTRUCTING (t)
3599 |= (TYPE_HAS_CONSTRUCTOR (t) || TYPE_USES_VIRTUAL_BASECLASSES (t)
3600 || has_virtual || any_default_members);
3601 if (! IS_SIGNATURE (t))
3602 CLASSTYPE_NON_AGGREGATE (t)
3603 = ! aggregate || has_virtual || TYPE_HAS_CONSTRUCTOR (t);
3605 /* ARM $12.1: A default constructor will be generated for a class X
3606 only if no constructor has been declared for class X. So we
3607 check TYPE_HAS_CONSTRUCTOR also, to make sure we don't generate
3608 one if they declared a constructor in this class. */
3609 if (! TYPE_HAS_CONSTRUCTOR (t) && ! cant_have_default_ctor
3610 && ! IS_SIGNATURE (t))
3612 tree default_fn = cons_up_default_function (t, name, 2);
3613 TREE_CHAIN (default_fn) = fn_fields;
3614 fn_fields = default_fn;
3617 /* Create default copy constructor, if needed. */
3618 if (! TYPE_HAS_INIT_REF (t) && ! IS_SIGNATURE (t))
3620 /* ARM 12.18: You get either X(X&) or X(const X&), but
3622 tree default_fn = cons_up_default_function (t, name,
3623 3 + cant_have_const_ctor);
3624 TREE_CHAIN (default_fn) = fn_fields;
3625 fn_fields = default_fn;
3628 TYPE_HAS_REAL_ASSIGNMENT (t) |= TYPE_HAS_ASSIGNMENT (t);
3629 TYPE_HAS_REAL_ASSIGN_REF (t) |= TYPE_HAS_ASSIGN_REF (t);
3630 TYPE_HAS_COMPLEX_ASSIGN_REF (t)
3631 |= TYPE_HAS_ASSIGN_REF (t) || TYPE_USES_VIRTUAL_BASECLASSES (t);
3633 if (! TYPE_HAS_ASSIGN_REF (t) && ! IS_SIGNATURE (t))
3635 tree default_fn = cons_up_default_function (t, name,
3636 5 + no_const_asn_ref);
3637 TREE_CHAIN (default_fn) = fn_fields;
3638 fn_fields = default_fn;
3643 TYPE_METHODS (t) = fn_fields;
3644 method_vec = finish_struct_methods (t, fn_fields, nonprivate_method);
3646 if (TYPE_HAS_CONSTRUCTOR (t)
3647 && CLASSTYPE_FRIEND_CLASSES (t) == NULL_TREE
3648 && DECL_FRIENDLIST (TYPE_MAIN_DECL (t)) == NULL_TREE)
3650 int nonprivate_ctor = 0;
3653 for (ctor = TREE_VEC_ELT (method_vec, 0);
3655 ctor = OVL_NEXT (ctor))
3656 if (! TREE_PRIVATE (OVL_CURRENT (ctor)))
3658 nonprivate_ctor = 1;
3662 if (nonprivate_ctor == 0 && warn_ctor_dtor_privacy)
3663 cp_warning ("`%#T' only defines private constructors and has no friends",
3671 /* Just in case these got accidentally
3672 filled in by syntax errors. */
3673 TYPE_HAS_CONSTRUCTOR (t) = 0;
3674 TYPE_HAS_DESTRUCTOR (t) = 0;
3678 int n_methods = method_vec ? TREE_VEC_LENGTH (method_vec) : 0;
3680 for (access_decls = nreverse (access_decls); access_decls;
3681 access_decls = TREE_CHAIN (access_decls))
3683 tree fdecl = TREE_VALUE (access_decls);
3684 tree flist = NULL_TREE;
3686 tree access = TREE_PURPOSE (access_decls);
3690 /* Functions are represented as TREE_LIST, with the purpose
3691 being the type and the value the functions. Other members
3692 come as themselves. */
3693 if (TREE_CODE (fdecl) == TREE_LIST)
3695 /* Ignore base type this came from. */
3696 fdecl = TREE_VALUE (fdecl);
3698 if (TREE_CODE (fdecl) == OVERLOAD)
3700 /* We later iterate over all functions. */
3702 fdecl = OVL_FUNCTION (flist);
3705 name = DECL_NAME (fdecl);
3707 for (; i < n_methods; i++)
3708 if (DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec, i)))
3711 cp_error ("cannot adjust access to `%#D' in `%#T'", fdecl, t);
3712 cp_error_at (" because of local method `%#D' with same name",
3713 TREE_VEC_ELT (method_vec, i));
3721 for (tmp = fields; tmp; tmp = TREE_CHAIN (tmp))
3722 if (DECL_NAME (tmp) == name)
3724 cp_error ("cannot adjust access to `%#D' in `%#T'", fdecl, t);
3725 cp_error_at (" because of local field `%#D' with same name", tmp);
3733 /* Make type T see field decl FDECL with access ACCESS.*/
3738 if (alter_access (t, OVL_FUNCTION (flist), access) == 0)
3740 flist = OVL_CHAIN (flist);
3744 alter_access (t, fdecl, access);
3749 if (vfield == NULL_TREE && has_virtual)
3751 /* We build this decl with ptr_type_node, and
3752 change the type when we know what it should be. */
3753 vfield = build_lang_field_decl (FIELD_DECL, get_vfield_name (t),
3755 /* If you change any of the below, take a look at all the
3756 other VFIELD_BASEs and VTABLE_BASEs in the code, and change
3758 DECL_ASSEMBLER_NAME (vfield) = get_identifier (VFIELD_BASE);
3759 CLASSTYPE_VFIELD (t) = vfield;
3760 DECL_VIRTUAL_P (vfield) = 1;
3761 DECL_ARTIFICIAL (vfield) = 1;
3762 DECL_FIELD_CONTEXT (vfield) = t;
3763 DECL_CLASS_CONTEXT (vfield) = t;
3764 DECL_FCONTEXT (vfield) = t;
3765 DECL_SAVED_INSNS (vfield) = NULL_RTX;
3766 DECL_FIELD_SIZE (vfield) = 0;
3767 DECL_ALIGN (vfield) = TYPE_ALIGN (ptr_type_node);
3769 /* This is more efficient, but breaks binary compatibility, turn
3770 it on sometime when we don't care. If we turn it on, we also
3771 have to enable the code in dfs_init_vbase_pointers. */
3772 /* vfield is always first entry in structure. */
3773 TREE_CHAIN (vfield) = fields;
3778 my_friendly_assert (TREE_CHAIN (last_x) == NULL_TREE, 175);
3779 TREE_CHAIN (last_x) = vfield;
3786 vfields = chainon (vfields, CLASSTYPE_AS_LIST (t));
3789 /* Now DECL_INITIAL is null on all members except for zero-width bit-fields.
3790 And they have already done their work.
3792 C++: maybe we will support default field initialization some day... */
3794 /* Delete all zero-width bit-fields from the front of the fieldlist */
3795 while (fields && DECL_BIT_FIELD (fields)
3796 && DECL_INITIAL (fields))
3797 fields = TREE_CHAIN (fields);
3798 /* Delete all such fields from the rest of the fields. */
3799 for (x = fields; x;)
3801 if (TREE_CHAIN (x) && DECL_BIT_FIELD (TREE_CHAIN (x))
3802 && DECL_INITIAL (TREE_CHAIN (x)))
3803 TREE_CHAIN (x) = TREE_CHAIN (TREE_CHAIN (x));
3807 /* Delete all duplicate fields from the fields */
3808 delete_duplicate_fields (fields);
3810 /* Catch function/field name conflict. We don't need to do this for a
3811 signature, since it can only contain the fields constructed in
3812 append_signature_fields. */
3813 if (! IS_SIGNATURE (t))
3815 int n_methods = method_vec ? TREE_VEC_LENGTH (method_vec) : 0;
3816 for (x = fields; x; x = TREE_CHAIN (x))
3818 tree name = DECL_NAME (x);
3821 if (TREE_CODE (x) == TYPE_DECL && DECL_ARTIFICIAL (x))
3824 for (; i < n_methods; ++i)
3825 if (DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (method_vec, i)))
3828 cp_error_at ("data member `%#D' conflicts with", x);
3829 cp_error_at ("function member `%#D'",
3830 TREE_VEC_ELT (method_vec, i));
3836 /* Now we have the final fieldlist for the data fields. Record it,
3837 then lay out the structure or union (including the fields). */
3839 TYPE_FIELDS (t) = fields;
3843 last_x = build_base_fields (t);
3845 /* If all our bases are empty, we can be empty too. */
3846 for (x = last_x; empty && x; x = TREE_CHAIN (x))
3847 if (DECL_SIZE (x) != integer_zero_node)
3852 /* C++: do not let empty structures exist. */
3853 tree decl = build_lang_field_decl
3854 (FIELD_DECL, NULL_TREE, char_type_node);
3855 TREE_CHAIN (decl) = fields;
3856 TYPE_FIELDS (t) = decl;
3859 TYPE_FIELDS (t) = chainon (last_x, TYPE_FIELDS (t));
3863 /* Remember the size and alignment of the class before adding
3864 the virtual bases. */
3865 if (empty && flag_new_abi)
3866 CLASSTYPE_SIZE (t) = integer_zero_node;
3868 CLASSTYPE_SIZE (t) = TYPE_SIZE (t);
3869 CLASSTYPE_ALIGN (t) = TYPE_ALIGN (t);
3871 finish_struct_anon (t);
3873 /* Set the TYPE_DECL for this type to contain the right
3874 value for DECL_OFFSET, so that we can use it as part
3875 of a COMPONENT_REF for multiple inheritance. */
3877 layout_decl (TYPE_MAIN_DECL (t), 0);
3879 /* Now fix up any virtual base class types that we left lying
3880 around. We must get these done before we try to lay out the
3881 virtual function table. */
3882 pending_hard_virtuals = nreverse (pending_hard_virtuals);
3885 /* layout_basetypes will remove the base subobject fields. */
3886 max_has_virtual = layout_basetypes (t, max_has_virtual);
3888 TYPE_FIELDS (t) = fields;
3890 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
3894 vbases = CLASSTYPE_VBASECLASSES (t);
3895 CLASSTYPE_N_VBASECLASSES (t) = list_length (vbases);
3898 /* Now fixup overrides of all functions in vtables from all
3899 direct or indirect virtual base classes. */
3900 tree binfos = BINFO_BASETYPES (TYPE_BINFO (t));
3901 int i, n_baseclasses = binfos ? TREE_VEC_LENGTH (binfos) : 0;
3903 for (i = 0; i < n_baseclasses; i++)
3905 tree base_binfo = TREE_VEC_ELT (binfos, i);
3906 tree basetype = BINFO_TYPE (base_binfo);
3909 vbases = CLASSTYPE_VBASECLASSES (basetype);
3912 merge_overrides (binfo_member (BINFO_TYPE (vbases),
3913 CLASSTYPE_VBASECLASSES (t)),
3915 vbases = TREE_CHAIN (vbases);
3921 /* Set up the DECL_FIELD_BITPOS of the vfield if we need to, as we
3922 might need to know it for setting up the offsets in the vtable
3923 (or in thunks) below. */
3924 if (vfield != NULL_TREE
3925 && DECL_FIELD_CONTEXT (vfield) != t)
3927 tree binfo = get_binfo (DECL_FIELD_CONTEXT (vfield), t, 0);
3928 tree offset = BINFO_OFFSET (binfo);
3930 vfield = copy_node (vfield);
3931 copy_lang_decl (vfield);
3933 if (! integer_zerop (offset))
3934 offset = size_binop (MULT_EXPR, offset, size_int (BITS_PER_UNIT));
3935 DECL_FIELD_CONTEXT (vfield) = t;
3936 DECL_CLASS_CONTEXT (vfield) = t;
3937 DECL_FIELD_BITPOS (vfield)
3938 = size_binop (PLUS_EXPR, offset, DECL_FIELD_BITPOS (vfield));
3939 CLASSTYPE_VFIELD (t) = vfield;
3943 cp_warning ("Doing hard virtuals for %T...", t);
3946 if (has_virtual > max_has_virtual)
3947 max_has_virtual = has_virtual;
3948 if (max_has_virtual > 0)
3949 TYPE_VIRTUAL_P (t) = 1;
3951 if (flag_rtti && TYPE_VIRTUAL_P (t) && !pending_hard_virtuals)
3952 modify_all_vtables (t, NULL_TREE, NULL_TREE);
3954 while (pending_hard_virtuals)
3956 modify_all_vtables (t,
3957 TREE_PURPOSE (pending_hard_virtuals),
3958 TREE_VALUE (pending_hard_virtuals));
3959 pending_hard_virtuals = TREE_CHAIN (pending_hard_virtuals);
3962 if (TYPE_USES_VIRTUAL_BASECLASSES (t))
3965 /* Now fixup any virtual function entries from virtual bases
3966 that have different deltas. This has to come after we do the
3967 pending hard virtuals, as we might have a function that comes
3968 from multiple virtual base instances that is only overridden
3969 by a hard virtual above. */
3970 vbases = CLASSTYPE_VBASECLASSES (t);
3973 /* We might be able to shorten the amount of work we do by
3974 only doing this for vtables that come from virtual bases
3975 that have differing offsets, but don't want to miss any
3977 fixup_vtable_deltas (vbases, 1, t);
3978 vbases = TREE_CHAIN (vbases);
3982 /* Under our model of GC, every C++ class gets its own virtual
3983 function table, at least virtually. */
3984 if (pending_virtuals)
3986 pending_virtuals = nreverse (pending_virtuals);
3987 /* We must enter these virtuals into the table. */
3988 if (first_vfn_base_index < 0)
3990 /* The second slot is for the tdesc pointer when thunks are used. */
3991 if (flag_vtable_thunks)
3992 pending_virtuals = tree_cons (NULL_TREE, NULL_TREE, pending_virtuals);
3994 /* The first slot is for the rtti offset. */
3995 pending_virtuals = tree_cons (NULL_TREE, NULL_TREE, pending_virtuals);
3997 set_rtti_entry (pending_virtuals, size_zero_node, t);
3998 build_vtable (NULL_TREE, t);
4002 /* Here we know enough to change the type of our virtual
4003 function table, but we will wait until later this function. */
4005 if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
4006 build_vtable (TREE_VEC_ELT (TYPE_BINFO_BASETYPES (t), first_vfn_base_index), t);
4009 /* If this type has basetypes with constructors, then those
4010 constructors might clobber the virtual function table. But
4011 they don't if the derived class shares the exact vtable of the base
4014 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t) = 1;
4016 else if (first_vfn_base_index >= 0)
4018 tree binfo = TREE_VEC_ELT (TYPE_BINFO_BASETYPES (t), first_vfn_base_index);
4019 /* This class contributes nothing new to the virtual function
4020 table. However, it may have declared functions which
4021 went into the virtual function table "inherited" from the
4022 base class. If so, we grab a copy of those updated functions,
4023 and pretend they are ours. */
4025 /* See if we should steal the virtual info from base class. */
4026 if (TYPE_BINFO_VTABLE (t) == NULL_TREE)
4027 TYPE_BINFO_VTABLE (t) = BINFO_VTABLE (binfo);
4028 if (TYPE_BINFO_VIRTUALS (t) == NULL_TREE)
4029 TYPE_BINFO_VIRTUALS (t) = BINFO_VIRTUALS (binfo);
4030 if (TYPE_BINFO_VTABLE (t) != BINFO_VTABLE (binfo))
4031 CLASSTYPE_NEEDS_VIRTUAL_REINIT (t) = 1;
4034 if (max_has_virtual || first_vfn_base_index >= 0)
4036 CLASSTYPE_VSIZE (t) = has_virtual;
4037 if (first_vfn_base_index >= 0)
4039 if (pending_virtuals)
4040 TYPE_BINFO_VIRTUALS (t) = chainon (TYPE_BINFO_VIRTUALS (t),
4043 else if (has_virtual)
4045 TYPE_BINFO_VIRTUALS (t) = pending_virtuals;
4046 if (write_virtuals >= 0)
4047 DECL_VIRTUAL_P (TYPE_BINFO_VTABLE (t)) = 1;
4051 /* Now lay out the virtual function table. */
4056 if (TREE_TYPE (vfield) == ptr_type_node)
4058 /* We must create a pointer to this table because
4059 the one inherited from base class does not exist.
4060 We will fill in the type when we know what it
4061 should really be. Use `size_int' so values are memoized
4063 itype = build_index_type (size_int (has_virtual));
4064 atype = build_array_type (vtable_entry_type, itype);
4065 layout_type (atype);
4066 TREE_TYPE (vfield) = build_pointer_type (atype);
4070 atype = TREE_TYPE (TREE_TYPE (vfield));
4072 if (has_virtual != TREE_INT_CST_LOW (TYPE_MAX_VALUE (TYPE_DOMAIN (atype))))
4074 /* We must extend (or create) the boundaries on this array,
4075 because we picked up virtual functions from multiple
4077 itype = build_index_type (size_int (has_virtual));
4078 atype = build_array_type (vtable_entry_type, itype);
4079 layout_type (atype);
4080 vfield = copy_node (vfield);
4081 TREE_TYPE (vfield) = build_pointer_type (atype);
4085 CLASSTYPE_VFIELD (t) = vfield;
4086 if (TREE_TYPE (TYPE_BINFO_VTABLE (t)) != atype)
4088 TREE_TYPE (TYPE_BINFO_VTABLE (t)) = atype;
4089 DECL_SIZE (TYPE_BINFO_VTABLE (t)) = 0;
4090 layout_decl (TYPE_BINFO_VTABLE (t), 0);
4091 /* At one time the vtable info was grabbed 2 words at a time. This
4092 fails on sparc unless you have 8-byte alignment. (tiemann) */
4093 DECL_ALIGN (TYPE_BINFO_VTABLE (t))
4094 = MAX (TYPE_ALIGN (double_type_node),
4095 DECL_ALIGN (TYPE_BINFO_VTABLE (t)));
4098 else if (first_vfn_base_index >= 0)
4099 CLASSTYPE_VFIELD (t) = vfield;
4100 CLASSTYPE_VFIELDS (t) = vfields;
4102 finish_struct_bits (t, max_has_virtual);
4104 /* Complete the rtl for any static member objects of the type we're
4106 for (x = fields; x; x = TREE_CHAIN (x))
4108 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
4109 && TREE_TYPE (x) == t)
4111 DECL_MODE (x) = TYPE_MODE (t);
4112 make_decl_rtl (x, NULL, 0);
4116 if (TYPE_HAS_CONSTRUCTOR (t))
4118 tree vfields = CLASSTYPE_VFIELDS (t);
4122 /* Mark the fact that constructor for T
4123 could affect anybody inheriting from T
4124 who wants to initialize vtables for VFIELDS's type. */
4125 if (VF_DERIVED_VALUE (vfields))
4126 TREE_ADDRESSABLE (vfields) = 1;
4127 vfields = TREE_CHAIN (vfields);
4129 if (any_default_members != 0)
4130 build_class_init_list (t);
4132 else if (TYPE_NEEDS_CONSTRUCTING (t))
4133 build_class_init_list (t);
4135 /* Write out inline function definitions. */
4136 do_inline_function_hair (t, CLASSTYPE_INLINE_FRIENDS (t));
4137 CLASSTYPE_INLINE_FRIENDS (t) = 0;
4139 if (CLASSTYPE_VSIZE (t) != 0)
4142 /* This is now done above. */
4143 if (DECL_FIELD_CONTEXT (vfield) != t)
4145 tree binfo = get_binfo (DECL_FIELD_CONTEXT (vfield), t, 0);
4146 tree offset = BINFO_OFFSET (binfo);
4148 vfield = copy_node (vfield);
4149 copy_lang_decl (vfield);
4151 if (! integer_zerop (offset))
4152 offset = size_binop (MULT_EXPR, offset, size_int (BITS_PER_UNIT));
4153 DECL_FIELD_CONTEXT (vfield) = t;
4154 DECL_CLASS_CONTEXT (vfield) = t;
4155 DECL_FIELD_BITPOS (vfield)
4156 = size_binop (PLUS_EXPR, offset, DECL_FIELD_BITPOS (vfield));
4157 CLASSTYPE_VFIELD (t) = vfield;
4161 /* In addition to this one, all the other vfields should be listed. */
4162 /* Before that can be done, we have to have FIELD_DECLs for them, and
4163 a place to find them. */
4164 TYPE_NONCOPIED_PARTS (t) = build_tree_list (default_conversion (TYPE_BINFO_VTABLE (t)), vfield);
4166 if (warn_nonvdtor && TYPE_HAS_DESTRUCTOR (t)
4167 && DECL_VINDEX (TREE_VEC_ELT (method_vec, 1)) == NULL_TREE)
4168 cp_warning ("`%#T' has virtual functions but non-virtual destructor",
4172 /* Make the rtl for any new vtables we have created, and unmark
4173 the base types we marked. */
4174 finish_vtbls (TYPE_BINFO (t), 1, t);
4175 hack_incomplete_structures (t);
4178 if (TYPE_NAME (t) && TYPE_IDENTIFIER (t))
4179 undo_template_name_overload (TYPE_IDENTIFIER (t), 1);
4182 resume_momentary (old);
4184 if (warn_overloaded_virtual)
4188 /* This has to be done after we have sorted out what to do with
4189 the enclosing type. */
4190 if (write_symbols != DWARF_DEBUG)
4192 /* Be smarter about nested classes here. If a type is nested,
4193 only output it if we would output the enclosing type. */
4194 if (DECL_CONTEXT (TYPE_MAIN_DECL (t))
4195 && TREE_CODE_CLASS (TREE_CODE (DECL_CONTEXT (TYPE_MAIN_DECL (t)))) == 't')
4196 DECL_IGNORED_P (TYPE_MAIN_DECL (t)) = TREE_ASM_WRITTEN (TYPE_MAIN_DECL (t));
4200 if (write_symbols != DWARF_DEBUG && write_symbols != DWARF2_DEBUG)
4202 /* If the type has methods, we want to think about cutting down
4203 the amount of symbol table stuff we output. The value stored in
4204 the TYPE_DECL's DECL_IGNORED_P slot is a first approximation.
4205 For example, if a member function is seen and we decide to
4206 write out that member function, then we can change the value
4207 of the DECL_IGNORED_P slot, and the type will be output when
4208 that member function's debug info is written out.
4210 We can't do this with DWARF, which does not support name
4211 references between translation units. */
4212 if (CLASSTYPE_METHOD_VEC (t))
4214 extern tree pending_vtables;
4216 /* Don't output full info about any type
4217 which does not have its implementation defined here. */
4218 if (TYPE_VIRTUAL_P (t) && write_virtuals == 2)
4219 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t))
4220 = (value_member (TYPE_IDENTIFIER (t), pending_vtables) == 0);
4221 else if (CLASSTYPE_INTERFACE_ONLY (t))
4222 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
4224 /* XXX do something about this. */
4225 else if (CLASSTYPE_INTERFACE_UNKNOWN (t))
4226 /* Only a first approximation! */
4227 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
4230 else if (CLASSTYPE_INTERFACE_ONLY (t))
4231 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
4234 /* Finish debugging output for this type. */
4235 rest_of_type_compilation (t, toplevel_bindings_p ());
4241 finish_struct (t, list_of_fieldlists, attributes, warn_anon)
4242 tree t, list_of_fieldlists, attributes;
4245 tree fields = NULL_TREE;
4246 tree *tail = &TYPE_METHODS (t);
4247 tree specializations = NULL_TREE;
4248 tree *specialization_tail = &specializations;
4249 tree name = TYPE_NAME (t);
4250 tree x, last_x = NULL_TREE;
4252 tree dummy = NULL_TREE;
4253 tree next_x = NULL_TREE;
4255 if (TREE_CODE (name) == TYPE_DECL)
4259 DECL_SOURCE_FILE (name) = input_filename;
4260 /* For TYPE_DECL that are not typedefs (those marked with a line
4261 number of zero, we don't want to mark them as real typedefs.
4262 If this fails one needs to make sure real typedefs have a
4263 previous line number, even if it is wrong, that way the below
4264 will fill in the right line number. (mrs) */
4265 if (DECL_SOURCE_LINE (name))
4266 DECL_SOURCE_LINE (name) = lineno;
4267 CLASSTYPE_SOURCE_LINE (t) = lineno;
4268 name = DECL_NAME (name);
4271 /* Append the fields we need for constructing signature tables. */
4272 if (IS_SIGNATURE (t))
4273 append_signature_fields (list_of_fieldlists);
4275 /* Move our self-reference declaration to the end of the field list so
4276 any real field with the same name takes precedence. */
4277 if (list_of_fieldlists
4278 && TREE_VALUE (list_of_fieldlists)
4279 && DECL_ARTIFICIAL (TREE_VALUE (list_of_fieldlists)))
4281 dummy = TREE_VALUE (list_of_fieldlists);
4282 list_of_fieldlists = TREE_CHAIN (list_of_fieldlists);
4285 if (last_x && list_of_fieldlists)
4286 TREE_CHAIN (last_x) = TREE_VALUE (list_of_fieldlists);
4288 while (list_of_fieldlists)
4290 access = TREE_PURPOSE (list_of_fieldlists);
4292 /* For signatures, we made all methods `public' in the parser and
4293 reported an error if a access specifier was used. */
4294 if (access == access_default_node)
4296 if (CLASSTYPE_DECLARED_CLASS (t) == 0)
4297 access = access_public_node;
4299 access = access_private_node;
4302 for (x = TREE_VALUE (list_of_fieldlists); x; x = next_x)
4304 next_x = TREE_CHAIN (x);
4306 TREE_PRIVATE (x) = access == access_private_node;
4307 TREE_PROTECTED (x) = access == access_protected_node;
4309 if (TREE_CODE (x) == TEMPLATE_DECL)
4311 TREE_PRIVATE (DECL_RESULT (x)) = TREE_PRIVATE (x);
4312 TREE_PROTECTED (DECL_RESULT (x)) = TREE_PROTECTED (x);
4315 /* Check for inconsistent use of this name in the class body.
4316 Enums, types and static vars have already been checked. */
4317 if (TREE_CODE (x) != TYPE_DECL && TREE_CODE (x) != USING_DECL
4318 && ! (TREE_CODE (x) == TEMPLATE_DECL
4319 && TREE_CODE (DECL_RESULT (x)) == TYPE_DECL)
4320 && TREE_CODE (x) != CONST_DECL && TREE_CODE (x) != VAR_DECL)
4322 tree name = DECL_NAME (x);
4325 /* Don't get confused by access decls. */
4326 if (name && TREE_CODE (name) == IDENTIFIER_NODE)
4327 icv = IDENTIFIER_CLASS_VALUE (name);
4332 /* Don't complain about constructors. */
4333 && name != constructor_name (current_class_type)
4334 /* Or inherited names. */
4335 && id_in_current_class (name)
4336 /* Or shadowed tags. */
4337 && !(TREE_CODE (icv) == TYPE_DECL
4338 && DECL_CONTEXT (icv) == t))
4340 cp_error_at ("declaration of identifier `%D' as `%+#D'",
4342 cp_error_at ("conflicts with other use in class as `%#D'",
4347 if (TREE_CODE (x) == FUNCTION_DECL
4348 || DECL_FUNCTION_TEMPLATE_P (x))
4350 DECL_CLASS_CONTEXT (x) = t;
4353 TREE_CHAIN (last_x) = next_x;
4355 if (DECL_TEMPLATE_SPECIALIZATION (x))
4356 /* We don't enter the specialization into the class
4357 method vector since specializations don't affect
4358 overloading. Instead we keep track of the
4359 specializations, and process them after the method
4360 vector is complete. */
4362 *specialization_tail = x;
4363 specialization_tail = &TREE_CHAIN (x);
4364 TREE_CHAIN (x) = NULL_TREE;
4368 /* Link x onto end of TYPE_METHODS. */
4370 tail = &TREE_CHAIN (x);
4374 if (TREE_CODE (x) != TYPE_DECL)
4375 DECL_FIELD_CONTEXT (x) = t;
4381 list_of_fieldlists = TREE_CHAIN (list_of_fieldlists);
4382 /* link the tail while we have it! */
4385 TREE_CHAIN (last_x) = NULL_TREE;
4387 if (list_of_fieldlists
4388 && TREE_VALUE (list_of_fieldlists)
4389 && TREE_CODE (TREE_VALUE (list_of_fieldlists)) != FUNCTION_DECL)
4390 TREE_CHAIN (last_x) = TREE_VALUE (list_of_fieldlists);
4394 /* Now add the tags, if any, to the list of TYPE_DECLs
4395 defined for this type. */
4396 if (CLASSTYPE_TAGS (t) || dummy)
4398 /* The list of tags was built up in pushtag in reverse order; we need
4399 to fix that so that enumerators will be processed in forward order
4400 in template instantiation. */
4401 CLASSTYPE_TAGS (t) = x = nreverse (CLASSTYPE_TAGS (t));
4404 tree tag = TYPE_MAIN_DECL (TREE_VALUE (x));
4406 TREE_NONLOCAL_FLAG (TREE_VALUE (x)) = 0;
4408 last_x = chainon (last_x, tag);
4411 last_x = chainon (last_x, dummy);
4412 if (fields == NULL_TREE)
4414 CLASSTYPE_LOCAL_TYPEDECLS (t) = 1;
4418 TYPE_FIELDS (t) = fields;
4420 cplus_decl_attributes (t, attributes, NULL_TREE);
4422 if (processing_template_decl)
4424 tree d = getdecls ();
4425 for (; d; d = TREE_CHAIN (d))
4427 /* If this is the decl for the class or one of the template
4428 parms, we've seen all the injected decls. */
4429 if ((TREE_CODE (d) == TYPE_DECL
4430 && (TREE_TYPE (d) == t
4431 || TREE_CODE (TREE_TYPE (d)) == TEMPLATE_TYPE_PARM
4432 || TREE_CODE (TREE_TYPE (d)) == TEMPLATE_TEMPLATE_PARM))
4433 || TREE_CODE (d) == CONST_DECL)
4435 /* Don't inject cache decls. */
4436 else if (IDENTIFIER_TEMPLATE (DECL_NAME (d)))
4438 DECL_TEMPLATE_INJECT (CLASSTYPE_TI_TEMPLATE (t))
4439 = tree_cons (NULL_TREE, d,
4440 DECL_TEMPLATE_INJECT (CLASSTYPE_TI_TEMPLATE (t)));
4442 CLASSTYPE_METHOD_VEC (t)
4443 = finish_struct_methods (t, TYPE_METHODS (t), 1);
4444 TYPE_SIZE (t) = integer_zero_node;
4447 t = finish_struct_1 (t, warn_anon);
4449 TYPE_BEING_DEFINED (t) = 0;
4451 /* Now, figure out which member templates we're specializing. */
4452 for (x = specializations; x != NULL_TREE; x = TREE_CHAIN (x))
4456 int pending_specialization;
4458 if (uses_template_parms (t))
4459 /* If t is a template class, and x is a specialization, then x
4460 is itself really a template. Due to the vagaries of the
4461 parser, however, we will have a handle to a function
4462 declaration, rather than the template declaration, at this
4465 my_friendly_assert (DECL_TEMPLATE_INFO (x) != NULL_TREE, 0);
4466 my_friendly_assert (DECL_TI_TEMPLATE (x) != NULL_TREE, 0);
4467 fn = DECL_TI_TEMPLATE (x);
4472 /* We want the specialization arguments, which will be the
4474 if (DECL_TI_ARGS (fn) && TREE_CODE (DECL_TI_ARGS (fn)) == TREE_VEC)
4476 = TREE_VEC_ELT (DECL_TI_ARGS (fn), 0);
4478 spec_args = DECL_TI_ARGS (fn);
4480 pending_specialization
4481 = TI_PENDING_SPECIALIZATION_FLAG (DECL_TEMPLATE_INFO (fn));
4482 check_explicit_specialization
4483 (lookup_template_function (DECL_NAME (fn), spec_args),
4484 fn, 0, 1 | (8 * pending_specialization));
4485 TI_PENDING_SPECIALIZATION_FLAG (DECL_TEMPLATE_INFO (fn)) = 0;
4487 /* Now, the assembler name will be correct for fn, so we
4490 make_decl_rtl (fn, NULL_PTR, 1);
4495 make_decl_rtl (x, NULL_PTR, 1);
4499 if (current_class_type)
4502 error ("trying to finish struct, but kicked out due to previous parse errors.");
4507 /* Return non-zero if the effective type of INSTANCE is static.
4508 Used to determine whether the virtual function table is needed
4511 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
4512 of our knowledge of its type. */
4515 resolves_to_fixed_type_p (instance, nonnull)
4519 switch (TREE_CODE (instance))
4522 /* Check that we are not going through a cast of some sort. */
4523 if (TREE_TYPE (instance)
4524 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (instance, 0))))
4525 instance = TREE_OPERAND (instance, 0);
4526 /* fall through... */
4528 /* This is a call to a constructor, hence it's never zero. */
4529 if (TREE_HAS_CONSTRUCTOR (instance))
4538 /* This is a call to a constructor, hence it's never zero. */
4539 if (TREE_HAS_CONSTRUCTOR (instance))
4545 return resolves_to_fixed_type_p (TREE_OPERAND (instance, 0), nonnull);
4552 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
4553 /* Propagate nonnull. */
4554 resolves_to_fixed_type_p (TREE_OPERAND (instance, 0), nonnull);
4555 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
4556 return resolves_to_fixed_type_p (TREE_OPERAND (instance, 0), nonnull);
4561 return resolves_to_fixed_type_p (TREE_OPERAND (instance, 0), nonnull);
4566 return resolves_to_fixed_type_p (TREE_OPERAND (instance, 0), nonnull);
4569 return resolves_to_fixed_type_p (TREE_OPERAND (instance, 1), nonnull);
4573 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
4574 && IS_AGGR_TYPE (TREE_TYPE (TREE_TYPE (instance))))
4580 /* fall through... */
4583 if (IS_AGGR_TYPE (TREE_TYPE (instance)))
4591 if (instance == current_class_ptr
4592 && flag_this_is_variable <= 0)
4594 /* Some people still use `this = 0' inside destructors. */
4595 *nonnull = ! DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (current_function_decl));
4596 /* In a constructor, we know our type. */
4597 if (flag_this_is_variable < 0)
4600 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
4601 /* Reference variables should be references to objects. */
4612 init_class_processing ()
4614 current_class_depth = 0;
4615 current_class_stacksize = 10;
4616 current_class_base = (tree *)xmalloc(current_class_stacksize * sizeof (tree));
4617 current_class_stack = current_class_base;
4619 current_lang_stacksize = 10;
4620 current_lang_base = (tree *)xmalloc(current_lang_stacksize * sizeof (tree));
4621 current_lang_stack = current_lang_base;
4623 access_default_node = build_int_2 (0, 0);
4624 access_public_node = build_int_2 (1, 0);
4625 access_protected_node = build_int_2 (2, 0);
4626 access_private_node = build_int_2 (3, 0);
4627 access_default_virtual_node = build_int_2 (4, 0);
4628 access_public_virtual_node = build_int_2 (5, 0);
4629 access_protected_virtual_node = build_int_2 (6, 0);
4630 access_private_virtual_node = build_int_2 (7, 0);
4632 /* Keep these values lying around. */
4633 base_layout_decl = build_lang_field_decl (FIELD_DECL, NULL_TREE, error_mark_node);
4634 TREE_TYPE (base_layout_decl) = make_node (RECORD_TYPE);
4636 gcc_obstack_init (&class_obstack);
4639 /* Set current scope to NAME. CODE tells us if this is a
4640 STRUCT, UNION, or ENUM environment.
4642 NAME may end up being NULL_TREE if this is an anonymous or
4643 late-bound struct (as in "struct { ... } foo;") */
4645 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE to
4646 appropriate values, found by looking up the type definition of
4649 If MODIFY is 1, we set IDENTIFIER_CLASS_VALUE's of names
4650 which can be seen locally to the class. They are shadowed by
4651 any subsequent local declaration (including parameter names).
4653 If MODIFY is 2, we set IDENTIFIER_CLASS_VALUE's of names
4654 which have static meaning (i.e., static members, static
4655 member functions, enum declarations, etc).
4657 If MODIFY is 3, we set IDENTIFIER_CLASS_VALUE of names
4658 which can be seen locally to the class (as in 1), but
4659 know that we are doing this for declaration purposes
4660 (i.e. friend foo::bar (int)).
4662 So that we may avoid calls to lookup_name, we cache the _TYPE
4663 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
4665 For multiple inheritance, we perform a two-pass depth-first search
4666 of the type lattice. The first pass performs a pre-order search,
4667 marking types after the type has had its fields installed in
4668 the appropriate IDENTIFIER_CLASS_VALUE slot. The second pass merely
4669 unmarks the marked types. If a field or member function name
4670 appears in an ambiguous way, the IDENTIFIER_CLASS_VALUE of
4671 that name becomes `error_mark_node'. */
4674 pushclass (type, modify)
4678 push_memoized_context (type, modify);
4680 current_class_depth++;
4681 *current_class_stack++ = current_class_name;
4682 *current_class_stack++ = current_class_type;
4683 if (current_class_stack >= current_class_base + current_class_stacksize)
4686 = (tree *)xrealloc (current_class_base,
4687 sizeof (tree) * (current_class_stacksize + 10));
4688 current_class_stack = current_class_base + current_class_stacksize;
4689 current_class_stacksize += 10;
4692 current_class_name = TYPE_NAME (type);
4693 if (TREE_CODE (current_class_name) == TYPE_DECL)
4694 current_class_name = DECL_NAME (current_class_name);
4695 current_class_type = type;
4697 if (previous_class_type != NULL_TREE
4698 && (type != previous_class_type || TYPE_SIZE (previous_class_type) == NULL_TREE)
4699 && current_class_depth == 1)
4701 /* Forcibly remove any old class remnants. */
4703 previous_class_type = NULL_TREE;
4709 if (CLASSTYPE_TEMPLATE_INFO (type))
4710 overload_template_name (type);
4716 tree this_fndecl = current_function_decl;
4718 if (current_function_decl
4719 && DECL_CONTEXT (current_function_decl)
4720 && TREE_CODE (DECL_CONTEXT (current_function_decl)) == FUNCTION_DECL)
4721 current_function_decl = DECL_CONTEXT (current_function_decl);
4723 current_function_decl = NULL_TREE;
4725 if (type != previous_class_type || current_class_depth > 1)
4728 build_mi_matrix (type);
4729 push_class_decls (type);
4732 push_class_decls (type);
4739 /* Hooray, we successfully cached; let's just install the
4740 cached class_shadowed list, and walk through it to get the
4741 IDENTIFIER_TYPE_VALUEs correct. */
4742 set_class_shadows (previous_class_values);
4743 for (item = previous_class_values; item; item = TREE_CHAIN (item))
4745 tree id = TREE_PURPOSE (item);
4746 tree decl = IDENTIFIER_CLASS_VALUE (id);
4748 if (TREE_CODE (decl) == TYPE_DECL)
4749 set_identifier_type_value (id, TREE_TYPE (decl));
4751 unuse_fields (type);
4754 for (tags = CLASSTYPE_TAGS (type); tags; tags = TREE_CHAIN (tags))
4756 TREE_NONLOCAL_FLAG (TREE_VALUE (tags)) = 1;
4757 if (! TREE_PURPOSE (tags))
4759 pushtag (TREE_PURPOSE (tags), TREE_VALUE (tags), 0);
4762 current_function_decl = this_fndecl;
4766 /* Get out of the current class scope. If we were in a class scope
4767 previously, that is the one popped to. The flag MODIFY tells whether
4768 the current scope declarations needs to be modified as a result of
4769 popping to the previous scope. 0 is used for class definitions. */
4777 /* Back this old class out completely. */
4778 tree tags = CLASSTYPE_TAGS (previous_class_type);
4781 /* This code can be seen as a cache miss. When we've cached a
4782 class' scope's bindings and we can't use them, we need to reset
4783 them. This is it! */
4784 for (t = previous_class_values; t; t = TREE_CHAIN (t))
4785 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t)) = NULL_TREE;
4788 TREE_NONLOCAL_FLAG (TREE_VALUE (tags)) = 0;
4789 tags = TREE_CHAIN (tags);
4796 /* Just remove from this class what didn't make
4797 it into IDENTIFIER_CLASS_VALUE. */
4798 tree tags = CLASSTYPE_TAGS (current_class_type);
4802 TREE_NONLOCAL_FLAG (TREE_VALUE (tags)) = 0;
4803 tags = TREE_CHAIN (tags);
4807 /* Force clearing of IDENTIFIER_CLASS_VALUEs after a class definition,
4808 since not all class decls make it there currently. */
4809 poplevel_class (! modify);
4811 /* Since poplevel_class does the popping of class decls nowadays,
4812 this really only frees the obstack used for these decls.
4813 That's why it had to be moved down here. */
4817 current_class_depth--;
4818 current_class_type = *--current_class_stack;
4819 current_class_name = *--current_class_stack;
4821 pop_memoized_context (modify);
4827 /* Returns 1 if current_class_type is either T or a nested type of T. */
4830 currently_open_class (t)
4834 if (t == current_class_type)
4836 for (i = 0; i < current_class_depth; ++i)
4837 if (current_class_stack [-i*2 - 1] == t)
4842 /* When entering a class scope, all enclosing class scopes' names with
4843 static meaning (static variables, static functions, types and enumerators)
4844 have to be visible. This recursive function calls pushclass for all
4845 enclosing class contexts until global or a local scope is reached.
4846 TYPE is the enclosed class and MODIFY is equivalent with the pushclass
4847 formal of the same name. */
4850 push_nested_class (type, modify)
4856 if (type == NULL_TREE || type == error_mark_node || ! IS_AGGR_TYPE (type)
4857 || TREE_CODE (type) == TEMPLATE_TYPE_PARM
4858 || TREE_CODE (type) == TEMPLATE_TEMPLATE_PARM)
4861 context = DECL_CONTEXT (TYPE_MAIN_DECL (type));
4863 if (context && TREE_CODE (context) == RECORD_TYPE)
4864 push_nested_class (context, 2);
4865 pushclass (type, modify);
4868 /* Undoes a push_nested_class call. MODIFY is passed on to popclass. */
4871 pop_nested_class (modify)
4874 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
4877 if (context && TREE_CODE (context) == RECORD_TYPE)
4878 pop_nested_class (modify);
4881 /* Set global variables CURRENT_LANG_NAME to appropriate value
4882 so that behavior of name-mangling machinery is correct. */
4885 push_lang_context (name)
4888 *current_lang_stack++ = current_lang_name;
4889 if (current_lang_stack >= current_lang_base + current_lang_stacksize)
4892 = (tree *)xrealloc (current_lang_base,
4893 sizeof (tree) * (current_lang_stacksize + 10));
4894 current_lang_stack = current_lang_base + current_lang_stacksize;
4895 current_lang_stacksize += 10;
4898 if (name == lang_name_cplusplus || name == lang_name_java)
4900 strict_prototype = strict_prototypes_lang_cplusplus;
4901 current_lang_name = name;
4903 else if (name == lang_name_c)
4905 strict_prototype = strict_prototypes_lang_c;
4906 current_lang_name = name;
4909 error ("language string `\"%s\"' not recognized", IDENTIFIER_POINTER (name));
4912 /* Get out of the current language scope. */
4917 current_lang_name = *--current_lang_stack;
4918 if (current_lang_name == lang_name_cplusplus)
4919 strict_prototype = strict_prototypes_lang_cplusplus;
4920 else if (current_lang_name == lang_name_c)
4921 strict_prototype = strict_prototypes_lang_c;
4924 /* Type instantiation routines. */
4927 validate_lhs (lhstype, complain)
4931 if (TYPE_PTRMEMFUNC_P (lhstype))
4932 lhstype = TYPE_PTRMEMFUNC_FN_TYPE (lhstype);
4934 if (TREE_CODE (lhstype) == POINTER_TYPE)
4936 if (TREE_CODE (TREE_TYPE (lhstype)) == FUNCTION_TYPE
4937 || TREE_CODE (TREE_TYPE (lhstype)) == METHOD_TYPE)
4938 lhstype = TREE_TYPE (lhstype);
4942 error ("invalid type combination for overload");
4943 return error_mark_node;
4949 /* This function will instantiate the type of the expression given in
4950 RHS to match the type of LHSTYPE. If errors exist, then return
4951 error_mark_node. If only complain is COMPLAIN is set. If we are
4952 not complaining, never modify rhs, as overload resolution wants to
4953 try many possible instantiations, in hopes that at least one will
4956 This function is used in build_modify_expr, convert_arguments,
4957 build_c_cast, and compute_conversion_costs. */
4960 instantiate_type (lhstype, rhs, complain)
4964 tree explicit_targs = NULL_TREE;
4966 if (TREE_CODE (lhstype) == UNKNOWN_TYPE)
4969 error ("not enough type information");
4970 return error_mark_node;
4973 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
4975 if (comptypes (lhstype, TREE_TYPE (rhs), 1))
4978 cp_error ("argument of type `%T' does not match `%T'",
4979 TREE_TYPE (rhs), lhstype);
4980 return error_mark_node;
4983 /* We don't overwrite rhs if it is an overloaded function.
4984 Copying it would destroy the tree link. */
4985 if (TREE_CODE (rhs) != OVERLOAD)
4986 rhs = copy_node (rhs);
4988 /* This should really only be used when attempting to distinguish
4989 what sort of a pointer to function we have. For now, any
4990 arithmetic operation which is not supported on pointers
4991 is rejected as an error. */
4993 switch (TREE_CODE (rhs))
5000 my_friendly_abort (177);
5001 return error_mark_node;
5008 new_rhs = instantiate_type (build_pointer_type (lhstype),
5009 TREE_OPERAND (rhs, 0), complain);
5010 if (new_rhs == error_mark_node)
5011 return error_mark_node;
5013 TREE_TYPE (rhs) = lhstype;
5014 TREE_OPERAND (rhs, 0) = new_rhs;
5019 rhs = copy_node (TREE_OPERAND (rhs, 0));
5020 TREE_TYPE (rhs) = unknown_type_node;
5021 return instantiate_type (lhstype, rhs, complain);
5025 tree field = TREE_OPERAND (rhs, 1);
5026 if (TREE_CODE (field) == TREE_LIST)
5028 tree function = instantiate_type (lhstype, field, complain);
5029 if (function == error_mark_node)
5030 return error_mark_node;
5031 my_friendly_assert (TREE_CODE (function) == FUNCTION_DECL, 185);
5032 if (DECL_VINDEX (function))
5034 tree base = TREE_OPERAND (rhs, 0);
5035 tree base_ptr = build_unary_op (ADDR_EXPR, base, 0);
5036 if (base_ptr == error_mark_node)
5037 return error_mark_node;
5038 base_ptr = convert_pointer_to (DECL_CONTEXT (function), base_ptr);
5039 if (base_ptr == error_mark_node)
5040 return error_mark_node;
5041 return build_vfn_ref (&base_ptr, base, DECL_VINDEX (function));
5043 mark_used (function);
5047 /* I could not trigger this code. MvL */
5048 my_friendly_abort (980326);
5050 my_friendly_assert (TREE_CODE (field) == FIELD_DECL, 178);
5051 my_friendly_assert (!(TREE_CODE (TREE_TYPE (field)) == FUNCTION_TYPE
5052 || TREE_CODE (TREE_TYPE (field)) == METHOD_TYPE),
5055 TREE_TYPE (rhs) = lhstype;
5056 /* First look for an exact match */
5058 while (field && TREE_TYPE (field) != lhstype)
5059 field = DECL_CHAIN (field);
5062 TREE_OPERAND (rhs, 1) = field;
5067 /* No exact match found, look for a compatible function. */
5068 field = TREE_OPERAND (rhs, 1);
5069 while (field && ! comptypes (lhstype, TREE_TYPE (field), 0))
5070 field = DECL_CHAIN (field);
5073 TREE_OPERAND (rhs, 1) = field;
5074 field = DECL_CHAIN (field);
5075 while (field && ! comptypes (lhstype, TREE_TYPE (field), 0))
5076 field = DECL_CHAIN (field);
5080 error ("ambiguous overload for COMPONENT_REF requested");
5081 return error_mark_node;
5087 error ("no appropriate overload exists for COMPONENT_REF");
5088 return error_mark_node;
5094 case TEMPLATE_ID_EXPR:
5096 explicit_targs = TREE_OPERAND (rhs, 1);
5097 rhs = TREE_OPERAND (rhs, 0);
5100 my_friendly_assert (TREE_CODE (rhs) == OVERLOAD, 980401);
5106 /* First look for an exact match. Search overloaded
5107 functions. May have to undo what `default_conversion'
5108 might do to lhstype. */
5110 lhstype = validate_lhs (lhstype, complain);
5111 if (lhstype == error_mark_node)
5114 if (TREE_CODE (lhstype) != FUNCTION_TYPE)
5116 rhs = DECL_NAME (OVL_FUNCTION (rhs));
5118 cp_error("cannot resolve overloaded function `%D' "
5119 "based on non-function type", rhs);
5120 return error_mark_node;
5124 /* If there are explicit_targs, only a template function
5126 if (explicit_targs == NULL_TREE)
5129 elem = OVL_FUNCTION (elems);
5130 if (! comptypes (lhstype, TREE_TYPE (elem), 1))
5131 elems = OVL_CHAIN (elems);
5139 /* No exact match found, look for a compatible template. */
5143 if (TREE_CODE (elems) == TREE_LIST)
5144 elems = TREE_VALUE (rhs);
5145 for (; elems; elems = OVL_NEXT (elems))
5146 if (TREE_CODE (elem = OVL_CURRENT (elems)) == TEMPLATE_DECL)
5148 int n = DECL_NTPARMS (elem);
5149 tree t = make_scratch_vec (n);
5151 i = type_unification
5152 (DECL_INNERMOST_TEMPLATE_PARMS (elem), t,
5153 TYPE_ARG_TYPES (TREE_TYPE (elem)),
5154 TYPE_ARG_TYPES (lhstype), explicit_targs, 1, 1);
5159 cp_error ("ambiguous template instantiation converting to `%#T'", lhstype);
5160 return error_mark_node;
5162 save_elem = instantiate_template (elem, t);
5163 /* Check the return type. */
5164 if (! comptypes (TREE_TYPE (lhstype),
5165 TREE_TYPE (TREE_TYPE (save_elem)), 1))
5171 mark_used (save_elem);
5176 /* If there are explicit_targs, only a template function
5178 if (explicit_targs == NULL_TREE)
5180 /* No match found, look for a compatible function. */
5183 for (; elems; elems = OVL_NEXT (elems))
5185 elem = OVL_CURRENT (elems);
5186 if (comp_target_types (lhstype, TREE_TYPE (elem), 1) > 0)
5191 tree save_elem = elem;
5192 for (elems = OVL_CHAIN (elems); elems;
5193 elems = OVL_CHAIN (elems))
5195 elem = OVL_FUNCTION (elems);
5196 if (comp_target_types (lhstype, TREE_TYPE (elem), 0) > 0)
5204 ("cannot resolve overload to target type `%#T'",
5206 cp_error_at (" ambiguity between `%#D'", save_elem);
5207 cp_error_at (" and `%#D', at least", elem);
5209 return error_mark_node;
5211 mark_used (save_elem);
5217 cp_error ("cannot resolve overload to target type `%#T'", lhstype);
5219 (" because no suitable overload of function `%D' exists",
5220 DECL_NAME (OVL_FUNCTION (rhs)));
5222 return error_mark_node;
5227 tree elem, baselink, name = NULL_TREE;
5229 if (TREE_PURPOSE (rhs) == error_mark_node)
5231 /* Make sure we don't drop the non-local flag, as the old code
5232 would rely on it. */
5233 int nl = TREE_NONLOCAL_FLAG (rhs);
5234 /* We don't need the type of this node. */
5235 rhs = TREE_VALUE (rhs);
5236 my_friendly_assert (TREE_NONLOCAL_FLAG (rhs) == nl, 980331);
5238 /* Now we should have a baselink. */
5239 my_friendly_assert (TREE_CODE (TREE_PURPOSE (rhs)) == TREE_VEC, 980331);
5240 /* First look for an exact match. Search member functions.
5241 May have to undo what `default_conversion' might do to
5244 lhstype = validate_lhs (lhstype, complain);
5245 if (lhstype == error_mark_node)
5248 if (TREE_NONLOCAL_FLAG (rhs))
5250 my_friendly_abort (980401);
5251 /* Got to get it as a baselink. */
5252 rhs = lookup_fnfields (TYPE_BINFO (current_class_type),
5253 DECL_NAME (OVL_FUNCTION (rhs)), 0);
5257 my_friendly_assert (TREE_CHAIN (rhs) == NULL_TREE, 181);
5258 my_friendly_assert (TREE_CODE (TREE_VALUE (rhs)) == FUNCTION_DECL
5259 || TREE_CODE (TREE_VALUE (rhs)) == OVERLOAD,
5263 for (baselink = rhs; baselink;
5264 baselink = next_baselink (baselink))
5266 elem = TREE_VALUE (baselink);
5268 if (comptypes (lhstype, TREE_TYPE (OVL_CURRENT (elem)), 1))
5270 mark_used (OVL_CURRENT (elem));
5271 return OVL_CURRENT (elem);
5274 elem = OVL_NEXT (elem);
5277 /* No exact match found, look for a compatible method. */
5278 for (baselink = rhs; baselink;
5279 baselink = next_baselink (baselink))
5281 elem = TREE_VALUE (baselink);
5282 for (; elem; elem = OVL_NEXT (elem))
5283 if (comp_target_types (lhstype,
5284 TREE_TYPE (OVL_CURRENT (elem)), 1) > 0)
5288 tree save_elem = OVL_CURRENT (elem);
5289 for (elem = OVL_NEXT (elem); elem; elem = OVL_NEXT (elem))
5290 if (comp_target_types (lhstype,
5291 TREE_TYPE (OVL_CURRENT (elem)), 0) > 0)
5296 error ("ambiguous overload for overloaded method requested");
5297 return error_mark_node;
5299 mark_used (save_elem);
5303 while (TREE_CODE (name) == TREE_LIST)
5304 name = TREE_VALUE (name);
5305 name = DECL_NAME (OVL_CURRENT (name));
5307 if (TREE_CODE (lhstype) == FUNCTION_TYPE && globals < 0)
5309 /* Try to instantiate from non-member functions. */
5310 rhs = lookup_name_nonclass (name);
5311 if (rhs && TREE_CODE (rhs) == TREE_LIST)
5313 /* This code seems to be missing a `return'. */
5314 my_friendly_abort (4);
5315 instantiate_type (lhstype, rhs, complain);
5321 cp_error ("no compatible member functions named `%D'", name);
5322 return error_mark_node;
5326 /* This is too hard for now. */
5327 my_friendly_abort (183);
5328 return error_mark_node;
5333 TREE_OPERAND (rhs, 0)
5334 = instantiate_type (lhstype, TREE_OPERAND (rhs, 0), complain);
5335 if (TREE_OPERAND (rhs, 0) == error_mark_node)
5336 return error_mark_node;
5337 TREE_OPERAND (rhs, 1)
5338 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), complain);
5339 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5340 return error_mark_node;
5342 TREE_TYPE (rhs) = lhstype;
5346 case TRUNC_DIV_EXPR:
5347 case FLOOR_DIV_EXPR:
5349 case ROUND_DIV_EXPR:
5351 case TRUNC_MOD_EXPR:
5352 case FLOOR_MOD_EXPR:
5354 case ROUND_MOD_EXPR:
5355 case FIX_ROUND_EXPR:
5356 case FIX_FLOOR_EXPR:
5358 case FIX_TRUNC_EXPR:
5374 case PREINCREMENT_EXPR:
5375 case PREDECREMENT_EXPR:
5376 case POSTINCREMENT_EXPR:
5377 case POSTDECREMENT_EXPR:
5379 error ("invalid operation on uninstantiated type");
5380 return error_mark_node;
5382 case TRUTH_AND_EXPR:
5384 case TRUTH_XOR_EXPR:
5391 case TRUTH_ANDIF_EXPR:
5392 case TRUTH_ORIF_EXPR:
5393 case TRUTH_NOT_EXPR:
5395 error ("not enough type information");
5396 return error_mark_node;
5399 if (type_unknown_p (TREE_OPERAND (rhs, 0)))
5402 error ("not enough type information");
5403 return error_mark_node;
5405 TREE_OPERAND (rhs, 1)
5406 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), complain);
5407 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5408 return error_mark_node;
5409 TREE_OPERAND (rhs, 2)
5410 = instantiate_type (lhstype, TREE_OPERAND (rhs, 2), complain);
5411 if (TREE_OPERAND (rhs, 2) == error_mark_node)
5412 return error_mark_node;
5414 TREE_TYPE (rhs) = lhstype;
5418 TREE_OPERAND (rhs, 1)
5419 = instantiate_type (lhstype, TREE_OPERAND (rhs, 1), complain);
5420 if (TREE_OPERAND (rhs, 1) == error_mark_node)
5421 return error_mark_node;
5423 TREE_TYPE (rhs) = lhstype;
5427 if (TYPE_PTRMEMFUNC_P (lhstype))
5428 lhstype = TYPE_PTRMEMFUNC_FN_TYPE (lhstype);
5429 else if (TREE_CODE (lhstype) != POINTER_TYPE)
5432 error ("type for resolving address of overloaded function must be pointer type");
5433 return error_mark_node;
5436 tree fn = instantiate_type (TREE_TYPE (lhstype), TREE_OPERAND (rhs, 0), complain);
5437 if (fn == error_mark_node)
5438 return error_mark_node;
5439 mark_addressable (fn);
5440 TREE_TYPE (rhs) = lhstype;
5441 TREE_OPERAND (rhs, 0) = fn;
5442 TREE_CONSTANT (rhs) = staticp (fn);
5443 if (TREE_CODE (lhstype) == POINTER_TYPE
5444 && TREE_CODE (TREE_TYPE (lhstype)) == METHOD_TYPE)
5446 build_ptrmemfunc_type (lhstype);
5447 rhs = build_ptrmemfunc (lhstype, rhs, 0);
5452 case ENTRY_VALUE_EXPR:
5453 my_friendly_abort (184);
5454 return error_mark_node;
5457 return error_mark_node;
5460 my_friendly_abort (185);
5461 return error_mark_node;
5465 /* Return the name of the virtual function pointer field
5466 (as an IDENTIFIER_NODE) for the given TYPE. Note that
5467 this may have to look back through base types to find the
5468 ultimate field name. (For single inheritance, these could
5469 all be the same name. Who knows for multiple inheritance). */
5472 get_vfield_name (type)
5475 tree binfo = TYPE_BINFO (type);
5478 while (BINFO_BASETYPES (binfo)
5479 && TYPE_VIRTUAL_P (BINFO_TYPE (BINFO_BASETYPE (binfo, 0)))
5480 && ! TREE_VIA_VIRTUAL (BINFO_BASETYPE (binfo, 0)))
5481 binfo = BINFO_BASETYPE (binfo, 0);
5483 type = BINFO_TYPE (binfo);
5484 buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT)
5485 + TYPE_NAME_LENGTH (type) + 2);
5486 sprintf (buf, VFIELD_NAME_FORMAT, TYPE_NAME_STRING (type));
5487 return get_identifier (buf);
5491 print_class_statistics ()
5493 #ifdef GATHER_STATISTICS
5494 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
5495 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
5496 fprintf (stderr, "build_method_call = %d (inner = %d)\n",
5497 n_build_method_call, n_inner_fields_searched);
5500 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
5501 n_vtables, n_vtable_searches);
5502 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
5503 n_vtable_entries, n_vtable_elems);
5508 /* Push an obstack which is sufficiently long-lived to hold such class
5509 decls that may be cached in the previous_class_values list. For now, let's
5510 use the permanent obstack, later we may create a dedicated obstack just
5511 for this purpose. The effect is undone by pop_obstacks. */
5514 maybe_push_cache_obstack ()
5516 push_obstacks_nochange ();
5517 if (current_class_depth == 1)
5518 current_obstack = &permanent_obstack;
5521 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
5522 according to [class]:
5523 The class-name is also inserted
5524 into the scope of the class itself. For purposes of access checking,
5525 the inserted class name is treated as if it were a public member name. */
5528 build_self_reference ()
5530 tree name = constructor_name (current_class_type);
5531 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
5532 DECL_NONLOCAL (value) = 1;
5533 DECL_CONTEXT (value) = current_class_type;
5534 DECL_CLASS_CONTEXT (value) = current_class_type;
5535 CLASSTYPE_LOCAL_TYPEDECLS (current_class_type) = 1;
5536 DECL_ARTIFICIAL (value) = 1;
5538 pushdecl_class_level (value);
5542 /* Returns 1 if TYPE contains only padding bytes. */
5545 is_empty_class (type)
5550 if (! IS_AGGR_TYPE (type))
5554 return CLASSTYPE_SIZE (type) == integer_zero_node;
5556 if (TYPE_BINFO_BASETYPES (type))
5558 t = TYPE_FIELDS (type);
5559 while (t && TREE_CODE (t) != FIELD_DECL)
5561 return (t == NULL_TREE);