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>
impl<'a, 'b, 'tcx> BuildReducedGraphVisitor<'a, 'b, 'tcx>
fn res(&self, def_id: impl Into<DefId>) -> Res<NodeId>
fn resolve_visibility(&mut self, vis: &Visibility) -> Visibility
fn try_resolve_visibility<'ast>( &mut self, vis: &'ast Visibility, finalize: bool, ) -> Result<Visibility, VisResolutionError<'ast>>
fn insert_field_idents(&mut self, def_id: LocalDefId, fields: &[FieldDef])
fn insert_field_visibilities_local( &mut self, def_id: DefId, fields: &[FieldDef], )
fn block_needs_anonymous_module(&mut self, block: &Block) -> bool
fn add_import( &mut self, module_path: Vec<Segment>, kind: ImportKind<'a>, span: Span, item: &Item, root_span: Span, root_id: NodeId, vis: Visibility, )
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, )
fn build_reduced_graph_for_struct_variant( &mut self, fields: &[FieldDef], ident: Ident, feed: Feed<'tcx, LocalDefId>, adt_res: Res<NodeId>, adt_vis: Visibility, adt_span: Span, )
sourcefn build_reduced_graph_for_item(&mut self, item: &'b Item)
fn build_reduced_graph_for_item(&mut self, item: &'b Item)
Constructs the reduced graph for one item.
fn build_reduced_graph_for_extern_crate( &mut self, orig_name: Option<Symbol>, item: &Item, local_def_id: LocalDefId, vis: Visibility, parent: Module<'a>, )
sourcefn build_reduced_graph_for_foreign_item(&mut self, item: &ForeignItem)
fn build_reduced_graph_for_foreign_item(&mut self, item: &ForeignItem)
Constructs the reduced graph for one foreign item.
fn build_reduced_graph_for_block(&mut self, block: &Block)
fn add_macro_use_binding( &mut self, name: Symbol, binding: Interned<'a, NameBindingData<'a>>, span: Span, allow_shadowing: bool, )
sourcefn process_macro_use_imports(&mut self, item: &Item, module: Module<'a>) -> bool
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.
sourcefn contains_macro_use(&mut self, attrs: &[Attribute]) -> bool
fn contains_macro_use(&mut self, attrs: &[Attribute]) -> bool
Returns true
if this attribute list contains macro_use
.
fn visit_invoc(&mut self, id: NodeId) -> LocalExpnId
sourcefn visit_invoc_in_module(
&mut self,
id: NodeId,
) -> Interned<'a, Cell<MacroRulesScope<'a>>>
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.
fn proc_macro_stub(&self, item: &Item) -> Option<(MacroKind, Ident, Span)>
fn insert_unused_macro( &mut self, ident: Ident, def_id: LocalDefId, node_id: NodeId, )
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>
impl<'a, 'tcx> AsMut<Resolver<'a, 'tcx>> for BuildReducedGraphVisitor<'a, '_, 'tcx>
source§impl<'a, 'b, 'tcx> Visitor<'b> for BuildReducedGraphVisitor<'a, 'b, 'tcx>
impl<'a, 'b, 'tcx> Visitor<'b> for BuildReducedGraphVisitor<'a, 'b, 'tcx>
fn visit_expr(&mut self, node: &'b Expr)
fn visit_pat(&mut self, node: &'b Pat)
fn visit_ty(&mut self, node: &'b Ty)
fn visit_item(&mut self, item: &'b Item)
fn visit_stmt(&mut self, stmt: &'b Stmt)
fn visit_foreign_item(&mut self, foreign_item: &'b ForeignItem)
fn visit_block(&mut self, block: &'b Block)
fn visit_assoc_item(&mut self, item: &'b AssocItem, ctxt: AssocCtxt)
fn visit_attribute(&mut self, attr: &'b Attribute)
fn visit_arm(&mut self, arm: &'b Arm)
fn visit_expr_field(&mut self, f: &'b ExprField)
fn visit_pat_field(&mut self, fp: &'b PatField)
fn visit_generic_param(&mut self, param: &'b GenericParam)
fn visit_param(&mut self, p: &'b Param)
fn visit_field_def(&mut self, sf: &'b FieldDef)
fn visit_variant(&mut self, variant: &'b Variant)
fn visit_crate(&mut self, krate: &'b Crate)
fn visit_ident(&mut self, _ident: Ident) -> Self::Result
fn visit_local(&mut self, l: &'ast Local) -> Self::Result
fn visit_anon_const(&mut self, c: &'ast AnonConst) -> 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
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) -> 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_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_enum_def(&mut self, enum_definition: &'ast EnumDef) -> 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_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_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<'a, 'b, 'tcx> Freeze for BuildReducedGraphVisitor<'a, 'b, 'tcx>
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> 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
Mutably borrows from an owned value. Read more
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>
Creates a filterable data provider with the given name for debugging. Read more
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>
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 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>
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 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: 48 bytes