1 /* Breadth-first and depth-first routines for
2 searching multiple-inheritance lattice for GNU C++.
3 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
4 1999, 2000, 2002, 2003, 2004 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
24 /* High-level class interface. */
28 #include "coretypes.h"
39 /* Obstack used for remembering decision points of breadth-first. */
41 static struct obstack search_obstack;
43 /* Methods for pushing and popping objects to and from obstacks. */
46 push_stack_level (struct obstack *obstack, char *tp,/* Sony NewsOS 5.0 compiler doesn't like void * here. */
49 struct stack_level *stack;
50 obstack_grow (obstack, tp, size);
51 stack = (struct stack_level *) ((char*)obstack_next_free (obstack) - size);
52 obstack_finish (obstack);
53 stack->obstack = obstack;
54 stack->first = (tree *) obstack_base (obstack);
55 stack->limit = obstack_room (obstack) / sizeof (tree *);
60 pop_stack_level (struct stack_level *stack)
62 struct stack_level *tem = stack;
63 struct obstack *obstack = tem->obstack;
65 obstack_free (obstack, tem);
69 #define search_level stack_level
70 static struct search_level *search_stack;
74 /* The class dominating the hierarchy. */
76 /* A pointer to a complete object of the indicated TYPE. */
81 static tree dfs_check_overlap (tree, void *);
82 static tree dfs_no_overlap_yet (tree, int, void *);
83 static base_kind lookup_base_r (tree, tree, base_access, bool, tree *);
84 static int dynamic_cast_base_recurse (tree, tree, bool, tree *);
85 static tree marked_pushdecls_p (tree, int, void *);
86 static tree unmarked_pushdecls_p (tree, int, void *);
87 static tree dfs_debug_unmarkedp (tree, int, void *);
88 static tree dfs_debug_mark (tree, void *);
89 static tree dfs_push_type_decls (tree, void *);
90 static tree dfs_push_decls (tree, void *);
91 static tree dfs_unuse_fields (tree, void *);
92 static tree add_conversions (tree, void *);
93 static int look_for_overrides_r (tree, tree);
94 static struct search_level *push_search_level (struct stack_level *,
96 static struct search_level *pop_search_level (struct stack_level *);
97 static tree bfs_walk (tree, tree (*) (tree, void *),
98 tree (*) (tree, int, void *), void *);
99 static tree lookup_field_queue_p (tree, int, void *);
100 static int shared_member_p (tree);
101 static tree lookup_field_r (tree, void *);
102 static tree dfs_accessible_queue_p (tree, int, void *);
103 static tree dfs_accessible_p (tree, void *);
104 static tree dfs_access_in_type (tree, void *);
105 static access_kind access_in_type (tree, tree);
106 static int protected_accessible_p (tree, tree, tree);
107 static int friend_accessible_p (tree, tree, tree);
108 static void setup_class_bindings (tree, int);
109 static int template_self_reference_p (tree, tree);
110 static tree dfs_get_pure_virtuals (tree, void *);
112 /* Allocate a level of searching. */
114 static struct search_level *
115 push_search_level (struct stack_level *stack, struct obstack *obstack)
117 struct search_level tem;
120 return push_stack_level (obstack, (char *)&tem, sizeof (tem));
123 /* Discard a level of search allocation. */
125 static struct search_level *
126 pop_search_level (struct stack_level *obstack)
128 struct search_level *stack = pop_stack_level (obstack);
133 /* Variables for gathering statistics. */
134 #ifdef GATHER_STATISTICS
135 static int n_fields_searched;
136 static int n_calls_lookup_field, n_calls_lookup_field_1;
137 static int n_calls_lookup_fnfields, n_calls_lookup_fnfields_1;
138 static int n_calls_get_base_type;
139 static int n_outer_fields_searched;
140 static int n_contexts_saved;
141 #endif /* GATHER_STATISTICS */
144 /* Worker for lookup_base. BINFO is the binfo we are searching at,
145 BASE is the RECORD_TYPE we are searching for. ACCESS is the
146 required access checks. IS_VIRTUAL indicates if BINFO is morally
149 If BINFO is of the required type, then *BINFO_PTR is examined to
150 compare with any other instance of BASE we might have already
151 discovered. *BINFO_PTR is initialized and a base_kind return value
152 indicates what kind of base was located.
154 Otherwise BINFO's bases are searched. */
157 lookup_base_r (tree binfo, tree base, base_access access,
158 bool is_virtual, /* inside a virtual part */
162 tree bases, accesses;
163 base_kind found = bk_not_base;
165 if (same_type_p (BINFO_TYPE (binfo), base))
167 /* We have found a base. Check against what we have found
169 found = bk_same_type;
171 found = bk_via_virtual;
175 else if (binfo != *binfo_ptr)
177 if (access != ba_any)
179 else if (!is_virtual)
180 /* Prefer a non-virtual base. */
188 bases = BINFO_BASETYPES (binfo);
189 accesses = BINFO_BASEACCESSES (binfo);
193 for (i = TREE_VEC_LENGTH (bases); i--;)
195 tree base_binfo = TREE_VEC_ELT (bases, i);
198 bk = lookup_base_r (base_binfo, base,
200 is_virtual || TREE_VIA_VIRTUAL (base_binfo),
206 if (access != ba_any)
215 my_friendly_assert (found == bk_not_base, 20010723);
220 if (found != bk_ambig)
234 /* Returns true if type BASE is accessible in T. (BASE is known to be
235 a base class of T.) */
238 accessible_base_p (tree t, tree base)
242 /* [class.access.base]
244 A base class is said to be accessible if an invented public
245 member of the base class is accessible. */
246 /* Rather than inventing a public member, we use the implicit
247 public typedef created in the scope of every class. */
248 decl = TYPE_FIELDS (base);
249 while (!DECL_SELF_REFERENCE_P (decl))
250 decl = TREE_CHAIN (decl);
251 while (ANON_AGGR_TYPE_P (t))
252 t = TYPE_CONTEXT (t);
253 return accessible_p (t, decl);
256 /* Lookup BASE in the hierarchy dominated by T. Do access checking as
257 ACCESS specifies. Return the binfo we discover. If KIND_PTR is
258 non-NULL, fill with information about what kind of base we
261 If the base is inaccessible, or ambiguous, and the ba_quiet bit is
262 not set in ACCESS, then an error is issued and error_mark_node is
263 returned. If the ba_quiet bit is set, then no error is issued and
264 NULL_TREE is returned. */
267 lookup_base (tree t, tree base, base_access access, base_kind *kind_ptr)
269 tree binfo = NULL; /* The binfo we've found so far. */
273 if (t == error_mark_node || base == error_mark_node)
276 *kind_ptr = bk_not_base;
277 return error_mark_node;
279 my_friendly_assert (TYPE_P (base), 20011127);
287 t_binfo = TYPE_BINFO (t);
289 /* Ensure that the types are instantiated. */
290 t = complete_type (TYPE_MAIN_VARIANT (t));
291 base = complete_type (TYPE_MAIN_VARIANT (base));
293 bk = lookup_base_r (t_binfo, base, access, 0, &binfo);
295 /* Check that the base is unambiguous and accessible. */
296 if (access != ba_any)
304 if (!(access & ba_quiet))
306 error ("`%T' is an ambiguous base of `%T'", base, t);
307 binfo = error_mark_node;
312 if ((access & ~ba_quiet) != ba_ignore
313 /* If BASE is incomplete, then BASE and TYPE are probably
314 the same, in which case BASE is accessible. If they
315 are not the same, then TYPE is invalid. In that case,
316 there's no need to issue another error here, and
317 there's no implicit typedef to use in the code that
318 follows, so we skip the check. */
319 && COMPLETE_TYPE_P (base)
320 && !accessible_base_p (t, base))
322 if (!(access & ba_quiet))
324 error ("`%T' is an inaccessible base of `%T'", base, t);
325 binfo = error_mark_node;
329 bk = bk_inaccessible;
340 /* Worker function for get_dynamic_cast_base_type. */
343 dynamic_cast_base_recurse (tree subtype, tree binfo, bool is_via_virtual,
346 tree binfos, accesses;
350 if (BINFO_TYPE (binfo) == subtype)
356 *offset_ptr = BINFO_OFFSET (binfo);
361 binfos = BINFO_BASETYPES (binfo);
362 accesses = BINFO_BASEACCESSES (binfo);
363 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
364 for (i = 0; i < n_baselinks; i++)
366 tree base_binfo = TREE_VEC_ELT (binfos, i);
367 tree base_access = TREE_VEC_ELT (accesses, i);
370 if (base_access != access_public_node)
372 rval = dynamic_cast_base_recurse
373 (subtype, base_binfo,
374 is_via_virtual || TREE_VIA_VIRTUAL (base_binfo), offset_ptr);
378 worst = worst >= 0 ? -3 : worst;
381 else if (rval == -3 && worst != -1)
387 /* The dynamic cast runtime needs a hint about how the static SUBTYPE type
388 started from is related to the required TARGET type, in order to optimize
389 the inheritance graph search. This information is independent of the
390 current context, and ignores private paths, hence get_base_distance is
391 inappropriate. Return a TREE specifying the base offset, BOFF.
392 BOFF >= 0, there is only one public non-virtual SUBTYPE base at offset BOFF,
393 and there are no public virtual SUBTYPE bases.
394 BOFF == -1, SUBTYPE occurs as multiple public virtual or non-virtual bases.
395 BOFF == -2, SUBTYPE is not a public base.
396 BOFF == -3, SUBTYPE occurs as multiple public non-virtual bases. */
399 get_dynamic_cast_base_type (tree subtype, tree target)
401 tree offset = NULL_TREE;
402 int boff = dynamic_cast_base_recurse (subtype, TYPE_BINFO (target),
407 offset = build_int_2 (boff, -1);
408 TREE_TYPE (offset) = ssizetype;
412 /* Search for a member with name NAME in a multiple inheritance
413 lattice specified by TYPE. If it does not exist, return NULL_TREE.
414 If the member is ambiguously referenced, return `error_mark_node'.
415 Otherwise, return a DECL with the indicated name. If WANT_TYPE is
416 true, type declarations are preferred. */
418 /* Do a 1-level search for NAME as a member of TYPE. The caller must
419 figure out whether it can access this field. (Since it is only one
420 level, this is reasonable.) */
423 lookup_field_1 (tree type, tree name, bool want_type)
427 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
428 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM
429 || TREE_CODE (type) == TYPENAME_TYPE)
430 /* The TYPE_FIELDS of a TEMPLATE_TYPE_PARM and
431 BOUND_TEMPLATE_TEMPLATE_PARM are not fields at all;
432 instead TYPE_FIELDS is the TEMPLATE_PARM_INDEX. (Miraculously,
433 the code often worked even when we treated the index as a list
435 The TYPE_FIELDS of TYPENAME_TYPE is its TYPENAME_TYPE_FULLNAME. */
439 && DECL_LANG_SPECIFIC (TYPE_NAME (type))
440 && DECL_SORTED_FIELDS (TYPE_NAME (type)))
442 tree *fields = &DECL_SORTED_FIELDS (TYPE_NAME (type))->elts[0];
443 int lo = 0, hi = DECL_SORTED_FIELDS (TYPE_NAME (type))->len;
450 #ifdef GATHER_STATISTICS
452 #endif /* GATHER_STATISTICS */
454 if (DECL_NAME (fields[i]) > name)
456 else if (DECL_NAME (fields[i]) < name)
462 /* We might have a nested class and a field with the
463 same name; we sorted them appropriately via
464 field_decl_cmp, so just look for the first or last
465 field with this name. */
470 while (i >= lo && DECL_NAME (fields[i]) == name);
471 if (TREE_CODE (field) != TYPE_DECL
472 && !DECL_CLASS_TEMPLATE_P (field))
479 while (i < hi && DECL_NAME (fields[i]) == name);
487 field = TYPE_FIELDS (type);
489 #ifdef GATHER_STATISTICS
490 n_calls_lookup_field_1++;
491 #endif /* GATHER_STATISTICS */
492 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
494 #ifdef GATHER_STATISTICS
496 #endif /* GATHER_STATISTICS */
497 my_friendly_assert (DECL_P (field), 0);
498 if (DECL_NAME (field) == NULL_TREE
499 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
501 tree temp = lookup_field_1 (TREE_TYPE (field), name, want_type);
505 if (TREE_CODE (field) == USING_DECL)
506 /* For now, we're just treating member using declarations as
507 old ARM-style access declarations. Thus, there's no reason
508 to return a USING_DECL, and the rest of the compiler can't
509 handle it. Once the class is defined, these are purged
510 from TYPE_FIELDS anyhow; see handle_using_decl. */
513 if (DECL_NAME (field) == name
515 || TREE_CODE (field) == TYPE_DECL
516 || DECL_CLASS_TEMPLATE_P (field)))
520 if (name == vptr_identifier)
522 /* Give the user what s/he thinks s/he wants. */
523 if (TYPE_POLYMORPHIC_P (type))
524 return TYPE_VFIELD (type);
529 /* There are a number of cases we need to be aware of here:
530 current_class_type current_function_decl
537 Those last two make life interesting. If we're in a function which is
538 itself inside a class, we need decls to go into the fn's decls (our
539 second case below). But if we're in a class and the class itself is
540 inside a function, we need decls to go into the decls for the class. To
541 achieve this last goal, we must see if, when both current_class_ptr and
542 current_function_decl are set, the class was declared inside that
543 function. If so, we know to put the decls into the class's scope. */
548 if (current_function_decl == NULL_TREE)
549 return current_class_type;
550 if (current_class_type == NULL_TREE)
551 return current_function_decl;
552 if ((DECL_FUNCTION_MEMBER_P (current_function_decl)
553 && same_type_p (DECL_CONTEXT (current_function_decl),
555 || (DECL_FRIEND_CONTEXT (current_function_decl)
556 && same_type_p (DECL_FRIEND_CONTEXT (current_function_decl),
557 current_class_type)))
558 return current_function_decl;
560 return current_class_type;
563 /* Returns nonzero if we are currently in a function scope. Note
564 that this function returns zero if we are within a local class, but
565 not within a member function body of the local class. */
568 at_function_scope_p (void)
570 tree cs = current_scope ();
571 return cs && TREE_CODE (cs) == FUNCTION_DECL;
574 /* Returns true if the innermost active scope is a class scope. */
577 at_class_scope_p (void)
579 tree cs = current_scope ();
580 return cs && TYPE_P (cs);
583 /* Returns true if the innermost active scope is a namespace scope. */
586 at_namespace_scope_p (void)
588 /* We are in a namespace scope if we are not it a class scope or a
590 return !current_scope();
593 /* Return the scope of DECL, as appropriate when doing name-lookup. */
596 context_for_name_lookup (tree decl)
600 For the purposes of name lookup, after the anonymous union
601 definition, the members of the anonymous union are considered to
602 have been defined in the scope in which the anonymous union is
604 tree context = DECL_CONTEXT (decl);
606 while (context && TYPE_P (context) && ANON_AGGR_TYPE_P (context))
607 context = TYPE_CONTEXT (context);
609 context = global_namespace;
614 /* The accessibility routines use BINFO_ACCESS for scratch space
615 during the computation of the accessibility of some declaration. */
617 #define BINFO_ACCESS(NODE) \
618 ((access_kind) ((TREE_PUBLIC (NODE) << 1) | TREE_PRIVATE (NODE)))
620 /* Set the access associated with NODE to ACCESS. */
622 #define SET_BINFO_ACCESS(NODE, ACCESS) \
623 ((TREE_PUBLIC (NODE) = ((ACCESS) & 2) != 0), \
624 (TREE_PRIVATE (NODE) = ((ACCESS) & 1) != 0))
626 /* Called from access_in_type via dfs_walk. Calculate the access to
627 DATA (which is really a DECL) in BINFO. */
630 dfs_access_in_type (tree binfo, void *data)
632 tree decl = (tree) data;
633 tree type = BINFO_TYPE (binfo);
634 access_kind access = ak_none;
636 if (context_for_name_lookup (decl) == type)
638 /* If we have descended to the scope of DECL, just note the
639 appropriate access. */
640 if (TREE_PRIVATE (decl))
642 else if (TREE_PROTECTED (decl))
643 access = ak_protected;
649 /* First, check for an access-declaration that gives us more
650 access to the DECL. The CONST_DECL for an enumeration
651 constant will not have DECL_LANG_SPECIFIC, and thus no
653 if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl))
655 tree decl_access = purpose_member (type, DECL_ACCESS (decl));
659 decl_access = TREE_VALUE (decl_access);
661 if (decl_access == access_public_node)
663 else if (decl_access == access_protected_node)
664 access = ak_protected;
665 else if (decl_access == access_private_node)
668 my_friendly_assert (false, 20030217);
676 tree binfos, accesses;
678 /* Otherwise, scan our baseclasses, and pick the most favorable
680 binfos = BINFO_BASETYPES (binfo);
681 accesses = BINFO_BASEACCESSES (binfo);
682 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
683 for (i = 0; i < n_baselinks; ++i)
685 tree base_binfo = TREE_VEC_ELT (binfos, i);
686 tree base_access = TREE_VEC_ELT (accesses, i);
687 access_kind base_access_now = BINFO_ACCESS (base_binfo);
689 if (base_access_now == ak_none || base_access_now == ak_private)
690 /* If it was not accessible in the base, or only
691 accessible as a private member, we can't access it
693 base_access_now = ak_none;
694 else if (base_access == access_protected_node)
695 /* Public and protected members in the base become
697 base_access_now = ak_protected;
698 else if (base_access == access_private_node)
699 /* Public and protected members in the base become
701 base_access_now = ak_private;
703 /* See if the new access, via this base, gives more
704 access than our previous best access. */
705 if (base_access_now != ak_none
706 && (access == ak_none || base_access_now < access))
708 access = base_access_now;
710 /* If the new access is public, we can't do better. */
711 if (access == ak_public)
718 /* Note the access to DECL in TYPE. */
719 SET_BINFO_ACCESS (binfo, access);
721 /* Mark TYPE as visited so that if we reach it again we do not
722 duplicate our efforts here. */
723 BINFO_MARKED (binfo) = 1;
728 /* Return the access to DECL in TYPE. */
731 access_in_type (tree type, tree decl)
733 tree binfo = TYPE_BINFO (type);
735 /* We must take into account
739 If a name can be reached by several paths through a multiple
740 inheritance graph, the access is that of the path that gives
743 The algorithm we use is to make a post-order depth-first traversal
744 of the base-class hierarchy. As we come up the tree, we annotate
745 each node with the most lenient access. */
746 dfs_walk_real (binfo, 0, dfs_access_in_type, unmarkedp, decl);
747 dfs_walk (binfo, dfs_unmark, markedp, 0);
749 return BINFO_ACCESS (binfo);
752 /* Called from accessible_p via dfs_walk. */
755 dfs_accessible_queue_p (tree derived, int ix, void *data ATTRIBUTE_UNUSED)
757 tree binfo = BINFO_BASETYPE (derived, ix);
759 if (BINFO_MARKED (binfo))
762 /* If this class is inherited via private or protected inheritance,
763 then we can't see it, unless we are a friend of the derived class. */
764 if (BINFO_BASEACCESS (derived, ix) != access_public_node
765 && !is_friend (BINFO_TYPE (derived), current_scope ()))
771 /* Called from accessible_p via dfs_walk. */
774 dfs_accessible_p (tree binfo, void *data ATTRIBUTE_UNUSED)
778 BINFO_MARKED (binfo) = 1;
779 access = BINFO_ACCESS (binfo);
780 if (access != ak_none
781 && is_friend (BINFO_TYPE (binfo), current_scope ()))
787 /* Returns nonzero if it is OK to access DECL through an object
788 indicated by BINFO in the context of DERIVED. */
791 protected_accessible_p (tree decl, tree derived, tree binfo)
795 /* We're checking this clause from [class.access.base]
797 m as a member of N is protected, and the reference occurs in a
798 member or friend of class N, or in a member or friend of a
799 class P derived from N, where m as a member of P is private or
802 Here DERIVED is a possible P and DECL is m. accessible_p will
803 iterate over various values of N, but the access to m in DERIVED
806 Note that I believe that the passage above is wrong, and should read
807 "...is private or protected or public"; otherwise you get bizarre results
808 whereby a public using-decl can prevent you from accessing a protected
809 member of a base. (jason 2000/02/28) */
811 /* If DERIVED isn't derived from m's class, then it can't be a P. */
812 if (!DERIVED_FROM_P (context_for_name_lookup (decl), derived))
815 access = access_in_type (derived, decl);
817 /* If m is inaccessible in DERIVED, then it's not a P. */
818 if (access == ak_none)
823 When a friend or a member function of a derived class references
824 a protected nonstatic member of a base class, an access check
825 applies in addition to those described earlier in clause
826 _class.access_) Except when forming a pointer to member
827 (_expr.unary.op_), the access must be through a pointer to,
828 reference to, or object of the derived class itself (or any class
829 derived from that class) (_expr.ref_). If the access is to form
830 a pointer to member, the nested-name-specifier shall name the
831 derived class (or any class derived from that class). */
832 if (DECL_NONSTATIC_MEMBER_P (decl))
834 /* We can tell through what the reference is occurring by
835 chasing BINFO up to the root. */
837 while (BINFO_INHERITANCE_CHAIN (t))
838 t = BINFO_INHERITANCE_CHAIN (t);
840 if (!DERIVED_FROM_P (derived, BINFO_TYPE (t)))
847 /* Returns nonzero if SCOPE is a friend of a type which would be able
848 to access DECL through the object indicated by BINFO. */
851 friend_accessible_p (tree scope, tree decl, tree binfo)
853 tree befriending_classes;
859 if (TREE_CODE (scope) == FUNCTION_DECL
860 || DECL_FUNCTION_TEMPLATE_P (scope))
861 befriending_classes = DECL_BEFRIENDING_CLASSES (scope);
862 else if (TYPE_P (scope))
863 befriending_classes = CLASSTYPE_BEFRIENDING_CLASSES (scope);
867 for (t = befriending_classes; t; t = TREE_CHAIN (t))
868 if (protected_accessible_p (decl, TREE_VALUE (t), binfo))
871 /* Nested classes are implicitly friends of their enclosing types, as
872 per core issue 45 (this is a change from the standard). */
874 for (t = TYPE_CONTEXT (scope); t && TYPE_P (t); t = TYPE_CONTEXT (t))
875 if (protected_accessible_p (decl, t, binfo))
878 if (TREE_CODE (scope) == FUNCTION_DECL
879 || DECL_FUNCTION_TEMPLATE_P (scope))
881 /* Perhaps this SCOPE is a member of a class which is a
883 if (DECL_CLASS_SCOPE_P (decl)
884 && friend_accessible_p (DECL_CONTEXT (scope), decl, binfo))
887 /* Or an instantiation of something which is a friend. */
888 if (DECL_TEMPLATE_INFO (scope))
889 return friend_accessible_p (DECL_TI_TEMPLATE (scope), decl, binfo);
891 else if (CLASSTYPE_TEMPLATE_INFO (scope))
892 return friend_accessible_p (CLASSTYPE_TI_TEMPLATE (scope), decl, binfo);
897 /* DECL is a declaration from a base class of TYPE, which was the
898 class used to name DECL. Return nonzero if, in the current
899 context, DECL is accessible. If TYPE is actually a BINFO node,
900 then we can tell in what context the access is occurring by looking
901 at the most derived class along the path indicated by BINFO. */
904 accessible_p (tree type, tree decl)
911 /* Nonzero if it's OK to access DECL if it has protected
912 accessibility in TYPE. */
913 int protected_ok = 0;
915 /* If this declaration is in a block or namespace scope, there's no
917 if (!TYPE_P (context_for_name_lookup (decl)))
920 /* There is no need to perform access checks inside a thunk. */
921 scope = current_scope ();
922 if (scope && DECL_THUNK_P (scope))
925 /* In a template declaration, we cannot be sure whether the
926 particular specialization that is instantiated will be a friend
927 or not. Therefore, all access checks are deferred until
929 if (processing_template_decl)
935 type = BINFO_TYPE (type);
938 binfo = TYPE_BINFO (type);
940 /* [class.access.base]
942 A member m is accessible when named in class N if
944 --m as a member of N is public, or
946 --m as a member of N is private, and the reference occurs in a
947 member or friend of class N, or
949 --m as a member of N is protected, and the reference occurs in a
950 member or friend of class N, or in a member or friend of a
951 class P derived from N, where m as a member of P is private or
954 --there exists a base class B of N that is accessible at the point
955 of reference, and m is accessible when named in class B.
957 We walk the base class hierarchy, checking these conditions. */
959 /* Figure out where the reference is occurring. Check to see if
960 DECL is private or protected in this scope, since that will
961 determine whether protected access is allowed. */
962 if (current_class_type)
963 protected_ok = protected_accessible_p (decl, current_class_type, binfo);
965 /* Now, loop through the classes of which we are a friend. */
967 protected_ok = friend_accessible_p (scope, decl, binfo);
969 /* Standardize the binfo that access_in_type will use. We don't
970 need to know what path was chosen from this point onwards. */
971 binfo = TYPE_BINFO (type);
973 /* Compute the accessibility of DECL in the class hierarchy
974 dominated by type. */
975 access = access_in_type (type, decl);
976 if (access == ak_public
977 || (access == ak_protected && protected_ok))
981 /* Walk the hierarchy again, looking for a base class that allows
983 t = dfs_walk (binfo, dfs_accessible_p, dfs_accessible_queue_p, 0);
984 /* Clear any mark bits. Note that we have to walk the whole tree
985 here, since we have aborted the previous walk from some point
987 dfs_walk (binfo, dfs_unmark, 0, 0);
989 return t != NULL_TREE;
993 struct lookup_field_info {
994 /* The type in which we're looking. */
996 /* The name of the field for which we're looking. */
998 /* If non-NULL, the current result of the lookup. */
1000 /* The path to RVAL. */
1002 /* If non-NULL, the lookup was ambiguous, and this is a list of the
1005 /* If nonzero, we are looking for types, not data members. */
1007 /* If something went wrong, a message indicating what. */
1011 /* Returns nonzero if BINFO is not hidden by the value found by the
1012 lookup so far. If BINFO is hidden, then there's no need to look in
1013 it. DATA is really a struct lookup_field_info. Called from
1014 lookup_field via breadth_first_search. */
1017 lookup_field_queue_p (tree derived, int ix, void *data)
1019 tree binfo = BINFO_BASETYPE (derived, ix);
1020 struct lookup_field_info *lfi = (struct lookup_field_info *) data;
1022 /* Don't look for constructors or destructors in base classes. */
1023 if (IDENTIFIER_CTOR_OR_DTOR_P (lfi->name))
1026 /* If this base class is hidden by the best-known value so far, we
1027 don't need to look. */
1028 if (lfi->rval_binfo && original_binfo (binfo, lfi->rval_binfo))
1031 /* If this is a dependent base, don't look in it. */
1032 if (BINFO_DEPENDENT_BASE_P (binfo))
1038 /* Within the scope of a template class, you can refer to the to the
1039 current specialization with the name of the template itself. For
1042 template <typename T> struct S { S* sp; }
1044 Returns nonzero if DECL is such a declaration in a class TYPE. */
1047 template_self_reference_p (tree type, tree decl)
1049 return (CLASSTYPE_USE_TEMPLATE (type)
1050 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))
1051 && TREE_CODE (decl) == TYPE_DECL
1052 && DECL_ARTIFICIAL (decl)
1053 && DECL_NAME (decl) == constructor_name (type));
1057 /* Nonzero for a class member means that it is shared between all objects
1060 [class.member.lookup]:If the resulting set of declarations are not all
1061 from sub-objects of the same type, or the set has a nonstatic member
1062 and includes members from distinct sub-objects, there is an ambiguity
1063 and the program is ill-formed.
1065 This function checks that T contains no nonstatic members. */
1068 shared_member_p (tree t)
1070 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == TYPE_DECL \
1071 || TREE_CODE (t) == CONST_DECL)
1073 if (is_overloaded_fn (t))
1075 for (; t; t = OVL_NEXT (t))
1077 tree fn = OVL_CURRENT (t);
1078 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
1086 /* DATA is really a struct lookup_field_info. Look for a field with
1087 the name indicated there in BINFO. If this function returns a
1088 non-NULL value it is the result of the lookup. Called from
1089 lookup_field via breadth_first_search. */
1092 lookup_field_r (tree binfo, void *data)
1094 struct lookup_field_info *lfi = (struct lookup_field_info *) data;
1095 tree type = BINFO_TYPE (binfo);
1096 tree nval = NULL_TREE;
1098 /* First, look for a function. There can't be a function and a data
1099 member with the same name, and if there's a function and a type
1100 with the same name, the type is hidden by the function. */
1101 if (!lfi->want_type)
1103 int idx = lookup_fnfields_1 (type, lfi->name);
1105 nval = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), idx);
1109 /* Look for a data member or type. */
1110 nval = lookup_field_1 (type, lfi->name, lfi->want_type);
1112 /* If there is no declaration with the indicated name in this type,
1113 then there's nothing to do. */
1117 /* If we're looking up a type (as with an elaborated type specifier)
1118 we ignore all non-types we find. */
1119 if (lfi->want_type && TREE_CODE (nval) != TYPE_DECL
1120 && !DECL_CLASS_TEMPLATE_P (nval))
1122 if (lfi->name == TYPE_IDENTIFIER (type))
1124 /* If the aggregate has no user defined constructors, we allow
1125 it to have fields with the same name as the enclosing type.
1126 If we are looking for that name, find the corresponding
1128 for (nval = TREE_CHAIN (nval); nval; nval = TREE_CHAIN (nval))
1129 if (DECL_NAME (nval) == lfi->name
1130 && TREE_CODE (nval) == TYPE_DECL)
1135 if (!nval && CLASSTYPE_NESTED_UTDS (type) != NULL)
1137 binding_entry e = binding_table_find (CLASSTYPE_NESTED_UTDS (type),
1140 nval = TYPE_MAIN_DECL (e->type);
1146 /* You must name a template base class with a template-id. */
1147 if (!same_type_p (type, lfi->type)
1148 && template_self_reference_p (type, nval))
1151 /* If the lookup already found a match, and the new value doesn't
1152 hide the old one, we might have an ambiguity. */
1153 if (lfi->rval_binfo && !original_binfo (lfi->rval_binfo, binfo))
1155 if (nval == lfi->rval && shared_member_p (nval))
1156 /* The two things are really the same. */
1158 else if (original_binfo (binfo, lfi->rval_binfo))
1159 /* The previous value hides the new one. */
1163 /* We have a real ambiguity. We keep a chain of all the
1165 if (!lfi->ambiguous && lfi->rval)
1167 /* This is the first time we noticed an ambiguity. Add
1168 what we previously thought was a reasonable candidate
1170 lfi->ambiguous = tree_cons (NULL_TREE, lfi->rval, NULL_TREE);
1171 TREE_TYPE (lfi->ambiguous) = error_mark_node;
1174 /* Add the new value. */
1175 lfi->ambiguous = tree_cons (NULL_TREE, nval, lfi->ambiguous);
1176 TREE_TYPE (lfi->ambiguous) = error_mark_node;
1177 lfi->errstr = "request for member `%D' is ambiguous";
1183 lfi->rval_binfo = binfo;
1189 /* Return a "baselink" which BASELINK_BINFO, BASELINK_ACCESS_BINFO,
1190 BASELINK_FUNCTIONS, and BASELINK_OPTYPE set to BINFO, ACCESS_BINFO,
1191 FUNCTIONS, and OPTYPE respectively. */
1194 build_baselink (tree binfo, tree access_binfo, tree functions, tree optype)
1198 my_friendly_assert (TREE_CODE (functions) == FUNCTION_DECL
1199 || TREE_CODE (functions) == TEMPLATE_DECL
1200 || TREE_CODE (functions) == TEMPLATE_ID_EXPR
1201 || TREE_CODE (functions) == OVERLOAD,
1203 my_friendly_assert (!optype || TYPE_P (optype), 20020730);
1204 my_friendly_assert (TREE_TYPE (functions), 20020805);
1206 baselink = make_node (BASELINK);
1207 TREE_TYPE (baselink) = TREE_TYPE (functions);
1208 BASELINK_BINFO (baselink) = binfo;
1209 BASELINK_ACCESS_BINFO (baselink) = access_binfo;
1210 BASELINK_FUNCTIONS (baselink) = functions;
1211 BASELINK_OPTYPE (baselink) = optype;
1216 /* Look for a member named NAME in an inheritance lattice dominated by
1217 XBASETYPE. If PROTECT is 0 or two, we do not check access. If it
1218 is 1, we enforce accessibility. If PROTECT is zero, then, for an
1219 ambiguous lookup, we return NULL. If PROTECT is 1, we issue error
1220 messages about inaccessible or ambiguous lookup. If PROTECT is 2,
1221 we return a TREE_LIST whose TREE_TYPE is error_mark_node and whose
1222 TREE_VALUEs are the list of ambiguous candidates.
1224 WANT_TYPE is 1 when we should only return TYPE_DECLs.
1226 If nothing can be found return NULL_TREE and do not issue an error. */
1229 lookup_member (tree xbasetype, tree name, int protect, bool want_type)
1231 tree rval, rval_binfo = NULL_TREE;
1232 tree type = NULL_TREE, basetype_path = NULL_TREE;
1233 struct lookup_field_info lfi;
1235 /* rval_binfo is the binfo associated with the found member, note,
1236 this can be set with useful information, even when rval is not
1237 set, because it must deal with ALL members, not just non-function
1238 members. It is used for ambiguity checking and the hidden
1239 checks. Whereas rval is only set if a proper (not hidden)
1240 non-function member is found. */
1242 const char *errstr = 0;
1244 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 20030624);
1246 if (TREE_CODE (xbasetype) == TREE_VEC)
1248 type = BINFO_TYPE (xbasetype);
1249 basetype_path = xbasetype;
1253 my_friendly_assert (IS_AGGR_TYPE_CODE (TREE_CODE (xbasetype)), 20030624);
1255 basetype_path = TYPE_BINFO (type);
1256 my_friendly_assert (!BINFO_INHERITANCE_CHAIN (basetype_path), 980827);
1259 if (type == current_class_type && TYPE_BEING_DEFINED (type)
1260 && IDENTIFIER_CLASS_VALUE (name))
1262 tree field = IDENTIFIER_CLASS_VALUE (name);
1263 if (! is_overloaded_fn (field)
1264 && ! (want_type && TREE_CODE (field) != TYPE_DECL))
1265 /* We're in the scope of this class, and the value has already
1266 been looked up. Just return the cached value. */
1270 complete_type (type);
1272 #ifdef GATHER_STATISTICS
1273 n_calls_lookup_field++;
1274 #endif /* GATHER_STATISTICS */
1276 memset (&lfi, 0, sizeof (lfi));
1279 lfi.want_type = want_type;
1280 bfs_walk (basetype_path, &lookup_field_r, &lookup_field_queue_p, &lfi);
1282 rval_binfo = lfi.rval_binfo;
1284 type = BINFO_TYPE (rval_binfo);
1285 errstr = lfi.errstr;
1287 /* If we are not interested in ambiguities, don't report them;
1288 just return NULL_TREE. */
1289 if (!protect && lfi.ambiguous)
1295 return lfi.ambiguous;
1302 In the case of overloaded function names, access control is
1303 applied to the function selected by overloaded resolution. */
1304 if (rval && protect && !is_overloaded_fn (rval))
1305 perform_or_defer_access_check (basetype_path, rval);
1307 if (errstr && protect)
1309 error (errstr, name, type);
1311 print_candidates (lfi.ambiguous);
1312 rval = error_mark_node;
1315 if (rval && is_overloaded_fn (rval))
1316 rval = build_baselink (rval_binfo, basetype_path, rval,
1317 (IDENTIFIER_TYPENAME_P (name)
1318 ? TREE_TYPE (name): NULL_TREE));
1322 /* Like lookup_member, except that if we find a function member we
1323 return NULL_TREE. */
1326 lookup_field (tree xbasetype, tree name, int protect, bool want_type)
1328 tree rval = lookup_member (xbasetype, name, protect, want_type);
1330 /* Ignore functions. */
1331 if (rval && BASELINK_P (rval))
1337 /* Like lookup_member, except that if we find a non-function member we
1338 return NULL_TREE. */
1341 lookup_fnfields (tree xbasetype, tree name, int protect)
1343 tree rval = lookup_member (xbasetype, name, protect, /*want_type=*/false);
1345 /* Ignore non-functions. */
1346 if (rval && !BASELINK_P (rval))
1352 /* Return the index in the CLASSTYPE_METHOD_VEC for CLASS_TYPE
1353 corresponding to "operator TYPE ()", or -1 if there is no such
1354 operator. Only CLASS_TYPE itself is searched; this routine does
1355 not scan the base classes of CLASS_TYPE. */
1358 lookup_conversion_operator (tree class_type, tree type)
1363 tree methods = CLASSTYPE_METHOD_VEC (class_type);
1365 for (pass = 0; pass < 2; ++pass)
1366 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
1367 i < TREE_VEC_LENGTH (methods);
1370 tree fn = TREE_VEC_ELT (methods, i);
1371 /* The size of the vector may have some unused slots at the
1376 /* All the conversion operators come near the beginning of the
1377 class. Therefore, if FN is not a conversion operator, there
1378 is no matching conversion operator in CLASS_TYPE. */
1379 fn = OVL_CURRENT (fn);
1380 if (!DECL_CONV_FN_P (fn))
1385 /* On the first pass we only consider exact matches. If
1386 the types match, this slot is the one where the right
1387 conversion operators can be found. */
1388 if (TREE_CODE (fn) != TEMPLATE_DECL
1389 && same_type_p (DECL_CONV_FN_TYPE (fn), type))
1394 /* On the second pass we look for template conversion
1395 operators. It may be possible to instantiate the
1396 template to get the type desired. All of the template
1397 conversion operators share a slot. By looking for
1398 templates second we ensure that specializations are
1399 preferred over templates. */
1400 if (TREE_CODE (fn) == TEMPLATE_DECL)
1408 /* TYPE is a class type. Return the index of the fields within
1409 the method vector with name NAME, or -1 is no such field exists. */
1412 lookup_fnfields_1 (tree type, tree name)
1420 if (!CLASS_TYPE_P (type))
1423 method_vec = CLASSTYPE_METHOD_VEC (type);
1428 methods = &TREE_VEC_ELT (method_vec, 0);
1429 len = TREE_VEC_LENGTH (method_vec);
1431 #ifdef GATHER_STATISTICS
1432 n_calls_lookup_fnfields_1++;
1433 #endif /* GATHER_STATISTICS */
1435 /* Constructors are first... */
1436 if (name == ctor_identifier)
1437 return (methods[CLASSTYPE_CONSTRUCTOR_SLOT]
1438 ? CLASSTYPE_CONSTRUCTOR_SLOT : -1);
1439 /* and destructors are second. */
1440 if (name == dtor_identifier)
1441 return (methods[CLASSTYPE_DESTRUCTOR_SLOT]
1442 ? CLASSTYPE_DESTRUCTOR_SLOT : -1);
1443 if (IDENTIFIER_TYPENAME_P (name))
1444 return lookup_conversion_operator (type, TREE_TYPE (name));
1446 /* Skip the conversion operators. */
1447 i = CLASSTYPE_FIRST_CONVERSION_SLOT;
1448 while (i < len && methods[i] && DECL_CONV_FN_P (OVL_CURRENT (methods[i])))
1451 /* If the type is complete, use binary search. */
1452 if (COMPLETE_TYPE_P (type))
1461 #ifdef GATHER_STATISTICS
1462 n_outer_fields_searched++;
1463 #endif /* GATHER_STATISTICS */
1466 /* This slot may be empty; we allocate more slots than we
1467 need. In that case, the entry we're looking for is
1468 closer to the beginning of the list. */
1470 tmp = DECL_NAME (OVL_CURRENT (tmp));
1471 if (!tmp || tmp > name)
1473 else if (tmp < name)
1480 for (; i < len && methods[i]; ++i)
1482 #ifdef GATHER_STATISTICS
1483 n_outer_fields_searched++;
1484 #endif /* GATHER_STATISTICS */
1486 tmp = OVL_CURRENT (methods[i]);
1487 if (DECL_NAME (tmp) == name)
1494 /* DECL is the result of a qualified name lookup. QUALIFYING_SCOPE is
1495 the class or namespace used to qualify the name. CONTEXT_CLASS is
1496 the class corresponding to the object in which DECL will be used.
1497 Return a possibly modified version of DECL that takes into account
1500 In particular, consider an expression like `B::m' in the context of
1501 a derived class `D'. If `B::m' has been resolved to a BASELINK,
1502 then the most derived class indicated by the BASELINK_BINFO will be
1503 `B', not `D'. This function makes that adjustment. */
1506 adjust_result_of_qualified_name_lookup (tree decl,
1507 tree qualifying_scope,
1510 if (context_class && CLASS_TYPE_P (qualifying_scope)
1511 && DERIVED_FROM_P (qualifying_scope, context_class)
1512 && BASELINK_P (decl))
1516 my_friendly_assert (CLASS_TYPE_P (context_class), 20020808);
1518 /* Look for the QUALIFYING_SCOPE as a base of the CONTEXT_CLASS.
1519 Because we do not yet know which function will be chosen by
1520 overload resolution, we cannot yet check either accessibility
1521 or ambiguity -- in either case, the choice of a static member
1522 function might make the usage valid. */
1523 base = lookup_base (context_class, qualifying_scope,
1524 ba_ignore | ba_quiet, NULL);
1527 BASELINK_ACCESS_BINFO (decl) = base;
1528 BASELINK_BINFO (decl)
1529 = lookup_base (base, BINFO_TYPE (BASELINK_BINFO (decl)),
1530 ba_ignore | ba_quiet,
1539 /* Walk the class hierarchy dominated by TYPE. FN is called for each
1540 type in the hierarchy, in a breadth-first preorder traversal.
1541 If it ever returns a non-NULL value, that value is immediately
1542 returned and the walk is terminated. At each node, FN is passed a
1543 BINFO indicating the path from the currently visited base-class to
1544 TYPE. Before each base-class is walked QFN is called. If the
1545 value returned is nonzero, the base-class is walked; otherwise it
1546 is not. If QFN is NULL, it is treated as a function which always
1547 returns 1. Both FN and QFN are passed the DATA whenever they are
1550 Implementation notes: Uses a circular queue, which starts off on
1551 the stack but gets moved to the malloc arena if it needs to be
1552 enlarged. The underflow and overflow conditions are
1553 indistinguishable except by context: if head == tail and we just
1554 moved the head pointer, the queue is empty, but if we just moved
1555 the tail pointer, the queue is full.
1556 Start with enough room for ten concurrent base classes. That
1557 will be enough for most hierarchies. */
1558 #define BFS_WALK_INITIAL_QUEUE_SIZE 10
1561 bfs_walk (tree binfo,
1562 tree (*fn) (tree, void *),
1563 tree (*qfn) (tree, int, void *),
1566 tree rval = NULL_TREE;
1568 tree bases_initial[BFS_WALK_INITIAL_QUEUE_SIZE];
1569 /* A circular queue of the base classes of BINFO. These will be
1570 built up in breadth-first order, except where QFN prunes the
1573 size_t base_buffer_size = BFS_WALK_INITIAL_QUEUE_SIZE;
1574 tree *base_buffer = bases_initial;
1577 base_buffer[tail++] = binfo;
1579 while (head != tail)
1582 tree binfo = base_buffer[head++];
1583 if (head == base_buffer_size)
1586 /* Is this the one we're looking for? If so, we're done. */
1587 rval = fn (binfo, data);
1591 n_bases = BINFO_N_BASETYPES (binfo);
1592 for (ix = 0; ix != n_bases; ix++)
1597 base_binfo = (*qfn) (binfo, ix, data);
1599 base_binfo = BINFO_BASETYPE (binfo, ix);
1603 base_buffer[tail++] = base_binfo;
1604 if (tail == base_buffer_size)
1608 tree *new_buffer = xmalloc (2 * base_buffer_size
1610 memcpy (&new_buffer[0], &base_buffer[0],
1611 tail * sizeof (tree));
1612 memcpy (&new_buffer[head + base_buffer_size],
1614 (base_buffer_size - head) * sizeof (tree));
1615 if (base_buffer_size != BFS_WALK_INITIAL_QUEUE_SIZE)
1617 base_buffer = new_buffer;
1618 head += base_buffer_size;
1619 base_buffer_size *= 2;
1626 if (base_buffer_size != BFS_WALK_INITIAL_QUEUE_SIZE)
1631 /* Exactly like bfs_walk, except that a depth-first traversal is
1632 performed, and PREFN is called in preorder, while POSTFN is called
1636 dfs_walk_real (tree binfo,
1637 tree (*prefn) (tree, void *),
1638 tree (*postfn) (tree, void *),
1639 tree (*qfn) (tree, int, void *),
1642 tree rval = NULL_TREE;
1644 /* Call the pre-order walking function. */
1647 rval = (*prefn) (binfo, data);
1652 /* Process the basetypes. */
1653 if (BINFO_BASETYPES (binfo))
1655 int i, n = TREE_VEC_LENGTH (BINFO_BASETYPES (binfo));
1656 for (i = 0; i != n; i++)
1661 base_binfo = (*qfn) (binfo, i, data);
1663 base_binfo = BINFO_BASETYPE (binfo, i);
1667 rval = dfs_walk_real (base_binfo, prefn, postfn, qfn, data);
1674 /* Call the post-order walking function. */
1676 rval = (*postfn) (binfo, data);
1681 /* Exactly like bfs_walk, except that a depth-first post-order traversal is
1685 dfs_walk (tree binfo,
1686 tree (*fn) (tree, void *),
1687 tree (*qfn) (tree, int, void *),
1690 return dfs_walk_real (binfo, 0, fn, qfn, data);
1693 /* Check that virtual overrider OVERRIDER is acceptable for base function
1694 BASEFN. Issue diagnostic, and return zero, if unacceptable. */
1697 check_final_overrider (tree overrider, tree basefn)
1699 tree over_type = TREE_TYPE (overrider);
1700 tree base_type = TREE_TYPE (basefn);
1701 tree over_return = TREE_TYPE (over_type);
1702 tree base_return = TREE_TYPE (base_type);
1703 tree over_throw = TYPE_RAISES_EXCEPTIONS (over_type);
1704 tree base_throw = TYPE_RAISES_EXCEPTIONS (base_type);
1707 if (DECL_INVALID_OVERRIDER_P (overrider))
1710 if (same_type_p (base_return, over_return))
1712 else if ((CLASS_TYPE_P (over_return) && CLASS_TYPE_P (base_return))
1713 || (TREE_CODE (base_return) == TREE_CODE (over_return)
1714 && POINTER_TYPE_P (base_return)))
1716 /* Potentially covariant. */
1717 unsigned base_quals, over_quals;
1719 fail = !POINTER_TYPE_P (base_return);
1722 fail = cp_type_quals (base_return) != cp_type_quals (over_return);
1724 base_return = TREE_TYPE (base_return);
1725 over_return = TREE_TYPE (over_return);
1727 base_quals = cp_type_quals (base_return);
1728 over_quals = cp_type_quals (over_return);
1730 if ((base_quals & over_quals) != over_quals)
1733 if (CLASS_TYPE_P (base_return) && CLASS_TYPE_P (over_return))
1735 tree binfo = lookup_base (over_return, base_return,
1736 ba_check | ba_quiet, NULL);
1742 && can_convert (TREE_TYPE (base_type), TREE_TYPE (over_type)))
1743 /* GNU extension, allow trivial pointer conversions such as
1744 converting to void *, or qualification conversion. */
1746 /* can_convert will permit user defined conversion from a
1747 (reference to) class type. We must reject them. */
1748 over_return = non_reference (TREE_TYPE (over_type));
1749 if (CLASS_TYPE_P (over_return))
1763 cp_error_at ("invalid covariant return type for `%#D'", overrider);
1764 cp_error_at (" overriding `%#D'", basefn);
1768 cp_error_at ("conflicting return type specified for `%#D'",
1770 cp_error_at (" overriding `%#D'", basefn);
1772 DECL_INVALID_OVERRIDER_P (overrider) = 1;
1776 /* Check throw specifier is at least as strict. */
1777 if (!comp_except_specs (base_throw, over_throw, 0))
1779 cp_error_at ("looser throw specifier for `%#F'", overrider);
1780 cp_error_at (" overriding `%#F'", basefn);
1781 DECL_INVALID_OVERRIDER_P (overrider) = 1;
1788 /* Given a class TYPE, and a function decl FNDECL, look for
1789 virtual functions in TYPE's hierarchy which FNDECL overrides.
1790 We do not look in TYPE itself, only its bases.
1792 Returns nonzero, if we find any. Set FNDECL's DECL_VIRTUAL_P, if we
1793 find that it overrides anything.
1795 We check that every function which is overridden, is correctly
1799 look_for_overrides (tree type, tree fndecl)
1801 tree binfo = TYPE_BINFO (type);
1802 tree basebinfos = BINFO_BASETYPES (binfo);
1803 int nbasebinfos = basebinfos ? TREE_VEC_LENGTH (basebinfos) : 0;
1807 for (ix = 0; ix != nbasebinfos; ix++)
1809 tree basetype = BINFO_TYPE (TREE_VEC_ELT (basebinfos, ix));
1811 if (TYPE_POLYMORPHIC_P (basetype))
1812 found += look_for_overrides_r (basetype, fndecl);
1817 /* Look in TYPE for virtual functions with the same signature as
1821 look_for_overrides_here (tree type, tree fndecl)
1825 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fndecl))
1826 ix = CLASSTYPE_DESTRUCTOR_SLOT;
1828 ix = lookup_fnfields_1 (type, DECL_NAME (fndecl));
1831 tree fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), ix);
1833 for (; fns; fns = OVL_NEXT (fns))
1835 tree fn = OVL_CURRENT (fns);
1837 if (!DECL_VIRTUAL_P (fn))
1838 /* Not a virtual. */;
1839 else if (DECL_CONTEXT (fn) != type)
1840 /* Introduced with a using declaration. */;
1841 else if (DECL_STATIC_FUNCTION_P (fndecl))
1843 tree btypes = TYPE_ARG_TYPES (TREE_TYPE (fn));
1844 tree dtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1845 if (compparms (TREE_CHAIN (btypes), dtypes))
1848 else if (same_signature_p (fndecl, fn))
1855 /* Look in TYPE for virtual functions overridden by FNDECL. Check both
1856 TYPE itself and its bases. */
1859 look_for_overrides_r (tree type, tree fndecl)
1861 tree fn = look_for_overrides_here (type, fndecl);
1864 if (DECL_STATIC_FUNCTION_P (fndecl))
1866 /* A static member function cannot match an inherited
1867 virtual member function. */
1868 cp_error_at ("`%#D' cannot be declared", fndecl);
1869 cp_error_at (" since `%#D' declared in base class", fn);
1873 /* It's definitely virtual, even if not explicitly set. */
1874 DECL_VIRTUAL_P (fndecl) = 1;
1875 check_final_overrider (fndecl, fn);
1880 /* We failed to find one declared in this class. Look in its bases. */
1881 return look_for_overrides (type, fndecl);
1884 /* Called via dfs_walk from dfs_get_pure_virtuals. */
1887 dfs_get_pure_virtuals (tree binfo, void *data)
1889 tree type = (tree) data;
1891 /* We're not interested in primary base classes; the derived class
1892 of which they are a primary base will contain the information we
1894 if (!BINFO_PRIMARY_P (binfo))
1898 for (virtuals = BINFO_VIRTUALS (binfo);
1900 virtuals = TREE_CHAIN (virtuals))
1901 if (DECL_PURE_VIRTUAL_P (BV_FN (virtuals)))
1902 CLASSTYPE_PURE_VIRTUALS (type)
1903 = tree_cons (NULL_TREE, BV_FN (virtuals),
1904 CLASSTYPE_PURE_VIRTUALS (type));
1907 BINFO_MARKED (binfo) = 1;
1912 /* Set CLASSTYPE_PURE_VIRTUALS for TYPE. */
1915 get_pure_virtuals (tree type)
1919 /* Clear the CLASSTYPE_PURE_VIRTUALS list; whatever is already there
1920 is going to be overridden. */
1921 CLASSTYPE_PURE_VIRTUALS (type) = NULL_TREE;
1922 /* Now, run through all the bases which are not primary bases, and
1923 collect the pure virtual functions. We look at the vtable in
1924 each class to determine what pure virtual functions are present.
1925 (A primary base is not interesting because the derived class of
1926 which it is a primary base will contain vtable entries for the
1927 pure virtuals in the base class. */
1928 dfs_walk (TYPE_BINFO (type), dfs_get_pure_virtuals, unmarkedp, type);
1929 dfs_walk (TYPE_BINFO (type), dfs_unmark, markedp, type);
1931 /* Put the pure virtuals in dfs order. */
1932 CLASSTYPE_PURE_VIRTUALS (type) = nreverse (CLASSTYPE_PURE_VIRTUALS (type));
1934 for (vbases = CLASSTYPE_VBASECLASSES (type);
1936 vbases = TREE_CHAIN (vbases))
1940 for (virtuals = BINFO_VIRTUALS (TREE_VALUE (vbases));
1942 virtuals = TREE_CHAIN (virtuals))
1944 tree base_fndecl = BV_FN (virtuals);
1945 if (DECL_NEEDS_FINAL_OVERRIDER_P (base_fndecl))
1946 error ("`%#D' needs a final overrider", base_fndecl);
1951 /* DEPTH-FIRST SEARCH ROUTINES. */
1954 markedp (tree derived, int ix, void *data ATTRIBUTE_UNUSED)
1956 tree binfo = BINFO_BASETYPE (derived, ix);
1958 return BINFO_MARKED (binfo) ? binfo : NULL_TREE;
1962 unmarkedp (tree derived, int ix, void *data ATTRIBUTE_UNUSED)
1964 tree binfo = BINFO_BASETYPE (derived, ix);
1966 return !BINFO_MARKED (binfo) ? binfo : NULL_TREE;
1970 marked_pushdecls_p (tree derived, int ix, void *data ATTRIBUTE_UNUSED)
1972 tree binfo = BINFO_BASETYPE (derived, ix);
1974 return (!BINFO_DEPENDENT_BASE_P (binfo)
1975 && BINFO_PUSHDECLS_MARKED (binfo)) ? binfo : NULL_TREE;
1979 unmarked_pushdecls_p (tree derived, int ix, void *data ATTRIBUTE_UNUSED)
1981 tree binfo = BINFO_BASETYPE (derived, ix);
1983 return (!BINFO_DEPENDENT_BASE_P (binfo)
1984 && !BINFO_PUSHDECLS_MARKED (binfo)) ? binfo : NULL_TREE;
1987 /* The worker functions for `dfs_walk'. These do not need to
1988 test anything (vis a vis marking) if they are paired with
1989 a predicate function (above). */
1992 dfs_unmark (tree binfo, void *data ATTRIBUTE_UNUSED)
1994 BINFO_MARKED (binfo) = 0;
1999 /* Debug info for C++ classes can get very large; try to avoid
2000 emitting it everywhere.
2002 Note that this optimization wins even when the target supports
2003 BINCL (if only slightly), and reduces the amount of work for the
2007 maybe_suppress_debug_info (tree t)
2009 /* We can't do the usual TYPE_DECL_SUPPRESS_DEBUG thing with DWARF, which
2010 does not support name references between translation units. It supports
2011 symbolic references between translation units, but only within a single
2012 executable or shared library.
2014 For DWARF 2, we handle TYPE_DECL_SUPPRESS_DEBUG by pretending
2015 that the type was never defined, so we only get the members we
2017 if (write_symbols == DWARF_DEBUG || write_symbols == NO_DEBUG)
2020 /* We might have set this earlier in cp_finish_decl. */
2021 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 0;
2023 /* If we already know how we're handling this class, handle debug info
2025 if (CLASSTYPE_INTERFACE_KNOWN (t))
2027 if (CLASSTYPE_INTERFACE_ONLY (t))
2028 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2029 /* else don't set it. */
2031 /* If the class has a vtable, write out the debug info along with
2033 else if (TYPE_CONTAINS_VPTR_P (t))
2034 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2036 /* Otherwise, just emit the debug info normally. */
2039 /* Note that we want debugging information for a base class of a class
2040 whose vtable is being emitted. Normally, this would happen because
2041 calling the constructor for a derived class implies calling the
2042 constructors for all bases, which involve initializing the
2043 appropriate vptr with the vtable for the base class; but in the
2044 presence of optimization, this initialization may be optimized
2045 away, so we tell finish_vtable_vardecl that we want the debugging
2046 information anyway. */
2049 dfs_debug_mark (tree binfo, void *data ATTRIBUTE_UNUSED)
2051 tree t = BINFO_TYPE (binfo);
2053 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
2058 /* Returns BINFO if we haven't already noted that we want debugging
2059 info for this base class. */
2062 dfs_debug_unmarkedp (tree derived, int ix, void *data ATTRIBUTE_UNUSED)
2064 tree binfo = BINFO_BASETYPE (derived, ix);
2066 return (!CLASSTYPE_DEBUG_REQUESTED (BINFO_TYPE (binfo))
2067 ? binfo : NULL_TREE);
2070 /* Write out the debugging information for TYPE, whose vtable is being
2071 emitted. Also walk through our bases and note that we want to
2072 write out information for them. This avoids the problem of not
2073 writing any debug info for intermediate basetypes whose
2074 constructors, and thus the references to their vtables, and thus
2075 the vtables themselves, were optimized away. */
2078 note_debug_info_needed (tree type)
2080 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)))
2082 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)) = 0;
2083 rest_of_type_compilation (type, toplevel_bindings_p ());
2086 dfs_walk (TYPE_BINFO (type), dfs_debug_mark, dfs_debug_unmarkedp, 0);
2089 /* Subroutines of push_class_decls (). */
2092 setup_class_bindings (tree name, int type_binding_p)
2094 tree type_binding = NULL_TREE;
2097 /* If we've already done the lookup for this declaration, we're
2099 if (IDENTIFIER_CLASS_VALUE (name))
2102 /* First, deal with the type binding. */
2105 type_binding = lookup_member (current_class_type, name,
2106 /*protect=*/2, /*want_type=*/true);
2107 if (TREE_CODE (type_binding) == TREE_LIST
2108 && TREE_TYPE (type_binding) == error_mark_node)
2109 /* NAME is ambiguous. */
2110 push_class_level_binding (name, type_binding);
2112 pushdecl_class_level (type_binding);
2115 /* Now, do the value binding. */
2116 value_binding = lookup_member (current_class_type, name,
2117 /*protect=*/2, /*want_type=*/false);
2120 && (TREE_CODE (value_binding) == TYPE_DECL
2121 || DECL_CLASS_TEMPLATE_P (value_binding)
2122 || (TREE_CODE (value_binding) == TREE_LIST
2123 && TREE_TYPE (value_binding) == error_mark_node
2124 && (TREE_CODE (TREE_VALUE (value_binding))
2126 /* We found a type-binding, even when looking for a non-type
2127 binding. This means that we already processed this binding
2129 else if (value_binding)
2131 if (TREE_CODE (value_binding) == TREE_LIST
2132 && TREE_TYPE (value_binding) == error_mark_node)
2133 /* NAME is ambiguous. */
2134 push_class_level_binding (name, value_binding);
2137 if (BASELINK_P (value_binding))
2138 /* NAME is some overloaded functions. */
2139 value_binding = BASELINK_FUNCTIONS (value_binding);
2140 /* Two conversion operators that convert to the same type
2141 may have different names. (See
2142 mangle_conv_op_name_for_type.) To avoid recording the
2143 same conversion operator declaration more than once we
2144 must check to see that the same operator was not already
2145 found under another name. */
2146 if (IDENTIFIER_TYPENAME_P (name)
2147 && is_overloaded_fn (value_binding))
2150 for (fns = value_binding; fns; fns = OVL_NEXT (fns))
2151 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (OVL_CURRENT (fns))))
2154 pushdecl_class_level (value_binding);
2159 /* Push class-level declarations for any names appearing in BINFO that
2163 dfs_push_type_decls (tree binfo, void *data ATTRIBUTE_UNUSED)
2168 type = BINFO_TYPE (binfo);
2169 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2170 if (DECL_NAME (fields) && TREE_CODE (fields) == TYPE_DECL
2171 && !(!same_type_p (type, current_class_type)
2172 && template_self_reference_p (type, fields)))
2173 setup_class_bindings (DECL_NAME (fields), /*type_binding_p=*/1);
2175 /* We can't just use BINFO_MARKED because envelope_add_decl uses
2176 DERIVED_FROM_P, which calls get_base_distance. */
2177 BINFO_PUSHDECLS_MARKED (binfo) = 1;
2182 /* Push class-level declarations for any names appearing in BINFO that
2183 are not TYPE_DECLS. */
2186 dfs_push_decls (tree binfo, void *data)
2188 tree type = BINFO_TYPE (binfo);
2192 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2193 if (DECL_NAME (fields)
2194 && TREE_CODE (fields) != TYPE_DECL
2195 && TREE_CODE (fields) != USING_DECL
2196 && !DECL_ARTIFICIAL (fields))
2197 setup_class_bindings (DECL_NAME (fields), /*type_binding_p=*/0);
2198 else if (TREE_CODE (fields) == FIELD_DECL
2199 && ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
2200 dfs_push_decls (TYPE_BINFO (TREE_TYPE (fields)), data);
2202 method_vec = (CLASS_TYPE_P (type)
2203 ? CLASSTYPE_METHOD_VEC (type) : NULL_TREE);
2205 if (method_vec && TREE_VEC_LENGTH (method_vec) >= 3)
2210 /* Farm out constructors and destructors. */
2211 end = TREE_VEC_END (method_vec);
2213 for (methods = &TREE_VEC_ELT (method_vec, 2);
2214 methods < end && *methods;
2216 setup_class_bindings (DECL_NAME (OVL_CURRENT (*methods)),
2217 /*type_binding_p=*/0);
2220 BINFO_PUSHDECLS_MARKED (binfo) = 0;
2225 /* When entering the scope of a class, we cache all of the
2226 fields that that class provides within its inheritance
2227 lattice. Where ambiguities result, we mark them
2228 with `error_mark_node' so that if they are encountered
2229 without explicit qualification, we can emit an error
2233 push_class_decls (tree type)
2235 search_stack = push_search_level (search_stack, &search_obstack);
2237 /* Enter type declarations and mark. */
2238 dfs_walk (TYPE_BINFO (type), dfs_push_type_decls, unmarked_pushdecls_p, 0);
2240 /* Enter non-type declarations and unmark. */
2241 dfs_walk (TYPE_BINFO (type), dfs_push_decls, marked_pushdecls_p, 0);
2244 /* Here's a subroutine we need because C lacks lambdas. */
2247 dfs_unuse_fields (tree binfo, void *data ATTRIBUTE_UNUSED)
2249 tree type = TREE_TYPE (binfo);
2252 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2254 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
2257 TREE_USED (fields) = 0;
2258 if (DECL_NAME (fields) == NULL_TREE
2259 && ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
2260 unuse_fields (TREE_TYPE (fields));
2267 unuse_fields (tree type)
2269 dfs_walk (TYPE_BINFO (type), dfs_unuse_fields, unmarkedp, 0);
2273 pop_class_decls (void)
2275 /* We haven't pushed a search level when dealing with cached classes,
2276 so we'd better not try to pop it. */
2278 search_stack = pop_search_level (search_stack);
2282 print_search_statistics (void)
2284 #ifdef GATHER_STATISTICS
2285 fprintf (stderr, "%d fields searched in %d[%d] calls to lookup_field[_1]\n",
2286 n_fields_searched, n_calls_lookup_field, n_calls_lookup_field_1);
2287 fprintf (stderr, "%d fnfields searched in %d calls to lookup_fnfields\n",
2288 n_outer_fields_searched, n_calls_lookup_fnfields);
2289 fprintf (stderr, "%d calls to get_base_type\n", n_calls_get_base_type);
2290 #else /* GATHER_STATISTICS */
2291 fprintf (stderr, "no search statistics\n");
2292 #endif /* GATHER_STATISTICS */
2296 init_search_processing (void)
2298 gcc_obstack_init (&search_obstack);
2302 reinit_search_statistics (void)
2304 #ifdef GATHER_STATISTICS
2305 n_fields_searched = 0;
2306 n_calls_lookup_field = 0, n_calls_lookup_field_1 = 0;
2307 n_calls_lookup_fnfields = 0, n_calls_lookup_fnfields_1 = 0;
2308 n_calls_get_base_type = 0;
2309 n_outer_fields_searched = 0;
2310 n_contexts_saved = 0;
2311 #endif /* GATHER_STATISTICS */
2315 add_conversions (tree binfo, void *data)
2318 tree method_vec = CLASSTYPE_METHOD_VEC (BINFO_TYPE (binfo));
2319 tree *conversions = (tree *) data;
2321 /* Some builtin types have no method vector, not even an empty one. */
2325 for (i = 2; i < TREE_VEC_LENGTH (method_vec); ++i)
2327 tree tmp = TREE_VEC_ELT (method_vec, i);
2330 if (!tmp || ! DECL_CONV_FN_P (OVL_CURRENT (tmp)))
2333 name = DECL_NAME (OVL_CURRENT (tmp));
2335 /* Make sure we don't already have this conversion. */
2336 if (! IDENTIFIER_MARKED (name))
2340 /* Make sure that we do not already have a conversion
2341 operator for this type. Merely checking the NAME is not
2342 enough because two conversion operators to the same type
2343 may not have the same NAME. */
2344 for (t = *conversions; t; t = TREE_CHAIN (t))
2347 for (fn = TREE_VALUE (t); fn; fn = OVL_NEXT (fn))
2348 if (same_type_p (TREE_TYPE (name),
2349 DECL_CONV_FN_TYPE (OVL_CURRENT (fn))))
2356 *conversions = tree_cons (binfo, tmp, *conversions);
2357 IDENTIFIER_MARKED (name) = 1;
2364 /* Return a TREE_LIST containing all the non-hidden user-defined
2365 conversion functions for TYPE (and its base-classes). The
2366 TREE_VALUE of each node is a FUNCTION_DECL or an OVERLOAD
2367 containing the conversion functions. The TREE_PURPOSE is the BINFO
2368 from which the conversion functions in this node were selected. */
2371 lookup_conversions (tree type)
2374 tree conversions = NULL_TREE;
2376 complete_type (type);
2377 bfs_walk (TYPE_BINFO (type), add_conversions, 0, &conversions);
2379 for (t = conversions; t; t = TREE_CHAIN (t))
2380 IDENTIFIER_MARKED (DECL_NAME (OVL_CURRENT (TREE_VALUE (t)))) = 0;
2391 /* Check whether the empty class indicated by EMPTY_BINFO is also present
2392 at offset 0 in COMPARE_TYPE, and set found_overlap if so. */
2395 dfs_check_overlap (tree empty_binfo, void *data)
2397 struct overlap_info *oi = (struct overlap_info *) data;
2399 for (binfo = TYPE_BINFO (oi->compare_type);
2401 binfo = BINFO_BASETYPE (binfo, 0))
2403 if (BINFO_TYPE (binfo) == BINFO_TYPE (empty_binfo))
2405 oi->found_overlap = 1;
2408 else if (BINFO_BASETYPES (binfo) == NULL_TREE)
2415 /* Trivial function to stop base traversal when we find something. */
2418 dfs_no_overlap_yet (tree derived, int ix, void *data)
2420 tree binfo = BINFO_BASETYPE (derived, ix);
2421 struct overlap_info *oi = (struct overlap_info *) data;
2423 return !oi->found_overlap ? binfo : NULL_TREE;
2426 /* Returns nonzero if EMPTY_TYPE or any of its bases can also be found at
2427 offset 0 in NEXT_TYPE. Used in laying out empty base class subobjects. */
2430 types_overlap_p (tree empty_type, tree next_type)
2432 struct overlap_info oi;
2434 if (! IS_AGGR_TYPE (next_type))
2436 oi.compare_type = next_type;
2437 oi.found_overlap = 0;
2438 dfs_walk (TYPE_BINFO (empty_type), dfs_check_overlap,
2439 dfs_no_overlap_yet, &oi);
2440 return oi.found_overlap;
2443 /* Given a vtable VAR, determine which of the inherited classes the vtable
2444 inherits (in a loose sense) functions from.
2446 FIXME: This does not work with the new ABI. */
2449 binfo_for_vtable (tree var)
2451 tree main_binfo = TYPE_BINFO (DECL_CONTEXT (var));
2452 tree binfos = TYPE_BINFO_BASETYPES (BINFO_TYPE (main_binfo));
2453 int n_baseclasses = CLASSTYPE_N_BASECLASSES (BINFO_TYPE (main_binfo));
2456 for (i = 0; i < n_baseclasses; i++)
2458 tree base_binfo = TREE_VEC_ELT (binfos, i);
2459 if (base_binfo != NULL_TREE && BINFO_VTABLE (base_binfo) == var)
2463 /* If no secondary base classes matched, return the primary base, if
2465 if (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (main_binfo)))
2466 return get_primary_binfo (main_binfo);
2471 /* Returns the binfo of the first direct or indirect virtual base derived
2472 from BINFO, or NULL if binfo is not via virtual. */
2475 binfo_from_vbase (tree binfo)
2477 for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo))
2479 if (TREE_VIA_VIRTUAL (binfo))
2485 /* Returns the binfo of the first direct or indirect virtual base derived
2486 from BINFO up to the TREE_TYPE, LIMIT, or NULL if binfo is not
2490 binfo_via_virtual (tree binfo, tree limit)
2492 for (; binfo && (!limit || !same_type_p (BINFO_TYPE (binfo), limit));
2493 binfo = BINFO_INHERITANCE_CHAIN (binfo))
2495 if (TREE_VIA_VIRTUAL (binfo))
2501 /* BINFO is a base binfo in the complete type BINFO_TYPE (HERE).
2502 Find the equivalent binfo within whatever graph HERE is located.
2503 This is the inverse of original_binfo. */
2506 copied_binfo (tree binfo, tree here)
2508 tree result = NULL_TREE;
2510 if (TREE_VIA_VIRTUAL (binfo))
2514 for (t = here; BINFO_INHERITANCE_CHAIN (t);
2515 t = BINFO_INHERITANCE_CHAIN (t))
2518 result = purpose_member (BINFO_TYPE (binfo),
2519 CLASSTYPE_VBASECLASSES (BINFO_TYPE (t)));
2520 result = TREE_VALUE (result);
2522 else if (BINFO_INHERITANCE_CHAIN (binfo))
2527 base_binfos = copied_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2528 base_binfos = BINFO_BASETYPES (base_binfos);
2529 n = TREE_VEC_LENGTH (base_binfos);
2530 for (ix = 0; ix != n; ix++)
2532 tree base = TREE_VEC_ELT (base_binfos, ix);
2534 if (BINFO_TYPE (base) == BINFO_TYPE (binfo))
2543 my_friendly_assert (BINFO_TYPE (here) == BINFO_TYPE (binfo), 20030202);
2547 my_friendly_assert (result, 20030202);
2551 /* BINFO is some base binfo of HERE, within some other
2552 hierarchy. Return the equivalent binfo, but in the hierarchy
2553 dominated by HERE. This is the inverse of copied_binfo. If BINFO
2554 is not a base binfo of HERE, returns NULL_TREE. */
2557 original_binfo (tree binfo, tree here)
2561 if (BINFO_TYPE (binfo) == BINFO_TYPE (here))
2563 else if (TREE_VIA_VIRTUAL (binfo))
2565 result = purpose_member (BINFO_TYPE (binfo),
2566 CLASSTYPE_VBASECLASSES (BINFO_TYPE (here)));
2568 result = TREE_VALUE (result);
2570 else if (BINFO_INHERITANCE_CHAIN (binfo))
2574 base_binfos = original_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2579 base_binfos = BINFO_BASETYPES (base_binfos);
2580 n = TREE_VEC_LENGTH (base_binfos);
2581 for (ix = 0; ix != n; ix++)
2583 tree base = TREE_VEC_ELT (base_binfos, ix);
2585 if (BINFO_TYPE (base) == BINFO_TYPE (binfo))