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>

source

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.

source

fn set_bindings_effective_visibilities(&mut self, module_id: LocalDefId)

Update effective visibilities of bindings in the given module, including their whole reexport chains.

source

fn effective_vis_or_private( &mut self, parent_id: ParentId<'a>, ) -> EffectiveVisibility

source

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.

source

fn update_import( &mut self, binding: Interned<'a, NameBindingData<'a>>, parent_id: ParentId<'a>, )

source

fn update_def( &mut self, def_id: LocalDefId, nominal_vis: Visibility, parent_id: ParentId<'a>, )

source

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>

source§

fn visit_item(&mut self, item: &'ast Item)

§

type Result = ()

The result type of the visit_* methods. Can be either (), or ControlFlow<T>.
source§

fn visit_ident(&mut self, _ident: Ident) -> Self::Result

source§

fn visit_foreign_item(&mut self, i: &'ast Item<ForeignItemKind>) -> Self::Result

source§

fn visit_local(&mut self, l: &'ast Local) -> Self::Result

source§

fn visit_block(&mut self, b: &'ast Block) -> Self::Result

source§

fn visit_stmt(&mut self, s: &'ast Stmt) -> Self::Result

source§

fn visit_param(&mut self, param: &'ast Param) -> Self::Result

source§

fn visit_arm(&mut self, a: &'ast Arm) -> Self::Result

source§

fn visit_pat(&mut self, p: &'ast Pat) -> Self::Result

source§

fn visit_anon_const(&mut self, c: &'ast AnonConst) -> Self::Result

source§

fn visit_expr(&mut self, ex: &'ast Expr) -> Self::Result

source§

fn visit_method_receiver_expr(&mut self, ex: &'ast Expr) -> Self::Result

This method is a hack to workaround unstable of stmt_expr_attributes. It can be removed once that feature is stabilized.
source§

fn visit_expr_post(&mut self, _ex: &'ast Expr) -> Self::Result

source§

fn visit_ty(&mut self, t: &'ast Ty) -> Self::Result

source§

fn visit_generic_param(&mut self, param: &'ast GenericParam) -> Self::Result

source§

fn visit_generics(&mut self, g: &'ast Generics) -> Self::Result

source§

fn visit_closure_binder(&mut self, b: &'ast ClosureBinder) -> Self::Result

source§

fn visit_where_predicate(&mut self, p: &'ast WherePredicate) -> Self::Result

source§

fn visit_fn(&mut self, fk: FnKind<'ast>, _: Span, _: NodeId) -> Self::Result

source§

fn visit_assoc_item( &mut self, i: &'ast Item<AssocItemKind>, ctxt: AssocCtxt, ) -> Self::Result

source§

fn visit_trait_ref(&mut self, t: &'ast TraitRef) -> Self::Result

source§

fn visit_param_bound( &mut self, bounds: &'ast GenericBound, _ctxt: BoundKind, ) -> Self::Result

source§

fn visit_precise_capturing_arg(&mut self, arg: &'ast PreciseCapturingArg)

source§

fn visit_poly_trait_ref(&mut self, t: &'ast PolyTraitRef) -> Self::Result

source§

fn visit_variant_data(&mut self, s: &'ast VariantData) -> Self::Result

source§

fn visit_field_def(&mut self, s: &'ast FieldDef) -> Self::Result

source§

fn visit_enum_def(&mut self, enum_definition: &'ast EnumDef) -> Self::Result

source§

fn visit_variant(&mut self, v: &'ast Variant) -> Self::Result

source§

fn visit_variant_discr(&mut self, discr: &'ast AnonConst) -> Self::Result

source§

fn visit_label(&mut self, label: &'ast Label) -> Self::Result

source§

fn visit_lifetime( &mut self, lifetime: &'ast Lifetime, _: LifetimeCtxt, ) -> Self::Result

source§

fn visit_mac_call(&mut self, mac: &'ast MacCall) -> Self::Result

source§

fn visit_mac_def(&mut self, _mac: &'ast MacroDef, _id: NodeId) -> Self::Result

source§

fn visit_path(&mut self, path: &'ast Path, _id: NodeId) -> Self::Result

source§

fn visit_use_tree( &mut self, use_tree: &'ast UseTree, id: NodeId, _nested: bool, ) -> Self::Result

source§

fn visit_path_segment( &mut self, path_segment: &'ast PathSegment, ) -> Self::Result

source§

fn visit_generic_args( &mut self, generic_args: &'ast GenericArgs, ) -> Self::Result

source§

fn visit_generic_arg(&mut self, generic_arg: &'ast GenericArg) -> Self::Result

source§

fn visit_assoc_item_constraint( &mut self, constraint: &'ast AssocItemConstraint, ) -> Self::Result

source§

fn visit_attribute(&mut self, attr: &'ast Attribute) -> Self::Result

source§

fn visit_vis(&mut self, vis: &'ast Visibility) -> Self::Result

source§

fn visit_fn_ret_ty(&mut self, ret_ty: &'ast FnRetTy) -> Self::Result

source§

fn visit_fn_header(&mut self, _header: &'ast FnHeader) -> Self::Result

source§

fn visit_expr_field(&mut self, f: &'ast ExprField) -> Self::Result

source§

fn visit_pat_field(&mut self, fp: &'ast PatField) -> Self::Result

source§

fn visit_crate(&mut self, krate: &'ast Crate) -> Self::Result

source§

fn visit_inline_asm(&mut self, asm: &'ast InlineAsm) -> Self::Result

source§

fn visit_format_args(&mut self, fmt: &'ast FormatArgs) -> Self::Result

source§

fn visit_inline_asm_sym(&mut self, sym: &'ast InlineAsmSym) -> Self::Result

source§

fn visit_capture_by(&mut self, _capture_by: &'ast CaptureBy) -> Self::Result

Auto Trait Implementations§

§

impl<'r, 'a, 'tcx> !DynSend for EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>

§

impl<'r, 'a, 'tcx> !DynSync for EffectiveVisibilitiesVisitor<'r, 'a, 'tcx>

§

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> Aligned for T

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

§

type Output = R

source§

impl<T> Filterable for T

source§

fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts 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 more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts 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 more
source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

§

type Error = !

source§

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

source§

impl<T> Pointable for T

source§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

source§

fn upcast(self, interner: I) -> U

source§

impl<I, T> UpcastFrom<I, T> for T

source§

fn upcast_from(from: T, _tcx: I) -> T

source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V

source§

impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

impl<T> ErasedDestructor for T
where 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