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 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"
40 /* Obstack used for remembering decision points of breadth-first. */
42 static struct obstack search_obstack;
44 /* Methods for pushing and popping objects to and from obstacks. */
47 push_stack_level (obstack, tp, size)
48 struct obstack *obstack;
49 char *tp; /* Sony NewsOS 5.0 compiler doesn't like void * here. */
52 struct stack_level *stack;
53 obstack_grow (obstack, tp, size);
54 stack = (struct stack_level *) ((char*)obstack_next_free (obstack) - size);
55 obstack_finish (obstack);
56 stack->obstack = obstack;
57 stack->first = (tree *) obstack_base (obstack);
58 stack->limit = obstack_room (obstack) / sizeof (tree *);
63 pop_stack_level (stack)
64 struct stack_level *stack;
66 struct stack_level *tem = stack;
67 struct obstack *obstack = tem->obstack;
69 obstack_free (obstack, tem);
73 #define search_level stack_level
74 static struct search_level *search_stack;
78 /* The class dominating the hierarchy. */
80 /* A pointer to a complete object of the indicated TYPE. */
85 static tree lookup_field_1 PARAMS ((tree, tree));
86 static int is_subobject_of_p PARAMS ((tree, tree, tree));
87 static int is_subobject_of_p_1 PARAMS ((tree, tree, tree));
88 static tree dfs_check_overlap PARAMS ((tree, void *));
89 static tree dfs_no_overlap_yet PARAMS ((tree, void *));
90 static base_kind lookup_base_r
91 PARAMS ((tree, tree, base_access, int, int, int, tree *));
92 static int dynamic_cast_base_recurse PARAMS ((tree, tree, int, tree *));
93 static tree marked_pushdecls_p PARAMS ((tree, void *));
94 static tree unmarked_pushdecls_p PARAMS ((tree, void *));
95 static tree dfs_debug_unmarkedp PARAMS ((tree, void *));
96 static tree dfs_debug_mark PARAMS ((tree, void *));
97 static tree dfs_get_vbase_types PARAMS ((tree, void *));
98 static tree dfs_push_type_decls PARAMS ((tree, void *));
99 static tree dfs_push_decls PARAMS ((tree, void *));
100 static tree dfs_unuse_fields PARAMS ((tree, void *));
101 static tree add_conversions PARAMS ((tree, void *));
102 static int look_for_overrides_r PARAMS ((tree, tree));
103 static struct search_level *push_search_level
104 PARAMS ((struct stack_level *, struct obstack *));
105 static struct search_level *pop_search_level
106 PARAMS ((struct stack_level *));
108 PARAMS ((tree, tree (*) (tree, void *), tree (*) (tree, void *),
110 static tree lookup_field_queue_p PARAMS ((tree, void *));
111 static int shared_member_p PARAMS ((tree));
112 static tree lookup_field_r PARAMS ((tree, void *));
113 static tree canonical_binfo PARAMS ((tree));
114 static tree shared_marked_p PARAMS ((tree, void *));
115 static tree shared_unmarked_p PARAMS ((tree, void *));
116 static int dependent_base_p PARAMS ((tree));
117 static tree dfs_accessible_queue_p PARAMS ((tree, void *));
118 static tree dfs_accessible_p PARAMS ((tree, void *));
119 static tree dfs_access_in_type PARAMS ((tree, void *));
120 static access_kind access_in_type PARAMS ((tree, tree));
121 static tree dfs_canonical_queue PARAMS ((tree, void *));
122 static tree dfs_assert_unmarked_p PARAMS ((tree, void *));
123 static void assert_canonical_unmarked PARAMS ((tree));
124 static int protected_accessible_p PARAMS ((tree, tree, tree));
125 static int friend_accessible_p PARAMS ((tree, tree, tree));
126 static void setup_class_bindings PARAMS ((tree, int));
127 static int template_self_reference_p PARAMS ((tree, tree));
128 static tree dfs_find_vbase_instance PARAMS ((tree, void *));
129 static tree dfs_get_pure_virtuals PARAMS ((tree, void *));
130 static tree dfs_build_inheritance_graph_order PARAMS ((tree, void *));
132 /* Allocate a level of searching. */
134 static struct search_level *
135 push_search_level (stack, obstack)
136 struct stack_level *stack;
137 struct obstack *obstack;
139 struct search_level tem;
142 return push_stack_level (obstack, (char *)&tem, sizeof (tem));
145 /* Discard a level of search allocation. */
147 static struct search_level *
148 pop_search_level (obstack)
149 struct stack_level *obstack;
151 register struct search_level *stack = pop_stack_level (obstack);
156 /* Variables for gathering statistics. */
157 #ifdef GATHER_STATISTICS
158 static int n_fields_searched;
159 static int n_calls_lookup_field, n_calls_lookup_field_1;
160 static int n_calls_lookup_fnfields, n_calls_lookup_fnfields_1;
161 static int n_calls_get_base_type;
162 static int n_outer_fields_searched;
163 static int n_contexts_saved;
164 #endif /* GATHER_STATISTICS */
167 /* Worker for lookup_base. BINFO is the binfo we are searching at,
168 BASE is the RECORD_TYPE we are searching for. ACCESS is the
169 required access checks. WITHIN_CURRENT_SCOPE, IS_NON_PUBLIC and
170 IS_VIRTUAL indicate how BINFO was reached from the start of the
171 search. WITHIN_CURRENT_SCOPE is true if we met the current scope,
172 or friend thereof (this allows us to determine whether a protected
173 base is accessible or not). IS_NON_PUBLIC indicates whether BINFO
174 is accessible and IS_VIRTUAL indicates if it is morally virtual.
176 If BINFO is of the required type, then *BINFO_PTR is examined to
177 compare with any other instance of BASE we might have already
178 discovered. *BINFO_PTR is initialized and a base_kind return value
179 indicates what kind of base was located.
181 Otherwise BINFO's bases are searched. */
184 lookup_base_r (binfo, base, access, within_current_scope,
185 is_non_public, is_virtual, binfo_ptr)
188 int within_current_scope;
189 int is_non_public; /* inside a non-public part */
190 int is_virtual; /* inside a virtual part */
195 base_kind found = bk_not_base;
197 if (access == ba_check
198 && !within_current_scope
199 && is_friend (BINFO_TYPE (binfo), current_scope ()))
201 /* Do not clear is_non_public here. If A is a private base of B, A
202 is not allowed to convert a B* to an A*. */
203 within_current_scope = 1;
206 if (same_type_p (BINFO_TYPE (binfo), base))
208 /* We have found a base. Check against what we have found
210 found = bk_same_type;
212 found = bk_via_virtual;
214 found = bk_inaccessible;
218 else if (!is_virtual || !tree_int_cst_equal (BINFO_OFFSET (binfo),
219 BINFO_OFFSET (*binfo_ptr)))
221 if (access != ba_any)
223 else if (!is_virtual)
224 /* Prefer a non-virtual base. */
232 bases = BINFO_BASETYPES (binfo);
236 for (i = TREE_VEC_LENGTH (bases); i--;)
238 tree base_binfo = TREE_VEC_ELT (bases, i);
239 int this_non_public = is_non_public;
240 int this_virtual = is_virtual;
243 if (access <= ba_ignore)
245 else if (TREE_VIA_PUBLIC (base_binfo))
247 else if (access == ba_not_special)
249 else if (TREE_VIA_PROTECTED (base_binfo) && within_current_scope)
251 else if (is_friend (BINFO_TYPE (binfo), current_scope ()))
256 if (TREE_VIA_VIRTUAL (base_binfo))
259 bk = lookup_base_r (base_binfo, base,
260 access, within_current_scope,
261 this_non_public, this_virtual,
267 if (access != ba_any)
272 case bk_inaccessible:
273 if (found == bk_not_base)
275 my_friendly_assert (found == bk_via_virtual
276 || found == bk_inaccessible, 20010723);
284 my_friendly_assert (found == bk_not_base, 20010723);
289 if (found != bk_ambig)
300 /* Lookup BASE in the hierarchy dominated by T. Do access checking as
301 ACCESS specifies. Return the binfo we discover (which might not be
302 canonical). If KIND_PTR is non-NULL, fill with information about
303 what kind of base we discovered.
305 If the base is inaccessible, or ambiguous, and the ba_quiet bit is
306 not set in ACCESS, then an error is issued and error_mark_node is
307 returned. If the ba_quiet bit is set, then no error is issued and
308 NULL_TREE is returned. */
311 lookup_base (t, base, access, kind_ptr)
316 tree binfo = NULL; /* The binfo we've found so far. */
320 if (t == error_mark_node || base == error_mark_node)
323 *kind_ptr = bk_not_base;
324 return error_mark_node;
326 my_friendly_assert (TYPE_P (base), 20011127);
334 t_binfo = TYPE_BINFO (t);
336 /* Ensure that the types are instantiated. */
337 t = complete_type (TYPE_MAIN_VARIANT (t));
338 base = complete_type (TYPE_MAIN_VARIANT (base));
340 bk = lookup_base_r (t_binfo, base, access & ~ba_quiet,
345 case bk_inaccessible:
347 if (!(access & ba_quiet))
349 error ("`%T' is an inaccessible base of `%T'", base, t);
350 binfo = error_mark_node;
354 if (access != ba_any)
357 if (!(access & ba_quiet))
359 error ("`%T' is an ambiguous base of `%T'", base, t);
360 binfo = error_mark_node;
373 /* Worker function for get_dynamic_cast_base_type. */
376 dynamic_cast_base_recurse (subtype, binfo, via_virtual, offset_ptr)
386 if (BINFO_TYPE (binfo) == subtype)
392 *offset_ptr = BINFO_OFFSET (binfo);
397 binfos = BINFO_BASETYPES (binfo);
398 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
399 for (i = 0; i < n_baselinks; i++)
401 tree base_binfo = TREE_VEC_ELT (binfos, i);
404 if (!TREE_VIA_PUBLIC (base_binfo))
406 rval = dynamic_cast_base_recurse
407 (subtype, base_binfo,
408 via_virtual || TREE_VIA_VIRTUAL (base_binfo), offset_ptr);
412 worst = worst >= 0 ? -3 : worst;
415 else if (rval == -3 && worst != -1)
421 /* The dynamic cast runtime needs a hint about how the static SUBTYPE type
422 started from is related to the required TARGET type, in order to optimize
423 the inheritance graph search. This information is independent of the
424 current context, and ignores private paths, hence get_base_distance is
425 inappropriate. Return a TREE specifying the base offset, BOFF.
426 BOFF >= 0, there is only one public non-virtual SUBTYPE base at offset BOFF,
427 and there are no public virtual SUBTYPE bases.
428 BOFF == -1, SUBTYPE occurs as multiple public virtual or non-virtual bases.
429 BOFF == -2, SUBTYPE is not a public base.
430 BOFF == -3, SUBTYPE occurs as multiple public non-virtual bases. */
433 get_dynamic_cast_base_type (subtype, target)
437 tree offset = NULL_TREE;
438 int boff = dynamic_cast_base_recurse (subtype, TYPE_BINFO (target),
443 offset = build_int_2 (boff, -1);
444 TREE_TYPE (offset) = ssizetype;
448 /* Search for a member with name NAME in a multiple inheritance lattice
449 specified by TYPE. If it does not exist, return NULL_TREE.
450 If the member is ambiguously referenced, return `error_mark_node'.
451 Otherwise, return the FIELD_DECL. */
453 /* Do a 1-level search for NAME as a member of TYPE. The caller must
454 figure out whether it can access this field. (Since it is only one
455 level, this is reasonable.) */
458 lookup_field_1 (type, name)
463 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
464 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM
465 || TREE_CODE (type) == TYPENAME_TYPE)
466 /* The TYPE_FIELDS of a TEMPLATE_TYPE_PARM and
467 BOUND_TEMPLATE_TEMPLATE_PARM are not fields at all;
468 instead TYPE_FIELDS is the TEMPLATE_PARM_INDEX. (Miraculously,
469 the code often worked even when we treated the index as a list
471 The TYPE_FIELDS of TYPENAME_TYPE is its TYPENAME_TYPE_FULLNAME. */
475 && DECL_LANG_SPECIFIC (TYPE_NAME (type))
476 && DECL_SORTED_FIELDS (TYPE_NAME (type)))
478 tree *fields = &TREE_VEC_ELT (DECL_SORTED_FIELDS (TYPE_NAME (type)), 0);
479 int lo = 0, hi = TREE_VEC_LENGTH (DECL_SORTED_FIELDS (TYPE_NAME (type)));
486 #ifdef GATHER_STATISTICS
488 #endif /* GATHER_STATISTICS */
490 if (DECL_NAME (fields[i]) > name)
492 else if (DECL_NAME (fields[i]) < name)
496 /* We might have a nested class and a field with the
497 same name; we sorted them appropriately via
498 field_decl_cmp, so just look for the last field with
501 && DECL_NAME (fields[i+1]) == name)
509 field = TYPE_FIELDS (type);
511 #ifdef GATHER_STATISTICS
512 n_calls_lookup_field_1++;
513 #endif /* GATHER_STATISTICS */
516 #ifdef GATHER_STATISTICS
518 #endif /* GATHER_STATISTICS */
519 my_friendly_assert (DECL_P (field), 0);
520 if (DECL_NAME (field) == NULL_TREE
521 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
523 tree temp = lookup_field_1 (TREE_TYPE (field), name);
527 if (TREE_CODE (field) == USING_DECL)
528 /* For now, we're just treating member using declarations as
529 old ARM-style access declarations. Thus, there's no reason
530 to return a USING_DECL, and the rest of the compiler can't
531 handle it. Once the class is defined, these are purged
532 from TYPE_FIELDS anyhow; see handle_using_decl. */
534 else if (DECL_NAME (field) == name)
536 field = TREE_CHAIN (field);
539 if (name == vptr_identifier)
541 /* Give the user what s/he thinks s/he wants. */
542 if (TYPE_POLYMORPHIC_P (type))
543 return TYPE_VFIELD (type);
548 /* There are a number of cases we need to be aware of here:
549 current_class_type current_function_decl
556 Those last two make life interesting. If we're in a function which is
557 itself inside a class, we need decls to go into the fn's decls (our
558 second case below). But if we're in a class and the class itself is
559 inside a function, we need decls to go into the decls for the class. To
560 achieve this last goal, we must see if, when both current_class_ptr and
561 current_function_decl are set, the class was declared inside that
562 function. If so, we know to put the decls into the class's scope. */
567 if (current_function_decl == NULL_TREE)
568 return current_class_type;
569 if (current_class_type == NULL_TREE)
570 return current_function_decl;
571 if ((DECL_FUNCTION_MEMBER_P (current_function_decl)
572 && same_type_p (DECL_CONTEXT (current_function_decl),
574 || (DECL_FRIEND_CONTEXT (current_function_decl)
575 && same_type_p (DECL_FRIEND_CONTEXT (current_function_decl),
576 current_class_type)))
577 return current_function_decl;
579 return current_class_type;
582 /* Returns nonzero if we are currently in a function scope. Note
583 that this function returns zero if we are within a local class, but
584 not within a member function body of the local class. */
587 at_function_scope_p ()
589 tree cs = current_scope ();
590 return cs && TREE_CODE (cs) == FUNCTION_DECL;
593 /* Returns true if the innermost active scope is a class scope. */
598 tree cs = current_scope ();
599 return cs && TYPE_P (cs);
602 /* Return the scope of DECL, as appropriate when doing name-lookup. */
605 context_for_name_lookup (decl)
610 For the purposes of name lookup, after the anonymous union
611 definition, the members of the anonymous union are considered to
612 have been defined in the scope in which the anonymous union is
614 tree context = DECL_CONTEXT (decl);
616 while (context && TYPE_P (context) && ANON_AGGR_TYPE_P (context))
617 context = TYPE_CONTEXT (context);
619 context = global_namespace;
624 /* Return a canonical BINFO if BINFO is a virtual base, or just BINFO
628 canonical_binfo (binfo)
631 return (TREE_VIA_VIRTUAL (binfo)
632 ? TYPE_BINFO (BINFO_TYPE (binfo)) : binfo);
635 /* A queue function that simply ensures that we walk into the
636 canonical versions of virtual bases. */
639 dfs_canonical_queue (binfo, data)
641 void *data ATTRIBUTE_UNUSED;
643 return canonical_binfo (binfo);
646 /* Called via dfs_walk from assert_canonical_unmarked. */
649 dfs_assert_unmarked_p (binfo, data)
651 void *data ATTRIBUTE_UNUSED;
653 my_friendly_assert (!BINFO_MARKED (binfo), 0);
657 /* Asserts that all the nodes below BINFO (using the canonical
658 versions of virtual bases) are unmarked. */
661 assert_canonical_unmarked (binfo)
664 dfs_walk (binfo, dfs_assert_unmarked_p, dfs_canonical_queue, 0);
667 /* If BINFO is marked, return a canonical version of BINFO.
668 Otherwise, return NULL_TREE. */
671 shared_marked_p (binfo, data)
675 binfo = canonical_binfo (binfo);
676 return markedp (binfo, data);
679 /* If BINFO is not marked, return a canonical version of BINFO.
680 Otherwise, return NULL_TREE. */
683 shared_unmarked_p (binfo, data)
687 binfo = canonical_binfo (binfo);
688 return unmarkedp (binfo, data);
691 /* The accessibility routines use BINFO_ACCESS for scratch space
692 during the computation of the accssibility of some declaration. */
694 #define BINFO_ACCESS(NODE) \
695 ((access_kind) ((TREE_LANG_FLAG_1 (NODE) << 1) | TREE_LANG_FLAG_6 (NODE)))
697 /* Set the access associated with NODE to ACCESS. */
699 #define SET_BINFO_ACCESS(NODE, ACCESS) \
700 ((TREE_LANG_FLAG_1 (NODE) = ((ACCESS) & 2) != 0), \
701 (TREE_LANG_FLAG_6 (NODE) = ((ACCESS) & 1) != 0))
703 /* Called from access_in_type via dfs_walk. Calculate the access to
704 DATA (which is really a DECL) in BINFO. */
707 dfs_access_in_type (binfo, data)
711 tree decl = (tree) data;
712 tree type = BINFO_TYPE (binfo);
713 access_kind access = ak_none;
715 if (context_for_name_lookup (decl) == type)
717 /* If we have desceneded to the scope of DECL, just note the
718 appropriate access. */
719 if (TREE_PRIVATE (decl))
721 else if (TREE_PROTECTED (decl))
722 access = ak_protected;
728 /* First, check for an access-declaration that gives us more
729 access to the DECL. The CONST_DECL for an enumeration
730 constant will not have DECL_LANG_SPECIFIC, and thus no
732 if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl))
734 tree decl_access = purpose_member (type, DECL_ACCESS (decl));
736 access = ((access_kind)
737 TREE_INT_CST_LOW (TREE_VALUE (decl_access)));
746 /* Otherwise, scan our baseclasses, and pick the most favorable
748 binfos = BINFO_BASETYPES (binfo);
749 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
750 for (i = 0; i < n_baselinks; ++i)
752 tree base_binfo = TREE_VEC_ELT (binfos, i);
753 access_kind base_access
754 = BINFO_ACCESS (canonical_binfo (base_binfo));
756 if (base_access == ak_none || base_access == ak_private)
757 /* If it was not accessible in the base, or only
758 accessible as a private member, we can't access it
760 base_access = ak_none;
761 else if (TREE_VIA_PROTECTED (base_binfo))
762 /* Public and protected members in the base are
764 base_access = ak_protected;
765 else if (!TREE_VIA_PUBLIC (base_binfo))
766 /* Public and protected members in the base are
768 base_access = ak_private;
770 /* See if the new access, via this base, gives more
771 access than our previous best access. */
772 if (base_access != ak_none
773 && (base_access == ak_public
774 || (base_access == ak_protected
775 && access != ak_public)
776 || (base_access == ak_private
777 && access == ak_none)))
779 access = base_access;
781 /* If the new access is public, we can't do better. */
782 if (access == ak_public)
789 /* Note the access to DECL in TYPE. */
790 SET_BINFO_ACCESS (binfo, access);
792 /* Mark TYPE as visited so that if we reach it again we do not
793 duplicate our efforts here. */
794 SET_BINFO_MARKED (binfo);
799 /* Return the access to DECL in TYPE. */
802 access_in_type (type, decl)
806 tree binfo = TYPE_BINFO (type);
808 /* We must take into account
812 If a name can be reached by several paths through a multiple
813 inheritance graph, the access is that of the path that gives
816 The algorithm we use is to make a post-order depth-first traversal
817 of the base-class hierarchy. As we come up the tree, we annotate
818 each node with the most lenient access. */
819 dfs_walk_real (binfo, 0, dfs_access_in_type, shared_unmarked_p, decl);
820 dfs_walk (binfo, dfs_unmark, shared_marked_p, 0);
821 assert_canonical_unmarked (binfo);
823 return BINFO_ACCESS (binfo);
826 /* Called from dfs_accessible_p via dfs_walk. */
829 dfs_accessible_queue_p (binfo, data)
831 void *data ATTRIBUTE_UNUSED;
833 if (BINFO_MARKED (binfo))
836 /* If this class is inherited via private or protected inheritance,
837 then we can't see it, unless we are a friend of the subclass. */
838 if (!TREE_VIA_PUBLIC (binfo)
839 && !is_friend (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)),
843 return canonical_binfo (binfo);
846 /* Called from dfs_accessible_p via dfs_walk. */
849 dfs_accessible_p (binfo, data)
853 int protected_ok = data != 0;
856 SET_BINFO_MARKED (binfo);
857 access = BINFO_ACCESS (binfo);
858 if (access == ak_public || (access == ak_protected && protected_ok))
860 else if (access != ak_none
861 && is_friend (BINFO_TYPE (binfo), current_scope ()))
867 /* Returns nonzero if it is OK to access DECL through an object
868 indiated by BINFO in the context of DERIVED. */
871 protected_accessible_p (decl, derived, binfo)
878 /* We're checking this clause from [class.access.base]
880 m as a member of N is protected, and the reference occurs in a
881 member or friend of class N, or in a member or friend of a
882 class P derived from N, where m as a member of P is private or
885 Here DERIVED is a possible P and DECL is m. accessible_p will
886 iterate over various values of N, but the access to m in DERIVED
889 Note that I believe that the passage above is wrong, and should read
890 "...is private or protected or public"; otherwise you get bizarre results
891 whereby a public using-decl can prevent you from accessing a protected
892 member of a base. (jason 2000/02/28) */
894 /* If DERIVED isn't derived from m's class, then it can't be a P. */
895 if (!DERIVED_FROM_P (context_for_name_lookup (decl), derived))
898 access = access_in_type (derived, decl);
900 /* If m is inaccessible in DERIVED, then it's not a P. */
901 if (access == ak_none)
906 When a friend or a member function of a derived class references
907 a protected nonstatic member of a base class, an access check
908 applies in addition to those described earlier in clause
909 _class.access_) Except when forming a pointer to member
910 (_expr.unary.op_), the access must be through a pointer to,
911 reference to, or object of the derived class itself (or any class
912 derived from that class) (_expr.ref_). If the access is to form
913 a pointer to member, the nested-name-specifier shall name the
914 derived class (or any class derived from that class). */
915 if (DECL_NONSTATIC_MEMBER_P (decl))
917 /* We can tell through what the reference is occurring by
918 chasing BINFO up to the root. */
920 while (BINFO_INHERITANCE_CHAIN (t))
921 t = BINFO_INHERITANCE_CHAIN (t);
923 if (!DERIVED_FROM_P (derived, BINFO_TYPE (t)))
930 /* Returns nonzero if SCOPE is a friend of a type which would be able
931 to access DECL through the object indicated by BINFO. */
934 friend_accessible_p (scope, decl, binfo)
939 tree befriending_classes;
945 if (TREE_CODE (scope) == FUNCTION_DECL
946 || DECL_FUNCTION_TEMPLATE_P (scope))
947 befriending_classes = DECL_BEFRIENDING_CLASSES (scope);
948 else if (TYPE_P (scope))
949 befriending_classes = CLASSTYPE_BEFRIENDING_CLASSES (scope);
953 for (t = befriending_classes; t; t = TREE_CHAIN (t))
954 if (protected_accessible_p (decl, TREE_VALUE (t), binfo))
957 /* Nested classes are implicitly friends of their enclosing types, as
958 per core issue 45 (this is a change from the standard). */
960 for (t = TYPE_CONTEXT (scope); t && TYPE_P (t); t = TYPE_CONTEXT (t))
961 if (protected_accessible_p (decl, t, binfo))
964 if (TREE_CODE (scope) == FUNCTION_DECL
965 || DECL_FUNCTION_TEMPLATE_P (scope))
967 /* Perhaps this SCOPE is a member of a class which is a
969 if (DECL_CLASS_SCOPE_P (decl)
970 && friend_accessible_p (DECL_CONTEXT (scope), decl, binfo))
973 /* Or an instantiation of something which is a friend. */
974 if (DECL_TEMPLATE_INFO (scope))
975 return friend_accessible_p (DECL_TI_TEMPLATE (scope), decl, binfo);
977 else if (CLASSTYPE_TEMPLATE_INFO (scope))
978 return friend_accessible_p (CLASSTYPE_TI_TEMPLATE (scope), decl, binfo);
983 /* Perform access control on TYPE_DECL or TEMPLATE_DECL VAL, which was
984 looked up in TYPE. This is fairly complex, so here's the design:
986 The lang_extdef nonterminal sets type_lookups to NULL_TREE before we
987 start to process a top-level declaration.
988 As we process the decl-specifier-seq for the declaration, any types we
989 see that might need access control are passed to type_access_control,
990 which defers checking by adding them to type_lookups.
991 When we are done with the decl-specifier-seq, we record the lookups we've
992 seen in the lookups field of the typed_declspecs nonterminal.
993 When we process the first declarator, either in parse_decl or
994 begin_function_definition, we call save_type_access_control,
995 which stores the lookups from the decl-specifier-seq in
996 current_type_lookups.
997 As we finish with each declarator, we process everything in type_lookups
998 via decl_type_access_control, which resets type_lookups to the value of
999 current_type_lookups for subsequent declarators.
1000 When we enter a function, we set type_lookups to error_mark_node, so all
1001 lookups are processed immediately. */
1004 type_access_control (type, val)
1007 if (val == NULL_TREE
1008 || (TREE_CODE (val) != TEMPLATE_DECL && TREE_CODE (val) != TYPE_DECL)
1009 || ! DECL_CLASS_SCOPE_P (val))
1012 if (type_lookups == error_mark_node)
1013 enforce_access (type, val);
1014 else if (! accessible_p (type, val))
1015 type_lookups = tree_cons (type, val, type_lookups);
1018 /* DECL is a declaration from a base class of TYPE, which was the
1019 class used to name DECL. Return nonzero if, in the current
1020 context, DECL is accessible. If TYPE is actually a BINFO node,
1021 then we can tell in what context the access is occurring by looking
1022 at the most derived class along the path indicated by BINFO. */
1025 accessible_p (type, decl)
1033 /* Nonzero if it's OK to access DECL if it has protected
1034 accessibility in TYPE. */
1035 int protected_ok = 0;
1037 /* If we're not checking access, everything is accessible. */
1038 if (!scope_chain->check_access)
1041 /* If this declaration is in a block or namespace scope, there's no
1043 if (!TYPE_P (context_for_name_lookup (decl)))
1049 type = BINFO_TYPE (type);
1052 binfo = TYPE_BINFO (type);
1054 /* [class.access.base]
1056 A member m is accessible when named in class N if
1058 --m as a member of N is public, or
1060 --m as a member of N is private, and the reference occurs in a
1061 member or friend of class N, or
1063 --m as a member of N is protected, and the reference occurs in a
1064 member or friend of class N, or in a member or friend of a
1065 class P derived from N, where m as a member of P is private or
1068 --there exists a base class B of N that is accessible at the point
1069 of reference, and m is accessible when named in class B.
1071 We walk the base class hierarchy, checking these conditions. */
1073 /* Figure out where the reference is occurring. Check to see if
1074 DECL is private or protected in this scope, since that will
1075 determine whether protected access is allowed. */
1076 if (current_class_type)
1077 protected_ok = protected_accessible_p (decl, current_class_type, binfo);
1079 /* Now, loop through the classes of which we are a friend. */
1081 protected_ok = friend_accessible_p (current_scope (), decl, binfo);
1083 /* Standardize the binfo that access_in_type will use. We don't
1084 need to know what path was chosen from this point onwards. */
1085 binfo = TYPE_BINFO (type);
1087 /* Compute the accessibility of DECL in the class hierarchy
1088 dominated by type. */
1089 access_in_type (type, decl);
1090 /* Walk the hierarchy again, looking for a base class that allows
1092 t = dfs_walk (binfo, dfs_accessible_p,
1093 dfs_accessible_queue_p,
1094 protected_ok ? &protected_ok : 0);
1095 /* Clear any mark bits. Note that we have to walk the whole tree
1096 here, since we have aborted the previous walk from some point
1097 deep in the tree. */
1098 dfs_walk (binfo, dfs_unmark, dfs_canonical_queue, 0);
1099 assert_canonical_unmarked (binfo);
1101 return t != NULL_TREE;
1104 /* Recursive helper funciton for is_subobject_of_p; see that routine
1105 for documentation of the parameters. */
1108 is_subobject_of_p_1 (parent, binfo, most_derived)
1109 tree parent, binfo, most_derived;
1114 if (parent == binfo)
1117 binfos = BINFO_BASETYPES (binfo);
1118 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos) : 0;
1120 /* Iterate through the base types. */
1121 for (i = 0; i < n_baselinks; i++)
1123 tree base_binfo = TREE_VEC_ELT (binfos, i);
1126 base_type = TREE_TYPE (base_binfo);
1127 if (!CLASS_TYPE_P (base_type))
1128 /* If we see a TEMPLATE_TYPE_PARM, or some such, as a base
1129 class there's no way to descend into it. */
1132 /* Avoid walking into the same virtual base more than once. */
1133 if (TREE_VIA_VIRTUAL (base_binfo))
1135 if (CLASSTYPE_MARKED4 (base_type))
1137 SET_CLASSTYPE_MARKED4 (base_type);
1138 base_binfo = binfo_for_vbase (base_type, most_derived);
1141 if (is_subobject_of_p_1 (parent, base_binfo, most_derived))
1147 /* Routine to see if the sub-object denoted by the binfo PARENT can be
1148 found as a base class and sub-object of the object denoted by
1149 BINFO. MOST_DERIVED is the most derived type of the hierarchy being
1153 is_subobject_of_p (tree parent, tree binfo, tree most_derived)
1158 result = is_subobject_of_p_1 (parent, binfo, most_derived);
1159 /* Clear the mark bits on virtual bases. */
1160 for (vbase = CLASSTYPE_VBASECLASSES (most_derived);
1162 vbase = TREE_CHAIN (vbase))
1163 CLEAR_CLASSTYPE_MARKED4 (TREE_TYPE (TREE_VALUE (vbase)));
1168 struct lookup_field_info {
1169 /* The type in which we're looking. */
1171 /* The name of the field for which we're looking. */
1173 /* If non-NULL, the current result of the lookup. */
1175 /* The path to RVAL. */
1177 /* If non-NULL, the lookup was ambiguous, and this is a list of the
1180 /* If nonzero, we are looking for types, not data members. */
1182 /* If nonzero, RVAL was found by looking through a dependent base. */
1183 int from_dep_base_p;
1184 /* If something went wrong, a message indicating what. */
1188 /* Returns nonzero if BINFO is not hidden by the value found by the
1189 lookup so far. If BINFO is hidden, then there's no need to look in
1190 it. DATA is really a struct lookup_field_info. Called from
1191 lookup_field via breadth_first_search. */
1194 lookup_field_queue_p (binfo, data)
1198 struct lookup_field_info *lfi = (struct lookup_field_info *) data;
1200 /* Don't look for constructors or destructors in base classes. */
1201 if (IDENTIFIER_CTOR_OR_DTOR_P (lfi->name))
1204 /* If this base class is hidden by the best-known value so far, we
1205 don't need to look. */
1206 binfo = CANONICAL_BINFO (binfo, lfi->type);
1207 if (!lfi->from_dep_base_p && lfi->rval_binfo
1208 && is_subobject_of_p (binfo, lfi->rval_binfo, lfi->type))
1214 /* Within the scope of a template class, you can refer to the to the
1215 current specialization with the name of the template itself. For
1218 template <typename T> struct S { S* sp; }
1220 Returns nonzero if DECL is such a declaration in a class TYPE. */
1223 template_self_reference_p (type, decl)
1227 return (CLASSTYPE_USE_TEMPLATE (type)
1228 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type))
1229 && TREE_CODE (decl) == TYPE_DECL
1230 && DECL_ARTIFICIAL (decl)
1231 && DECL_NAME (decl) == constructor_name (type));
1235 /* Nonzero for a class member means that it is shared between all objects
1238 [class.member.lookup]:If the resulting set of declarations are not all
1239 from sub-objects of the same type, or the set has a nonstatic member
1240 and includes members from distinct sub-objects, there is an ambiguity
1241 and the program is ill-formed.
1243 This function checks that T contains no nonstatic members. */
1249 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == TYPE_DECL \
1250 || TREE_CODE (t) == CONST_DECL)
1252 if (is_overloaded_fn (t))
1254 for (; t; t = OVL_NEXT (t))
1256 tree fn = OVL_CURRENT (t);
1257 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
1265 /* DATA is really a struct lookup_field_info. Look for a field with
1266 the name indicated there in BINFO. If this function returns a
1267 non-NULL value it is the result of the lookup. Called from
1268 lookup_field via breadth_first_search. */
1271 lookup_field_r (binfo, data)
1275 struct lookup_field_info *lfi = (struct lookup_field_info *) data;
1276 tree type = BINFO_TYPE (binfo);
1277 tree nval = NULL_TREE;
1278 int from_dep_base_p;
1280 /* First, look for a function. There can't be a function and a data
1281 member with the same name, and if there's a function and a type
1282 with the same name, the type is hidden by the function. */
1283 if (!lfi->want_type)
1285 int idx = lookup_fnfields_1 (type, lfi->name);
1287 nval = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), idx);
1291 /* Look for a data member or type. */
1292 nval = lookup_field_1 (type, lfi->name);
1294 /* If there is no declaration with the indicated name in this type,
1295 then there's nothing to do. */
1299 /* If we're looking up a type (as with an elaborated type specifier)
1300 we ignore all non-types we find. */
1301 if (lfi->want_type && TREE_CODE (nval) != TYPE_DECL
1302 && !DECL_CLASS_TEMPLATE_P (nval))
1304 if (lfi->name == TYPE_IDENTIFIER (type))
1306 /* If the aggregate has no user defined constructors, we allow
1307 it to have fields with the same name as the enclosing type.
1308 If we are looking for that name, find the corresponding
1310 for (nval = TREE_CHAIN (nval); nval; nval = TREE_CHAIN (nval))
1311 if (DECL_NAME (nval) == lfi->name
1312 && TREE_CODE (nval) == TYPE_DECL)
1319 nval = purpose_member (lfi->name, CLASSTYPE_TAGS (type));
1321 nval = TYPE_MAIN_DECL (TREE_VALUE (nval));
1327 /* You must name a template base class with a template-id. */
1328 if (!same_type_p (type, lfi->type)
1329 && template_self_reference_p (type, nval))
1332 from_dep_base_p = dependent_base_p (binfo);
1333 if (lfi->from_dep_base_p && !from_dep_base_p)
1335 /* If the new declaration is not found via a dependent base, and
1336 the old one was, then we must prefer the new one. We weren't
1337 really supposed to be able to find the old one, so we don't
1338 want to be affected by a specialization. Consider:
1340 struct B { typedef int I; };
1341 template <typename T> struct D1 : virtual public B {};
1342 template <typename T> struct D :
1343 public D1, virtual pubic B { I i; };
1345 The `I' in `D<T>' is unambigousuly `B::I', regardless of how
1346 D1 is specialized. */
1347 lfi->from_dep_base_p = 0;
1348 lfi->rval = NULL_TREE;
1349 lfi->rval_binfo = NULL_TREE;
1350 lfi->ambiguous = NULL_TREE;
1353 else if (lfi->rval_binfo && !lfi->from_dep_base_p && from_dep_base_p)
1354 /* Similarly, if the old declaration was not found via a dependent
1355 base, and the new one is, ignore the new one. */
1358 /* If the lookup already found a match, and the new value doesn't
1359 hide the old one, we might have an ambiguity. */
1360 if (lfi->rval_binfo && !is_subobject_of_p (lfi->rval_binfo, binfo, lfi->type))
1362 if (nval == lfi->rval && shared_member_p (nval))
1363 /* The two things are really the same. */
1365 else if (is_subobject_of_p (binfo, lfi->rval_binfo, lfi->type))
1366 /* The previous value hides the new one. */
1370 /* We have a real ambiguity. We keep a chain of all the
1372 if (!lfi->ambiguous && lfi->rval)
1374 /* This is the first time we noticed an ambiguity. Add
1375 what we previously thought was a reasonable candidate
1377 lfi->ambiguous = tree_cons (NULL_TREE, lfi->rval, NULL_TREE);
1378 TREE_TYPE (lfi->ambiguous) = error_mark_node;
1381 /* Add the new value. */
1382 lfi->ambiguous = tree_cons (NULL_TREE, nval, lfi->ambiguous);
1383 TREE_TYPE (lfi->ambiguous) = error_mark_node;
1384 lfi->errstr = "request for member `%D' is ambiguous";
1389 if (from_dep_base_p && TREE_CODE (nval) != TYPE_DECL
1390 /* We need to return a member template class so we can
1391 define partial specializations. Is there a better
1393 && !DECL_CLASS_TEMPLATE_P (nval))
1394 /* The thing we're looking for isn't a type, so the implicit
1395 typename extension doesn't apply, so we just pretend we
1396 didn't find anything. */
1400 lfi->from_dep_base_p = from_dep_base_p;
1401 lfi->rval_binfo = binfo;
1407 /* Return a "baselink" which BASELINK_BINFO, BASELINK_ACCESS_BINFO,
1408 BASELINK_FUNCTIONS, and BASELINK_OPTYPE set to BINFO, ACCESS_BINFO,
1409 FUNCTIONS, and OPTYPE respectively. */
1412 build_baselink (tree binfo, tree access_binfo, tree functions, tree optype)
1416 my_friendly_assert (TREE_CODE (functions) == FUNCTION_DECL
1417 || TREE_CODE (functions) == TEMPLATE_DECL
1418 || TREE_CODE (functions) == TEMPLATE_ID_EXPR
1419 || TREE_CODE (functions) == OVERLOAD,
1421 my_friendly_assert (!optype || TYPE_P (optype), 20020730);
1422 my_friendly_assert (TREE_TYPE (functions), 20020805);
1424 baselink = build (BASELINK, TREE_TYPE (functions), NULL_TREE,
1425 NULL_TREE, NULL_TREE);
1426 BASELINK_BINFO (baselink) = binfo;
1427 BASELINK_ACCESS_BINFO (baselink) = access_binfo;
1428 BASELINK_FUNCTIONS (baselink) = functions;
1429 BASELINK_OPTYPE (baselink) = optype;
1434 /* Look for a member named NAME in an inheritance lattice dominated by
1435 XBASETYPE. If PROTECT is 0 or two, we do not check access. If it
1436 is 1, we enforce accessibility. If PROTECT is zero, then, for an
1437 ambiguous lookup, we return NULL. If PROTECT is 1, we issue error
1438 messages about inaccessible or ambiguous lookup. If PROTECT is 2,
1439 we return a TREE_LIST whose TREE_TYPE is error_mark_node and whose
1440 TREE_VALUEs are the list of ambiguous candidates.
1442 WANT_TYPE is 1 when we should only return TYPE_DECLs.
1444 If nothing can be found return NULL_TREE and do not issue an error. */
1447 lookup_member (xbasetype, name, protect, want_type)
1448 register tree xbasetype, name;
1449 int protect, want_type;
1451 tree rval, rval_binfo = NULL_TREE;
1452 tree type = NULL_TREE, basetype_path = NULL_TREE;
1453 struct lookup_field_info lfi;
1455 /* rval_binfo is the binfo associated with the found member, note,
1456 this can be set with useful information, even when rval is not
1457 set, because it must deal with ALL members, not just non-function
1458 members. It is used for ambiguity checking and the hidden
1459 checks. Whereas rval is only set if a proper (not hidden)
1460 non-function member is found. */
1462 const char *errstr = 0;
1464 if (xbasetype == current_class_type && TYPE_BEING_DEFINED (xbasetype)
1465 && IDENTIFIER_CLASS_VALUE (name))
1467 tree field = IDENTIFIER_CLASS_VALUE (name);
1468 if (TREE_CODE (field) != FUNCTION_DECL
1469 && ! (want_type && TREE_CODE (field) != TYPE_DECL))
1470 /* We're in the scope of this class, and the value has already
1471 been looked up. Just return the cached value. */
1475 if (TREE_CODE (xbasetype) == TREE_VEC)
1477 type = BINFO_TYPE (xbasetype);
1478 basetype_path = xbasetype;
1480 else if (IS_AGGR_TYPE_CODE (TREE_CODE (xbasetype)))
1483 basetype_path = TYPE_BINFO (type);
1484 my_friendly_assert (BINFO_INHERITANCE_CHAIN (basetype_path) == NULL_TREE,
1490 complete_type (type);
1492 #ifdef GATHER_STATISTICS
1493 n_calls_lookup_field++;
1494 #endif /* GATHER_STATISTICS */
1496 memset ((PTR) &lfi, 0, sizeof (lfi));
1499 lfi.want_type = want_type;
1500 bfs_walk (basetype_path, &lookup_field_r, &lookup_field_queue_p, &lfi);
1502 rval_binfo = lfi.rval_binfo;
1504 type = BINFO_TYPE (rval_binfo);
1505 errstr = lfi.errstr;
1507 /* If we are not interested in ambiguities, don't report them;
1508 just return NULL_TREE. */
1509 if (!protect && lfi.ambiguous)
1515 return lfi.ambiguous;
1522 In the case of overloaded function names, access control is
1523 applied to the function selected by overloaded resolution. */
1524 if (rval && protect && !is_overloaded_fn (rval)
1525 && !enforce_access (xbasetype, rval))
1526 return error_mark_node;
1528 if (errstr && protect)
1530 error (errstr, name, type);
1532 print_candidates (lfi.ambiguous);
1533 rval = error_mark_node;
1536 /* If the thing we found was found via the implicit typename
1537 extension, build the typename type. */
1538 if (rval && lfi.from_dep_base_p && !DECL_CLASS_TEMPLATE_P (rval))
1539 rval = TYPE_STUB_DECL (build_typename_type (BINFO_TYPE (basetype_path),
1543 if (rval && is_overloaded_fn (rval))
1544 rval = build_baselink (rval_binfo, basetype_path, rval,
1545 (IDENTIFIER_TYPENAME_P (name)
1546 ? TREE_TYPE (name): NULL_TREE));
1550 /* Like lookup_member, except that if we find a function member we
1551 return NULL_TREE. */
1554 lookup_field (xbasetype, name, protect, want_type)
1555 register tree xbasetype, name;
1556 int protect, want_type;
1558 tree rval = lookup_member (xbasetype, name, protect, want_type);
1560 /* Ignore functions. */
1561 if (rval && BASELINK_P (rval))
1567 /* Like lookup_member, except that if we find a non-function member we
1568 return NULL_TREE. */
1571 lookup_fnfields (xbasetype, name, protect)
1572 register tree xbasetype, name;
1575 tree rval = lookup_member (xbasetype, name, protect, /*want_type=*/0);
1577 /* Ignore non-functions. */
1578 if (rval && !BASELINK_P (rval))
1584 /* TYPE is a class type. Return the index of the fields within
1585 the method vector with name NAME, or -1 is no such field exists. */
1588 lookup_fnfields_1 (type, name)
1591 tree method_vec = (CLASS_TYPE_P (type)
1592 ? CLASSTYPE_METHOD_VEC (type)
1595 if (method_vec != 0)
1598 register tree *methods = &TREE_VEC_ELT (method_vec, 0);
1599 int len = TREE_VEC_LENGTH (method_vec);
1602 #ifdef GATHER_STATISTICS
1603 n_calls_lookup_fnfields_1++;
1604 #endif /* GATHER_STATISTICS */
1606 /* Constructors are first... */
1607 if (name == ctor_identifier)
1608 return (methods[CLASSTYPE_CONSTRUCTOR_SLOT]
1609 ? CLASSTYPE_CONSTRUCTOR_SLOT : -1);
1610 /* and destructors are second. */
1611 if (name == dtor_identifier)
1612 return (methods[CLASSTYPE_DESTRUCTOR_SLOT]
1613 ? CLASSTYPE_DESTRUCTOR_SLOT : -1);
1615 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
1616 i < len && methods[i];
1619 #ifdef GATHER_STATISTICS
1620 n_outer_fields_searched++;
1621 #endif /* GATHER_STATISTICS */
1623 tmp = OVL_CURRENT (methods[i]);
1624 if (DECL_NAME (tmp) == name)
1627 /* If the type is complete and we're past the conversion ops,
1628 switch to binary search. */
1629 if (! DECL_CONV_FN_P (tmp)
1630 && COMPLETE_TYPE_P (type))
1632 int lo = i + 1, hi = len;
1638 #ifdef GATHER_STATISTICS
1639 n_outer_fields_searched++;
1640 #endif /* GATHER_STATISTICS */
1642 tmp = DECL_NAME (OVL_CURRENT (methods[i]));
1646 else if (tmp < name)
1655 /* If we didn't find it, it might have been a template
1656 conversion operator to a templated type. If there are any,
1657 such template conversion operators will all be overloaded on
1658 the first conversion slot. (Note that we don't look for this
1659 case above so that we will always find specializations
1661 if (IDENTIFIER_TYPENAME_P (name))
1663 i = CLASSTYPE_FIRST_CONVERSION_SLOT;
1664 if (i < len && methods[i])
1666 tmp = OVL_CURRENT (methods[i]);
1667 if (TREE_CODE (tmp) == TEMPLATE_DECL
1668 && DECL_TEMPLATE_CONV_FN_P (tmp))
1677 /* DECL is the result of a qualified name lookup. QUALIFYING_SCOPE is
1678 the class or namespace used to qualify the name. CONTEXT_CLASS is
1679 the class corresponding to the object in which DECL will be used.
1680 Return a possibly modified version of DECL that takes into account
1683 In particular, consider an expression like `B::m' in the context of
1684 a derived class `D'. If `B::m' has been resolved to a BASELINK,
1685 then the most derived class indicated by the BASELINK_BINFO will be
1686 `B', not `D'. This function makes that adjustment. */
1689 adjust_result_of_qualified_name_lookup (tree decl,
1690 tree qualifying_scope,
1693 if (context_class && CLASS_TYPE_P (qualifying_scope)
1694 && DERIVED_FROM_P (qualifying_scope, context_class)
1695 && BASELINK_P (decl))
1699 my_friendly_assert (CLASS_TYPE_P (context_class), 20020808);
1701 /* Look for the QUALIFYING_SCOPE as a base of the
1702 CONTEXT_CLASS. If QUALIFYING_SCOPE is ambiguous, we cannot
1703 be sure yet than an error has occurred; perhaps the function
1704 chosen by overload resolution will be static. */
1705 base = lookup_base (context_class, qualifying_scope,
1706 ba_ignore | ba_quiet, NULL);
1709 BASELINK_ACCESS_BINFO (decl) = base;
1710 BASELINK_BINFO (decl)
1711 = lookup_base (base, BINFO_TYPE (BASELINK_BINFO (decl)),
1712 ba_ignore | ba_quiet,
1721 /* Walk the class hierarchy dominated by TYPE. FN is called for each
1722 type in the hierarchy, in a breadth-first preorder traversal.
1723 If it ever returns a non-NULL value, that value is immediately
1724 returned and the walk is terminated. At each node, FN is passed a
1725 BINFO indicating the path from the curently visited base-class to
1726 TYPE. Before each base-class is walked QFN is called. If the
1727 value returned is nonzero, the base-class is walked; otherwise it
1728 is not. If QFN is NULL, it is treated as a function which always
1729 returns 1. Both FN and QFN are passed the DATA whenever they are
1733 bfs_walk (binfo, fn, qfn, data)
1735 tree (*fn) PARAMS ((tree, void *));
1736 tree (*qfn) PARAMS ((tree, void *));
1741 tree rval = NULL_TREE;
1742 /* An array of the base classes of BINFO. These will be built up in
1743 breadth-first order, except where QFN prunes the search. */
1744 varray_type bfs_bases;
1746 /* Start with enough room for ten base classes. That will be enough
1747 for most hierarchies. */
1748 VARRAY_TREE_INIT (bfs_bases, 10, "search_stack");
1750 /* Put the first type into the stack. */
1751 VARRAY_TREE (bfs_bases, 0) = binfo;
1754 for (head = 0; head < tail; ++head)
1760 /* Pull the next type out of the queue. */
1761 binfo = VARRAY_TREE (bfs_bases, head);
1763 /* If this is the one we're looking for, we're done. */
1764 rval = (*fn) (binfo, data);
1768 /* Queue up the base types. */
1769 binfos = BINFO_BASETYPES (binfo);
1770 n_baselinks = binfos ? TREE_VEC_LENGTH (binfos): 0;
1771 for (i = 0; i < n_baselinks; i++)
1773 tree base_binfo = TREE_VEC_ELT (binfos, i);
1776 base_binfo = (*qfn) (base_binfo, data);
1780 if (tail == VARRAY_SIZE (bfs_bases))
1781 VARRAY_GROW (bfs_bases, 2 * VARRAY_SIZE (bfs_bases));
1782 VARRAY_TREE (bfs_bases, tail) = base_binfo;
1791 /* Exactly like bfs_walk, except that a depth-first traversal is
1792 performed, and PREFN is called in preorder, while POSTFN is called
1796 dfs_walk_real (binfo, prefn, postfn, qfn, data)
1798 tree (*prefn) PARAMS ((tree, void *));
1799 tree (*postfn) PARAMS ((tree, void *));
1800 tree (*qfn) PARAMS ((tree, void *));
1806 tree rval = NULL_TREE;
1808 /* Call the pre-order walking function. */
1811 rval = (*prefn) (binfo, data);
1816 /* Process the basetypes. */
1817 binfos = BINFO_BASETYPES (binfo);
1818 n_baselinks = BINFO_N_BASETYPES (binfo);
1819 for (i = 0; i < n_baselinks; i++)
1821 tree base_binfo = TREE_VEC_ELT (binfos, i);
1824 base_binfo = (*qfn) (base_binfo, data);
1828 rval = dfs_walk_real (base_binfo, prefn, postfn, qfn, data);
1834 /* Call the post-order walking function. */
1836 rval = (*postfn) (binfo, data);
1841 /* Exactly like bfs_walk, except that a depth-first post-order traversal is
1845 dfs_walk (binfo, fn, qfn, data)
1847 tree (*fn) PARAMS ((tree, void *));
1848 tree (*qfn) PARAMS ((tree, void *));
1851 return dfs_walk_real (binfo, 0, fn, qfn, data);
1854 /* Check that virtual overrider OVERRIDER is acceptable for base function
1855 BASEFN. Issue diagnostic, and return zero, if unacceptable. */
1858 check_final_overrider (overrider, basefn)
1859 tree overrider, basefn;
1861 tree over_type = TREE_TYPE (overrider);
1862 tree base_type = TREE_TYPE (basefn);
1863 tree over_return = TREE_TYPE (over_type);
1864 tree base_return = TREE_TYPE (base_type);
1865 tree over_throw = TYPE_RAISES_EXCEPTIONS (over_type);
1866 tree base_throw = TYPE_RAISES_EXCEPTIONS (base_type);
1869 if (same_type_p (base_return, over_return))
1871 else if ((CLASS_TYPE_P (over_return) && CLASS_TYPE_P (base_return))
1872 || (TREE_CODE (base_return) == TREE_CODE (over_return)
1873 && POINTER_TYPE_P (base_return)))
1875 /* Potentially covariant. */
1876 unsigned base_quals, over_quals;
1878 fail = !POINTER_TYPE_P (base_return);
1881 fail = cp_type_quals (base_return) != cp_type_quals (over_return);
1883 base_return = TREE_TYPE (base_return);
1884 over_return = TREE_TYPE (over_return);
1886 base_quals = cp_type_quals (base_return);
1887 over_quals = cp_type_quals (over_return);
1889 if ((base_quals & over_quals) != over_quals)
1892 if (CLASS_TYPE_P (base_return) && CLASS_TYPE_P (over_return))
1894 tree binfo = lookup_base (over_return, base_return,
1895 ba_check | ba_quiet, NULL);
1901 && can_convert (TREE_TYPE (base_type), TREE_TYPE (over_type)))
1902 /* GNU extension, allow trivial pointer conversions such as
1903 converting to void *, or qualification conversion. */
1905 /* can_convert will permit user defined conversion from a
1906 (reference to) class type. We must reject them. */
1907 over_return = TREE_TYPE (over_type);
1908 if (TREE_CODE (over_return) == REFERENCE_TYPE)
1909 over_return = TREE_TYPE (over_return);
1910 if (CLASS_TYPE_P (over_return))
1920 else if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (overrider)))
1926 cp_error_at ("invalid covariant return type for `%#D'", overrider);
1927 cp_error_at (" overriding `%#D'", basefn);
1931 cp_error_at ("conflicting return type specified for `%#D'",
1933 cp_error_at (" overriding `%#D'", basefn);
1935 SET_IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (overrider),
1936 DECL_CONTEXT (overrider));
1940 /* Check throw specifier is at least as strict. */
1941 if (!comp_except_specs (base_throw, over_throw, 0))
1943 if (!IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (overrider)))
1945 cp_error_at ("looser throw specifier for `%#F'", overrider);
1946 cp_error_at (" overriding `%#F'", basefn);
1947 SET_IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (overrider),
1948 DECL_CONTEXT (overrider));
1956 /* Given a class TYPE, and a function decl FNDECL, look for
1957 virtual functions in TYPE's hierarchy which FNDECL overrides.
1958 We do not look in TYPE itself, only its bases.
1960 Returns nonzero, if we find any. Set FNDECL's DECL_VIRTUAL_P, if we
1961 find that it overrides anything.
1963 We check that every function which is overridden, is correctly
1967 look_for_overrides (type, fndecl)
1970 tree binfo = TYPE_BINFO (type);
1971 tree basebinfos = BINFO_BASETYPES (binfo);
1972 int nbasebinfos = basebinfos ? TREE_VEC_LENGTH (basebinfos) : 0;
1976 for (ix = 0; ix != nbasebinfos; ix++)
1978 tree basetype = BINFO_TYPE (TREE_VEC_ELT (basebinfos, ix));
1980 if (TYPE_POLYMORPHIC_P (basetype))
1981 found += look_for_overrides_r (basetype, fndecl);
1986 /* Look in TYPE for virtual functions with the same signature as
1990 look_for_overrides_here (type, fndecl)
1995 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fndecl))
1996 ix = CLASSTYPE_DESTRUCTOR_SLOT;
1998 ix = lookup_fnfields_1 (type, DECL_NAME (fndecl));
2001 tree fns = TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (type), ix);
2003 for (; fns; fns = OVL_NEXT (fns))
2005 tree fn = OVL_CURRENT (fns);
2007 if (!DECL_VIRTUAL_P (fn))
2008 /* Not a virtual. */;
2009 else if (DECL_CONTEXT (fn) != type)
2010 /* Introduced with a using declaration. */;
2011 else if (DECL_STATIC_FUNCTION_P (fndecl))
2013 tree btypes = TYPE_ARG_TYPES (TREE_TYPE (fn));
2014 tree dtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2015 if (compparms (TREE_CHAIN (btypes), dtypes))
2018 else if (same_signature_p (fndecl, fn))
2025 /* Look in TYPE for virtual functions overridden by FNDECL. Check both
2026 TYPE itself and its bases. */
2029 look_for_overrides_r (type, fndecl)
2032 tree fn = look_for_overrides_here (type, fndecl);
2035 if (DECL_STATIC_FUNCTION_P (fndecl))
2037 /* A static member function cannot match an inherited
2038 virtual member function. */
2039 cp_error_at ("`%#D' cannot be declared", fndecl);
2040 cp_error_at (" since `%#D' declared in base class", fn);
2044 /* It's definitely virtual, even if not explicitly set. */
2045 DECL_VIRTUAL_P (fndecl) = 1;
2046 check_final_overrider (fndecl, fn);
2051 /* We failed to find one declared in this class. Look in its bases. */
2052 return look_for_overrides (type, fndecl);
2055 /* A queue function to use with dfs_walk that only walks into
2056 canonical bases. DATA should be the type of the complete object,
2057 or a TREE_LIST whose TREE_PURPOSE is the type of the complete
2058 object. By using this function as a queue function, you will walk
2059 over exactly those BINFOs that actually exist in the complete
2060 object, including those for virtual base classes. If you
2061 SET_BINFO_MARKED for each binfo you process, you are further
2062 guaranteed that you will walk into each virtual base class exactly
2066 dfs_unmarked_real_bases_queue_p (binfo, data)
2070 if (TREE_VIA_VIRTUAL (binfo))
2072 tree type = (tree) data;
2074 if (TREE_CODE (type) == TREE_LIST)
2075 type = TREE_PURPOSE (type);
2076 binfo = binfo_for_vbase (BINFO_TYPE (binfo), type);
2078 return unmarkedp (binfo, NULL);
2081 /* Like dfs_unmarked_real_bases_queue_p but walks only into things
2082 that are marked, rather than unmarked. */
2085 dfs_marked_real_bases_queue_p (binfo, data)
2089 if (TREE_VIA_VIRTUAL (binfo))
2091 tree type = (tree) data;
2093 if (TREE_CODE (type) == TREE_LIST)
2094 type = TREE_PURPOSE (type);
2095 binfo = binfo_for_vbase (BINFO_TYPE (binfo), type);
2097 return markedp (binfo, NULL);
2100 /* A queue function that skips all virtual bases (and their
2104 dfs_skip_vbases (binfo, data)
2106 void *data ATTRIBUTE_UNUSED;
2108 if (TREE_VIA_VIRTUAL (binfo))
2114 /* Called via dfs_walk from dfs_get_pure_virtuals. */
2117 dfs_get_pure_virtuals (binfo, data)
2121 tree type = (tree) data;
2123 /* We're not interested in primary base classes; the derived class
2124 of which they are a primary base will contain the information we
2126 if (!BINFO_PRIMARY_P (binfo))
2130 for (virtuals = BINFO_VIRTUALS (binfo);
2132 virtuals = TREE_CHAIN (virtuals))
2133 if (DECL_PURE_VIRTUAL_P (BV_FN (virtuals)))
2134 CLASSTYPE_PURE_VIRTUALS (type)
2135 = tree_cons (NULL_TREE, BV_FN (virtuals),
2136 CLASSTYPE_PURE_VIRTUALS (type));
2139 SET_BINFO_MARKED (binfo);
2144 /* Set CLASSTYPE_PURE_VIRTUALS for TYPE. */
2147 get_pure_virtuals (type)
2152 /* Clear the CLASSTYPE_PURE_VIRTUALS list; whatever is already there
2153 is going to be overridden. */
2154 CLASSTYPE_PURE_VIRTUALS (type) = NULL_TREE;
2155 /* Now, run through all the bases which are not primary bases, and
2156 collect the pure virtual functions. We look at the vtable in
2157 each class to determine what pure virtual functions are present.
2158 (A primary base is not interesting because the derived class of
2159 which it is a primary base will contain vtable entries for the
2160 pure virtuals in the base class. */
2161 dfs_walk (TYPE_BINFO (type), dfs_get_pure_virtuals,
2162 dfs_unmarked_real_bases_queue_p, type);
2163 dfs_walk (TYPE_BINFO (type), dfs_unmark,
2164 dfs_marked_real_bases_queue_p, type);
2166 /* Put the pure virtuals in dfs order. */
2167 CLASSTYPE_PURE_VIRTUALS (type) = nreverse (CLASSTYPE_PURE_VIRTUALS (type));
2169 for (vbases = CLASSTYPE_VBASECLASSES (type);
2171 vbases = TREE_CHAIN (vbases))
2175 for (virtuals = BINFO_VIRTUALS (TREE_VALUE (vbases));
2177 virtuals = TREE_CHAIN (virtuals))
2179 tree base_fndecl = BV_FN (virtuals);
2180 if (DECL_NEEDS_FINAL_OVERRIDER_P (base_fndecl))
2181 error ("`%#D' needs a final overrider", base_fndecl);
2186 /* DEPTH-FIRST SEARCH ROUTINES. */
2189 markedp (binfo, data)
2191 void *data ATTRIBUTE_UNUSED;
2193 return BINFO_MARKED (binfo) ? binfo : NULL_TREE;
2197 unmarkedp (binfo, data)
2199 void *data ATTRIBUTE_UNUSED;
2201 return !BINFO_MARKED (binfo) ? binfo : NULL_TREE;
2205 marked_vtable_pathp (binfo, data)
2207 void *data ATTRIBUTE_UNUSED;
2209 return BINFO_VTABLE_PATH_MARKED (binfo) ? binfo : NULL_TREE;
2213 unmarked_vtable_pathp (binfo, data)
2215 void *data ATTRIBUTE_UNUSED;
2217 return !BINFO_VTABLE_PATH_MARKED (binfo) ? binfo : NULL_TREE;
2221 marked_pushdecls_p (binfo, data)
2223 void *data ATTRIBUTE_UNUSED;
2225 return (CLASS_TYPE_P (BINFO_TYPE (binfo))
2226 && BINFO_PUSHDECLS_MARKED (binfo)) ? binfo : NULL_TREE;
2230 unmarked_pushdecls_p (binfo, data)
2232 void *data ATTRIBUTE_UNUSED;
2234 return (CLASS_TYPE_P (BINFO_TYPE (binfo))
2235 && !BINFO_PUSHDECLS_MARKED (binfo)) ? binfo : NULL_TREE;
2238 /* The worker functions for `dfs_walk'. These do not need to
2239 test anything (vis a vis marking) if they are paired with
2240 a predicate function (above). */
2243 dfs_unmark (binfo, data)
2245 void *data ATTRIBUTE_UNUSED;
2247 CLEAR_BINFO_MARKED (binfo);
2251 /* get virtual base class types.
2252 This adds type to the vbase_types list in reverse dfs order.
2253 Ordering is very important, so don't change it. */
2256 dfs_get_vbase_types (binfo, data)
2260 tree type = (tree) data;
2262 if (TREE_VIA_VIRTUAL (binfo))
2263 CLASSTYPE_VBASECLASSES (type)
2264 = tree_cons (BINFO_TYPE (binfo),
2266 CLASSTYPE_VBASECLASSES (type));
2267 SET_BINFO_MARKED (binfo);
2271 /* Called via dfs_walk from mark_primary_bases. Builds the
2272 inheritance graph order list of BINFOs. */
2275 dfs_build_inheritance_graph_order (binfo, data)
2279 tree *last_binfo = (tree *) data;
2282 TREE_CHAIN (*last_binfo) = binfo;
2283 *last_binfo = binfo;
2284 SET_BINFO_MARKED (binfo);
2288 /* Set CLASSTYPE_VBASECLASSES for TYPE. */
2291 get_vbase_types (type)
2296 CLASSTYPE_VBASECLASSES (type) = NULL_TREE;
2297 dfs_walk (TYPE_BINFO (type), dfs_get_vbase_types, unmarkedp, type);
2298 /* Rely upon the reverse dfs ordering from dfs_get_vbase_types, and now
2299 reverse it so that we get normal dfs ordering. */
2300 CLASSTYPE_VBASECLASSES (type) = nreverse (CLASSTYPE_VBASECLASSES (type));
2301 dfs_walk (TYPE_BINFO (type), dfs_unmark, markedp, 0);
2302 /* Thread the BINFOs in inheritance-graph order. */
2304 dfs_walk_real (TYPE_BINFO (type),
2305 dfs_build_inheritance_graph_order,
2309 dfs_walk (TYPE_BINFO (type), dfs_unmark, markedp, NULL);
2312 /* Called from find_vbase_instance via dfs_walk. */
2315 dfs_find_vbase_instance (binfo, data)
2319 tree base = TREE_VALUE ((tree) data);
2321 if (BINFO_PRIMARY_P (binfo)
2322 && same_type_p (BINFO_TYPE (binfo), base))
2328 /* Find the real occurrence of the virtual BASE (a class type) in the
2329 hierarchy dominated by TYPE. */
2332 find_vbase_instance (base, type)
2338 instance = binfo_for_vbase (base, type);
2339 if (!BINFO_PRIMARY_P (instance))
2342 return dfs_walk (TYPE_BINFO (type),
2343 dfs_find_vbase_instance,
2345 build_tree_list (type, base));
2349 /* Debug info for C++ classes can get very large; try to avoid
2350 emitting it everywhere.
2352 Note that this optimization wins even when the target supports
2353 BINCL (if only slightly), and reduces the amount of work for the
2357 maybe_suppress_debug_info (t)
2360 /* We can't do the usual TYPE_DECL_SUPPRESS_DEBUG thing with DWARF, which
2361 does not support name references between translation units. It supports
2362 symbolic references between translation units, but only within a single
2363 executable or shared library.
2365 For DWARF 2, we handle TYPE_DECL_SUPPRESS_DEBUG by pretending
2366 that the type was never defined, so we only get the members we
2368 if (write_symbols == DWARF_DEBUG || write_symbols == NO_DEBUG)
2371 /* We might have set this earlier in cp_finish_decl. */
2372 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 0;
2374 /* If we already know how we're handling this class, handle debug info
2376 if (CLASSTYPE_INTERFACE_KNOWN (t))
2378 if (CLASSTYPE_INTERFACE_ONLY (t))
2379 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2380 /* else don't set it. */
2382 /* If the class has a vtable, write out the debug info along with
2384 else if (TYPE_CONTAINS_VPTR_P (t))
2385 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2387 /* Otherwise, just emit the debug info normally. */
2390 /* Note that we want debugging information for a base class of a class
2391 whose vtable is being emitted. Normally, this would happen because
2392 calling the constructor for a derived class implies calling the
2393 constructors for all bases, which involve initializing the
2394 appropriate vptr with the vtable for the base class; but in the
2395 presence of optimization, this initialization may be optimized
2396 away, so we tell finish_vtable_vardecl that we want the debugging
2397 information anyway. */
2400 dfs_debug_mark (binfo, data)
2402 void *data ATTRIBUTE_UNUSED;
2404 tree t = BINFO_TYPE (binfo);
2406 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
2411 /* Returns BINFO if we haven't already noted that we want debugging
2412 info for this base class. */
2415 dfs_debug_unmarkedp (binfo, data)
2417 void *data ATTRIBUTE_UNUSED;
2419 return (!CLASSTYPE_DEBUG_REQUESTED (BINFO_TYPE (binfo))
2420 ? binfo : NULL_TREE);
2423 /* Write out the debugging information for TYPE, whose vtable is being
2424 emitted. Also walk through our bases and note that we want to
2425 write out information for them. This avoids the problem of not
2426 writing any debug info for intermediate basetypes whose
2427 constructors, and thus the references to their vtables, and thus
2428 the vtables themselves, were optimized away. */
2431 note_debug_info_needed (type)
2434 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)))
2436 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)) = 0;
2437 rest_of_type_compilation (type, toplevel_bindings_p ());
2440 dfs_walk (TYPE_BINFO (type), dfs_debug_mark, dfs_debug_unmarkedp, 0);
2443 /* Subroutines of push_class_decls (). */
2445 /* Returns 1 iff BINFO is a base we shouldn't really be able to see into,
2446 because it (or one of the intermediate bases) depends on template parms. */
2449 dependent_base_p (binfo)
2452 for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo))
2454 if (currently_open_class (TREE_TYPE (binfo)))
2456 if (uses_template_parms (TREE_TYPE (binfo)))
2463 setup_class_bindings (name, type_binding_p)
2467 tree type_binding = NULL_TREE;
2470 /* If we've already done the lookup for this declaration, we're
2472 if (IDENTIFIER_CLASS_VALUE (name))
2475 /* First, deal with the type binding. */
2478 type_binding = lookup_member (current_class_type, name,
2481 if (TREE_CODE (type_binding) == TREE_LIST
2482 && TREE_TYPE (type_binding) == error_mark_node)
2483 /* NAME is ambiguous. */
2484 push_class_level_binding (name, type_binding);
2486 pushdecl_class_level (type_binding);
2489 /* Now, do the value binding. */
2490 value_binding = lookup_member (current_class_type, name,
2495 && (TREE_CODE (value_binding) == TYPE_DECL
2496 || DECL_CLASS_TEMPLATE_P (value_binding)
2497 || (TREE_CODE (value_binding) == TREE_LIST
2498 && TREE_TYPE (value_binding) == error_mark_node
2499 && (TREE_CODE (TREE_VALUE (value_binding))
2501 /* We found a type-binding, even when looking for a non-type
2502 binding. This means that we already processed this binding
2504 else if (value_binding)
2506 if (TREE_CODE (value_binding) == TREE_LIST
2507 && TREE_TYPE (value_binding) == error_mark_node)
2508 /* NAME is ambiguous. */
2509 push_class_level_binding (name, value_binding);
2512 if (BASELINK_P (value_binding))
2513 /* NAME is some overloaded functions. */
2514 value_binding = BASELINK_FUNCTIONS (value_binding);
2515 pushdecl_class_level (value_binding);
2520 /* Push class-level declarations for any names appearing in BINFO that
2524 dfs_push_type_decls (binfo, data)
2526 void *data ATTRIBUTE_UNUSED;
2531 type = BINFO_TYPE (binfo);
2532 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2533 if (DECL_NAME (fields) && TREE_CODE (fields) == TYPE_DECL
2534 && !(!same_type_p (type, current_class_type)
2535 && template_self_reference_p (type, fields)))
2536 setup_class_bindings (DECL_NAME (fields), /*type_binding_p=*/1);
2538 /* We can't just use BINFO_MARKED because envelope_add_decl uses
2539 DERIVED_FROM_P, which calls get_base_distance. */
2540 SET_BINFO_PUSHDECLS_MARKED (binfo);
2545 /* Push class-level declarations for any names appearing in BINFO that
2546 are not TYPE_DECLS. */
2549 dfs_push_decls (binfo, data)
2557 type = BINFO_TYPE (binfo);
2558 dep_base_p = (processing_template_decl && type != current_class_type
2559 && dependent_base_p (binfo));
2563 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2564 if (DECL_NAME (fields)
2565 && TREE_CODE (fields) != TYPE_DECL
2566 && TREE_CODE (fields) != USING_DECL
2567 && !DECL_ARTIFICIAL (fields))
2568 setup_class_bindings (DECL_NAME (fields), /*type_binding_p=*/0);
2569 else if (TREE_CODE (fields) == FIELD_DECL
2570 && ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
2571 dfs_push_decls (TYPE_BINFO (TREE_TYPE (fields)), data);
2573 method_vec = (CLASS_TYPE_P (type)
2574 ? CLASSTYPE_METHOD_VEC (type) : NULL_TREE);
2576 if (method_vec && TREE_VEC_LENGTH (method_vec) >= 3)
2581 /* Farm out constructors and destructors. */
2582 end = TREE_VEC_END (method_vec);
2584 for (methods = &TREE_VEC_ELT (method_vec, 2);
2585 methods < end && *methods;
2587 setup_class_bindings (DECL_NAME (OVL_CURRENT (*methods)),
2588 /*type_binding_p=*/0);
2592 CLEAR_BINFO_PUSHDECLS_MARKED (binfo);
2597 /* When entering the scope of a class, we cache all of the
2598 fields that that class provides within its inheritance
2599 lattice. Where ambiguities result, we mark them
2600 with `error_mark_node' so that if they are encountered
2601 without explicit qualification, we can emit an error
2605 push_class_decls (type)
2608 search_stack = push_search_level (search_stack, &search_obstack);
2610 /* Enter type declarations and mark. */
2611 dfs_walk (TYPE_BINFO (type), dfs_push_type_decls, unmarked_pushdecls_p, 0);
2613 /* Enter non-type declarations and unmark. */
2614 dfs_walk (TYPE_BINFO (type), dfs_push_decls, marked_pushdecls_p, 0);
2617 /* Here's a subroutine we need because C lacks lambdas. */
2620 dfs_unuse_fields (binfo, data)
2622 void *data ATTRIBUTE_UNUSED;
2624 tree type = TREE_TYPE (binfo);
2627 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
2629 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
2632 TREE_USED (fields) = 0;
2633 if (DECL_NAME (fields) == NULL_TREE
2634 && ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
2635 unuse_fields (TREE_TYPE (fields));
2645 dfs_walk (TYPE_BINFO (type), dfs_unuse_fields, unmarkedp, 0);
2651 /* We haven't pushed a search level when dealing with cached classes,
2652 so we'd better not try to pop it. */
2654 search_stack = pop_search_level (search_stack);
2658 print_search_statistics ()
2660 #ifdef GATHER_STATISTICS
2661 fprintf (stderr, "%d fields searched in %d[%d] calls to lookup_field[_1]\n",
2662 n_fields_searched, n_calls_lookup_field, n_calls_lookup_field_1);
2663 fprintf (stderr, "%d fnfields searched in %d calls to lookup_fnfields\n",
2664 n_outer_fields_searched, n_calls_lookup_fnfields);
2665 fprintf (stderr, "%d calls to get_base_type\n", n_calls_get_base_type);
2666 #else /* GATHER_STATISTICS */
2667 fprintf (stderr, "no search statistics\n");
2668 #endif /* GATHER_STATISTICS */
2672 init_search_processing ()
2674 gcc_obstack_init (&search_obstack);
2678 reinit_search_statistics ()
2680 #ifdef GATHER_STATISTICS
2681 n_fields_searched = 0;
2682 n_calls_lookup_field = 0, n_calls_lookup_field_1 = 0;
2683 n_calls_lookup_fnfields = 0, n_calls_lookup_fnfields_1 = 0;
2684 n_calls_get_base_type = 0;
2685 n_outer_fields_searched = 0;
2686 n_contexts_saved = 0;
2687 #endif /* GATHER_STATISTICS */
2691 add_conversions (binfo, data)
2696 tree method_vec = CLASSTYPE_METHOD_VEC (BINFO_TYPE (binfo));
2697 tree *conversions = (tree *) data;
2699 /* Some builtin types have no method vector, not even an empty one. */
2703 for (i = 2; i < TREE_VEC_LENGTH (method_vec); ++i)
2705 tree tmp = TREE_VEC_ELT (method_vec, i);
2708 if (!tmp || ! DECL_CONV_FN_P (OVL_CURRENT (tmp)))
2711 name = DECL_NAME (OVL_CURRENT (tmp));
2713 /* Make sure we don't already have this conversion. */
2714 if (! IDENTIFIER_MARKED (name))
2716 *conversions = tree_cons (binfo, tmp, *conversions);
2717 IDENTIFIER_MARKED (name) = 1;
2723 /* Return a TREE_LIST containing all the non-hidden user-defined
2724 conversion functions for TYPE (and its base-classes). The
2725 TREE_VALUE of each node is a FUNCTION_DECL or an OVERLOAD
2726 containing the conversion functions. The TREE_PURPOSE is the BINFO
2727 from which the conversion functions in this node were selected. */
2730 lookup_conversions (type)
2734 tree conversions = NULL_TREE;
2736 if (COMPLETE_TYPE_P (type))
2737 bfs_walk (TYPE_BINFO (type), add_conversions, 0, &conversions);
2739 for (t = conversions; t; t = TREE_CHAIN (t))
2740 IDENTIFIER_MARKED (DECL_NAME (OVL_CURRENT (TREE_VALUE (t)))) = 0;
2751 /* Check whether the empty class indicated by EMPTY_BINFO is also present
2752 at offset 0 in COMPARE_TYPE, and set found_overlap if so. */
2755 dfs_check_overlap (empty_binfo, data)
2759 struct overlap_info *oi = (struct overlap_info *) data;
2761 for (binfo = TYPE_BINFO (oi->compare_type);
2763 binfo = BINFO_BASETYPE (binfo, 0))
2765 if (BINFO_TYPE (binfo) == BINFO_TYPE (empty_binfo))
2767 oi->found_overlap = 1;
2770 else if (BINFO_BASETYPES (binfo) == NULL_TREE)
2777 /* Trivial function to stop base traversal when we find something. */
2780 dfs_no_overlap_yet (binfo, data)
2784 struct overlap_info *oi = (struct overlap_info *) data;
2785 return !oi->found_overlap ? binfo : NULL_TREE;
2788 /* Returns nonzero if EMPTY_TYPE or any of its bases can also be found at
2789 offset 0 in NEXT_TYPE. Used in laying out empty base class subobjects. */
2792 types_overlap_p (empty_type, next_type)
2793 tree empty_type, next_type;
2795 struct overlap_info oi;
2797 if (! IS_AGGR_TYPE (next_type))
2799 oi.compare_type = next_type;
2800 oi.found_overlap = 0;
2801 dfs_walk (TYPE_BINFO (empty_type), dfs_check_overlap,
2802 dfs_no_overlap_yet, &oi);
2803 return oi.found_overlap;
2806 /* Given a vtable VAR, determine which of the inherited classes the vtable
2807 inherits (in a loose sense) functions from.
2809 FIXME: This does not work with the new ABI. */
2812 binfo_for_vtable (var)
2815 tree main_binfo = TYPE_BINFO (DECL_CONTEXT (var));
2816 tree binfos = TYPE_BINFO_BASETYPES (BINFO_TYPE (main_binfo));
2817 int n_baseclasses = CLASSTYPE_N_BASECLASSES (BINFO_TYPE (main_binfo));
2820 for (i = 0; i < n_baseclasses; i++)
2822 tree base_binfo = TREE_VEC_ELT (binfos, i);
2823 if (base_binfo != NULL_TREE && BINFO_VTABLE (base_binfo) == var)
2827 /* If no secondary base classes matched, return the primary base, if
2829 if (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (main_binfo)))
2830 return get_primary_binfo (main_binfo);
2835 /* Returns the binfo of the first direct or indirect virtual base derived
2836 from BINFO, or NULL if binfo is not via virtual. */
2839 binfo_from_vbase (binfo)
2842 for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo))
2844 if (TREE_VIA_VIRTUAL (binfo))
2850 /* Returns the binfo of the first direct or indirect virtual base derived
2851 from BINFO up to the TREE_TYPE, LIMIT, or NULL if binfo is not
2855 binfo_via_virtual (binfo, limit)
2859 for (; binfo && (!limit || !same_type_p (BINFO_TYPE (binfo), limit));
2860 binfo = BINFO_INHERITANCE_CHAIN (binfo))
2862 if (TREE_VIA_VIRTUAL (binfo))
2868 /* Returns the BINFO (if any) for the virtual baseclass T of the class
2869 C from the CLASSTYPE_VBASECLASSES list. */
2872 binfo_for_vbase (basetype, classtype)
2878 binfo = purpose_member (basetype, CLASSTYPE_VBASECLASSES (classtype));
2879 return binfo ? TREE_VALUE (binfo) : NULL_TREE;