struct BuildReducedGraphVisitor<'a, 'b, 'tcx> {
    r: &'b mut Resolver<'a, 'tcx>,
    parent_scope: ParentScope<'a>,
}

Fields§

§r: &'b mut Resolver<'a, 'tcx>§parent_scope: ParentScope<'a>

Implementations§

source§

impl<'a, 'b, 'tcx> BuildReducedGraphVisitor<'a, 'b, 'tcx>

source

fn res(&self, def_id: impl Into<DefId>) -> Res<NodeId>

source

fn resolve_visibility(&mut self, vis: &Visibility) -> Visibility

source

fn try_resolve_visibility<'ast>( &mut self, vis: &'ast Visibility, finalize: bool ) -> Result<Visibility, VisResolutionError<'ast>>

source

fn insert_field_def_ids(&mut self, def_id: LocalDefId, vdata: &VariantData)

source

fn insert_field_visibilities_local( &mut self, def_id: DefId, vdata: &VariantData )

source

fn block_needs_anonymous_module(&mut self, block: &Block) -> bool

source

fn add_import( &mut self, module_path: Vec<Segment>, kind: ImportKind<'a>, span: Span, item: &Item, root_span: Span, root_id: NodeId, vis: Visibility )

source

fn build_reduced_graph_for_use_tree( &mut self, use_tree: &UseTree, id: NodeId, parent_prefix: &[Segment], nested: bool, list_stem: bool, item: &Item, vis: Visibility, root_span: Span )

source

fn build_reduced_graph_for_item(&mut self, item: &'b Item)

Constructs the reduced graph for one item.

source

fn build_reduced_graph_for_extern_crate( &mut self, orig_name: Option<Symbol>, item: &Item, local_def_id: LocalDefId, vis: Visibility, parent: Module<'a> )

source

fn build_reduced_graph_for_foreign_item(&mut self, item: &ForeignItem)

Constructs the reduced graph for one foreign item.

source

fn build_reduced_graph_for_block(&mut self, block: &Block)

source

fn build_reduced_graph_for_external_crate_res(&mut self, child: &ModChild)

Builds the reduced graph for a single item in an external crate.

source

fn add_macro_use_binding( &mut self, name: Symbol, binding: Interned<'a, NameBindingData<'a>>, span: Span, allow_shadowing: bool )

source

fn process_macro_use_imports(&mut self, item: &Item, module: Module<'a>) -> bool

Returns true if we should consider the underlying extern crate to be used.

source

fn contains_macro_use(&mut self, attrs: &[Attribute]) -> bool

Returns true if this attribute list contains macro_use.

source

fn visit_invoc(&mut self, id: NodeId) -> LocalExpnId

source

fn visit_invoc_in_module( &mut self, id: NodeId ) -> Interned<'a, Cell<MacroRulesScope<'a>>>

Visit invocation in context in which it can emit a named item (possibly macro_rules) directly into its parent scope’s module.

source

fn proc_macro_stub(&self, item: &Item) -> Option<(MacroKind, Ident, Span)>

source

fn insert_unused_macro( &mut self, ident: Ident, def_id: LocalDefId, node_id: NodeId )

source

fn define_macro( &mut self, item: &Item ) -> Interned<'a, Cell<MacroRulesScope<'a>>>

Trait Implementations§

source§

impl<'a, 'tcx> AsMut<Resolver<'a, 'tcx>> for BuildReducedGraphVisitor<'a, '_, 'tcx>

source§

fn as_mut(&mut self) -> &mut Resolver<'a, 'tcx>

Converts this type into a mutable reference of the (usually inferred) input type.
source§

impl<'a, 'b, 'tcx> Visitor<'b> for BuildReducedGraphVisitor<'a, 'b, 'tcx>

source§

fn visit_expr(&mut self, node: &'b Expr)

source§

fn visit_pat(&mut self, node: &'b Pat)

source§

fn visit_ty(&mut self, node: &'b Ty)

source§

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

source§

fn visit_stmt(&mut self, stmt: &'b Stmt)

source§

fn visit_foreign_item(&mut self, foreign_item: &'b ForeignItem)

source§

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

source§

fn visit_assoc_item(&mut self, item: &'b AssocItem, ctxt: AssocCtxt)

source§

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

source§

fn visit_arm(&mut self, arm: &'b Arm)

source§

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

source§

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

source§

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

source§

fn visit_param(&mut self, p: &'b Param)

source§

fn visit_field_def(&mut self, sf: &'b FieldDef)

source§

fn visit_variant(&mut self, variant: &'b Variant)

source§

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

source§

fn visit_ident(&mut self, _ident: Ident)

source§

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

source§

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

source§

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.
source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

Auto Trait Implementations§

§

impl<'a, 'b, 'tcx> !RefUnwindSafe for BuildReducedGraphVisitor<'a, 'b, 'tcx>

§

impl<'a, 'b, 'tcx> !Send for BuildReducedGraphVisitor<'a, 'b, 'tcx>

§

impl<'a, 'b, 'tcx> !Sync for BuildReducedGraphVisitor<'a, 'b, 'tcx>

§

impl<'a, 'b, 'tcx> Unpin for BuildReducedGraphVisitor<'a, 'b, 'tcx>

§

impl<'a, 'b, 'tcx> !UnwindSafe for BuildReducedGraphVisitor<'a, 'b, 'tcx>

Blanket Implementations§

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

source§

fn from(t: T) -> T

Returns the argument unchanged.

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, 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.

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