Struct BuildReducedGraphVisitor

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

Fields

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

parent_scope: ParentScope<'ra>

Implementations

impl<'a, 'ra, 'tcx> BuildReducedGraphVisitor<'a, 'ra, '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<'ra>, 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, )

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

Constructs the reduced graph for one item.

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

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

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<'ra, NameBindingData<'ra>>, span: Span, allow_shadowing: bool, )

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

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

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

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

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, fn_ident: Ident, ) -> 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<'ra, Cell<MacroRulesScope<'ra>>>

Trait Implementations

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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_foreign_mod(&mut self, nm: &'a ForeignMod) -> Self::Result

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

fn visit_anon_const(&mut self, c: &'a AnonConst) -> 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_ty_pat(&mut self, t: &'a TyPat) -> Self::Result

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn visit_qself(&mut self, qs: &'a Option<Box<QSelf>>) -> 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: 48 bytes