pub(crate) struct EffectiveVisibilitiesVisitor<'r, 'a, 'tcx> {
r: &'r mut Resolver<'a, 'tcx>,
def_effective_visibilities: EffectiveVisibilities,
import_effective_visibilities: EffectiveVisibilities<Interned<'a, NameBindingData<'a>>>,
current_private_vis: Visibility,
changed: bool,
}
Fields§
§r: &'r mut Resolver<'a, 'tcx>
§def_effective_visibilities: EffectiveVisibilities
§import_effective_visibilities: EffectiveVisibilities<Interned<'a, NameBindingData<'a>>>
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<'r, 'a, 'tcx> EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>
impl<'r, 'a, 'tcx> EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>
sourcepub(crate) fn compute_effective_visibilities<'c>(
r: &'r mut Resolver<'a, 'tcx>,
krate: &'c Crate,
) -> FxHashSet<Interned<'a, NameBindingData<'a>>>
pub(crate) fn compute_effective_visibilities<'c>( r: &'r mut Resolver<'a, 'tcx>, krate: &'c Crate, ) -> FxHashSet<Interned<'a, NameBindingData<'a>>>
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<'a>, ) -> 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<'a, NameBindingData<'a>>, parent_id: ParentId<'a>, )
fn update_def( &mut self, def_id: LocalDefId, nominal_vis: Visibility, parent_id: ParentId<'a>, )
fn update_field(&mut self, def_id: LocalDefId, parent_id: LocalDefId)
Trait Implementations§
source§impl<'r, 'ast, 'tcx> Visitor<'ast> for EffectiveVisibilitiesVisitor<'ast, 'r, 'tcx>
impl<'r, 'ast, 'tcx> Visitor<'ast> for EffectiveVisibilitiesVisitor<'ast, 'r, 'tcx>
fn visit_item(&mut self, item: &'ast Item)
fn visit_ident(&mut self, _ident: Ident) -> Self::Result
fn visit_foreign_item(&mut self, i: &'ast Item<ForeignItemKind>) -> Self::Result
fn visit_local(&mut self, l: &'ast Local) -> Self::Result
fn visit_block(&mut self, b: &'ast Block) -> Self::Result
fn visit_stmt(&mut self, s: &'ast Stmt) -> Self::Result
fn visit_param(&mut self, param: &'ast Param) -> Self::Result
fn visit_arm(&mut self, a: &'ast Arm) -> Self::Result
fn visit_pat(&mut self, p: &'ast Pat) -> Self::Result
fn visit_anon_const(&mut self, c: &'ast AnonConst) -> Self::Result
fn visit_expr(&mut self, ex: &'ast Expr) -> Self::Result
source§fn visit_method_receiver_expr(&mut self, ex: &'ast Expr) -> Self::Result
fn visit_method_receiver_expr(&mut self, ex: &'ast Expr) -> Self::Result
stmt_expr_attributes
.
It can be removed once that feature is stabilized.fn visit_expr_post(&mut self, _ex: &'ast Expr) -> Self::Result
fn visit_ty(&mut self, t: &'ast Ty) -> Self::Result
fn visit_generic_param(&mut self, param: &'ast GenericParam) -> Self::Result
fn visit_generics(&mut self, g: &'ast Generics) -> Self::Result
fn visit_closure_binder(&mut self, b: &'ast ClosureBinder) -> Self::Result
fn visit_where_predicate(&mut self, p: &'ast WherePredicate) -> Self::Result
fn visit_fn(&mut self, fk: FnKind<'ast>, _: Span, _: NodeId) -> Self::Result
fn visit_assoc_item( &mut self, i: &'ast Item<AssocItemKind>, ctxt: AssocCtxt, ) -> Self::Result
fn visit_trait_ref(&mut self, t: &'ast TraitRef) -> Self::Result
fn visit_param_bound( &mut self, bounds: &'ast GenericBound, _ctxt: BoundKind, ) -> Self::Result
fn visit_precise_capturing_arg(&mut self, arg: &'ast PreciseCapturingArg)
fn visit_poly_trait_ref(&mut self, t: &'ast PolyTraitRef) -> Self::Result
fn visit_variant_data(&mut self, s: &'ast VariantData) -> Self::Result
fn visit_field_def(&mut self, s: &'ast FieldDef) -> Self::Result
fn visit_enum_def(&mut self, enum_definition: &'ast EnumDef) -> Self::Result
fn visit_variant(&mut self, v: &'ast Variant) -> Self::Result
fn visit_variant_discr(&mut self, discr: &'ast AnonConst) -> Self::Result
fn visit_label(&mut self, label: &'ast Label) -> Self::Result
fn visit_lifetime( &mut self, lifetime: &'ast Lifetime, _: LifetimeCtxt, ) -> Self::Result
fn visit_mac_call(&mut self, mac: &'ast MacCall) -> Self::Result
fn visit_mac_def(&mut self, _mac: &'ast MacroDef, _id: NodeId) -> Self::Result
fn visit_path(&mut self, path: &'ast Path, _id: NodeId) -> Self::Result
fn visit_use_tree( &mut self, use_tree: &'ast UseTree, id: NodeId, _nested: bool, ) -> Self::Result
fn visit_path_segment( &mut self, path_segment: &'ast PathSegment, ) -> Self::Result
fn visit_generic_args( &mut self, generic_args: &'ast GenericArgs, ) -> Self::Result
fn visit_generic_arg(&mut self, generic_arg: &'ast GenericArg) -> Self::Result
fn visit_assoc_item_constraint( &mut self, constraint: &'ast AssocItemConstraint, ) -> Self::Result
fn visit_attribute(&mut self, attr: &'ast Attribute) -> Self::Result
fn visit_vis(&mut self, vis: &'ast Visibility) -> Self::Result
fn visit_fn_ret_ty(&mut self, ret_ty: &'ast FnRetTy) -> Self::Result
fn visit_fn_header(&mut self, _header: &'ast FnHeader) -> Self::Result
fn visit_expr_field(&mut self, f: &'ast ExprField) -> Self::Result
fn visit_pat_field(&mut self, fp: &'ast PatField) -> Self::Result
fn visit_crate(&mut self, krate: &'ast Crate) -> Self::Result
fn visit_inline_asm(&mut self, asm: &'ast InlineAsm) -> Self::Result
fn visit_format_args(&mut self, fmt: &'ast FormatArgs) -> Self::Result
fn visit_inline_asm_sym(&mut self, sym: &'ast InlineAsmSym) -> Self::Result
fn visit_capture_by(&mut self, _capture_by: &'ast CaptureBy) -> Self::Result
Auto Trait Implementations§
impl<'r, 'a, 'tcx> Freeze for EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>
impl<'r, 'a, 'tcx> !RefUnwindSafe for EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>
impl<'r, 'a, 'tcx> !Send for EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>
impl<'r, 'a, 'tcx> !Sync for EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>
impl<'r, 'a, 'tcx> Unpin for EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>
impl<'r, 'a, 'tcx> !UnwindSafe for EffectiveVisibilitiesVisitor<'r, 'a, '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<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<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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