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, 2005, 2007, 2008, 2009, 2010
5 Free Software Foundation, Inc.
6 Contributed by Michael Tiemann (tiemann@cygnus.com)
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* High-level class interface. */
28 #include "coretypes.h"
38 static int is_subobject_of_p (tree, tree);
39 static tree dfs_lookup_base (tree, void *);
40 static tree dfs_dcast_hint_pre (tree, void *);
41 static tree dfs_dcast_hint_post (tree, void *);
42 static tree dfs_debug_mark (tree, void *);
43 static tree dfs_walk_once_r (tree, tree (*pre_fn) (tree, void *),
44 tree (*post_fn) (tree, void *), void *data);
45 static void dfs_unmark_r (tree);
46 static int check_hidden_convs (tree, int, int, tree, tree, tree);
47 static tree split_conversions (tree, tree, tree, tree);
48 static int lookup_conversions_r (tree, int, int,
49 tree, tree, tree, tree, tree *, tree *);
50 static int look_for_overrides_r (tree, tree);
51 static tree lookup_field_r (tree, void *);
52 static tree dfs_accessible_post (tree, void *);
53 static tree dfs_walk_once_accessible_r (tree, bool, bool,
54 tree (*pre_fn) (tree, void *),
55 tree (*post_fn) (tree, void *),
57 static tree dfs_walk_once_accessible (tree, bool,
58 tree (*pre_fn) (tree, void *),
59 tree (*post_fn) (tree, void *),
61 static tree dfs_access_in_type (tree, void *);
62 static access_kind access_in_type (tree, tree);
63 static int protected_accessible_p (tree, tree, tree);
64 static int friend_accessible_p (tree, tree, tree);
65 static tree dfs_get_pure_virtuals (tree, void *);
68 /* Variables for gathering statistics. */
69 #ifdef GATHER_STATISTICS
70 static int n_fields_searched;
71 static int n_calls_lookup_field, n_calls_lookup_field_1;
72 static int n_calls_lookup_fnfields, n_calls_lookup_fnfields_1;
73 static int n_calls_get_base_type;
74 static int n_outer_fields_searched;
75 static int n_contexts_saved;
76 #endif /* GATHER_STATISTICS */
79 /* Data for lookup_base and its workers. */
81 struct lookup_base_data_s
83 tree t; /* type being searched. */
84 tree base; /* The base type we're looking for. */
85 tree binfo; /* Found binfo. */
86 bool via_virtual; /* Found via a virtual path. */
87 bool ambiguous; /* Found multiply ambiguous */
88 bool repeated_base; /* Whether there are repeated bases in the
90 bool want_any; /* Whether we want any matching binfo. */
93 /* Worker function for lookup_base. See if we've found the desired
94 base and update DATA_ (a pointer to LOOKUP_BASE_DATA_S). */
97 dfs_lookup_base (tree binfo, void *data_)
99 struct lookup_base_data_s *data = (struct lookup_base_data_s *) data_;
101 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->base))
107 = binfo_via_virtual (data->binfo, data->t) != NULL_TREE;
109 if (!data->repeated_base)
110 /* If there are no repeated bases, we can stop now. */
113 if (data->want_any && !data->via_virtual)
114 /* If this is a non-virtual base, then we can't do
118 return dfs_skip_bases;
122 gcc_assert (binfo != data->binfo);
124 /* We've found more than one matching binfo. */
127 /* This is immediately ambiguous. */
128 data->binfo = NULL_TREE;
129 data->ambiguous = true;
130 return error_mark_node;
133 /* Prefer one via a non-virtual path. */
134 if (!binfo_via_virtual (binfo, data->t))
137 data->via_virtual = false;
141 /* There must be repeated bases, otherwise we'd have stopped
142 on the first base we found. */
143 return dfs_skip_bases;
150 /* Returns true if type BASE is accessible in T. (BASE is known to be
151 a (possibly non-proper) base class of T.) If CONSIDER_LOCAL_P is
152 true, consider any special access of the current scope, or access
153 bestowed by friendship. */
156 accessible_base_p (tree t, tree base, bool consider_local_p)
160 /* [class.access.base]
162 A base class is said to be accessible if an invented public
163 member of the base class is accessible.
165 If BASE is a non-proper base, this condition is trivially
167 if (same_type_p (t, base))
169 /* Rather than inventing a public member, we use the implicit
170 public typedef created in the scope of every class. */
171 decl = TYPE_FIELDS (base);
172 while (!DECL_SELF_REFERENCE_P (decl))
173 decl = DECL_CHAIN (decl);
174 while (ANON_AGGR_TYPE_P (t))
175 t = TYPE_CONTEXT (t);
176 return accessible_p (t, decl, consider_local_p);
179 /* Lookup BASE in the hierarchy dominated by T. Do access checking as
180 ACCESS specifies. Return the binfo we discover. If KIND_PTR is
181 non-NULL, fill with information about what kind of base we
184 If the base is inaccessible, or ambiguous, and the ba_quiet bit is
185 not set in ACCESS, then an error is issued and error_mark_node is
186 returned. If the ba_quiet bit is set, then no error is issued and
187 NULL_TREE is returned. */
190 lookup_base (tree t, tree base, base_access access, base_kind *kind_ptr)
196 if (t == error_mark_node || base == error_mark_node)
199 *kind_ptr = bk_not_base;
200 return error_mark_node;
202 gcc_assert (TYPE_P (base));
211 t = complete_type (TYPE_MAIN_VARIANT (t));
212 t_binfo = TYPE_BINFO (t);
215 base = TYPE_MAIN_VARIANT (base);
217 /* If BASE is incomplete, it can't be a base of T--and instantiating it
218 might cause an error. */
219 if (t_binfo && CLASS_TYPE_P (base) && COMPLETE_OR_OPEN_TYPE_P (base))
221 struct lookup_base_data_s data;
225 data.binfo = NULL_TREE;
226 data.ambiguous = data.via_virtual = false;
227 data.repeated_base = CLASSTYPE_REPEATED_BASE_P (t);
228 data.want_any = access == ba_any;
230 dfs_walk_once (t_binfo, dfs_lookup_base, NULL, &data);
234 bk = data.ambiguous ? bk_ambig : bk_not_base;
235 else if (binfo == t_binfo)
237 else if (data.via_virtual)
248 /* Check that the base is unambiguous and accessible. */
249 if (access != ba_any)
256 if (!(access & ba_quiet))
258 error ("%qT is an ambiguous base of %qT", base, t);
259 binfo = error_mark_node;
264 if ((access & ba_check_bit)
265 /* If BASE is incomplete, then BASE and TYPE are probably
266 the same, in which case BASE is accessible. If they
267 are not the same, then TYPE is invalid. In that case,
268 there's no need to issue another error here, and
269 there's no implicit typedef to use in the code that
270 follows, so we skip the check. */
271 && COMPLETE_TYPE_P (base)
272 && !accessible_base_p (t, base, !(access & ba_ignore_scope)))
274 if (!(access & ba_quiet))
276 error ("%qT is an inaccessible base of %qT", base, t);
277 binfo = error_mark_node;
281 bk = bk_inaccessible;
292 /* Data for dcast_base_hint walker. */
296 tree subtype; /* The base type we're looking for. */
297 int virt_depth; /* Number of virtual bases encountered from most
299 tree offset; /* Best hint offset discovered so far. */
300 bool repeated_base; /* Whether there are repeated bases in the
304 /* Worker for dcast_base_hint. Search for the base type being cast
308 dfs_dcast_hint_pre (tree binfo, void *data_)
310 struct dcast_data_s *data = (struct dcast_data_s *) data_;
312 if (BINFO_VIRTUAL_P (binfo))
315 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->subtype))
317 if (data->virt_depth)
319 data->offset = ssize_int (-1);
323 data->offset = ssize_int (-3);
325 data->offset = BINFO_OFFSET (binfo);
327 return data->repeated_base ? dfs_skip_bases : data->offset;
333 /* Worker for dcast_base_hint. Track the virtual depth. */
336 dfs_dcast_hint_post (tree binfo, void *data_)
338 struct dcast_data_s *data = (struct dcast_data_s *) data_;
340 if (BINFO_VIRTUAL_P (binfo))
346 /* The dynamic cast runtime needs a hint about how the static SUBTYPE type
347 started from is related to the required TARGET type, in order to optimize
348 the inheritance graph search. This information is independent of the
349 current context, and ignores private paths, hence get_base_distance is
350 inappropriate. Return a TREE specifying the base offset, BOFF.
351 BOFF >= 0, there is only one public non-virtual SUBTYPE base at offset BOFF,
352 and there are no public virtual SUBTYPE bases.
353 BOFF == -1, SUBTYPE occurs as multiple public virtual or non-virtual bases.
354 BOFF == -2, SUBTYPE is not a public base.
355 BOFF == -3, SUBTYPE occurs as multiple public non-virtual bases. */
358 dcast_base_hint (tree subtype, tree target)
360 struct dcast_data_s data;
362 data.subtype = subtype;
364 data.offset = NULL_TREE;
365 data.repeated_base = CLASSTYPE_REPEATED_BASE_P (target);
367 dfs_walk_once_accessible (TYPE_BINFO (target), /*friends=*/false,
368 dfs_dcast_hint_pre, dfs_dcast_hint_post, &data);
369 return data.offset ? data.offset : ssize_int (-2);
372 /* Search for a member with name NAME in a multiple inheritance
373 lattice specified by TYPE. If it does not exist, return NULL_TREE.
374 If the member is ambiguously referenced, return `error_mark_node'.
375 Otherwise, return a DECL with the indicated name. If WANT_TYPE is
376 true, type declarations are preferred. */
378 /* Do a 1-level search for NAME as a member of TYPE. The caller must
379 figure out whether it can access this field. (Since it is only one
380 level, this is reasonable.) */
383 lookup_field_1 (tree type, tree name, bool want_type)
387 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
388 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM
389 || TREE_CODE (type) == TYPENAME_TYPE)
390 /* The TYPE_FIELDS of a TEMPLATE_TYPE_PARM and
391 BOUND_TEMPLATE_TEMPLATE_PARM are not fields at all;
392 instead TYPE_FIELDS is the TEMPLATE_PARM_INDEX. (Miraculously,
393 the code often worked even when we treated the index as a list
395 The TYPE_FIELDS of TYPENAME_TYPE is its TYPENAME_TYPE_FULLNAME. */
398 if (CLASSTYPE_SORTED_FIELDS (type))
400 tree *fields = &CLASSTYPE_SORTED_FIELDS (type)->elts[0];
401 int lo = 0, hi = CLASSTYPE_SORTED_FIELDS (type)->len;
408 #ifdef GATHER_STATISTICS
410 #endif /* GATHER_STATISTICS */
412 if (DECL_NAME (fields[i]) > name)
414 else if (DECL_NAME (fields[i]) < name)
420 /* We might have a nested class and a field with the
421 same name; we sorted them appropriately via
422 field_decl_cmp, so just look for the first or last
423 field with this name. */
428 while (i >= lo && DECL_NAME (fields[i]) == name);
429 if (TREE_CODE (field) != TYPE_DECL
430 && !DECL_TYPE_TEMPLATE_P (field))
437 while (i < hi && DECL_NAME (fields[i]) == name);
445 field = TYPE_FIELDS (type);
447 #ifdef GATHER_STATISTICS
448 n_calls_lookup_field_1++;
449 #endif /* GATHER_STATISTICS */
450 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
452 #ifdef GATHER_STATISTICS
454 #endif /* GATHER_STATISTICS */
455 gcc_assert (DECL_P (field));
456 if (DECL_NAME (field) == NULL_TREE
457 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
459 tree temp = lookup_field_1 (TREE_TYPE (field), name, want_type);
463 if (TREE_CODE (field) == USING_DECL)
465 /* We generally treat class-scope using-declarations as
466 ARM-style access specifications, because support for the
467 ISO semantics has not been implemented. So, in general,
468 there's no reason to return a USING_DECL, and the rest of
469 the compiler cannot handle that. Once the class is
470 defined, USING_DECLs are purged from TYPE_FIELDS; see
471 handle_using_decl. However, we make special efforts to
472 make using-declarations in class templates and class
473 template partial specializations work correctly. */
474 if (!DECL_DEPENDENT_P (field))
478 if (DECL_NAME (field) == name
480 || TREE_CODE (field) == TYPE_DECL
481 || DECL_TYPE_TEMPLATE_P (field)))
485 if (name == vptr_identifier)
487 /* Give the user what s/he thinks s/he wants. */
488 if (TYPE_POLYMORPHIC_P (type))
489 return TYPE_VFIELD (type);
494 /* Return the FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, or
495 NAMESPACE_DECL corresponding to the innermost non-block scope. */
500 /* There are a number of cases we need to be aware of here:
501 current_class_type current_function_decl
508 Those last two make life interesting. If we're in a function which is
509 itself inside a class, we need decls to go into the fn's decls (our
510 second case below). But if we're in a class and the class itself is
511 inside a function, we need decls to go into the decls for the class. To
512 achieve this last goal, we must see if, when both current_class_ptr and
513 current_function_decl are set, the class was declared inside that
514 function. If so, we know to put the decls into the class's scope. */
515 if (current_function_decl && current_class_type
516 && ((DECL_FUNCTION_MEMBER_P (current_function_decl)
517 && same_type_p (DECL_CONTEXT (current_function_decl),
519 || (DECL_FRIEND_CONTEXT (current_function_decl)
520 && same_type_p (DECL_FRIEND_CONTEXT (current_function_decl),
521 current_class_type))))
522 return current_function_decl;
523 if (current_class_type)
524 return current_class_type;
525 if (current_function_decl)
526 return current_function_decl;
527 return current_namespace;
530 /* Returns nonzero if we are currently in a function scope. Note
531 that this function returns zero if we are within a local class, but
532 not within a member function body of the local class. */
535 at_function_scope_p (void)
537 tree cs = current_scope ();
538 return cs && TREE_CODE (cs) == FUNCTION_DECL;
541 /* Returns true if the innermost active scope is a class scope. */
544 at_class_scope_p (void)
546 tree cs = current_scope ();
547 return cs && TYPE_P (cs);
550 /* Returns true if the innermost active scope is a namespace scope. */
553 at_namespace_scope_p (void)
555 tree cs = current_scope ();
556 return cs && TREE_CODE (cs) == NAMESPACE_DECL;
559 /* Return the scope of DECL, as appropriate when doing name-lookup. */
562 context_for_name_lookup (tree decl)
566 For the purposes of name lookup, after the anonymous union
567 definition, the members of the anonymous union are considered to
568 have been defined in the scope in which the anonymous union is
570 tree context = DECL_CONTEXT (decl);
572 while (context && TYPE_P (context) && ANON_AGGR_TYPE_P (context))
573 context = TYPE_CONTEXT (context);
575 context = global_namespace;
580 /* The accessibility routines use BINFO_ACCESS for scratch space
581 during the computation of the accessibility of some declaration. */
583 #define BINFO_ACCESS(NODE) \
584 ((access_kind) ((TREE_PUBLIC (NODE) << 1) | TREE_PRIVATE (NODE)))
586 /* Set the access associated with NODE to ACCESS. */
588 #define SET_BINFO_ACCESS(NODE, ACCESS) \
589 ((TREE_PUBLIC (NODE) = ((ACCESS) & 2) != 0), \
590 (TREE_PRIVATE (NODE) = ((ACCESS) & 1) != 0))
592 /* Called from access_in_type via dfs_walk. Calculate the access to
593 DATA (which is really a DECL) in BINFO. */
596 dfs_access_in_type (tree binfo, void *data)
598 tree decl = (tree) data;
599 tree type = BINFO_TYPE (binfo);
600 access_kind access = ak_none;
602 if (context_for_name_lookup (decl) == type)
604 /* If we have descended to the scope of DECL, just note the
605 appropriate access. */
606 if (TREE_PRIVATE (decl))
608 else if (TREE_PROTECTED (decl))
609 access = ak_protected;
615 /* First, check for an access-declaration that gives us more
616 access to the DECL. The CONST_DECL for an enumeration
617 constant will not have DECL_LANG_SPECIFIC, and thus no
619 if (DECL_LANG_SPECIFIC (decl) && !DECL_DISCRIMINATOR_P (decl))
621 tree decl_access = purpose_member (type, DECL_ACCESS (decl));
625 decl_access = TREE_VALUE (decl_access);
627 if (decl_access == access_public_node)
629 else if (decl_access == access_protected_node)
630 access = ak_protected;
631 else if (decl_access == access_private_node)
642 VEC(tree,gc) *accesses;
644 /* Otherwise, scan our baseclasses, and pick the most favorable
646 accesses = BINFO_BASE_ACCESSES (binfo);
647 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
649 tree base_access = VEC_index (tree, accesses, i);
650 access_kind base_access_now = BINFO_ACCESS (base_binfo);
652 if (base_access_now == ak_none || base_access_now == ak_private)
653 /* If it was not accessible in the base, or only
654 accessible as a private member, we can't access it
656 base_access_now = ak_none;
657 else if (base_access == access_protected_node)
658 /* Public and protected members in the base become
660 base_access_now = ak_protected;
661 else if (base_access == access_private_node)
662 /* Public and protected members in the base become
664 base_access_now = ak_private;
666 /* See if the new access, via this base, gives more
667 access than our previous best access. */
668 if (base_access_now != ak_none
669 && (access == ak_none || base_access_now < access))
671 access = base_access_now;
673 /* If the new access is public, we can't do better. */
674 if (access == ak_public)
681 /* Note the access to DECL in TYPE. */
682 SET_BINFO_ACCESS (binfo, access);
687 /* Return the access to DECL in TYPE. */
690 access_in_type (tree type, tree decl)
692 tree binfo = TYPE_BINFO (type);
694 /* We must take into account
698 If a name can be reached by several paths through a multiple
699 inheritance graph, the access is that of the path that gives
702 The algorithm we use is to make a post-order depth-first traversal
703 of the base-class hierarchy. As we come up the tree, we annotate
704 each node with the most lenient access. */
705 dfs_walk_once (binfo, NULL, dfs_access_in_type, decl);
707 return BINFO_ACCESS (binfo);
710 /* Returns nonzero if it is OK to access DECL through an object
711 indicated by BINFO in the context of DERIVED. */
714 protected_accessible_p (tree decl, tree derived, tree binfo)
718 /* We're checking this clause from [class.access.base]
720 m as a member of N is protected, and the reference occurs in a
721 member or friend of class N, or in a member or friend of a
722 class P derived from N, where m as a member of P is public, private
725 Here DERIVED is a possible P, DECL is m and BINFO_TYPE (binfo) is N. */
727 /* If DERIVED isn't derived from N, then it can't be a P. */
728 if (!DERIVED_FROM_P (BINFO_TYPE (binfo), derived))
731 access = access_in_type (derived, decl);
733 /* If m is inaccessible in DERIVED, then it's not a P. */
734 if (access == ak_none)
739 When a friend or a member function of a derived class references
740 a protected nonstatic member of a base class, an access check
741 applies in addition to those described earlier in clause
742 _class.access_) Except when forming a pointer to member
743 (_expr.unary.op_), the access must be through a pointer to,
744 reference to, or object of the derived class itself (or any class
745 derived from that class) (_expr.ref_). If the access is to form
746 a pointer to member, the nested-name-specifier shall name the
747 derived class (or any class derived from that class). */
748 if (DECL_NONSTATIC_MEMBER_P (decl))
750 /* We can tell through what the reference is occurring by
751 chasing BINFO up to the root. */
753 while (BINFO_INHERITANCE_CHAIN (t))
754 t = BINFO_INHERITANCE_CHAIN (t);
756 if (!DERIVED_FROM_P (derived, BINFO_TYPE (t)))
763 /* Returns nonzero if SCOPE is a friend of a type which would be able
764 to access DECL through the object indicated by BINFO. */
767 friend_accessible_p (tree scope, tree decl, tree binfo)
769 tree befriending_classes;
775 if (TREE_CODE (scope) == FUNCTION_DECL
776 || DECL_FUNCTION_TEMPLATE_P (scope))
777 befriending_classes = DECL_BEFRIENDING_CLASSES (scope);
778 else if (TYPE_P (scope))
779 befriending_classes = CLASSTYPE_BEFRIENDING_CLASSES (scope);
783 for (t = befriending_classes; t; t = TREE_CHAIN (t))
784 if (protected_accessible_p (decl, TREE_VALUE (t), binfo))
787 /* Nested classes have the same access as their enclosing types, as
788 per DR 45 (this is a change from the standard). */
790 for (t = TYPE_CONTEXT (scope); t && TYPE_P (t); t = TYPE_CONTEXT (t))
791 if (protected_accessible_p (decl, t, binfo))
794 if (TREE_CODE (scope) == FUNCTION_DECL
795 || DECL_FUNCTION_TEMPLATE_P (scope))
797 /* Perhaps this SCOPE is a member of a class which is a
799 if (DECL_CLASS_SCOPE_P (scope)
800 && friend_accessible_p (DECL_CONTEXT (scope), decl, binfo))
803 /* Or an instantiation of something which is a friend. */
804 if (DECL_TEMPLATE_INFO (scope))
807 /* Increment processing_template_decl to make sure that
808 dependent_type_p works correctly. */
809 ++processing_template_decl;
810 ret = friend_accessible_p (DECL_TI_TEMPLATE (scope), decl, binfo);
811 --processing_template_decl;
819 /* Called via dfs_walk_once_accessible from accessible_p */
822 dfs_accessible_post (tree binfo, void *data ATTRIBUTE_UNUSED)
824 if (BINFO_ACCESS (binfo) != ak_none)
826 tree scope = current_scope ();
827 if (scope && TREE_CODE (scope) != NAMESPACE_DECL
828 && is_friend (BINFO_TYPE (binfo), scope))
835 /* DECL is a declaration from a base class of TYPE, which was the
836 class used to name DECL. Return nonzero if, in the current
837 context, DECL is accessible. If TYPE is actually a BINFO node,
838 then we can tell in what context the access is occurring by looking
839 at the most derived class along the path indicated by BINFO. If
840 CONSIDER_LOCAL is true, do consider special access the current
841 scope or friendship thereof we might have. */
844 accessible_p (tree type, tree decl, bool consider_local_p)
850 /* Nonzero if it's OK to access DECL if it has protected
851 accessibility in TYPE. */
852 int protected_ok = 0;
854 /* If this declaration is in a block or namespace scope, there's no
856 if (!TYPE_P (context_for_name_lookup (decl)))
859 /* There is no need to perform access checks inside a thunk. */
860 scope = current_scope ();
861 if (scope && DECL_THUNK_P (scope))
864 /* In a template declaration, we cannot be sure whether the
865 particular specialization that is instantiated will be a friend
866 or not. Therefore, all access checks are deferred until
867 instantiation. However, PROCESSING_TEMPLATE_DECL is set in the
868 parameter list for a template (because we may see dependent types
869 in default arguments for template parameters), and access
870 checking should be performed in the outermost parameter list. */
871 if (processing_template_decl
872 && (!processing_template_parmlist || processing_template_decl > 1))
878 type = BINFO_TYPE (type);
881 binfo = TYPE_BINFO (type);
883 /* [class.access.base]
885 A member m is accessible when named in class N if
887 --m as a member of N is public, or
889 --m as a member of N is private, and the reference occurs in a
890 member or friend of class N, or
892 --m as a member of N is protected, and the reference occurs in a
893 member or friend of class N, or in a member or friend of a
894 class P derived from N, where m as a member of P is private or
897 --there exists a base class B of N that is accessible at the point
898 of reference, and m is accessible when named in class B.
900 We walk the base class hierarchy, checking these conditions. */
902 if (consider_local_p)
904 /* Figure out where the reference is occurring. Check to see if
905 DECL is private or protected in this scope, since that will
906 determine whether protected access is allowed. */
907 if (current_class_type)
908 protected_ok = protected_accessible_p (decl,
909 current_class_type, binfo);
911 /* Now, loop through the classes of which we are a friend. */
913 protected_ok = friend_accessible_p (scope, decl, binfo);
916 /* Standardize the binfo that access_in_type will use. We don't
917 need to know what path was chosen from this point onwards. */
918 binfo = TYPE_BINFO (type);
920 /* Compute the accessibility of DECL in the class hierarchy
921 dominated by type. */
922 access = access_in_type (type, decl);
923 if (access == ak_public
924 || (access == ak_protected && protected_ok))
927 if (!consider_local_p)
930 /* Walk the hierarchy again, looking for a base class that allows
932 return dfs_walk_once_accessible (binfo, /*friends=*/true,
933 NULL, dfs_accessible_post, NULL)
937 struct lookup_field_info {
938 /* The type in which we're looking. */
940 /* The name of the field for which we're looking. */
942 /* If non-NULL, the current result of the lookup. */
944 /* The path to RVAL. */
946 /* If non-NULL, the lookup was ambiguous, and this is a list of the
949 /* If nonzero, we are looking for types, not data members. */
951 /* If something went wrong, a message indicating what. */
955 /* Nonzero for a class member means that it is shared between all objects
958 [class.member.lookup]:If the resulting set of declarations are not all
959 from sub-objects of the same type, or the set has a nonstatic member
960 and includes members from distinct sub-objects, there is an ambiguity
961 and the program is ill-formed.
963 This function checks that T contains no nonstatic members. */
966 shared_member_p (tree t)
968 if (TREE_CODE (t) == VAR_DECL || TREE_CODE (t) == TYPE_DECL \
969 || TREE_CODE (t) == CONST_DECL)
971 if (is_overloaded_fn (t))
974 for (; t; t = OVL_NEXT (t))
976 tree fn = OVL_CURRENT (t);
977 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
985 /* Routine to see if the sub-object denoted by the binfo PARENT can be
986 found as a base class and sub-object of the object denoted by
990 is_subobject_of_p (tree parent, tree binfo)
994 for (probe = parent; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
998 if (BINFO_VIRTUAL_P (probe))
999 return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (binfo))
1005 /* DATA is really a struct lookup_field_info. Look for a field with
1006 the name indicated there in BINFO. If this function returns a
1007 non-NULL value it is the result of the lookup. Called from
1008 lookup_field via breadth_first_search. */
1011 lookup_field_r (tree binfo, void *data)
1013 struct lookup_field_info *lfi = (struct lookup_field_info *) data;
1014 tree type = BINFO_TYPE (binfo);
1015 tree nval = NULL_TREE;
1017 /* If this is a dependent base, don't look in it. */
1018 if (BINFO_DEPENDENT_BASE_P (binfo))
1021 /* If this base class is hidden by the best-known value so far, we
1022 don't need to look. */
1023 if (lfi->rval_binfo && BINFO_INHERITANCE_CHAIN (binfo) == lfi->rval_binfo
1024 && !BINFO_VIRTUAL_P (binfo))
1025 return dfs_skip_bases;
1027 /* First, look for a function. There can't be a function and a data
1028 member with the same name, and if there's a function and a type
1029 with the same name, the type is hidden by the function. */
1030 if (!lfi->want_type)
1032 int idx = lookup_fnfields_1 (type, lfi->name);
1034 nval = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), idx);
1038 /* Look for a data member or type. */
1039 nval = lookup_field_1 (type, lfi->name, lfi->want_type);
1041 /* If there is no declaration with the indicated name in this type,
1042 then there's nothing to do. */
1046 /* If we're looking up a type (as with an elaborated type specifier)
1047 we ignore all non-types we find. */
1048 if (lfi->want_type && TREE_CODE (nval) != TYPE_DECL
1049 && !DECL_TYPE_TEMPLATE_P (nval))
1051 if (lfi->name == TYPE_IDENTIFIER (type))
1053 /* If the aggregate has no user defined constructors, we allow
1054 it to have fields with the same name as the enclosing type.
1055 If we are looking for that name, find the corresponding
1057 for (nval = TREE_CHAIN (nval); nval; nval = TREE_CHAIN (nval))
1058 if (DECL_NAME (nval) == lfi->name
1059 && TREE_CODE (nval) == TYPE_DECL)
1064 if (!nval && CLASSTYPE_NESTED_UTDS (type) != NULL)
1066 binding_entry e = binding_table_find (CLASSTYPE_NESTED_UTDS (type),
1069 nval = TYPE_MAIN_DECL (e->type);
1075 /* If the lookup already found a match, and the new value doesn't
1076 hide the old one, we might have an ambiguity. */
1078 && !is_subobject_of_p (lfi->rval_binfo, binfo))
1081 if (nval == lfi->rval && shared_member_p (nval))
1082 /* The two things are really the same. */
1084 else if (is_subobject_of_p (binfo, lfi->rval_binfo))
1085 /* The previous value hides the new one. */
1089 /* We have a real ambiguity. We keep a chain of all the
1091 if (!lfi->ambiguous && lfi->rval)
1093 /* This is the first time we noticed an ambiguity. Add
1094 what we previously thought was a reasonable candidate
1096 lfi->ambiguous = tree_cons (NULL_TREE, lfi->rval, NULL_TREE);
1097 TREE_TYPE (lfi->ambiguous) = error_mark_node;
1100 /* Add the new value. */
1101 lfi->ambiguous = tree_cons (NULL_TREE, nval, lfi->ambiguous);
1102 TREE_TYPE (lfi->ambiguous) = error_mark_node;
1103 lfi->errstr = G_("request for member %qD is ambiguous");
1109 lfi->rval_binfo = binfo;
1113 /* Don't look for constructors or destructors in base classes. */
1114 if (IDENTIFIER_CTOR_OR_DTOR_P (lfi->name))
1115 return dfs_skip_bases;
1119 /* Return a "baselink" with BASELINK_BINFO, BASELINK_ACCESS_BINFO,
1120 BASELINK_FUNCTIONS, and BASELINK_OPTYPE set to BINFO, ACCESS_BINFO,
1121 FUNCTIONS, and OPTYPE respectively. */
1124 build_baselink (tree binfo, tree access_binfo, tree functions, tree optype)
1128 gcc_assert (TREE_CODE (functions) == FUNCTION_DECL
1129 || TREE_CODE (functions) == TEMPLATE_DECL
1130 || TREE_CODE (functions) == TEMPLATE_ID_EXPR
1131 || TREE_CODE (functions) == OVERLOAD);
1132 gcc_assert (!optype || TYPE_P (optype));
1133 gcc_assert (TREE_TYPE (functions));
1135 baselink = make_node (BASELINK);
1136 TREE_TYPE (baselink) = TREE_TYPE (functions);
1137 BASELINK_BINFO (baselink) = binfo;
1138 BASELINK_ACCESS_BINFO (baselink) = access_binfo;
1139 BASELINK_FUNCTIONS (baselink) = functions;
1140 BASELINK_OPTYPE (baselink) = optype;
1145 /* Look for a member named NAME in an inheritance lattice dominated by
1146 XBASETYPE. If PROTECT is 0 or two, we do not check access. If it
1147 is 1, we enforce accessibility. If PROTECT is zero, then, for an
1148 ambiguous lookup, we return NULL. If PROTECT is 1, we issue error
1149 messages about inaccessible or ambiguous lookup. If PROTECT is 2,
1150 we return a TREE_LIST whose TREE_TYPE is error_mark_node and whose
1151 TREE_VALUEs are the list of ambiguous candidates.
1153 WANT_TYPE is 1 when we should only return TYPE_DECLs.
1155 If nothing can be found return NULL_TREE and do not issue an error. */
1158 lookup_member (tree xbasetype, tree name, int protect, bool want_type,
1159 tsubst_flags_t complain)
1161 tree rval, rval_binfo = NULL_TREE;
1162 tree type = NULL_TREE, basetype_path = NULL_TREE;
1163 struct lookup_field_info lfi;
1165 /* rval_binfo is the binfo associated with the found member, note,
1166 this can be set with useful information, even when rval is not
1167 set, because it must deal with ALL members, not just non-function
1168 members. It is used for ambiguity checking and the hidden
1169 checks. Whereas rval is only set if a proper (not hidden)
1170 non-function member is found. */
1172 const char *errstr = 0;
1174 if (name == error_mark_node)
1177 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
1179 if (TREE_CODE (xbasetype) == TREE_BINFO)
1181 type = BINFO_TYPE (xbasetype);
1182 basetype_path = xbasetype;
1186 if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype)))
1189 xbasetype = NULL_TREE;
1192 type = complete_type (type);
1194 basetype_path = TYPE_BINFO (type);
1199 #ifdef GATHER_STATISTICS
1200 n_calls_lookup_field++;
1201 #endif /* GATHER_STATISTICS */
1203 memset (&lfi, 0, sizeof (lfi));
1206 lfi.want_type = want_type;
1207 dfs_walk_all (basetype_path, &lookup_field_r, NULL, &lfi);
1209 rval_binfo = lfi.rval_binfo;
1211 type = BINFO_TYPE (rval_binfo);
1212 errstr = lfi.errstr;
1214 /* If we are not interested in ambiguities, don't report them;
1215 just return NULL_TREE. */
1216 if (!protect && lfi.ambiguous)
1222 return lfi.ambiguous;
1229 In the case of overloaded function names, access control is
1230 applied to the function selected by overloaded resolution.
1232 We cannot check here, even if RVAL is only a single non-static
1233 member function, since we do not know what the "this" pointer
1236 class A { protected: void f(); };
1237 class B : public A {
1244 only the first call to "f" is valid. However, if the function is
1245 static, we can check. */
1247 && !really_overloaded_fn (rval)
1248 && !(TREE_CODE (rval) == FUNCTION_DECL
1249 && DECL_NONSTATIC_MEMBER_FUNCTION_P (rval)))
1250 perform_or_defer_access_check (basetype_path, rval, rval);
1252 if (errstr && protect)
1254 if (complain & tf_error)
1256 error (errstr, name, type);
1258 print_candidates (lfi.ambiguous);
1260 rval = error_mark_node;
1263 if (rval && is_overloaded_fn (rval))
1264 rval = build_baselink (rval_binfo, basetype_path, rval,
1265 (IDENTIFIER_TYPENAME_P (name)
1266 ? TREE_TYPE (name): NULL_TREE));
1270 /* Like lookup_member, except that if we find a function member we
1271 return NULL_TREE. */
1274 lookup_field (tree xbasetype, tree name, int protect, bool want_type)
1276 tree rval = lookup_member (xbasetype, name, protect, want_type,
1277 tf_warning_or_error);
1279 /* Ignore functions, but propagate the ambiguity list. */
1280 if (!error_operand_p (rval)
1281 && (rval && BASELINK_P (rval)))
1287 /* Like lookup_member, except that if we find a non-function member we
1288 return NULL_TREE. */
1291 lookup_fnfields (tree xbasetype, tree name, int protect)
1293 tree rval = lookup_member (xbasetype, name, protect, /*want_type=*/false,
1294 tf_warning_or_error);
1296 /* Ignore non-functions, but propagate the ambiguity list. */
1297 if (!error_operand_p (rval)
1298 && (rval && !BASELINK_P (rval)))
1304 /* Return the index in the CLASSTYPE_METHOD_VEC for CLASS_TYPE
1305 corresponding to "operator TYPE ()", or -1 if there is no such
1306 operator. Only CLASS_TYPE itself is searched; this routine does
1307 not scan the base classes of CLASS_TYPE. */
1310 lookup_conversion_operator (tree class_type, tree type)
1314 if (TYPE_HAS_CONVERSION (class_type))
1318 VEC(tree,gc) *methods = CLASSTYPE_METHOD_VEC (class_type);
1320 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
1321 VEC_iterate (tree, methods, i, fn); ++i)
1323 /* All the conversion operators come near the beginning of
1324 the class. Therefore, if FN is not a conversion
1325 operator, there is no matching conversion operator in
1327 fn = OVL_CURRENT (fn);
1328 if (!DECL_CONV_FN_P (fn))
1331 if (TREE_CODE (fn) == TEMPLATE_DECL)
1332 /* All the templated conversion functions are on the same
1333 slot, so remember it. */
1335 else if (same_type_p (DECL_CONV_FN_TYPE (fn), type))
1343 /* TYPE is a class type. Return the index of the fields within
1344 the method vector with name NAME, or -1 if no such field exists.
1345 Does not lazily declare implicitly-declared member functions. */
1348 lookup_fnfields_idx_nolazy (tree type, tree name)
1350 VEC(tree,gc) *method_vec;
1355 if (!CLASS_TYPE_P (type))
1358 method_vec = CLASSTYPE_METHOD_VEC (type);
1362 #ifdef GATHER_STATISTICS
1363 n_calls_lookup_fnfields_1++;
1364 #endif /* GATHER_STATISTICS */
1366 /* Constructors are first... */
1367 if (name == ctor_identifier)
1369 fn = CLASSTYPE_CONSTRUCTORS (type);
1370 return fn ? CLASSTYPE_CONSTRUCTOR_SLOT : -1;
1372 /* and destructors are second. */
1373 if (name == dtor_identifier)
1375 fn = CLASSTYPE_DESTRUCTORS (type);
1376 return fn ? CLASSTYPE_DESTRUCTOR_SLOT : -1;
1378 if (IDENTIFIER_TYPENAME_P (name))
1379 return lookup_conversion_operator (type, TREE_TYPE (name));
1381 /* Skip the conversion operators. */
1382 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
1383 VEC_iterate (tree, method_vec, i, fn);
1385 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1388 /* If the type is complete, use binary search. */
1389 if (COMPLETE_TYPE_P (type))
1395 hi = VEC_length (tree, method_vec);
1400 #ifdef GATHER_STATISTICS
1401 n_outer_fields_searched++;
1402 #endif /* GATHER_STATISTICS */
1404 tmp = VEC_index (tree, method_vec, i);
1405 tmp = DECL_NAME (OVL_CURRENT (tmp));
1408 else if (tmp < name)
1415 for (; VEC_iterate (tree, method_vec, i, fn); ++i)
1417 #ifdef GATHER_STATISTICS
1418 n_outer_fields_searched++;
1419 #endif /* GATHER_STATISTICS */
1420 if (DECL_NAME (OVL_CURRENT (fn)) == name)
1427 /* TYPE is a class type. Return the index of the fields within
1428 the method vector with name NAME, or -1 if no such field exists. */
1431 lookup_fnfields_1 (tree type, tree name)
1433 if (!CLASS_TYPE_P (type))
1436 if (COMPLETE_TYPE_P (type))
1438 if ((name == ctor_identifier
1439 || name == base_ctor_identifier
1440 || name == complete_ctor_identifier))
1442 if (CLASSTYPE_LAZY_DEFAULT_CTOR (type))
1443 lazily_declare_fn (sfk_constructor, type);
1444 if (CLASSTYPE_LAZY_COPY_CTOR (type))
1445 lazily_declare_fn (sfk_copy_constructor, type);
1446 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
1447 lazily_declare_fn (sfk_move_constructor, type);
1449 else if (name == ansi_assopname (NOP_EXPR))
1451 if (CLASSTYPE_LAZY_COPY_ASSIGN (type))
1452 lazily_declare_fn (sfk_copy_assignment, type);
1453 if (CLASSTYPE_LAZY_MOVE_ASSIGN (type))
1454 lazily_declare_fn (sfk_move_assignment, type);
1456 else if ((name == dtor_identifier
1457 || name == base_dtor_identifier
1458 || name == complete_dtor_identifier
1459 || name == deleting_dtor_identifier)
1460 && CLASSTYPE_LAZY_DESTRUCTOR (type))
1461 lazily_declare_fn (sfk_destructor, type);
1464 return lookup_fnfields_idx_nolazy (type, name);
1467 /* TYPE is a class type. Return the field within the method vector with
1468 name NAME, or NULL_TREE if no such field exists. */
1471 lookup_fnfields_slot (tree type, tree name)
1473 int ix = lookup_fnfields_1 (complete_type (type), name);
1476 return VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
1479 /* As above, but avoid lazily declaring functions. */
1482 lookup_fnfields_slot_nolazy (tree type, tree name)
1484 int ix = lookup_fnfields_idx_nolazy (complete_type (type), name);
1487 return VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
1490 /* Like lookup_fnfields_1, except that the name is extracted from
1491 FUNCTION, which is a FUNCTION_DECL or a TEMPLATE_DECL. */
1494 class_method_index_for_fn (tree class_type, tree function)
1496 gcc_assert (TREE_CODE (function) == FUNCTION_DECL
1497 || DECL_FUNCTION_TEMPLATE_P (function));
1499 return lookup_fnfields_1 (class_type,
1500 DECL_CONSTRUCTOR_P (function) ? ctor_identifier :
1501 DECL_DESTRUCTOR_P (function) ? dtor_identifier :
1502 DECL_NAME (function));
1506 /* DECL is the result of a qualified name lookup. QUALIFYING_SCOPE is
1507 the class or namespace used to qualify the name. CONTEXT_CLASS is
1508 the class corresponding to the object in which DECL will be used.
1509 Return a possibly modified version of DECL that takes into account
1512 In particular, consider an expression like `B::m' in the context of
1513 a derived class `D'. If `B::m' has been resolved to a BASELINK,
1514 then the most derived class indicated by the BASELINK_BINFO will be
1515 `B', not `D'. This function makes that adjustment. */
1518 adjust_result_of_qualified_name_lookup (tree decl,
1519 tree qualifying_scope,
1522 if (context_class && context_class != error_mark_node
1523 && CLASS_TYPE_P (context_class)
1524 && CLASS_TYPE_P (qualifying_scope)
1525 && DERIVED_FROM_P (qualifying_scope, context_class)
1526 && BASELINK_P (decl))
1530 /* Look for the QUALIFYING_SCOPE as a base of the CONTEXT_CLASS.
1531 Because we do not yet know which function will be chosen by
1532 overload resolution, we cannot yet check either accessibility
1533 or ambiguity -- in either case, the choice of a static member
1534 function might make the usage valid. */
1535 base = lookup_base (context_class, qualifying_scope,
1536 ba_unique | ba_quiet, NULL);
1539 BASELINK_ACCESS_BINFO (decl) = base;
1540 BASELINK_BINFO (decl)
1541 = lookup_base (base, BINFO_TYPE (BASELINK_BINFO (decl)),
1542 ba_unique | ba_quiet,
1551 /* Walk the class hierarchy within BINFO, in a depth-first traversal.
1552 PRE_FN is called in preorder, while POST_FN is called in postorder.
1553 If PRE_FN returns DFS_SKIP_BASES, child binfos will not be
1554 walked. If PRE_FN or POST_FN returns a different non-NULL value,
1555 that value is immediately returned and the walk is terminated. One
1556 of PRE_FN and POST_FN can be NULL. At each node, PRE_FN and
1557 POST_FN are passed the binfo to examine and the caller's DATA
1558 value. All paths are walked, thus virtual and morally virtual
1559 binfos can be multiply walked. */
1562 dfs_walk_all (tree binfo, tree (*pre_fn) (tree, void *),
1563 tree (*post_fn) (tree, void *), void *data)
1569 /* Call the pre-order walking function. */
1572 rval = pre_fn (binfo, data);
1575 if (rval == dfs_skip_bases)
1581 /* Find the next child binfo to walk. */
1582 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1584 rval = dfs_walk_all (base_binfo, pre_fn, post_fn, data);
1590 /* Call the post-order walking function. */
1593 rval = post_fn (binfo, data);
1594 gcc_assert (rval != dfs_skip_bases);
1601 /* Worker for dfs_walk_once. This behaves as dfs_walk_all, except
1602 that binfos are walked at most once. */
1605 dfs_walk_once_r (tree binfo, tree (*pre_fn) (tree, void *),
1606 tree (*post_fn) (tree, void *), void *data)
1612 /* Call the pre-order walking function. */
1615 rval = pre_fn (binfo, data);
1618 if (rval == dfs_skip_bases)
1625 /* Find the next child binfo to walk. */
1626 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1628 if (BINFO_VIRTUAL_P (base_binfo))
1630 if (BINFO_MARKED (base_binfo))
1632 BINFO_MARKED (base_binfo) = 1;
1635 rval = dfs_walk_once_r (base_binfo, pre_fn, post_fn, data);
1641 /* Call the post-order walking function. */
1644 rval = post_fn (binfo, data);
1645 gcc_assert (rval != dfs_skip_bases);
1652 /* Worker for dfs_walk_once. Recursively unmark the virtual base binfos of
1656 dfs_unmark_r (tree binfo)
1661 /* Process the basetypes. */
1662 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1664 if (BINFO_VIRTUAL_P (base_binfo))
1666 if (!BINFO_MARKED (base_binfo))
1668 BINFO_MARKED (base_binfo) = 0;
1670 /* Only walk, if it can contain more virtual bases. */
1671 if (CLASSTYPE_VBASECLASSES (BINFO_TYPE (base_binfo)))
1672 dfs_unmark_r (base_binfo);
1676 /* Like dfs_walk_all, except that binfos are not multiply walked. For
1677 non-diamond shaped hierarchies this is the same as dfs_walk_all.
1678 For diamond shaped hierarchies we must mark the virtual bases, to
1679 avoid multiple walks. */
1682 dfs_walk_once (tree binfo, tree (*pre_fn) (tree, void *),
1683 tree (*post_fn) (tree, void *), void *data)
1685 static int active = 0; /* We must not be called recursively. */
1688 gcc_assert (pre_fn || post_fn);
1689 gcc_assert (!active);
1692 if (!CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo)))
1693 /* We are not diamond shaped, and therefore cannot encounter the
1694 same binfo twice. */
1695 rval = dfs_walk_all (binfo, pre_fn, post_fn, data);
1698 rval = dfs_walk_once_r (binfo, pre_fn, post_fn, data);
1699 if (!BINFO_INHERITANCE_CHAIN (binfo))
1701 /* We are at the top of the hierarchy, and can use the
1702 CLASSTYPE_VBASECLASSES list for unmarking the virtual
1704 VEC(tree,gc) *vbases;
1708 for (vbases = CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)), ix = 0;
1709 VEC_iterate (tree, vbases, ix, base_binfo); ix++)
1710 BINFO_MARKED (base_binfo) = 0;
1713 dfs_unmark_r (binfo);
1721 /* Worker function for dfs_walk_once_accessible. Behaves like
1722 dfs_walk_once_r, except (a) FRIENDS_P is true if special
1723 access given by the current context should be considered, (b) ONCE
1724 indicates whether bases should be marked during traversal. */
1727 dfs_walk_once_accessible_r (tree binfo, bool friends_p, bool once,
1728 tree (*pre_fn) (tree, void *),
1729 tree (*post_fn) (tree, void *), void *data)
1731 tree rval = NULL_TREE;
1735 /* Call the pre-order walking function. */
1738 rval = pre_fn (binfo, data);
1741 if (rval == dfs_skip_bases)
1748 /* Find the next child binfo to walk. */
1749 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1751 bool mark = once && BINFO_VIRTUAL_P (base_binfo);
1753 if (mark && BINFO_MARKED (base_binfo))
1756 /* If the base is inherited via private or protected
1757 inheritance, then we can't see it, unless we are a friend of
1758 the current binfo. */
1759 if (BINFO_BASE_ACCESS (binfo, ix) != access_public_node)
1764 scope = current_scope ();
1766 || TREE_CODE (scope) == NAMESPACE_DECL
1767 || !is_friend (BINFO_TYPE (binfo), scope))
1772 BINFO_MARKED (base_binfo) = 1;
1774 rval = dfs_walk_once_accessible_r (base_binfo, friends_p, once,
1775 pre_fn, post_fn, data);
1781 /* Call the post-order walking function. */
1784 rval = post_fn (binfo, data);
1785 gcc_assert (rval != dfs_skip_bases);
1792 /* Like dfs_walk_once except that only accessible bases are walked.
1793 FRIENDS_P indicates whether friendship of the local context
1794 should be considered when determining accessibility. */
1797 dfs_walk_once_accessible (tree binfo, bool friends_p,
1798 tree (*pre_fn) (tree, void *),
1799 tree (*post_fn) (tree, void *), void *data)
1801 bool diamond_shaped = CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo));
1802 tree rval = dfs_walk_once_accessible_r (binfo, friends_p, diamond_shaped,
1803 pre_fn, post_fn, data);
1807 if (!BINFO_INHERITANCE_CHAIN (binfo))
1809 /* We are at the top of the hierarchy, and can use the
1810 CLASSTYPE_VBASECLASSES list for unmarking the virtual
1812 VEC(tree,gc) *vbases;
1816 for (vbases = CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)), ix = 0;
1817 VEC_iterate (tree, vbases, ix, base_binfo); ix++)
1818 BINFO_MARKED (base_binfo) = 0;
1821 dfs_unmark_r (binfo);
1826 /* Check that virtual overrider OVERRIDER is acceptable for base function
1827 BASEFN. Issue diagnostic, and return zero, if unacceptable. */
1830 check_final_overrider (tree overrider, tree basefn)
1832 tree over_type = TREE_TYPE (overrider);
1833 tree base_type = TREE_TYPE (basefn);
1834 tree over_return = TREE_TYPE (over_type);
1835 tree base_return = TREE_TYPE (base_type);
1836 tree over_throw, base_throw;
1840 if (DECL_INVALID_OVERRIDER_P (overrider))
1843 if (same_type_p (base_return, over_return))
1845 else if ((CLASS_TYPE_P (over_return) && CLASS_TYPE_P (base_return))
1846 || (TREE_CODE (base_return) == TREE_CODE (over_return)
1847 && POINTER_TYPE_P (base_return)))
1849 /* Potentially covariant. */
1850 unsigned base_quals, over_quals;
1852 fail = !POINTER_TYPE_P (base_return);
1855 fail = cp_type_quals (base_return) != cp_type_quals (over_return);
1857 base_return = TREE_TYPE (base_return);
1858 over_return = TREE_TYPE (over_return);
1860 base_quals = cp_type_quals (base_return);
1861 over_quals = cp_type_quals (over_return);
1863 if ((base_quals & over_quals) != over_quals)
1866 if (CLASS_TYPE_P (base_return) && CLASS_TYPE_P (over_return))
1868 /* Strictly speaking, the standard requires the return type to be
1869 complete even if it only differs in cv-quals, but that seems
1870 like a bug in the wording. */
1871 if (!same_type_ignoring_top_level_qualifiers_p (base_return, over_return))
1873 tree binfo = lookup_base (over_return, base_return,
1874 ba_check | ba_quiet, NULL);
1881 && can_convert (TREE_TYPE (base_type), TREE_TYPE (over_type)))
1882 /* GNU extension, allow trivial pointer conversions such as
1883 converting to void *, or qualification conversion. */
1885 /* can_convert will permit user defined conversion from a
1886 (reference to) class type. We must reject them. */
1887 over_return = non_reference (TREE_TYPE (over_type));
1888 if (CLASS_TYPE_P (over_return))
1892 warning (0, "deprecated covariant return type for %q+#D",
1894 warning (0, " overriding %q+#D", basefn);
1908 error ("invalid covariant return type for %q+#D", overrider);
1909 error (" overriding %q+#D", basefn);
1913 error ("conflicting return type specified for %q+#D", overrider);
1914 error (" overriding %q+#D", basefn);
1916 DECL_INVALID_OVERRIDER_P (overrider) = 1;
1920 /* Check throw specifier is at least as strict. */
1921 maybe_instantiate_noexcept (basefn);
1922 maybe_instantiate_noexcept (overrider);
1923 base_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (basefn));
1924 over_throw = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (overrider));
1926 if (!comp_except_specs (base_throw, over_throw, ce_derived))
1928 error ("looser throw specifier for %q+#F", overrider);
1929 error (" overriding %q+#F", basefn);
1930 DECL_INVALID_OVERRIDER_P (overrider) = 1;
1934 /* Check for conflicting type attributes. */
1935 if (!comp_type_attributes (over_type, base_type))
1937 error ("conflicting type attributes specified for %q+#D", overrider);
1938 error (" overriding %q+#D", basefn);
1939 DECL_INVALID_OVERRIDER_P (overrider) = 1;
1943 if (DECL_DELETED_FN (basefn) != DECL_DELETED_FN (overrider))
1945 if (DECL_DELETED_FN (overrider))
1947 error ("deleted function %q+D", overrider);
1948 error ("overriding non-deleted function %q+D", basefn);
1949 maybe_explain_implicit_delete (overrider);
1953 error ("non-deleted function %q+D", overrider);
1954 error ("overriding deleted function %q+D", basefn);
1958 if (DECL_FINAL_P (basefn))
1960 error ("virtual function %q+D", overrider);
1961 error ("overriding final function %q+D", basefn);
1967 /* Given a class TYPE, and a function decl FNDECL, look for
1968 virtual functions in TYPE's hierarchy which FNDECL overrides.
1969 We do not look in TYPE itself, only its bases.
1971 Returns nonzero, if we find any. Set FNDECL's DECL_VIRTUAL_P, if we
1972 find that it overrides anything.
1974 We check that every function which is overridden, is correctly
1978 look_for_overrides (tree type, tree fndecl)
1980 tree binfo = TYPE_BINFO (type);
1985 /* A constructor for a class T does not override a function T
1987 if (DECL_CONSTRUCTOR_P (fndecl))
1990 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
1992 tree basetype = BINFO_TYPE (base_binfo);
1994 if (TYPE_POLYMORPHIC_P (basetype))
1995 found += look_for_overrides_r (basetype, fndecl);
2000 /* Look in TYPE for virtual functions with the same signature as
2004 look_for_overrides_here (tree type, tree fndecl)
2008 /* If there are no methods in TYPE (meaning that only implicitly
2009 declared methods will ever be provided for TYPE), then there are
2010 no virtual functions. */
2011 if (!CLASSTYPE_METHOD_VEC (type))
2014 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fndecl))
2015 ix = CLASSTYPE_DESTRUCTOR_SLOT;
2017 ix = lookup_fnfields_1 (type, DECL_NAME (fndecl));
2020 tree fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
2022 for (; fns; fns = OVL_NEXT (fns))
2024 tree fn = OVL_CURRENT (fns);
2026 if (!DECL_VIRTUAL_P (fn))
2027 /* Not a virtual. */;
2028 else if (DECL_CONTEXT (fn) != type)
2029 /* Introduced with a using declaration. */;
2030 else if (DECL_STATIC_FUNCTION_P (fndecl))
2032 tree btypes = TYPE_ARG_TYPES (TREE_TYPE (fn));
2033 tree dtypes = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2034 if (compparms (TREE_CHAIN (btypes), dtypes))
2037 else if (same_signature_p (fndecl, fn))
2044 /* Look in TYPE for virtual functions overridden by FNDECL. Check both
2045 TYPE itself and its bases. */
2048 look_for_overrides_r (tree type, tree fndecl)
2050 tree fn = look_for_overrides_here (type, fndecl);
2053 if (DECL_STATIC_FUNCTION_P (fndecl))
2055 /* A static member function cannot match an inherited
2056 virtual member function. */
2057 error ("%q+#D cannot be declared", fndecl);
2058 error (" since %q+#D declared in base class", fn);
2062 /* It's definitely virtual, even if not explicitly set. */
2063 DECL_VIRTUAL_P (fndecl) = 1;
2064 check_final_overrider (fndecl, fn);
2069 /* We failed to find one declared in this class. Look in its bases. */
2070 return look_for_overrides (type, fndecl);
2073 /* Called via dfs_walk from dfs_get_pure_virtuals. */
2076 dfs_get_pure_virtuals (tree binfo, void *data)
2078 tree type = (tree) data;
2080 /* We're not interested in primary base classes; the derived class
2081 of which they are a primary base will contain the information we
2083 if (!BINFO_PRIMARY_P (binfo))
2087 for (virtuals = BINFO_VIRTUALS (binfo);
2089 virtuals = TREE_CHAIN (virtuals))
2090 if (DECL_PURE_VIRTUAL_P (BV_FN (virtuals)))
2091 VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (type),
2098 /* Set CLASSTYPE_PURE_VIRTUALS for TYPE. */
2101 get_pure_virtuals (tree type)
2103 /* Clear the CLASSTYPE_PURE_VIRTUALS list; whatever is already there
2104 is going to be overridden. */
2105 CLASSTYPE_PURE_VIRTUALS (type) = NULL;
2106 /* Now, run through all the bases which are not primary bases, and
2107 collect the pure virtual functions. We look at the vtable in
2108 each class to determine what pure virtual functions are present.
2109 (A primary base is not interesting because the derived class of
2110 which it is a primary base will contain vtable entries for the
2111 pure virtuals in the base class. */
2112 dfs_walk_once (TYPE_BINFO (type), NULL, dfs_get_pure_virtuals, type);
2115 /* Debug info for C++ classes can get very large; try to avoid
2116 emitting it everywhere.
2118 Note that this optimization wins even when the target supports
2119 BINCL (if only slightly), and reduces the amount of work for the
2123 maybe_suppress_debug_info (tree t)
2125 if (write_symbols == NO_DEBUG)
2128 /* We might have set this earlier in cp_finish_decl. */
2129 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 0;
2131 /* Always emit the information for each class every time. */
2132 if (flag_emit_class_debug_always)
2135 /* If we already know how we're handling this class, handle debug info
2137 if (CLASSTYPE_INTERFACE_KNOWN (t))
2139 if (CLASSTYPE_INTERFACE_ONLY (t))
2140 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2141 /* else don't set it. */
2143 /* If the class has a vtable, write out the debug info along with
2145 else if (TYPE_CONTAINS_VPTR_P (t))
2146 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t)) = 1;
2148 /* Otherwise, just emit the debug info normally. */
2151 /* Note that we want debugging information for a base class of a class
2152 whose vtable is being emitted. Normally, this would happen because
2153 calling the constructor for a derived class implies calling the
2154 constructors for all bases, which involve initializing the
2155 appropriate vptr with the vtable for the base class; but in the
2156 presence of optimization, this initialization may be optimized
2157 away, so we tell finish_vtable_vardecl that we want the debugging
2158 information anyway. */
2161 dfs_debug_mark (tree binfo, void *data ATTRIBUTE_UNUSED)
2163 tree t = BINFO_TYPE (binfo);
2165 if (CLASSTYPE_DEBUG_REQUESTED (t))
2166 return dfs_skip_bases;
2168 CLASSTYPE_DEBUG_REQUESTED (t) = 1;
2173 /* Write out the debugging information for TYPE, whose vtable is being
2174 emitted. Also walk through our bases and note that we want to
2175 write out information for them. This avoids the problem of not
2176 writing any debug info for intermediate basetypes whose
2177 constructors, and thus the references to their vtables, and thus
2178 the vtables themselves, were optimized away. */
2181 note_debug_info_needed (tree type)
2183 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)))
2185 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type)) = 0;
2186 rest_of_type_compilation (type, toplevel_bindings_p ());
2189 dfs_walk_all (TYPE_BINFO (type), dfs_debug_mark, NULL, 0);
2193 print_search_statistics (void)
2195 #ifdef GATHER_STATISTICS
2196 fprintf (stderr, "%d fields searched in %d[%d] calls to lookup_field[_1]\n",
2197 n_fields_searched, n_calls_lookup_field, n_calls_lookup_field_1);
2198 fprintf (stderr, "%d fnfields searched in %d calls to lookup_fnfields\n",
2199 n_outer_fields_searched, n_calls_lookup_fnfields);
2200 fprintf (stderr, "%d calls to get_base_type\n", n_calls_get_base_type);
2201 #else /* GATHER_STATISTICS */
2202 fprintf (stderr, "no search statistics\n");
2203 #endif /* GATHER_STATISTICS */
2207 reinit_search_statistics (void)
2209 #ifdef GATHER_STATISTICS
2210 n_fields_searched = 0;
2211 n_calls_lookup_field = 0, n_calls_lookup_field_1 = 0;
2212 n_calls_lookup_fnfields = 0, n_calls_lookup_fnfields_1 = 0;
2213 n_calls_get_base_type = 0;
2214 n_outer_fields_searched = 0;
2215 n_contexts_saved = 0;
2216 #endif /* GATHER_STATISTICS */
2219 /* Helper for lookup_conversions_r. TO_TYPE is the type converted to
2220 by a conversion op in base BINFO. VIRTUAL_DEPTH is nonzero if
2221 BINFO is morally virtual, and VIRTUALNESS is nonzero if virtual
2222 bases have been encountered already in the tree walk. PARENT_CONVS
2223 is the list of lists of conversion functions that could hide CONV
2224 and OTHER_CONVS is the list of lists of conversion functions that
2225 could hide or be hidden by CONV, should virtualness be involved in
2226 the hierarchy. Merely checking the conversion op's name is not
2227 enough because two conversion operators to the same type can have
2228 different names. Return nonzero if we are visible. */
2231 check_hidden_convs (tree binfo, int virtual_depth, int virtualness,
2232 tree to_type, tree parent_convs, tree other_convs)
2236 /* See if we are hidden by a parent conversion. */
2237 for (level = parent_convs; level; level = TREE_CHAIN (level))
2238 for (probe = TREE_VALUE (level); probe; probe = TREE_CHAIN (probe))
2239 if (same_type_p (to_type, TREE_TYPE (probe)))
2242 if (virtual_depth || virtualness)
2244 /* In a virtual hierarchy, we could be hidden, or could hide a
2245 conversion function on the other_convs list. */
2246 for (level = other_convs; level; level = TREE_CHAIN (level))
2252 if (!(virtual_depth || TREE_STATIC (level)))
2253 /* Neither is morally virtual, so cannot hide each other. */
2256 if (!TREE_VALUE (level))
2257 /* They evaporated away already. */
2260 they_hide_us = (virtual_depth
2261 && original_binfo (binfo, TREE_PURPOSE (level)));
2262 we_hide_them = (!they_hide_us && TREE_STATIC (level)
2263 && original_binfo (TREE_PURPOSE (level), binfo));
2265 if (!(we_hide_them || they_hide_us))
2266 /* Neither is within the other, so no hiding can occur. */
2269 for (prev = &TREE_VALUE (level), other = *prev; other;)
2271 if (same_type_p (to_type, TREE_TYPE (other)))
2274 /* We are hidden. */
2279 /* We hide the other one. */
2280 other = TREE_CHAIN (other);
2285 prev = &TREE_CHAIN (other);
2293 /* Helper for lookup_conversions_r. PARENT_CONVS is a list of lists
2294 of conversion functions, the first slot will be for the current
2295 binfo, if MY_CONVS is non-NULL. CHILD_CONVS is the list of lists
2296 of conversion functions from children of the current binfo,
2297 concatenated with conversions from elsewhere in the hierarchy --
2298 that list begins with OTHER_CONVS. Return a single list of lists
2299 containing only conversions from the current binfo and its
2303 split_conversions (tree my_convs, tree parent_convs,
2304 tree child_convs, tree other_convs)
2309 /* Remove the original other_convs portion from child_convs. */
2310 for (prev = NULL, t = child_convs;
2311 t != other_convs; prev = t, t = TREE_CHAIN (t))
2315 TREE_CHAIN (prev) = NULL_TREE;
2317 child_convs = NULL_TREE;
2319 /* Attach the child convs to any we had at this level. */
2322 my_convs = parent_convs;
2323 TREE_CHAIN (my_convs) = child_convs;
2326 my_convs = child_convs;
2331 /* Worker for lookup_conversions. Lookup conversion functions in
2332 BINFO and its children. VIRTUAL_DEPTH is nonzero, if BINFO is in
2333 a morally virtual base, and VIRTUALNESS is nonzero, if we've
2334 encountered virtual bases already in the tree walk. PARENT_CONVS &
2335 PARENT_TPL_CONVS are lists of list of conversions within parent
2336 binfos. OTHER_CONVS and OTHER_TPL_CONVS are conversions found
2337 elsewhere in the tree. Return the conversions found within this
2338 portion of the graph in CONVS and TPL_CONVS. Return nonzero is we
2339 encountered virtualness. We keep template and non-template
2340 conversions separate, to avoid unnecessary type comparisons.
2342 The located conversion functions are held in lists of lists. The
2343 TREE_VALUE of the outer list is the list of conversion functions
2344 found in a particular binfo. The TREE_PURPOSE of both the outer
2345 and inner lists is the binfo at which those conversions were
2346 found. TREE_STATIC is set for those lists within of morally
2347 virtual binfos. The TREE_VALUE of the inner list is the conversion
2348 function or overload itself. The TREE_TYPE of each inner list node
2349 is the converted-to type. */
2352 lookup_conversions_r (tree binfo,
2353 int virtual_depth, int virtualness,
2354 tree parent_convs, tree parent_tpl_convs,
2355 tree other_convs, tree other_tpl_convs,
2356 tree *convs, tree *tpl_convs)
2358 int my_virtualness = 0;
2359 tree my_convs = NULL_TREE;
2360 tree my_tpl_convs = NULL_TREE;
2361 tree child_convs = NULL_TREE;
2362 tree child_tpl_convs = NULL_TREE;
2365 VEC(tree,gc) *method_vec = CLASSTYPE_METHOD_VEC (BINFO_TYPE (binfo));
2368 /* If we have no conversion operators, then don't look. */
2369 if (!TYPE_HAS_CONVERSION (BINFO_TYPE (binfo)))
2371 *convs = *tpl_convs = NULL_TREE;
2376 if (BINFO_VIRTUAL_P (binfo))
2379 /* First, locate the unhidden ones at this level. */
2380 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
2381 VEC_iterate (tree, method_vec, i, conv);
2384 tree cur = OVL_CURRENT (conv);
2386 if (!DECL_CONV_FN_P (cur))
2389 if (TREE_CODE (cur) == TEMPLATE_DECL)
2391 /* Only template conversions can be overloaded, and we must
2392 flatten them out and check each one individually. */
2395 for (tpls = conv; tpls; tpls = OVL_NEXT (tpls))
2397 tree tpl = OVL_CURRENT (tpls);
2398 tree type = DECL_CONV_FN_TYPE (tpl);
2400 if (check_hidden_convs (binfo, virtual_depth, virtualness,
2401 type, parent_tpl_convs, other_tpl_convs))
2403 my_tpl_convs = tree_cons (binfo, tpl, my_tpl_convs);
2404 TREE_TYPE (my_tpl_convs) = type;
2407 TREE_STATIC (my_tpl_convs) = 1;
2415 tree name = DECL_NAME (cur);
2417 if (!IDENTIFIER_MARKED (name))
2419 tree type = DECL_CONV_FN_TYPE (cur);
2421 if (check_hidden_convs (binfo, virtual_depth, virtualness,
2422 type, parent_convs, other_convs))
2424 my_convs = tree_cons (binfo, conv, my_convs);
2425 TREE_TYPE (my_convs) = type;
2428 TREE_STATIC (my_convs) = 1;
2431 IDENTIFIER_MARKED (name) = 1;
2439 parent_convs = tree_cons (binfo, my_convs, parent_convs);
2441 TREE_STATIC (parent_convs) = 1;
2446 parent_tpl_convs = tree_cons (binfo, my_tpl_convs, parent_tpl_convs);
2448 TREE_STATIC (parent_tpl_convs) = 1;
2451 child_convs = other_convs;
2452 child_tpl_convs = other_tpl_convs;
2454 /* Now iterate over each base, looking for more conversions. */
2455 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
2457 tree base_convs, base_tpl_convs;
2458 unsigned base_virtualness;
2460 base_virtualness = lookup_conversions_r (base_binfo,
2461 virtual_depth, virtualness,
2462 parent_convs, parent_tpl_convs,
2463 child_convs, child_tpl_convs,
2464 &base_convs, &base_tpl_convs);
2465 if (base_virtualness)
2466 my_virtualness = virtualness = 1;
2467 child_convs = chainon (base_convs, child_convs);
2468 child_tpl_convs = chainon (base_tpl_convs, child_tpl_convs);
2471 /* Unmark the conversions found at this level */
2472 for (conv = my_convs; conv; conv = TREE_CHAIN (conv))
2473 IDENTIFIER_MARKED (DECL_NAME (OVL_CURRENT (TREE_VALUE (conv)))) = 0;
2475 *convs = split_conversions (my_convs, parent_convs,
2476 child_convs, other_convs);
2477 *tpl_convs = split_conversions (my_tpl_convs, parent_tpl_convs,
2478 child_tpl_convs, other_tpl_convs);
2480 return my_virtualness;
2483 /* Return a TREE_LIST containing all the non-hidden user-defined
2484 conversion functions for TYPE (and its base-classes). The
2485 TREE_VALUE of each node is the FUNCTION_DECL of the conversion
2486 function. The TREE_PURPOSE is the BINFO from which the conversion
2487 functions in this node were selected. This function is effectively
2488 performing a set of member lookups as lookup_fnfield does, but
2489 using the type being converted to as the unique key, rather than the
2493 lookup_conversions (tree type)
2495 tree convs, tpl_convs;
2496 tree list = NULL_TREE;
2498 complete_type (type);
2499 if (!TYPE_BINFO (type))
2502 lookup_conversions_r (TYPE_BINFO (type), 0, 0,
2503 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE,
2504 &convs, &tpl_convs);
2506 /* Flatten the list-of-lists */
2507 for (; convs; convs = TREE_CHAIN (convs))
2511 for (probe = TREE_VALUE (convs); probe; probe = next)
2513 next = TREE_CHAIN (probe);
2515 TREE_CHAIN (probe) = list;
2520 for (; tpl_convs; tpl_convs = TREE_CHAIN (tpl_convs))
2524 for (probe = TREE_VALUE (tpl_convs); probe; probe = next)
2526 next = TREE_CHAIN (probe);
2528 TREE_CHAIN (probe) = list;
2536 /* Returns the binfo of the first direct or indirect virtual base derived
2537 from BINFO, or NULL if binfo is not via virtual. */
2540 binfo_from_vbase (tree binfo)
2542 for (; binfo; binfo = BINFO_INHERITANCE_CHAIN (binfo))
2544 if (BINFO_VIRTUAL_P (binfo))
2550 /* Returns the binfo of the first direct or indirect virtual base derived
2551 from BINFO up to the TREE_TYPE, LIMIT, or NULL if binfo is not
2555 binfo_via_virtual (tree binfo, tree limit)
2557 if (limit && !CLASSTYPE_VBASECLASSES (limit))
2558 /* LIMIT has no virtual bases, so BINFO cannot be via one. */
2561 for (; binfo && !SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), limit);
2562 binfo = BINFO_INHERITANCE_CHAIN (binfo))
2564 if (BINFO_VIRTUAL_P (binfo))
2570 /* BINFO is a base binfo in the complete type BINFO_TYPE (HERE).
2571 Find the equivalent binfo within whatever graph HERE is located.
2572 This is the inverse of original_binfo. */
2575 copied_binfo (tree binfo, tree here)
2577 tree result = NULL_TREE;
2579 if (BINFO_VIRTUAL_P (binfo))
2583 for (t = here; BINFO_INHERITANCE_CHAIN (t);
2584 t = BINFO_INHERITANCE_CHAIN (t))
2587 result = binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (t));
2589 else if (BINFO_INHERITANCE_CHAIN (binfo))
2595 cbinfo = copied_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2596 for (ix = 0; BINFO_BASE_ITERATE (cbinfo, ix, base_binfo); ix++)
2597 if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), BINFO_TYPE (binfo)))
2599 result = base_binfo;
2605 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (here), BINFO_TYPE (binfo)));
2609 gcc_assert (result);
2614 binfo_for_vbase (tree base, tree t)
2618 VEC(tree,gc) *vbases;
2620 for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
2621 VEC_iterate (tree, vbases, ix, binfo); ix++)
2622 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), base))
2627 /* BINFO is some base binfo of HERE, within some other
2628 hierarchy. Return the equivalent binfo, but in the hierarchy
2629 dominated by HERE. This is the inverse of copied_binfo. If BINFO
2630 is not a base binfo of HERE, returns NULL_TREE. */
2633 original_binfo (tree binfo, tree here)
2637 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (here)))
2639 else if (BINFO_VIRTUAL_P (binfo))
2640 result = (CLASSTYPE_VBASECLASSES (BINFO_TYPE (here))
2641 ? binfo_for_vbase (BINFO_TYPE (binfo), BINFO_TYPE (here))
2643 else if (BINFO_INHERITANCE_CHAIN (binfo))
2647 base_binfos = original_binfo (BINFO_INHERITANCE_CHAIN (binfo), here);
2653 for (ix = 0; (base_binfo = BINFO_BASE_BINFO (base_binfos, ix)); ix++)
2654 if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
2655 BINFO_TYPE (binfo)))
2657 result = base_binfo;