pub(crate) struct EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx> {
r: &'a mut Resolver<'ra, 'tcx>,
def_effective_visibilities: EffectiveVisibilities,
import_effective_visibilities: EffectiveVisibilities<Interned<'ra, NameBindingData<'ra>>>,
current_private_vis: Visibility,
changed: bool,
}
Fields§
§r: &'a mut Resolver<'ra, 'tcx>
§def_effective_visibilities: EffectiveVisibilities
§import_effective_visibilities: EffectiveVisibilities<Interned<'ra, NameBindingData<'ra>>>
While walking import chains we need to track effective visibilities per-binding, and def id
keys in Resolver::effective_visibilities
are not enough for that, because multiple
bindings can correspond to a single def id in imports. So we keep a separate table.
current_private_vis: Visibility
§changed: bool
Implementations§
Source§impl<'a, 'ra, 'tcx> EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
Sourcepub(crate) fn compute_effective_visibilities<'c>(
r: &'a mut Resolver<'ra, 'tcx>,
krate: &'c Crate,
) -> FxHashSet<Interned<'ra, NameBindingData<'ra>>>
pub(crate) fn compute_effective_visibilities<'c>( r: &'a mut Resolver<'ra, 'tcx>, krate: &'c Crate, ) -> FxHashSet<Interned<'ra, NameBindingData<'ra>>>
Fills the Resolver::effective_visibilities
table with public & exported items
For now, this doesn’t resolve macros (FIXME) and cannot resolve Impl, as we
need access to a TyCtxt for that. Returns the set of ambiguous re-exports.
Sourcefn set_bindings_effective_visibilities(&mut self, module_id: LocalDefId)
fn set_bindings_effective_visibilities(&mut self, module_id: LocalDefId)
Update effective visibilities of bindings in the given module, including their whole reexport chains.
fn effective_vis_or_private( &mut self, parent_id: ParentId<'ra>, ) -> EffectiveVisibility
Sourcefn may_update(
&self,
nominal_vis: Visibility,
parent_id: ParentId<'_>,
) -> Option<Option<Visibility>>
fn may_update( &self, nominal_vis: Visibility, parent_id: ParentId<'_>, ) -> Option<Option<Visibility>>
All effective visibilities for a node are larger or equal than private visibility
for that node (see check_invariants
in middle/privacy.rs).
So if either parent or nominal visibility is the same as private visibility, then
min(parent_vis, nominal_vis) <= private_vis
, and the update logic is guaranteed
to not update anything and we can skip it.
We are checking this condition only if the correct value of private visibility is cheaply available, otherwise it doesn’t make sense performance-wise.
None
is returned if the update can be skipped,
and cheap private visibility is returned otherwise.
fn update_import( &mut self, binding: Interned<'ra, NameBindingData<'ra>>, parent_id: ParentId<'ra>, )
fn update_def( &mut self, def_id: LocalDefId, nominal_vis: Visibility, parent_id: ParentId<'ra>, )
fn update_field(&mut self, def_id: LocalDefId, parent_id: LocalDefId)
Trait Implementations§
Source§impl<'a, 'ra, 'tcx> Visitor<'a> for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> Visitor<'a> for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
fn visit_item(&mut self, item: &'a Item)
fn visit_ident(&mut self, _: &'a Ident) -> Self::Result
fn visit_foreign_mod(&mut self, nm: &'a ForeignMod) -> Self::Result
fn visit_foreign_item(&mut self, i: &'a Item<ForeignItemKind>) -> Self::Result
fn visit_local(&mut self, l: &'a Local) -> Self::Result
fn visit_block(&mut self, b: &'a Block) -> Self::Result
fn visit_param(&mut self, param: &'a Param) -> Self::Result
fn visit_arm(&mut self, a: &'a Arm) -> Self::Result
fn visit_pat(&mut self, p: &'a Pat) -> Self::Result
fn visit_anon_const(&mut self, c: &'a AnonConst) -> Self::Result
fn visit_expr(&mut self, ex: &'a Expr) -> Self::Result
Source§fn visit_method_receiver_expr(&mut self, ex: &'a Expr) -> Self::Result
fn visit_method_receiver_expr(&mut self, ex: &'a Expr) -> Self::Result
stmt_expr_attributes
.
It can be removed once that feature is stabilized.fn visit_ty(&mut self, t: &'a Ty) -> Self::Result
fn visit_ty_pat(&mut self, t: &'a TyPat) -> Self::Result
fn visit_generic_param(&mut self, param: &'a GenericParam) -> Self::Result
fn visit_generics(&mut self, g: &'a Generics) -> Self::Result
fn visit_closure_binder(&mut self, b: &'a ClosureBinder) -> Self::Result
fn visit_contract(&mut self, c: &'a FnContract) -> Self::Result
fn visit_where_predicate(&mut self, p: &'a WherePredicate) -> Self::Result
fn visit_where_predicate_kind( &mut self, k: &'a WherePredicateKind, ) -> Self::Result
fn visit_fn(&mut self, fk: FnKind<'a>, _: Span, _: NodeId) -> Self::Result
fn visit_assoc_item( &mut self, i: &'a Item<AssocItemKind>, ctxt: AssocCtxt, ) -> Self::Result
fn visit_trait_ref(&mut self, t: &'a TraitRef) -> Self::Result
fn visit_param_bound( &mut self, bounds: &'a GenericBound, _ctxt: BoundKind, ) -> Self::Result
fn visit_precise_capturing_arg( &mut self, arg: &'a PreciseCapturingArg, ) -> Self::Result
fn visit_poly_trait_ref(&mut self, t: &'a PolyTraitRef) -> Self::Result
fn visit_variant_data(&mut self, s: &'a VariantData) -> Self::Result
fn visit_field_def(&mut self, s: &'a FieldDef) -> Self::Result
fn visit_variant(&mut self, v: &'a Variant) -> Self::Result
fn visit_label(&mut self, label: &'a Label) -> Self::Result
fn visit_lifetime( &mut self, lifetime: &'a Lifetime, _: LifetimeCtxt, ) -> Self::Result
fn visit_mac_call(&mut self, mac: &'a MacCall) -> Self::Result
fn visit_id(&mut self, _id: NodeId) -> Self::Result
fn visit_macro_def(&mut self, macro_def: &'a MacroDef) -> Self::Result
fn visit_path(&mut self, path: &'a Path) -> Self::Result
fn visit_use_tree(&mut self, use_tree: &'a UseTree) -> Self::Result
fn visit_path_segment(&mut self, path_segment: &'a PathSegment) -> Self::Result
fn visit_generic_args(&mut self, generic_args: &'a GenericArgs) -> Self::Result
fn visit_generic_arg(&mut self, generic_arg: &'a GenericArg) -> Self::Result
fn visit_assoc_item_constraint( &mut self, constraint: &'a AssocItemConstraint, ) -> Self::Result
fn visit_attribute(&mut self, attr: &'a Attribute) -> Self::Result
fn visit_vis(&mut self, vis: &'a Visibility) -> Self::Result
fn visit_fn_ret_ty(&mut self, ret_ty: &'a FnRetTy) -> Self::Result
fn visit_fn_header(&mut self, header: &'a FnHeader) -> Self::Result
fn visit_expr_field(&mut self, f: &'a ExprField) -> Self::Result
fn visit_pat_field(&mut self, fp: &'a PatField) -> Self::Result
fn visit_crate(&mut self, krate: &'a Crate) -> Self::Result
fn visit_inline_asm(&mut self, asm: &'a InlineAsm) -> Self::Result
fn visit_format_args(&mut self, fmt: &'a FormatArgs) -> Self::Result
fn visit_inline_asm_sym(&mut self, sym: &'a InlineAsmSym) -> Self::Result
fn visit_capture_by(&mut self, capture_by: &'a CaptureBy) -> Self::Result
fn visit_coroutine_kind( &mut self, coroutine_kind: &'a CoroutineKind, ) -> Self::Result
fn visit_fn_decl(&mut self, fn_decl: &'a FnDecl) -> Self::Result
fn visit_qself(&mut self, qs: &'a Option<Box<QSelf>>) -> Self::Result
fn visit_stmt(&mut self, s: &'a Stmt) -> Self::Result
fn visit_nested_use_tree( &mut self, use_tree: &'a UseTree, id: NodeId, ) -> Self::Result
Auto Trait Implementations§
impl<'a, 'ra, 'tcx> !DynSend for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> !DynSync for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> Freeze for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> !RefUnwindSafe for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> !Send for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> !Sync for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> Unpin for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
impl<'a, 'ra, 'tcx> !UnwindSafe for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
Source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> ErasedDestructor for Twhere
T: 'static,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 128 bytes