Struct rustc_resolve::effective_visibilities::EffectiveVisibilitiesVisitor

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

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

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.

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

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

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)

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

fn visit_local(&mut self, l: &'ast Local)

fn visit_block(&mut self, b: &'ast Block)

fn visit_stmt(&mut self, s: &'ast Stmt)

fn visit_param(&mut self, param: &'ast Param)

fn visit_arm(&mut self, a: &'ast Arm)

fn visit_pat(&mut self, p: &'ast Pat)

fn visit_anon_const(&mut self, c: &'ast AnonConst)

fn visit_expr(&mut self, ex: &'ast Expr)

fn visit_method_receiver_expr(&mut self, ex: &'ast Expr)

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

fn visit_expr_post(&mut self, _ex: &'ast Expr)

fn visit_ty(&mut self, t: &'ast Ty)

fn visit_generic_param(&mut self, param: &'ast GenericParam)

fn visit_generics(&mut self, g: &'ast Generics)

fn visit_closure_binder(&mut self, b: &'ast ClosureBinder)

fn visit_where_predicate(&mut self, p: &'ast WherePredicate)

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

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

fn visit_trait_ref(&mut self, t: &'ast TraitRef)

fn visit_param_bound(&mut self, bounds: &'ast GenericBound, _ctxt: BoundKind)

fn visit_poly_trait_ref(&mut self, t: &'ast PolyTraitRef)

fn visit_variant_data(&mut self, s: &'ast VariantData)

fn visit_field_def(&mut self, s: &'ast FieldDef)

fn visit_enum_def(&mut self, enum_definition: &'ast EnumDef)

fn visit_variant(&mut self, v: &'ast Variant)

fn visit_variant_discr(&mut self, discr: &'ast AnonConst)

fn visit_label(&mut self, label: &'ast Label)

fn visit_lifetime(&mut self, lifetime: &'ast Lifetime, _: LifetimeCtxt)

fn visit_mac_call(&mut self, mac: &'ast MacCall)

fn visit_mac_def(&mut self, _mac: &'ast MacroDef, _id: NodeId)

fn visit_path(&mut self, path: &'ast Path, _id: NodeId)

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

fn visit_path_segment(&mut self, path_segment: &'ast PathSegment)

fn visit_generic_args(&mut self, generic_args: &'ast GenericArgs)

fn visit_generic_arg(&mut self, generic_arg: &'ast GenericArg)

fn visit_assoc_constraint(&mut self, constraint: &'ast AssocConstraint)

fn visit_attribute(&mut self, attr: &'ast Attribute)

fn visit_vis(&mut self, vis: &'ast Visibility)

fn visit_fn_ret_ty(&mut self, ret_ty: &'ast FnRetTy)

fn visit_fn_header(&mut self, _header: &'ast FnHeader)

fn visit_expr_field(&mut self, f: &'ast ExprField)

fn visit_pat_field(&mut self, fp: &'ast PatField)

fn visit_crate(&mut self, krate: &'ast Crate)

fn visit_inline_asm(&mut self, asm: &'ast InlineAsm)

fn visit_format_args(&mut self, fmt: &'ast FormatArgs)

fn visit_inline_asm_sym(&mut self, sym: &'ast InlineAsmSym)

fn visit_capture_by(&mut self, _capture_by: &'ast CaptureBy)

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