Struct EffectiveVisibilitiesVisitor 

pub(crate) struct EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx> {
    r: &'a mut Resolver<'ra, 'tcx>,
    def_effective_visibilities: EffectiveVisibilities,
    import_effective_visibilities: EffectiveVisibilities<Interned<'ra, DeclData<'ra>>>,
    current_private_vis: Visibility,
    macro_reachable: FxHashSet<(LocalDefId, LocalDefId)>,
    changed: bool,
}

Fields

r: &'a mut Resolver<'ra, 'tcx>

def_effective_visibilities: EffectiveVisibilities

import_effective_visibilities: EffectiveVisibilities<Interned<'ra, DeclData<'ra>>>

While walking import chains we need to track effective visibilities per-decl, and def id keys in Resolver::effective_visibilities are not enough for that, because multiple declarations can correspond to a single def id in imports. So we keep a separate table.

current_private_vis: Visibility

macro_reachable: FxHashSet<(LocalDefId, LocalDefId)>

A set of pairs corresponding to modules, where the first module is reachable via a macro that’s defined in the second module. This cannot be represented as reachable because it can’t handle the following case:

pub mod n { // Should be Public pub(crate) mod p { // Should not be accessible pub fn f() -> i32 { 12 } // Must be Reachable } } pub macro m() { n::p::f() }

changed: bool

Implementations

impl<'a, 'ra, 'tcx> EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>

pub(crate) fn compute_effective_visibilities<'c>( r: &'a mut Resolver<'ra, 'tcx>, krate: &'c Crate, ) -> FxHashSet<Interned<'ra, DeclData<'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.

fn set_bindings_effective_visibilities(&mut self, module_id: LocalDefId)

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

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

fn may_update( &self, nominal_vis: Visibility, parent_id: ParentId<'_>, priv_vis: Visibility, ) -> bool

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) <= priv_vis, and the update logic is guaranteed to not update anything and we can skip it.

fn update_import( &mut self, decl: Interned<'ra, DeclData<'ra>>, parent_id: ParentId<'ra>, priv_vis: Visibility, )

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

fn update_field(&mut self, def_id: LocalDefId, parent_id: LocalDefId)

fn update_macro( &mut self, def_id: LocalDefId, inherited_effective_vis: EffectiveVisibility, )

fn update_reachability_from_macro( &mut self, local_def_id: LocalDefId, md: &MacroDef, attrs: &[Attribute], )

fn update_macro_reachable( &mut self, module_def_id: LocalDefId, defining_mod: LocalDefId, macro_ev: EffectiveVisibility, ) -> bool

Updates the item as being reachable through a macro defined in the given module. Returns true if the level has changed.

fn update_macro_reachable_def( &mut self, def_id: LocalDefId, def_kind: DefKind, vis: Visibility, module: LocalDefId, macro_ev: EffectiveVisibility, )

Trait Implementations

impl<'a, 'ra, 'tcx> Visitor<'a> for EffectiveVisibilitiesVisitor<'a, 'ra, 'tcx>

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

type Result = ()

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

fn visit_ident(&mut self, _: &'a Ident) -> Self::Result

fn visit_anon_const(&mut self, node: &'a AnonConst) -> Self::Result

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

fn visit_assoc_item_constraint( &mut self, node: &'a AssocItemConstraint, ) -> Self::Result

fn visit_attribute(&mut self, node: &'a Attribute) -> Self::Result

fn visit_block(&mut self, node: &'a Block) -> Self::Result

fn visit_capture_by(&mut self, node: &'a CaptureBy) -> Self::Result

fn visit_closure_binder(&mut self, node: &'a ClosureBinder) -> Self::Result

fn visit_contract(&mut self, node: &'a FnContract) -> Self::Result

fn visit_coroutine_kind(&mut self, node: &'a CoroutineKind) -> Self::Result

fn visit_crate(&mut self, node: &'a Crate) -> Self::Result

fn visit_expr(&mut self, node: &'a Expr) -> Self::Result

fn visit_expr_field(&mut self, node: &'a ExprField) -> Self::Result

fn visit_field_def(&mut self, node: &'a FieldDef) -> Self::Result

fn visit_fn_decl(&mut self, node: &'a FnDecl) -> Self::Result

fn visit_fn_header(&mut self, node: &'a FnHeader) -> Self::Result

fn visit_fn_ret_ty(&mut self, node: &'a FnRetTy) -> Self::Result

fn visit_foreign_mod(&mut self, node: &'a ForeignMod) -> Self::Result

fn visit_format_args(&mut self, node: &'a FormatArgs) -> Self::Result

fn visit_generic_arg(&mut self, node: &'a GenericArg) -> Self::Result

fn visit_generic_args(&mut self, node: &'a GenericArgs) -> Self::Result

fn visit_generic_param(&mut self, node: &'a GenericParam) -> Self::Result

fn visit_generics(&mut self, node: &'a Generics) -> Self::Result

fn visit_inline_asm(&mut self, node: &'a InlineAsm) -> Self::Result

fn visit_inline_asm_sym(&mut self, node: &'a InlineAsmSym) -> Self::Result

fn visit_label(&mut self, node: &'a Label) -> Self::Result

fn visit_lifetime( &mut self, node: &'a Lifetime, _ctxt: LifetimeCtxt, ) -> Self::Result

fn visit_local(&mut self, node: &'a Local) -> Self::Result

fn visit_mac_call(&mut self, node: &'a MacCall) -> Self::Result

fn visit_macro_def(&mut self, node: &'a MacroDef) -> Self::Result

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

fn visit_param(&mut self, node: &'a Param) -> Self::Result

fn visit_pat_field(&mut self, node: &'a PatField) -> Self::Result

fn visit_path(&mut self, node: &'a Path) -> Self::Result

fn visit_path_segment(&mut self, node: &'a PathSegment) -> Self::Result

fn visit_pat(&mut self, node: &'a Pat) -> Self::Result

fn visit_poly_trait_ref(&mut self, node: &'a PolyTraitRef) -> Self::Result

fn visit_precise_capturing_arg( &mut self, node: &'a PreciseCapturingArg, ) -> Self::Result

fn visit_qself(&mut self, node: &'a QSelf) -> Self::Result

fn visit_impl_restriction(&mut self, node: &'a ImplRestriction) -> Self::Result

fn visit_trait_ref(&mut self, node: &'a TraitRef) -> Self::Result

fn visit_ty_pat(&mut self, node: &'a TyPat) -> Self::Result

fn visit_ty(&mut self, node: &'a Ty) -> Self::Result

fn visit_use_tree(&mut self, node: &'a UseTree) -> Self::Result

fn visit_variant_data(&mut self, node: &'a VariantData) -> Self::Result

fn visit_variant(&mut self, node: &'a Variant) -> Self::Result

fn visit_vis(&mut self, node: &'a Visibility) -> Self::Result

fn visit_where_predicate_kind( &mut self, node: &'a WherePredicateKind, ) -> Self::Result

fn visit_where_predicate(&mut self, node: &'a WherePredicate) -> Self::Result

fn visit_id(&mut self, _id: NodeId) -> Self::Result

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

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

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

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

fn visit_fn( &mut self, fk: FnKind<'a>, _: &ThinVec<Attribute>, _: Span, _: NodeId, ) -> 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

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: 160 bytes