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
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"
39 static int is_subobject_of_p (tree
, tree
);
40 static tree
dfs_lookup_base (tree
, void *);
41 static tree
dfs_dcast_hint_pre (tree
, void *);
42 static tree
dfs_dcast_hint_post (tree
, void *);
43 static tree
dfs_debug_mark (tree
, void *);
44 static tree
dfs_walk_once_r (tree
, tree (*pre_fn
) (tree
, void *),
45 tree (*post_fn
) (tree
, void *), void *data
);
46 static void dfs_unmark_r (tree
);
47 static int check_hidden_convs (tree
, int, int, tree
, tree
, tree
);
48 static tree
split_conversions (tree
, tree
, tree
, tree
);
49 static int lookup_conversions_r (tree
, int, int,
50 tree
, tree
, tree
, tree
, tree
*, tree
*);
51 static int look_for_overrides_r (tree
, tree
);
52 static tree
lookup_field_r (tree
, void *);
53 static tree
dfs_accessible_post (tree
, void *);
54 static tree
dfs_walk_once_accessible_r (tree
, bool, bool,
55 tree (*pre_fn
) (tree
, void *),
56 tree (*post_fn
) (tree
, void *),
58 static tree
dfs_walk_once_accessible (tree
, bool,
59 tree (*pre_fn
) (tree
, void *),
60 tree (*post_fn
) (tree
, void *),
62 static tree
dfs_access_in_type (tree
, void *);
63 static access_kind
access_in_type (tree
, tree
);
64 static int protected_accessible_p (tree
, tree
, tree
);
65 static int friend_accessible_p (tree
, tree
, tree
);
66 static int template_self_reference_p (tree
, tree
);
67 static tree
dfs_get_pure_virtuals (tree
, void *);
70 /* Variables for gathering statistics. */
71 #ifdef GATHER_STATISTICS
72 static int n_fields_searched
;
73 static int n_calls_lookup_field
, n_calls_lookup_field_1
;
74 static int n_calls_lookup_fnfields
, n_calls_lookup_fnfields_1
;
75 static int n_calls_get_base_type
;
76 static int n_outer_fields_searched
;
77 static int n_contexts_saved
;
78 #endif /* GATHER_STATISTICS */
81 /* Data for lookup_base and its workers. */
83 struct lookup_base_data_s
85 tree t
; /* type being searched. */
86 tree base
; /* The base type we're looking for. */
87 tree binfo
; /* Found binfo. */
88 bool via_virtual
; /* Found via a virtual path. */
89 bool ambiguous
; /* Found multiply ambiguous */
90 bool repeated_base
; /* Whether there are repeated bases in the
92 bool want_any
; /* Whether we want any matching binfo. */
95 /* Worker function for lookup_base. See if we've found the desired
96 base and update DATA_ (a pointer to LOOKUP_BASE_DATA_S). */
99 dfs_lookup_base (tree binfo
, void *data_
)
101 struct lookup_base_data_s
*data
= (struct lookup_base_data_s
*) data_
;
103 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->base
))
109 = binfo_via_virtual (data
->binfo
, data
->t
) != NULL_TREE
;
111 if (!data
->repeated_base
)
112 /* If there are no repeated bases, we can stop now. */
115 if (data
->want_any
&& !data
->via_virtual
)
116 /* If this is a non-virtual base, then we can't do
120 return dfs_skip_bases
;
124 gcc_assert (binfo
!= data
->binfo
);
126 /* We've found more than one matching binfo. */
129 /* This is immediately ambiguous. */
130 data
->binfo
= NULL_TREE
;
131 data
->ambiguous
= true;
132 return error_mark_node
;
135 /* Prefer one via a non-virtual path. */
136 if (!binfo_via_virtual (binfo
, data
->t
))
139 data
->via_virtual
= false;
143 /* There must be repeated bases, otherwise we'd have stopped
144 on the first base we found. */
145 return dfs_skip_bases
;
152 /* Returns true if type BASE is accessible in T. (BASE is known to be
153 a (possibly non-proper) base class of T.) If CONSIDER_LOCAL_P is
154 true, consider any special access of the current scope, or access
155 bestowed by friendship. */
158 accessible_base_p (tree t
, tree base
, bool consider_local_p
)
162 /* [class.access.base]
164 A base class is said to be accessible if an invented public
165 member of the base class is accessible.
167 If BASE is a non-proper base, this condition is trivially
169 if (same_type_p (t
, base
))
171 /* Rather than inventing a public member, we use the implicit
172 public typedef created in the scope of every class. */
173 decl
= TYPE_FIELDS (base
);
174 while (!DECL_SELF_REFERENCE_P (decl
))
175 decl
= TREE_CHAIN (decl
);
176 while (ANON_AGGR_TYPE_P (t
))
177 t
= TYPE_CONTEXT (t
);
178 return accessible_p (t
, decl
, consider_local_p
);
181 /* Lookup BASE in the hierarchy dominated by T. Do access checking as
182 ACCESS specifies. Return the binfo we discover. If KIND_PTR is
183 non-NULL, fill with information about what kind of base we
186 If the base is inaccessible, or ambiguous, and the ba_quiet bit is
187 not set in ACCESS, then an error is issued and error_mark_node is
188 returned. If the ba_quiet bit is set, then no error is issued and
189 NULL_TREE is returned. */
192 lookup_base (tree t
, tree base
, base_access access
, base_kind
*kind_ptr
)
198 if (t
== error_mark_node
|| base
== error_mark_node
)
201 *kind_ptr
= bk_not_base
;
202 return error_mark_node
;
204 gcc_assert (TYPE_P (base
));
213 t
= complete_type (TYPE_MAIN_VARIANT (t
));
214 t_binfo
= TYPE_BINFO (t
);
217 base
= TYPE_MAIN_VARIANT (base
);
219 /* If BASE is incomplete, it can't be a base of T--and instantiating it
220 might cause an error. */
221 if (t_binfo
&& CLASS_TYPE_P (base
)
222 && (COMPLETE_TYPE_P (base
) || TYPE_BEING_DEFINED (base
)))
224 struct lookup_base_data_s data
;
228 data
.binfo
= NULL_TREE
;
229 data
.ambiguous
= data
.via_virtual
= false;
230 data
.repeated_base
= CLASSTYPE_REPEATED_BASE_P (t
);
231 data
.want_any
= access
== ba_any
;
233 dfs_walk_once (t_binfo
, dfs_lookup_base
, NULL
, &data
);
237 bk
= data
.ambiguous
? bk_ambig
: bk_not_base
;
238 else if (binfo
== t_binfo
)
240 else if (data
.via_virtual
)
251 /* Check that the base is unambiguous and accessible. */
252 if (access
!= ba_any
)
259 if (!(access
& ba_quiet
))
261 error ("%qT is an ambiguous base of %qT", base
, t
);
262 binfo
= error_mark_node
;
267 if ((access
& ba_check_bit
)
268 /* If BASE is incomplete, then BASE and TYPE are probably
269 the same, in which case BASE is accessible. If they
270 are not the same, then TYPE is invalid. In that case,
271 there's no need to issue another error here, and
272 there's no implicit typedef to use in the code that
273 follows, so we skip the check. */
274 && COMPLETE_TYPE_P (base
)
275 && !accessible_base_p (t
, base
, !(access
& ba_ignore_scope
)))
277 if (!(access
& ba_quiet
))
279 error ("%qT is an inaccessible base of %qT", base
, t
);
280 binfo
= error_mark_node
;
284 bk
= bk_inaccessible
;
295 /* Data for dcast_base_hint walker. */
299 tree subtype
; /* The base type we're looking for. */
300 int virt_depth
; /* Number of virtual bases encountered from most
302 tree offset
; /* Best hint offset discovered so far. */
303 bool repeated_base
; /* Whether there are repeated bases in the
307 /* Worker for dcast_base_hint. Search for the base type being cast
311 dfs_dcast_hint_pre (tree binfo
, void *data_
)
313 struct dcast_data_s
*data
= (struct dcast_data_s
*) data_
;
315 if (BINFO_VIRTUAL_P (binfo
))
318 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->subtype
))
320 if (data
->virt_depth
)
322 data
->offset
= ssize_int (-1);
326 data
->offset
= ssize_int (-3);
328 data
->offset
= BINFO_OFFSET (binfo
);
330 return data
->repeated_base
? dfs_skip_bases
: data
->offset
;
336 /* Worker for dcast_base_hint. Track the virtual depth. */
339 dfs_dcast_hint_post (tree binfo
, void *data_
)
341 struct dcast_data_s
*data
= (struct dcast_data_s
*) data_
;
343 if (BINFO_VIRTUAL_P (binfo
))
349 /* The dynamic cast runtime needs a hint about how the static SUBTYPE type
350 started from is related to the required TARGET type, in order to optimize
351 the inheritance graph search. This information is independent of the
352 current context, and ignores private paths, hence get_base_distance is
353 inappropriate. Return a TREE specifying the base offset, BOFF.
354 BOFF >= 0, there is only one public non-virtual SUBTYPE base at offset BOFF,
355 and there are no public virtual SUBTYPE bases.
356 BOFF == -1, SUBTYPE occurs as multiple public virtual or non-virtual bases.
357 BOFF == -2, SUBTYPE is not a public base.
358 BOFF == -3, SUBTYPE occurs as multiple public non-virtual bases. */
361 dcast_base_hint (tree subtype
, tree target
)
363 struct dcast_data_s data
;
365 data
.subtype
= subtype
;
367 data
.offset
= NULL_TREE
;
368 data
.repeated_base
= CLASSTYPE_REPEATED_BASE_P (target
);
370 dfs_walk_once_accessible (TYPE_BINFO (target
), /*friends=*/false,
371 dfs_dcast_hint_pre
, dfs_dcast_hint_post
, &data
);
372 return data
.offset
? data
.offset
: ssize_int (-2);
375 /* Search for a member with name NAME in a multiple inheritance
376 lattice specified by TYPE. If it does not exist, return NULL_TREE.
377 If the member is ambiguously referenced, return `error_mark_node'.
378 Otherwise, return a DECL with the indicated name. If WANT_TYPE is
379 true, type declarations are preferred. */
381 /* Do a 1-level search for NAME as a member of TYPE. The caller must
382 figure out whether it can access this field. (Since it is only one
383 level, this is reasonable.) */
386 lookup_field_1 (tree type
, tree name
, bool want_type
)
390 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
391 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
392 || TREE_CODE (type
) == TYPENAME_TYPE
)
393 /* The TYPE_FIELDS of a TEMPLATE_TYPE_PARM and
394 BOUND_TEMPLATE_TEMPLATE_PARM are not fields at all;
395 instead TYPE_FIELDS is the TEMPLATE_PARM_INDEX. (Miraculously,
396 the code often worked even when we treated the index as a list
398 The TYPE_FIELDS of TYPENAME_TYPE is its TYPENAME_TYPE_FULLNAME. */
401 if (CLASSTYPE_SORTED_FIELDS (type
))
403 tree
*fields
= &CLASSTYPE_SORTED_FIELDS (type
)->elts
[0];
404 int lo
= 0, hi
= CLASSTYPE_SORTED_FIELDS (type
)->len
;
411 #ifdef GATHER_STATISTICS
413 #endif /* GATHER_STATISTICS */
415 if (DECL_NAME (fields
[i
]) > name
)
417 else if (DECL_NAME (fields
[i
]) < name
)
423 /* We might have a nested class and a field with the
424 same name; we sorted them appropriately via
425 field_decl_cmp, so just look for the first or last
426 field with this name. */
431 while (i
>= lo
&& DECL_NAME (fields
[i
]) == name
);
432 if (TREE_CODE (field
) != TYPE_DECL
433 && !DECL_CLASS_TEMPLATE_P (field
))
440 while (i
< hi
&& DECL_NAME (fields
[i
]) == name
);
448 field
= TYPE_FIELDS (type
);
450 #ifdef GATHER_STATISTICS
451 n_calls_lookup_field_1
++;
452 #endif /* GATHER_STATISTICS */
453 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
455 #ifdef GATHER_STATISTICS
457 #endif /* GATHER_STATISTICS */
458 gcc_assert (DECL_P (field
));
459 if (DECL_NAME (field
) == NULL_TREE
460 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
462 tree temp
= lookup_field_1 (TREE_TYPE (field
), name
, want_type
);
466 if (TREE_CODE (field
) == USING_DECL
)
468 /* We generally treat class-scope using-declarations as
469 ARM-style access specifications, because support for the
470 ISO semantics has not been implemented. So, in general,
471 there's no reason to return a USING_DECL, and the rest of
472 the compiler cannot handle that. Once the class is
473 defined, USING_DECLs are purged from TYPE_FIELDS; see
474 handle_using_decl. However, we make special efforts to
475 make using-declarations in class templates and class
476 template partial specializations work correctly. */
477 if (!DECL_DEPENDENT_P (field
))
481 if (DECL_NAME (field
) == name
483 || TREE_CODE (field
) == TYPE_DECL
484 || DECL_CLASS_TEMPLATE_P (field
)))
488 if (name
== vptr_identifier
)
490 /* Give the user what s/he thinks s/he wants. */
491 if (TYPE_POLYMORPHIC_P (type
))
492 return TYPE_VFIELD (type
);
497 /* Return the FUNCTION_DECL, RECORD_TYPE, UNION_TYPE, or
498 NAMESPACE_DECL corresponding to the innermost non-block scope. */
503 /* There are a number of cases we need to be aware of here:
504 current_class_type current_function_decl
511 Those last two make life interesting. If we're in a function which is
512 itself inside a class, we need decls to go into the fn's decls (our
513 second case below). But if we're in a class and the class itself is
514 inside a function, we need decls to go into the decls for the class. To
515 achieve this last goal, we must see if, when both current_class_ptr and
516 current_function_decl are set, the class was declared inside that
517 function. If so, we know to put the decls into the class's scope. */
518 if (current_function_decl
&& current_class_type
519 && ((DECL_FUNCTION_MEMBER_P (current_function_decl
)
520 && same_type_p (DECL_CONTEXT (current_function_decl
),
522 || (DECL_FRIEND_CONTEXT (current_function_decl
)
523 && same_type_p (DECL_FRIEND_CONTEXT (current_function_decl
),
524 current_class_type
))))
525 return current_function_decl
;
526 if (current_class_type
)
527 return current_class_type
;
528 if (current_function_decl
)
529 return current_function_decl
;
530 return current_namespace
;
533 /* Returns nonzero if we are currently in a function scope. Note
534 that this function returns zero if we are within a local class, but
535 not within a member function body of the local class. */
538 at_function_scope_p (void)
540 tree cs
= current_scope ();
541 return cs
&& TREE_CODE (cs
) == FUNCTION_DECL
;
544 /* Returns true if the innermost active scope is a class scope. */
547 at_class_scope_p (void)
549 tree cs
= current_scope ();
550 return cs
&& TYPE_P (cs
);
553 /* Returns true if the innermost active scope is a namespace scope. */
556 at_namespace_scope_p (void)
558 tree cs
= current_scope ();
559 return cs
&& TREE_CODE (cs
) == NAMESPACE_DECL
;
562 /* Return the scope of DECL, as appropriate when doing name-lookup. */
565 context_for_name_lookup (tree decl
)
569 For the purposes of name lookup, after the anonymous union
570 definition, the members of the anonymous union are considered to
571 have been defined in the scope in which the anonymous union is
573 tree context
= DECL_CONTEXT (decl
);
575 while (context
&& TYPE_P (context
) && ANON_AGGR_TYPE_P (context
))
576 context
= TYPE_CONTEXT (context
);
578 context
= global_namespace
;
583 /* The accessibility routines use BINFO_ACCESS for scratch space
584 during the computation of the accessibility of some declaration. */
586 #define BINFO_ACCESS(NODE) \
587 ((access_kind) ((TREE_PUBLIC (NODE) << 1) | TREE_PRIVATE (NODE)))
589 /* Set the access associated with NODE to ACCESS. */
591 #define SET_BINFO_ACCESS(NODE, ACCESS) \
592 ((TREE_PUBLIC (NODE) = ((ACCESS) & 2) != 0), \
593 (TREE_PRIVATE (NODE) = ((ACCESS) & 1) != 0))
595 /* Called from access_in_type via dfs_walk. Calculate the access to
596 DATA (which is really a DECL) in BINFO. */
599 dfs_access_in_type (tree binfo
, void *data
)
601 tree decl
= (tree
) data
;
602 tree type
= BINFO_TYPE (binfo
);
603 access_kind access
= ak_none
;
605 if (context_for_name_lookup (decl
) == type
)
607 /* If we have descended to the scope of DECL, just note the
608 appropriate access. */
609 if (TREE_PRIVATE (decl
))
611 else if (TREE_PROTECTED (decl
))
612 access
= ak_protected
;
618 /* First, check for an access-declaration that gives us more
619 access to the DECL. The CONST_DECL for an enumeration
620 constant will not have DECL_LANG_SPECIFIC, and thus no
622 if (DECL_LANG_SPECIFIC (decl
) && !DECL_DISCRIMINATOR_P (decl
))
624 tree decl_access
= purpose_member (type
, DECL_ACCESS (decl
));
628 decl_access
= TREE_VALUE (decl_access
);
630 if (decl_access
== access_public_node
)
632 else if (decl_access
== access_protected_node
)
633 access
= ak_protected
;
634 else if (decl_access
== access_private_node
)
645 VEC(tree
,gc
) *accesses
;
647 /* Otherwise, scan our baseclasses, and pick the most favorable
649 accesses
= BINFO_BASE_ACCESSES (binfo
);
650 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
652 tree base_access
= VEC_index (tree
, accesses
, i
);
653 access_kind base_access_now
= BINFO_ACCESS (base_binfo
);
655 if (base_access_now
== ak_none
|| base_access_now
== ak_private
)
656 /* If it was not accessible in the base, or only
657 accessible as a private member, we can't access it
659 base_access_now
= ak_none
;
660 else if (base_access
== access_protected_node
)
661 /* Public and protected members in the base become
663 base_access_now
= ak_protected
;
664 else if (base_access
== access_private_node
)
665 /* Public and protected members in the base become
667 base_access_now
= ak_private
;
669 /* See if the new access, via this base, gives more
670 access than our previous best access. */
671 if (base_access_now
!= ak_none
672 && (access
== ak_none
|| base_access_now
< access
))
674 access
= base_access_now
;
676 /* If the new access is public, we can't do better. */
677 if (access
== ak_public
)
684 /* Note the access to DECL in TYPE. */
685 SET_BINFO_ACCESS (binfo
, access
);
690 /* Return the access to DECL in TYPE. */
693 access_in_type (tree type
, tree decl
)
695 tree binfo
= TYPE_BINFO (type
);
697 /* We must take into account
701 If a name can be reached by several paths through a multiple
702 inheritance graph, the access is that of the path that gives
705 The algorithm we use is to make a post-order depth-first traversal
706 of the base-class hierarchy. As we come up the tree, we annotate
707 each node with the most lenient access. */
708 dfs_walk_once (binfo
, NULL
, dfs_access_in_type
, decl
);
710 return BINFO_ACCESS (binfo
);
713 /* Returns nonzero if it is OK to access DECL through an object
714 indicated by BINFO in the context of DERIVED. */
717 protected_accessible_p (tree decl
, tree derived
, tree binfo
)
721 /* We're checking this clause from [class.access.base]
723 m as a member of N is protected, and the reference occurs in a
724 member or friend of class N, or in a member or friend of a
725 class P derived from N, where m as a member of P is public, private
728 Here DERIVED is a possible P, DECL is m and BINFO_TYPE (binfo) is N. */
730 /* If DERIVED isn't derived from N, then it can't be a P. */
731 if (!DERIVED_FROM_P (BINFO_TYPE (binfo
), derived
))
734 access
= access_in_type (derived
, decl
);
736 /* If m is inaccessible in DERIVED, then it's not a P. */
737 if (access
== ak_none
)
742 When a friend or a member function of a derived class references
743 a protected nonstatic member of a base class, an access check
744 applies in addition to those described earlier in clause
745 _class.access_) Except when forming a pointer to member
746 (_expr.unary.op_), the access must be through a pointer to,
747 reference to, or object of the derived class itself (or any class
748 derived from that class) (_expr.ref_). If the access is to form
749 a pointer to member, the nested-name-specifier shall name the
750 derived class (or any class derived from that class). */
751 if (DECL_NONSTATIC_MEMBER_P (decl
))
753 /* We can tell through what the reference is occurring by
754 chasing BINFO up to the root. */
756 while (BINFO_INHERITANCE_CHAIN (t
))
757 t
= BINFO_INHERITANCE_CHAIN (t
);
759 if (!DERIVED_FROM_P (derived
, BINFO_TYPE (t
)))
766 /* Returns nonzero if SCOPE is a friend of a type which would be able
767 to access DECL through the object indicated by BINFO. */
770 friend_accessible_p (tree scope
, tree decl
, tree binfo
)
772 tree befriending_classes
;
778 if (TREE_CODE (scope
) == FUNCTION_DECL
779 || DECL_FUNCTION_TEMPLATE_P (scope
))
780 befriending_classes
= DECL_BEFRIENDING_CLASSES (scope
);
781 else if (TYPE_P (scope
))
782 befriending_classes
= CLASSTYPE_BEFRIENDING_CLASSES (scope
);
786 for (t
= befriending_classes
; t
; t
= TREE_CHAIN (t
))
787 if (protected_accessible_p (decl
, TREE_VALUE (t
), binfo
))
790 /* Nested classes have the same access as their enclosing types, as
791 per DR 45 (this is a change from the standard). */
793 for (t
= TYPE_CONTEXT (scope
); t
&& TYPE_P (t
); t
= TYPE_CONTEXT (t
))
794 if (protected_accessible_p (decl
, t
, binfo
))
797 if (TREE_CODE (scope
) == FUNCTION_DECL
798 || DECL_FUNCTION_TEMPLATE_P (scope
))
800 /* Perhaps this SCOPE is a member of a class which is a
802 if (DECL_CLASS_SCOPE_P (scope
)
803 && friend_accessible_p (DECL_CONTEXT (scope
), decl
, binfo
))
806 /* Or an instantiation of something which is a friend. */
807 if (DECL_TEMPLATE_INFO (scope
))
810 /* Increment processing_template_decl to make sure that
811 dependent_type_p works correctly. */
812 ++processing_template_decl
;
813 ret
= friend_accessible_p (DECL_TI_TEMPLATE (scope
), decl
, binfo
);
814 --processing_template_decl
;
822 /* Called via dfs_walk_once_accessible from accessible_p */
825 dfs_accessible_post (tree binfo
, void *data ATTRIBUTE_UNUSED
)
827 if (BINFO_ACCESS (binfo
) != ak_none
)
829 tree scope
= current_scope ();
830 if (scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
831 && is_friend (BINFO_TYPE (binfo
), scope
))
838 /* DECL is a declaration from a base class of TYPE, which was the
839 class used to name DECL. Return nonzero if, in the current
840 context, DECL is accessible. If TYPE is actually a BINFO node,
841 then we can tell in what context the access is occurring by looking
842 at the most derived class along the path indicated by BINFO. If
843 CONSIDER_LOCAL is true, do consider special access the current
844 scope or friendship thereof we might have. */
847 accessible_p (tree type
, tree decl
, bool consider_local_p
)
853 /* Nonzero if it's OK to access DECL if it has protected
854 accessibility in TYPE. */
855 int protected_ok
= 0;
857 /* If this declaration is in a block or namespace scope, there's no
859 if (!TYPE_P (context_for_name_lookup (decl
)))
862 /* There is no need to perform access checks inside a thunk. */
863 scope
= current_scope ();
864 if (scope
&& DECL_THUNK_P (scope
))
867 /* In a template declaration, we cannot be sure whether the
868 particular specialization that is instantiated will be a friend
869 or not. Therefore, all access checks are deferred until
870 instantiation. However, PROCESSING_TEMPLATE_DECL is set in the
871 parameter list for a template (because we may see dependent types
872 in default arguments for template parameters), and access
873 checking should be performed in the outermost parameter list. */
874 if (processing_template_decl
875 && (!processing_template_parmlist
|| processing_template_decl
> 1))
881 type
= BINFO_TYPE (type
);
884 binfo
= TYPE_BINFO (type
);
886 /* [class.access.base]
888 A member m is accessible when named in class N if
890 --m as a member of N is public, or
892 --m as a member of N is private, and the reference occurs in a
893 member or friend of class N, or
895 --m as a member of N is protected, and the reference occurs in a
896 member or friend of class N, or in a member or friend of a
897 class P derived from N, where m as a member of P is private or
900 --there exists a base class B of N that is accessible at the point
901 of reference, and m is accessible when named in class B.
903 We walk the base class hierarchy, checking these conditions. */
905 if (consider_local_p
)
907 /* Figure out where the reference is occurring. Check to see if
908 DECL is private or protected in this scope, since that will
909 determine whether protected access is allowed. */
910 if (current_class_type
)
911 protected_ok
= protected_accessible_p (decl
,
912 current_class_type
, binfo
);
914 /* Now, loop through the classes of which we are a friend. */
916 protected_ok
= friend_accessible_p (scope
, decl
, binfo
);
919 /* Standardize the binfo that access_in_type will use. We don't
920 need to know what path was chosen from this point onwards. */
921 binfo
= TYPE_BINFO (type
);
923 /* Compute the accessibility of DECL in the class hierarchy
924 dominated by type. */
925 access
= access_in_type (type
, decl
);
926 if (access
== ak_public
927 || (access
== ak_protected
&& protected_ok
))
930 if (!consider_local_p
)
933 /* Walk the hierarchy again, looking for a base class that allows
935 return dfs_walk_once_accessible (binfo
, /*friends=*/true,
936 NULL
, dfs_accessible_post
, NULL
)
940 struct lookup_field_info
{
941 /* The type in which we're looking. */
943 /* The name of the field for which we're looking. */
945 /* If non-NULL, the current result of the lookup. */
947 /* The path to RVAL. */
949 /* If non-NULL, the lookup was ambiguous, and this is a list of the
952 /* If nonzero, we are looking for types, not data members. */
954 /* If something went wrong, a message indicating what. */
958 /* Within the scope of a template class, you can refer to the to the
959 current specialization with the name of the template itself. For
962 template <typename T> struct S { S* sp; }
964 Returns nonzero if DECL is such a declaration in a class TYPE. */
967 template_self_reference_p (tree type
, tree decl
)
969 return (CLASSTYPE_USE_TEMPLATE (type
)
970 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (type
))
971 && TREE_CODE (decl
) == TYPE_DECL
972 && DECL_ARTIFICIAL (decl
)
973 && DECL_NAME (decl
) == constructor_name (type
));
976 /* Nonzero for a class member means that it is shared between all objects
979 [class.member.lookup]:If the resulting set of declarations are not all
980 from sub-objects of the same type, or the set has a nonstatic member
981 and includes members from distinct sub-objects, there is an ambiguity
982 and the program is ill-formed.
984 This function checks that T contains no nonstatic members. */
987 shared_member_p (tree t
)
989 if (TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == TYPE_DECL \
990 || TREE_CODE (t
) == CONST_DECL
)
992 if (is_overloaded_fn (t
))
994 for (; t
; t
= OVL_NEXT (t
))
996 tree fn
= OVL_CURRENT (t
);
997 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
1005 /* Routine to see if the sub-object denoted by the binfo PARENT can be
1006 found as a base class and sub-object of the object denoted by
1010 is_subobject_of_p (tree parent
, tree binfo
)
1014 for (probe
= parent
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
1018 if (BINFO_VIRTUAL_P (probe
))
1019 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (binfo
))
1025 /* DATA is really a struct lookup_field_info. Look for a field with
1026 the name indicated there in BINFO. If this function returns a
1027 non-NULL value it is the result of the lookup. Called from
1028 lookup_field via breadth_first_search. */
1031 lookup_field_r (tree binfo
, void *data
)
1033 struct lookup_field_info
*lfi
= (struct lookup_field_info
*) data
;
1034 tree type
= BINFO_TYPE (binfo
);
1035 tree nval
= NULL_TREE
;
1037 /* If this is a dependent base, don't look in it. */
1038 if (BINFO_DEPENDENT_BASE_P (binfo
))
1041 /* If this base class is hidden by the best-known value so far, we
1042 don't need to look. */
1043 if (lfi
->rval_binfo
&& BINFO_INHERITANCE_CHAIN (binfo
) == lfi
->rval_binfo
1044 && !BINFO_VIRTUAL_P (binfo
))
1045 return dfs_skip_bases
;
1047 /* First, look for a function. There can't be a function and a data
1048 member with the same name, and if there's a function and a type
1049 with the same name, the type is hidden by the function. */
1050 if (!lfi
->want_type
)
1052 int idx
= lookup_fnfields_1 (type
, lfi
->name
);
1054 nval
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), idx
);
1058 /* Look for a data member or type. */
1059 nval
= lookup_field_1 (type
, lfi
->name
, lfi
->want_type
);
1061 /* If there is no declaration with the indicated name in this type,
1062 then there's nothing to do. */
1066 /* If we're looking up a type (as with an elaborated type specifier)
1067 we ignore all non-types we find. */
1068 if (lfi
->want_type
&& TREE_CODE (nval
) != TYPE_DECL
1069 && !DECL_CLASS_TEMPLATE_P (nval
))
1071 if (lfi
->name
== TYPE_IDENTIFIER (type
))
1073 /* If the aggregate has no user defined constructors, we allow
1074 it to have fields with the same name as the enclosing type.
1075 If we are looking for that name, find the corresponding
1077 for (nval
= TREE_CHAIN (nval
); nval
; nval
= TREE_CHAIN (nval
))
1078 if (DECL_NAME (nval
) == lfi
->name
1079 && TREE_CODE (nval
) == TYPE_DECL
)
1084 if (!nval
&& CLASSTYPE_NESTED_UTDS (type
) != NULL
)
1086 binding_entry e
= binding_table_find (CLASSTYPE_NESTED_UTDS (type
),
1089 nval
= TYPE_MAIN_DECL (e
->type
);
1095 /* You must name a template base class with a template-id. */
1096 if (!same_type_p (type
, lfi
->type
)
1097 && template_self_reference_p (type
, nval
))
1100 /* If the lookup already found a match, and the new value doesn't
1101 hide the old one, we might have an ambiguity. */
1103 && !is_subobject_of_p (lfi
->rval_binfo
, binfo
))
1106 if (nval
== lfi
->rval
&& shared_member_p (nval
))
1107 /* The two things are really the same. */
1109 else if (is_subobject_of_p (binfo
, lfi
->rval_binfo
))
1110 /* The previous value hides the new one. */
1114 /* We have a real ambiguity. We keep a chain of all the
1116 if (!lfi
->ambiguous
&& lfi
->rval
)
1118 /* This is the first time we noticed an ambiguity. Add
1119 what we previously thought was a reasonable candidate
1121 lfi
->ambiguous
= tree_cons (NULL_TREE
, lfi
->rval
, NULL_TREE
);
1122 TREE_TYPE (lfi
->ambiguous
) = error_mark_node
;
1125 /* Add the new value. */
1126 lfi
->ambiguous
= tree_cons (NULL_TREE
, nval
, lfi
->ambiguous
);
1127 TREE_TYPE (lfi
->ambiguous
) = error_mark_node
;
1128 lfi
->errstr
= "request for member %qD is ambiguous";
1134 lfi
->rval_binfo
= binfo
;
1138 /* Don't look for constructors or destructors in base classes. */
1139 if (IDENTIFIER_CTOR_OR_DTOR_P (lfi
->name
))
1140 return dfs_skip_bases
;
1144 /* Return a "baselink" with BASELINK_BINFO, BASELINK_ACCESS_BINFO,
1145 BASELINK_FUNCTIONS, and BASELINK_OPTYPE set to BINFO, ACCESS_BINFO,
1146 FUNCTIONS, and OPTYPE respectively. */
1149 build_baselink (tree binfo
, tree access_binfo
, tree functions
, tree optype
)
1153 gcc_assert (TREE_CODE (functions
) == FUNCTION_DECL
1154 || TREE_CODE (functions
) == TEMPLATE_DECL
1155 || TREE_CODE (functions
) == TEMPLATE_ID_EXPR
1156 || TREE_CODE (functions
) == OVERLOAD
);
1157 gcc_assert (!optype
|| TYPE_P (optype
));
1158 gcc_assert (TREE_TYPE (functions
));
1160 baselink
= make_node (BASELINK
);
1161 TREE_TYPE (baselink
) = TREE_TYPE (functions
);
1162 BASELINK_BINFO (baselink
) = binfo
;
1163 BASELINK_ACCESS_BINFO (baselink
) = access_binfo
;
1164 BASELINK_FUNCTIONS (baselink
) = functions
;
1165 BASELINK_OPTYPE (baselink
) = optype
;
1170 /* Look for a member named NAME in an inheritance lattice dominated by
1171 XBASETYPE. If PROTECT is 0 or two, we do not check access. If it
1172 is 1, we enforce accessibility. If PROTECT is zero, then, for an
1173 ambiguous lookup, we return NULL. If PROTECT is 1, we issue error
1174 messages about inaccessible or ambiguous lookup. If PROTECT is 2,
1175 we return a TREE_LIST whose TREE_TYPE is error_mark_node and whose
1176 TREE_VALUEs are the list of ambiguous candidates.
1178 WANT_TYPE is 1 when we should only return TYPE_DECLs.
1180 If nothing can be found return NULL_TREE and do not issue an error. */
1183 lookup_member (tree xbasetype
, tree name
, int protect
, bool want_type
)
1185 tree rval
, rval_binfo
= NULL_TREE
;
1186 tree type
= NULL_TREE
, basetype_path
= NULL_TREE
;
1187 struct lookup_field_info lfi
;
1189 /* rval_binfo is the binfo associated with the found member, note,
1190 this can be set with useful information, even when rval is not
1191 set, because it must deal with ALL members, not just non-function
1192 members. It is used for ambiguity checking and the hidden
1193 checks. Whereas rval is only set if a proper (not hidden)
1194 non-function member is found. */
1196 const char *errstr
= 0;
1198 if (name
== error_mark_node
)
1201 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
1203 if (TREE_CODE (xbasetype
) == TREE_BINFO
)
1205 type
= BINFO_TYPE (xbasetype
);
1206 basetype_path
= xbasetype
;
1210 if (!RECORD_OR_UNION_CODE_P (TREE_CODE (xbasetype
)))
1213 xbasetype
= NULL_TREE
;
1216 type
= complete_type (type
);
1218 basetype_path
= TYPE_BINFO (type
);
1223 #ifdef GATHER_STATISTICS
1224 n_calls_lookup_field
++;
1225 #endif /* GATHER_STATISTICS */
1227 memset (&lfi
, 0, sizeof (lfi
));
1230 lfi
.want_type
= want_type
;
1231 dfs_walk_all (basetype_path
, &lookup_field_r
, NULL
, &lfi
);
1233 rval_binfo
= lfi
.rval_binfo
;
1235 type
= BINFO_TYPE (rval_binfo
);
1236 errstr
= lfi
.errstr
;
1238 /* If we are not interested in ambiguities, don't report them;
1239 just return NULL_TREE. */
1240 if (!protect
&& lfi
.ambiguous
)
1246 return lfi
.ambiguous
;
1253 In the case of overloaded function names, access control is
1254 applied to the function selected by overloaded resolution.
1256 We cannot check here, even if RVAL is only a single non-static
1257 member function, since we do not know what the "this" pointer
1260 class A { protected: void f(); };
1261 class B : public A {
1268 only the first call to "f" is valid. However, if the function is
1269 static, we can check. */
1271 && !really_overloaded_fn (rval
)
1272 && !(TREE_CODE (rval
) == FUNCTION_DECL
1273 && DECL_NONSTATIC_MEMBER_FUNCTION_P (rval
)))
1274 perform_or_defer_access_check (basetype_path
, rval
, rval
);
1276 if (errstr
&& protect
)
1278 error (errstr
, name
, type
);
1280 print_candidates (lfi
.ambiguous
);
1281 rval
= error_mark_node
;
1284 if (rval
&& is_overloaded_fn (rval
))
1285 rval
= build_baselink (rval_binfo
, basetype_path
, rval
,
1286 (IDENTIFIER_TYPENAME_P (name
)
1287 ? TREE_TYPE (name
): NULL_TREE
));
1291 /* Like lookup_member, except that if we find a function member we
1292 return NULL_TREE. */
1295 lookup_field (tree xbasetype
, tree name
, int protect
, bool want_type
)
1297 tree rval
= lookup_member (xbasetype
, name
, protect
, want_type
);
1299 /* Ignore functions, but propagate the ambiguity list. */
1300 if (!error_operand_p (rval
)
1301 && (rval
&& BASELINK_P (rval
)))
1307 /* Like lookup_member, except that if we find a non-function member we
1308 return NULL_TREE. */
1311 lookup_fnfields (tree xbasetype
, tree name
, int protect
)
1313 tree rval
= lookup_member (xbasetype
, name
, protect
, /*want_type=*/false);
1315 /* Ignore non-functions, but propagate the ambiguity list. */
1316 if (!error_operand_p (rval
)
1317 && (rval
&& !BASELINK_P (rval
)))
1323 /* Return the index in the CLASSTYPE_METHOD_VEC for CLASS_TYPE
1324 corresponding to "operator TYPE ()", or -1 if there is no such
1325 operator. Only CLASS_TYPE itself is searched; this routine does
1326 not scan the base classes of CLASS_TYPE. */
1329 lookup_conversion_operator (tree class_type
, tree type
)
1333 if (TYPE_HAS_CONVERSION (class_type
))
1337 VEC(tree
,gc
) *methods
= CLASSTYPE_METHOD_VEC (class_type
);
1339 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1340 VEC_iterate (tree
, methods
, i
, fn
); ++i
)
1342 /* All the conversion operators come near the beginning of
1343 the class. Therefore, if FN is not a conversion
1344 operator, there is no matching conversion operator in
1346 fn
= OVL_CURRENT (fn
);
1347 if (!DECL_CONV_FN_P (fn
))
1350 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
1351 /* All the templated conversion functions are on the same
1352 slot, so remember it. */
1354 else if (same_type_p (DECL_CONV_FN_TYPE (fn
), type
))
1362 /* TYPE is a class type. Return the index of the fields within
1363 the method vector with name NAME, or -1 is no such field exists. */
1366 lookup_fnfields_1 (tree type
, tree name
)
1368 VEC(tree
,gc
) *method_vec
;
1373 if (!CLASS_TYPE_P (type
))
1376 if (COMPLETE_TYPE_P (type
))
1378 if ((name
== ctor_identifier
1379 || name
== base_ctor_identifier
1380 || name
== complete_ctor_identifier
))
1382 if (CLASSTYPE_LAZY_DEFAULT_CTOR (type
))
1383 lazily_declare_fn (sfk_constructor
, type
);
1384 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
1385 lazily_declare_fn (sfk_copy_constructor
, type
);
1386 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
1387 lazily_declare_fn (sfk_move_constructor
, type
);
1389 else if (name
== ansi_assopname(NOP_EXPR
)
1390 && CLASSTYPE_LAZY_ASSIGNMENT_OP (type
))
1391 lazily_declare_fn (sfk_assignment_operator
, type
);
1392 else if ((name
== dtor_identifier
1393 || name
== base_dtor_identifier
1394 || name
== complete_dtor_identifier
1395 || name
== deleting_dtor_identifier
)
1396 && CLASSTYPE_LAZY_DESTRUCTOR (type
))
1397 lazily_declare_fn (sfk_destructor
, type
);
1400 method_vec
= CLASSTYPE_METHOD_VEC (type
);
1404 #ifdef GATHER_STATISTICS
1405 n_calls_lookup_fnfields_1
++;
1406 #endif /* GATHER_STATISTICS */
1408 /* Constructors are first... */
1409 if (name
== ctor_identifier
)
1411 fn
= CLASSTYPE_CONSTRUCTORS (type
);
1412 return fn
? CLASSTYPE_CONSTRUCTOR_SLOT
: -1;
1414 /* and destructors are second. */
1415 if (name
== dtor_identifier
)
1417 fn
= CLASSTYPE_DESTRUCTORS (type
);
1418 return fn
? CLASSTYPE_DESTRUCTOR_SLOT
: -1;
1420 if (IDENTIFIER_TYPENAME_P (name
))
1421 return lookup_conversion_operator (type
, TREE_TYPE (name
));
1423 /* Skip the conversion operators. */
1424 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1425 VEC_iterate (tree
, method_vec
, i
, fn
);
1427 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
1430 /* If the type is complete, use binary search. */
1431 if (COMPLETE_TYPE_P (type
))
1437 hi
= VEC_length (tree
, method_vec
);
1442 #ifdef GATHER_STATISTICS
1443 n_outer_fields_searched
++;
1444 #endif /* GATHER_STATISTICS */
1446 tmp
= VEC_index (tree
, method_vec
, i
);
1447 tmp
= DECL_NAME (OVL_CURRENT (tmp
));
1450 else if (tmp
< name
)
1457 for (; VEC_iterate (tree
, method_vec
, i
, fn
); ++i
)
1459 #ifdef GATHER_STATISTICS
1460 n_outer_fields_searched
++;
1461 #endif /* GATHER_STATISTICS */
1462 if (DECL_NAME (OVL_CURRENT (fn
)) == name
)
1469 /* Like lookup_fnfields_1, except that the name is extracted from
1470 FUNCTION, which is a FUNCTION_DECL or a TEMPLATE_DECL. */
1473 class_method_index_for_fn (tree class_type
, tree function
)
1475 gcc_assert (TREE_CODE (function
) == FUNCTION_DECL
1476 || DECL_FUNCTION_TEMPLATE_P (function
));
1478 return lookup_fnfields_1 (class_type
,
1479 DECL_CONSTRUCTOR_P (function
) ? ctor_identifier
:
1480 DECL_DESTRUCTOR_P (function
) ? dtor_identifier
:
1481 DECL_NAME (function
));
1485 /* DECL is the result of a qualified name lookup. QUALIFYING_SCOPE is
1486 the class or namespace used to qualify the name. CONTEXT_CLASS is
1487 the class corresponding to the object in which DECL will be used.
1488 Return a possibly modified version of DECL that takes into account
1491 In particular, consider an expression like `B::m' in the context of
1492 a derived class `D'. If `B::m' has been resolved to a BASELINK,
1493 then the most derived class indicated by the BASELINK_BINFO will be
1494 `B', not `D'. This function makes that adjustment. */
1497 adjust_result_of_qualified_name_lookup (tree decl
,
1498 tree qualifying_scope
,
1501 if (context_class
&& context_class
!= error_mark_node
1502 && CLASS_TYPE_P (context_class
)
1503 && CLASS_TYPE_P (qualifying_scope
)
1504 && DERIVED_FROM_P (qualifying_scope
, context_class
)
1505 && BASELINK_P (decl
))
1509 /* Look for the QUALIFYING_SCOPE as a base of the CONTEXT_CLASS.
1510 Because we do not yet know which function will be chosen by
1511 overload resolution, we cannot yet check either accessibility
1512 or ambiguity -- in either case, the choice of a static member
1513 function might make the usage valid. */
1514 base
= lookup_base (context_class
, qualifying_scope
,
1515 ba_unique
| ba_quiet
, NULL
);
1518 BASELINK_ACCESS_BINFO (decl
) = base
;
1519 BASELINK_BINFO (decl
)
1520 = lookup_base (base
, BINFO_TYPE (BASELINK_BINFO (decl
)),
1521 ba_unique
| ba_quiet
,
1530 /* Walk the class hierarchy within BINFO, in a depth-first traversal.
1531 PRE_FN is called in preorder, while POST_FN is called in postorder.
1532 If PRE_FN returns DFS_SKIP_BASES, child binfos will not be
1533 walked. If PRE_FN or POST_FN returns a different non-NULL value,
1534 that value is immediately returned and the walk is terminated. One
1535 of PRE_FN and POST_FN can be NULL. At each node, PRE_FN and
1536 POST_FN are passed the binfo to examine and the caller's DATA
1537 value. All paths are walked, thus virtual and morally virtual
1538 binfos can be multiply walked. */
1541 dfs_walk_all (tree binfo
, tree (*pre_fn
) (tree
, void *),
1542 tree (*post_fn
) (tree
, void *), void *data
)
1548 /* Call the pre-order walking function. */
1551 rval
= pre_fn (binfo
, data
);
1554 if (rval
== dfs_skip_bases
)
1560 /* Find the next child binfo to walk. */
1561 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1563 rval
= dfs_walk_all (base_binfo
, pre_fn
, post_fn
, data
);
1569 /* Call the post-order walking function. */
1572 rval
= post_fn (binfo
, data
);
1573 gcc_assert (rval
!= dfs_skip_bases
);
1580 /* Worker for dfs_walk_once. This behaves as dfs_walk_all, except
1581 that binfos are walked at most once. */
1584 dfs_walk_once_r (tree binfo
, tree (*pre_fn
) (tree
, void *),
1585 tree (*post_fn
) (tree
, void *), void *data
)
1591 /* Call the pre-order walking function. */
1594 rval
= pre_fn (binfo
, data
);
1597 if (rval
== dfs_skip_bases
)
1604 /* Find the next child binfo to walk. */
1605 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1607 if (BINFO_VIRTUAL_P (base_binfo
))
1609 if (BINFO_MARKED (base_binfo
))
1611 BINFO_MARKED (base_binfo
) = 1;
1614 rval
= dfs_walk_once_r (base_binfo
, pre_fn
, post_fn
, data
);
1620 /* Call the post-order walking function. */
1623 rval
= post_fn (binfo
, data
);
1624 gcc_assert (rval
!= dfs_skip_bases
);
1631 /* Worker for dfs_walk_once. Recursively unmark the virtual base binfos of
1635 dfs_unmark_r (tree binfo
)
1640 /* Process the basetypes. */
1641 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1643 if (BINFO_VIRTUAL_P (base_binfo
))
1645 if (!BINFO_MARKED (base_binfo
))
1647 BINFO_MARKED (base_binfo
) = 0;
1649 /* Only walk, if it can contain more virtual bases. */
1650 if (CLASSTYPE_VBASECLASSES (BINFO_TYPE (base_binfo
)))
1651 dfs_unmark_r (base_binfo
);
1655 /* Like dfs_walk_all, except that binfos are not multiply walked. For
1656 non-diamond shaped hierarchies this is the same as dfs_walk_all.
1657 For diamond shaped hierarchies we must mark the virtual bases, to
1658 avoid multiple walks. */
1661 dfs_walk_once (tree binfo
, tree (*pre_fn
) (tree
, void *),
1662 tree (*post_fn
) (tree
, void *), void *data
)
1664 static int active
= 0; /* We must not be called recursively. */
1667 gcc_assert (pre_fn
|| post_fn
);
1668 gcc_assert (!active
);
1671 if (!CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo
)))
1672 /* We are not diamond shaped, and therefore cannot encounter the
1673 same binfo twice. */
1674 rval
= dfs_walk_all (binfo
, pre_fn
, post_fn
, data
);
1677 rval
= dfs_walk_once_r (binfo
, pre_fn
, post_fn
, data
);
1678 if (!BINFO_INHERITANCE_CHAIN (binfo
))
1680 /* We are at the top of the hierarchy, and can use the
1681 CLASSTYPE_VBASECLASSES list for unmarking the virtual
1683 VEC(tree
,gc
) *vbases
;
1687 for (vbases
= CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)), ix
= 0;
1688 VEC_iterate (tree
, vbases
, ix
, base_binfo
); ix
++)
1689 BINFO_MARKED (base_binfo
) = 0;
1692 dfs_unmark_r (binfo
);
1700 /* Worker function for dfs_walk_once_accessible. Behaves like
1701 dfs_walk_once_r, except (a) FRIENDS_P is true if special
1702 access given by the current context should be considered, (b) ONCE
1703 indicates whether bases should be marked during traversal. */
1706 dfs_walk_once_accessible_r (tree binfo
, bool friends_p
, bool once
,
1707 tree (*pre_fn
) (tree
, void *),
1708 tree (*post_fn
) (tree
, void *), void *data
)
1710 tree rval
= NULL_TREE
;
1714 /* Call the pre-order walking function. */
1717 rval
= pre_fn (binfo
, data
);
1720 if (rval
== dfs_skip_bases
)
1727 /* Find the next child binfo to walk. */
1728 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1730 bool mark
= once
&& BINFO_VIRTUAL_P (base_binfo
);
1732 if (mark
&& BINFO_MARKED (base_binfo
))
1735 /* If the base is inherited via private or protected
1736 inheritance, then we can't see it, unless we are a friend of
1737 the current binfo. */
1738 if (BINFO_BASE_ACCESS (binfo
, ix
) != access_public_node
)
1743 scope
= current_scope ();
1745 || TREE_CODE (scope
) == NAMESPACE_DECL
1746 || !is_friend (BINFO_TYPE (binfo
), scope
))
1751 BINFO_MARKED (base_binfo
) = 1;
1753 rval
= dfs_walk_once_accessible_r (base_binfo
, friends_p
, once
,
1754 pre_fn
, post_fn
, data
);
1760 /* Call the post-order walking function. */
1763 rval
= post_fn (binfo
, data
);
1764 gcc_assert (rval
!= dfs_skip_bases
);
1771 /* Like dfs_walk_once except that only accessible bases are walked.
1772 FRIENDS_P indicates whether friendship of the local context
1773 should be considered when determining accessibility. */
1776 dfs_walk_once_accessible (tree binfo
, bool friends_p
,
1777 tree (*pre_fn
) (tree
, void *),
1778 tree (*post_fn
) (tree
, void *), void *data
)
1780 bool diamond_shaped
= CLASSTYPE_DIAMOND_SHAPED_P (BINFO_TYPE (binfo
));
1781 tree rval
= dfs_walk_once_accessible_r (binfo
, friends_p
, diamond_shaped
,
1782 pre_fn
, post_fn
, data
);
1786 if (!BINFO_INHERITANCE_CHAIN (binfo
))
1788 /* We are at the top of the hierarchy, and can use the
1789 CLASSTYPE_VBASECLASSES list for unmarking the virtual
1791 VEC(tree
,gc
) *vbases
;
1795 for (vbases
= CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)), ix
= 0;
1796 VEC_iterate (tree
, vbases
, ix
, base_binfo
); ix
++)
1797 BINFO_MARKED (base_binfo
) = 0;
1800 dfs_unmark_r (binfo
);
1805 /* Check that virtual overrider OVERRIDER is acceptable for base function
1806 BASEFN. Issue diagnostic, and return zero, if unacceptable. */
1809 check_final_overrider (tree overrider
, tree basefn
)
1811 tree over_type
= TREE_TYPE (overrider
);
1812 tree base_type
= TREE_TYPE (basefn
);
1813 tree over_return
= TREE_TYPE (over_type
);
1814 tree base_return
= TREE_TYPE (base_type
);
1815 tree over_throw
= TYPE_RAISES_EXCEPTIONS (over_type
);
1816 tree base_throw
= TYPE_RAISES_EXCEPTIONS (base_type
);
1819 if (DECL_INVALID_OVERRIDER_P (overrider
))
1822 if (same_type_p (base_return
, over_return
))
1824 else if ((CLASS_TYPE_P (over_return
) && CLASS_TYPE_P (base_return
))
1825 || (TREE_CODE (base_return
) == TREE_CODE (over_return
)
1826 && POINTER_TYPE_P (base_return
)))
1828 /* Potentially covariant. */
1829 unsigned base_quals
, over_quals
;
1831 fail
= !POINTER_TYPE_P (base_return
);
1834 fail
= cp_type_quals (base_return
) != cp_type_quals (over_return
);
1836 base_return
= TREE_TYPE (base_return
);
1837 over_return
= TREE_TYPE (over_return
);
1839 base_quals
= cp_type_quals (base_return
);
1840 over_quals
= cp_type_quals (over_return
);
1842 if ((base_quals
& over_quals
) != over_quals
)
1845 if (CLASS_TYPE_P (base_return
) && CLASS_TYPE_P (over_return
))
1847 tree binfo
= lookup_base (over_return
, base_return
,
1848 ba_check
| ba_quiet
, NULL
);
1854 && can_convert (TREE_TYPE (base_type
), TREE_TYPE (over_type
)))
1855 /* GNU extension, allow trivial pointer conversions such as
1856 converting to void *, or qualification conversion. */
1858 /* can_convert will permit user defined conversion from a
1859 (reference to) class type. We must reject them. */
1860 over_return
= non_reference (TREE_TYPE (over_type
));
1861 if (CLASS_TYPE_P (over_return
))
1865 warning (0, "deprecated covariant return type for %q+#D",
1867 warning (0, " overriding %q+#D", basefn
);
1881 error ("invalid covariant return type for %q+#D", overrider
);
1882 error (" overriding %q+#D", basefn
);
1886 error ("conflicting return type specified for %q+#D", overrider
);
1887 error (" overriding %q+#D", basefn
);
1889 DECL_INVALID_OVERRIDER_P (overrider
) = 1;
1893 /* Check throw specifier is at least as strict. */
1894 if (!comp_except_specs (base_throw
, over_throw
, 0))
1896 error ("looser throw specifier for %q+#F", overrider
);
1897 error (" overriding %q+#F", basefn
);
1898 DECL_INVALID_OVERRIDER_P (overrider
) = 1;
1902 /* Check for conflicting type attributes. */
1903 if (!targetm
.comp_type_attributes (over_type
, base_type
))
1905 error ("conflicting type attributes specified for %q+#D", overrider
);
1906 error (" overriding %q+#D", basefn
);
1907 DECL_INVALID_OVERRIDER_P (overrider
) = 1;
1911 if (DECL_DELETED_FN (basefn
) != DECL_DELETED_FN (overrider
))
1913 if (DECL_DELETED_FN (overrider
))
1915 error ("deleted function %q+D", overrider
);
1916 error ("overriding non-deleted function %q+D", basefn
);
1920 error ("non-deleted function %q+D", overrider
);
1921 error ("overriding deleted function %q+D", basefn
);
1928 /* Given a class TYPE, and a function decl FNDECL, look for
1929 virtual functions in TYPE's hierarchy which FNDECL overrides.
1930 We do not look in TYPE itself, only its bases.
1932 Returns nonzero, if we find any. Set FNDECL's DECL_VIRTUAL_P, if we
1933 find that it overrides anything.
1935 We check that every function which is overridden, is correctly
1939 look_for_overrides (tree type
, tree fndecl
)
1941 tree binfo
= TYPE_BINFO (type
);
1946 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ix
++)
1948 tree basetype
= BINFO_TYPE (base_binfo
);
1950 if (TYPE_POLYMORPHIC_P (basetype
))
1951 found
+= look_for_overrides_r (basetype
, fndecl
);
1956 /* Look in TYPE for virtual functions with the same signature as
1960 look_for_overrides_here (tree type
, tree fndecl
)
1964 /* If there are no methods in TYPE (meaning that only implicitly
1965 declared methods will ever be provided for TYPE), then there are
1966 no virtual functions. */
1967 if (!CLASSTYPE_METHOD_VEC (type
))
1970 if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fndecl
))
1971 ix
= CLASSTYPE_DESTRUCTOR_SLOT
;
1973 ix
= lookup_fnfields_1 (type
, DECL_NAME (fndecl
));
1976 tree fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
1978 for (; fns
; fns
= OVL_NEXT (fns
))
1980 tree fn
= OVL_CURRENT (fns
);
1982 if (!DECL_VIRTUAL_P (fn
))
1983 /* Not a virtual. */;
1984 else if (DECL_CONTEXT (fn
) != type
)
1985 /* Introduced with a using declaration. */;
1986 else if (DECL_STATIC_FUNCTION_P (fndecl
))
1988 tree btypes
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1989 tree dtypes
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1990 if (compparms (TREE_CHAIN (btypes
), dtypes
))
1993 else if (same_signature_p (fndecl
, fn
))
2000 /* Look in TYPE for virtual functions overridden by FNDECL. Check both
2001 TYPE itself and its bases. */
2004 look_for_overrides_r (tree type
, tree fndecl
)
2006 tree fn
= look_for_overrides_here (type
, fndecl
);
2009 if (DECL_STATIC_FUNCTION_P (fndecl
))
2011 /* A static member function cannot match an inherited
2012 virtual member function. */
2013 error ("%q+#D cannot be declared", fndecl
);
2014 error (" since %q+#D declared in base class", fn
);
2018 /* It's definitely virtual, even if not explicitly set. */
2019 DECL_VIRTUAL_P (fndecl
) = 1;
2020 check_final_overrider (fndecl
, fn
);
2025 /* We failed to find one declared in this class. Look in its bases. */
2026 return look_for_overrides (type
, fndecl
);
2029 /* Called via dfs_walk from dfs_get_pure_virtuals. */
2032 dfs_get_pure_virtuals (tree binfo
, void *data
)
2034 tree type
= (tree
) data
;
2036 /* We're not interested in primary base classes; the derived class
2037 of which they are a primary base will contain the information we
2039 if (!BINFO_PRIMARY_P (binfo
))
2043 for (virtuals
= BINFO_VIRTUALS (binfo
);
2045 virtuals
= TREE_CHAIN (virtuals
))
2046 if (DECL_PURE_VIRTUAL_P (BV_FN (virtuals
)))
2047 VEC_safe_push (tree
, gc
, CLASSTYPE_PURE_VIRTUALS (type
),
2054 /* Set CLASSTYPE_PURE_VIRTUALS for TYPE. */
2057 get_pure_virtuals (tree type
)
2059 /* Clear the CLASSTYPE_PURE_VIRTUALS list; whatever is already there
2060 is going to be overridden. */
2061 CLASSTYPE_PURE_VIRTUALS (type
) = NULL
;
2062 /* Now, run through all the bases which are not primary bases, and
2063 collect the pure virtual functions. We look at the vtable in
2064 each class to determine what pure virtual functions are present.
2065 (A primary base is not interesting because the derived class of
2066 which it is a primary base will contain vtable entries for the
2067 pure virtuals in the base class. */
2068 dfs_walk_once (TYPE_BINFO (type
), NULL
, dfs_get_pure_virtuals
, type
);
2071 /* Debug info for C++ classes can get very large; try to avoid
2072 emitting it everywhere.
2074 Note that this optimization wins even when the target supports
2075 BINCL (if only slightly), and reduces the amount of work for the
2079 maybe_suppress_debug_info (tree t
)
2081 if (write_symbols
== NO_DEBUG
)
2084 /* We might have set this earlier in cp_finish_decl. */
2085 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t
)) = 0;
2087 /* Always emit the information for each class every time. */
2088 if (flag_emit_class_debug_always
)
2091 /* If we already know how we're handling this class, handle debug info
2093 if (CLASSTYPE_INTERFACE_KNOWN (t
))
2095 if (CLASSTYPE_INTERFACE_ONLY (t
))
2096 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t
)) = 1;
2097 /* else don't set it. */
2099 /* If the class has a vtable, write out the debug info along with
2101 else if (TYPE_CONTAINS_VPTR_P (t
))
2102 TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (t
)) = 1;
2104 /* Otherwise, just emit the debug info normally. */
2107 /* Note that we want debugging information for a base class of a class
2108 whose vtable is being emitted. Normally, this would happen because
2109 calling the constructor for a derived class implies calling the
2110 constructors for all bases, which involve initializing the
2111 appropriate vptr with the vtable for the base class; but in the
2112 presence of optimization, this initialization may be optimized
2113 away, so we tell finish_vtable_vardecl that we want the debugging
2114 information anyway. */
2117 dfs_debug_mark (tree binfo
, void *data ATTRIBUTE_UNUSED
)
2119 tree t
= BINFO_TYPE (binfo
);
2121 if (CLASSTYPE_DEBUG_REQUESTED (t
))
2122 return dfs_skip_bases
;
2124 CLASSTYPE_DEBUG_REQUESTED (t
) = 1;
2129 /* Write out the debugging information for TYPE, whose vtable is being
2130 emitted. Also walk through our bases and note that we want to
2131 write out information for them. This avoids the problem of not
2132 writing any debug info for intermediate basetypes whose
2133 constructors, and thus the references to their vtables, and thus
2134 the vtables themselves, were optimized away. */
2137 note_debug_info_needed (tree type
)
2139 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type
)))
2141 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (type
)) = 0;
2142 rest_of_type_compilation (type
, toplevel_bindings_p ());
2145 dfs_walk_all (TYPE_BINFO (type
), dfs_debug_mark
, NULL
, 0);
2149 print_search_statistics (void)
2151 #ifdef GATHER_STATISTICS
2152 fprintf (stderr
, "%d fields searched in %d[%d] calls to lookup_field[_1]\n",
2153 n_fields_searched
, n_calls_lookup_field
, n_calls_lookup_field_1
);
2154 fprintf (stderr
, "%d fnfields searched in %d calls to lookup_fnfields\n",
2155 n_outer_fields_searched
, n_calls_lookup_fnfields
);
2156 fprintf (stderr
, "%d calls to get_base_type\n", n_calls_get_base_type
);
2157 #else /* GATHER_STATISTICS */
2158 fprintf (stderr
, "no search statistics\n");
2159 #endif /* GATHER_STATISTICS */
2163 reinit_search_statistics (void)
2165 #ifdef GATHER_STATISTICS
2166 n_fields_searched
= 0;
2167 n_calls_lookup_field
= 0, n_calls_lookup_field_1
= 0;
2168 n_calls_lookup_fnfields
= 0, n_calls_lookup_fnfields_1
= 0;
2169 n_calls_get_base_type
= 0;
2170 n_outer_fields_searched
= 0;
2171 n_contexts_saved
= 0;
2172 #endif /* GATHER_STATISTICS */
2175 /* Helper for lookup_conversions_r. TO_TYPE is the type converted to
2176 by a conversion op in base BINFO. VIRTUAL_DEPTH is nonzero if
2177 BINFO is morally virtual, and VIRTUALNESS is nonzero if virtual
2178 bases have been encountered already in the tree walk. PARENT_CONVS
2179 is the list of lists of conversion functions that could hide CONV
2180 and OTHER_CONVS is the list of lists of conversion functions that
2181 could hide or be hidden by CONV, should virtualness be involved in
2182 the hierarchy. Merely checking the conversion op's name is not
2183 enough because two conversion operators to the same type can have
2184 different names. Return nonzero if we are visible. */
2187 check_hidden_convs (tree binfo
, int virtual_depth
, int virtualness
,
2188 tree to_type
, tree parent_convs
, tree other_convs
)
2192 /* See if we are hidden by a parent conversion. */
2193 for (level
= parent_convs
; level
; level
= TREE_CHAIN (level
))
2194 for (probe
= TREE_VALUE (level
); probe
; probe
= TREE_CHAIN (probe
))
2195 if (same_type_p (to_type
, TREE_TYPE (probe
)))
2198 if (virtual_depth
|| virtualness
)
2200 /* In a virtual hierarchy, we could be hidden, or could hide a
2201 conversion function on the other_convs list. */
2202 for (level
= other_convs
; level
; level
= TREE_CHAIN (level
))
2208 if (!(virtual_depth
|| TREE_STATIC (level
)))
2209 /* Neither is morally virtual, so cannot hide each other. */
2212 if (!TREE_VALUE (level
))
2213 /* They evaporated away already. */
2216 they_hide_us
= (virtual_depth
2217 && original_binfo (binfo
, TREE_PURPOSE (level
)));
2218 we_hide_them
= (!they_hide_us
&& TREE_STATIC (level
)
2219 && original_binfo (TREE_PURPOSE (level
), binfo
));
2221 if (!(we_hide_them
|| they_hide_us
))
2222 /* Neither is within the other, so no hiding can occur. */
2225 for (prev
= &TREE_VALUE (level
), other
= *prev
; other
;)
2227 if (same_type_p (to_type
, TREE_TYPE (other
)))
2230 /* We are hidden. */
2235 /* We hide the other one. */
2236 other
= TREE_CHAIN (other
);
2241 prev
= &TREE_CHAIN (other
);
2249 /* Helper for lookup_conversions_r. PARENT_CONVS is a list of lists
2250 of conversion functions, the first slot will be for the current
2251 binfo, if MY_CONVS is non-NULL. CHILD_CONVS is the list of lists
2252 of conversion functions from children of the current binfo,
2253 concatenated with conversions from elsewhere in the hierarchy --
2254 that list begins with OTHER_CONVS. Return a single list of lists
2255 containing only conversions from the current binfo and its
2259 split_conversions (tree my_convs
, tree parent_convs
,
2260 tree child_convs
, tree other_convs
)
2265 /* Remove the original other_convs portion from child_convs. */
2266 for (prev
= NULL
, t
= child_convs
;
2267 t
!= other_convs
; prev
= t
, t
= TREE_CHAIN (t
))
2271 TREE_CHAIN (prev
) = NULL_TREE
;
2273 child_convs
= NULL_TREE
;
2275 /* Attach the child convs to any we had at this level. */
2278 my_convs
= parent_convs
;
2279 TREE_CHAIN (my_convs
) = child_convs
;
2282 my_convs
= child_convs
;
2287 /* Worker for lookup_conversions. Lookup conversion functions in
2288 BINFO and its children. VIRTUAL_DEPTH is nonzero, if BINFO is in
2289 a morally virtual base, and VIRTUALNESS is nonzero, if we've
2290 encountered virtual bases already in the tree walk. PARENT_CONVS &
2291 PARENT_TPL_CONVS are lists of list of conversions within parent
2292 binfos. OTHER_CONVS and OTHER_TPL_CONVS are conversions found
2293 elsewhere in the tree. Return the conversions found within this
2294 portion of the graph in CONVS and TPL_CONVS. Return nonzero is we
2295 encountered virtualness. We keep template and non-template
2296 conversions separate, to avoid unnecessary type comparisons.
2298 The located conversion functions are held in lists of lists. The
2299 TREE_VALUE of the outer list is the list of conversion functions
2300 found in a particular binfo. The TREE_PURPOSE of both the outer
2301 and inner lists is the binfo at which those conversions were
2302 found. TREE_STATIC is set for those lists within of morally
2303 virtual binfos. The TREE_VALUE of the inner list is the conversion
2304 function or overload itself. The TREE_TYPE of each inner list node
2305 is the converted-to type. */
2308 lookup_conversions_r (tree binfo
,
2309 int virtual_depth
, int virtualness
,
2310 tree parent_convs
, tree parent_tpl_convs
,
2311 tree other_convs
, tree other_tpl_convs
,
2312 tree
*convs
, tree
*tpl_convs
)
2314 int my_virtualness
= 0;
2315 tree my_convs
= NULL_TREE
;
2316 tree my_tpl_convs
= NULL_TREE
;
2317 tree child_convs
= NULL_TREE
;
2318 tree child_tpl_convs
= NULL_TREE
;
2321 VEC(tree
,gc
) *method_vec
= CLASSTYPE_METHOD_VEC (BINFO_TYPE (binfo
));
2324 /* If we have no conversion operators, then don't look. */
2325 if (!TYPE_HAS_CONVERSION (BINFO_TYPE (binfo
)))
2327 *convs
= *tpl_convs
= NULL_TREE
;
2332 if (BINFO_VIRTUAL_P (binfo
))
2335 /* First, locate the unhidden ones at this level. */
2336 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2337 VEC_iterate (tree
, method_vec
, i
, conv
);
2340 tree cur
= OVL_CURRENT (conv
);
2342 if (!DECL_CONV_FN_P (cur
))
2345 if (TREE_CODE (cur
) == TEMPLATE_DECL
)
2347 /* Only template conversions can be overloaded, and we must
2348 flatten them out and check each one individually. */
2351 for (tpls
= conv
; tpls
; tpls
= OVL_NEXT (tpls
))
2353 tree tpl
= OVL_CURRENT (tpls
);
2354 tree type
= DECL_CONV_FN_TYPE (tpl
);
2356 if (check_hidden_convs (binfo
, virtual_depth
, virtualness
,
2357 type
, parent_tpl_convs
, other_tpl_convs
))
2359 my_tpl_convs
= tree_cons (binfo
, tpl
, my_tpl_convs
);
2360 TREE_TYPE (my_tpl_convs
) = type
;
2363 TREE_STATIC (my_tpl_convs
) = 1;
2371 tree name
= DECL_NAME (cur
);
2373 if (!IDENTIFIER_MARKED (name
))
2375 tree type
= DECL_CONV_FN_TYPE (cur
);
2377 if (check_hidden_convs (binfo
, virtual_depth
, virtualness
,
2378 type
, parent_convs
, other_convs
))
2380 my_convs
= tree_cons (binfo
, conv
, my_convs
);
2381 TREE_TYPE (my_convs
) = type
;
2384 TREE_STATIC (my_convs
) = 1;
2387 IDENTIFIER_MARKED (name
) = 1;
2395 parent_convs
= tree_cons (binfo
, my_convs
, parent_convs
);
2397 TREE_STATIC (parent_convs
) = 1;
2402 parent_tpl_convs
= tree_cons (binfo
, my_tpl_convs
, parent_tpl_convs
);
2404 TREE_STATIC (parent_tpl_convs
) = 1;
2407 child_convs
= other_convs
;
2408 child_tpl_convs
= other_tpl_convs
;
2410 /* Now iterate over each base, looking for more conversions. */
2411 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
2413 tree base_convs
, base_tpl_convs
;
2414 unsigned base_virtualness
;
2416 base_virtualness
= lookup_conversions_r (base_binfo
,
2417 virtual_depth
, virtualness
,
2418 parent_convs
, parent_tpl_convs
,
2419 child_convs
, child_tpl_convs
,
2420 &base_convs
, &base_tpl_convs
);
2421 if (base_virtualness
)
2422 my_virtualness
= virtualness
= 1;
2423 child_convs
= chainon (base_convs
, child_convs
);
2424 child_tpl_convs
= chainon (base_tpl_convs
, child_tpl_convs
);
2427 /* Unmark the conversions found at this level */
2428 for (conv
= my_convs
; conv
; conv
= TREE_CHAIN (conv
))
2429 IDENTIFIER_MARKED (DECL_NAME (OVL_CURRENT (TREE_VALUE (conv
)))) = 0;
2431 *convs
= split_conversions (my_convs
, parent_convs
,
2432 child_convs
, other_convs
);
2433 *tpl_convs
= split_conversions (my_tpl_convs
, parent_tpl_convs
,
2434 child_tpl_convs
, other_tpl_convs
);
2436 return my_virtualness
;
2439 /* Return a TREE_LIST containing all the non-hidden user-defined
2440 conversion functions for TYPE (and its base-classes). The
2441 TREE_VALUE of each node is the FUNCTION_DECL of the conversion
2442 function. The TREE_PURPOSE is the BINFO from which the conversion
2443 functions in this node were selected. This function is effectively
2444 performing a set of member lookups as lookup_fnfield does, but
2445 using the type being converted to as the unique key, rather than the
2449 lookup_conversions (tree type
)
2451 tree convs
, tpl_convs
;
2452 tree list
= NULL_TREE
;
2454 complete_type (type
);
2455 if (!TYPE_BINFO (type
))
2458 lookup_conversions_r (TYPE_BINFO (type
), 0, 0,
2459 NULL_TREE
, NULL_TREE
, NULL_TREE
, NULL_TREE
,
2460 &convs
, &tpl_convs
);
2462 /* Flatten the list-of-lists */
2463 for (; convs
; convs
= TREE_CHAIN (convs
))
2467 for (probe
= TREE_VALUE (convs
); probe
; probe
= next
)
2469 next
= TREE_CHAIN (probe
);
2471 TREE_CHAIN (probe
) = list
;
2476 for (; tpl_convs
; tpl_convs
= TREE_CHAIN (tpl_convs
))
2480 for (probe
= TREE_VALUE (tpl_convs
); probe
; probe
= next
)
2482 next
= TREE_CHAIN (probe
);
2484 TREE_CHAIN (probe
) = list
;
2492 /* Returns the binfo of the first direct or indirect virtual base derived
2493 from BINFO, or NULL if binfo is not via virtual. */
2496 binfo_from_vbase (tree binfo
)
2498 for (; binfo
; binfo
= BINFO_INHERITANCE_CHAIN (binfo
))
2500 if (BINFO_VIRTUAL_P (binfo
))
2506 /* Returns the binfo of the first direct or indirect virtual base derived
2507 from BINFO up to the TREE_TYPE, LIMIT, or NULL if binfo is not
2511 binfo_via_virtual (tree binfo
, tree limit
)
2513 if (limit
&& !CLASSTYPE_VBASECLASSES (limit
))
2514 /* LIMIT has no virtual bases, so BINFO cannot be via one. */
2517 for (; binfo
&& !SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), limit
);
2518 binfo
= BINFO_INHERITANCE_CHAIN (binfo
))
2520 if (BINFO_VIRTUAL_P (binfo
))
2526 /* BINFO is a base binfo in the complete type BINFO_TYPE (HERE).
2527 Find the equivalent binfo within whatever graph HERE is located.
2528 This is the inverse of original_binfo. */
2531 copied_binfo (tree binfo
, tree here
)
2533 tree result
= NULL_TREE
;
2535 if (BINFO_VIRTUAL_P (binfo
))
2539 for (t
= here
; BINFO_INHERITANCE_CHAIN (t
);
2540 t
= BINFO_INHERITANCE_CHAIN (t
))
2543 result
= binfo_for_vbase (BINFO_TYPE (binfo
), BINFO_TYPE (t
));
2545 else if (BINFO_INHERITANCE_CHAIN (binfo
))
2551 cbinfo
= copied_binfo (BINFO_INHERITANCE_CHAIN (binfo
), here
);
2552 for (ix
= 0; BINFO_BASE_ITERATE (cbinfo
, ix
, base_binfo
); ix
++)
2553 if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
), BINFO_TYPE (binfo
)))
2555 result
= base_binfo
;
2561 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (here
), BINFO_TYPE (binfo
)));
2565 gcc_assert (result
);
2570 binfo_for_vbase (tree base
, tree t
)
2574 VEC(tree
,gc
) *vbases
;
2576 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
2577 VEC_iterate (tree
, vbases
, ix
, binfo
); ix
++)
2578 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), base
))
2583 /* BINFO is some base binfo of HERE, within some other
2584 hierarchy. Return the equivalent binfo, but in the hierarchy
2585 dominated by HERE. This is the inverse of copied_binfo. If BINFO
2586 is not a base binfo of HERE, returns NULL_TREE. */
2589 original_binfo (tree binfo
, tree here
)
2593 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (here
)))
2595 else if (BINFO_VIRTUAL_P (binfo
))
2596 result
= (CLASSTYPE_VBASECLASSES (BINFO_TYPE (here
))
2597 ? binfo_for_vbase (BINFO_TYPE (binfo
), BINFO_TYPE (here
))
2599 else if (BINFO_INHERITANCE_CHAIN (binfo
))
2603 base_binfos
= original_binfo (BINFO_INHERITANCE_CHAIN (binfo
), here
);
2609 for (ix
= 0; (base_binfo
= BINFO_BASE_BINFO (base_binfos
, ix
)); ix
++)
2610 if (SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
2611 BINFO_TYPE (binfo
)))
2613 result
= base_binfo
;