Struct rustc_symbol_mangling::legacy::SymbolPrinter
source · struct SymbolPrinter<'tcx> {
tcx: TyCtxt<'tcx>,
path: SymbolPath,
keep_within_component: bool,
}
Fields§
§tcx: TyCtxt<'tcx>
§path: SymbolPath
§keep_within_component: bool
Trait Implementations§
source§impl<'tcx> PrettyPrinter<'tcx> for SymbolPrinter<'tcx>
impl<'tcx> PrettyPrinter<'tcx> for SymbolPrinter<'tcx>
source§fn should_print_region(&self, _region: Region<'_>) -> bool
fn should_print_region(&self, _region: Region<'_>) -> bool
Returns
true
if the region should be printed in
optional positions, e.g., &'a T
or dyn Tr + 'b
.
This is typically the case for all non-'_
regions.source§fn comma_sep<T>(
&mut self,
elems: impl Iterator<Item = T>
) -> Result<(), PrintError>where
T: Print<'tcx, Self>,
fn comma_sep<T>(
&mut self,
elems: impl Iterator<Item = T>
) -> Result<(), PrintError>where
T: Print<'tcx, Self>,
Prints comma-separated elements.
source§fn generic_delimiters(
&mut self,
f: impl FnOnce(&mut Self) -> Result<(), PrintError>
) -> Result<(), PrintError>
fn generic_delimiters( &mut self, f: impl FnOnce(&mut Self) -> Result<(), PrintError> ) -> Result<(), PrintError>
Prints
<...>
around what f
prints.source§fn print_value_path(
&mut self,
def_id: DefId,
args: &'tcx [GenericArg<'tcx>]
) -> Result<(), Error>
fn print_value_path( &mut self, def_id: DefId, args: &'tcx [GenericArg<'tcx>] ) -> Result<(), Error>
Like
print_def_path
but for value paths.fn in_binder<T>(&mut self, value: &Binder<'tcx, T>) -> Result<(), Error>
fn wrap_binder<T, F>( &mut self, value: &Binder<'tcx, T>, f: F ) -> Result<(), Error>
source§fn typed_value(
&mut self,
f: impl FnOnce(&mut Self) -> Result<(), Error>,
t: impl FnOnce(&mut Self) -> Result<(), Error>,
conversion: &str
) -> Result<(), Error>
fn typed_value( &mut self, f: impl FnOnce(&mut Self) -> Result<(), Error>, t: impl FnOnce(&mut Self) -> Result<(), Error>, conversion: &str ) -> Result<(), Error>
Prints
{f: t}
or {f as t}
depending on the cast
argumentfn reset_type_limit(&mut self)
source§fn try_print_visible_def_path(&mut self, def_id: DefId) -> Result<bool, Error>
fn try_print_visible_def_path(&mut self, def_id: DefId) -> Result<bool, Error>
If possible, this returns a global path resolving to
def_id
that is visible
from at least one local module, and returns true
. If the crate defining def_id
is
declared with an extern crate
, the path is guaranteed to use the extern crate
.fn force_print_trimmed_def_path(&mut self, def_id: DefId) -> Result<bool, Error>
source§fn try_print_trimmed_def_path(&mut self, def_id: DefId) -> Result<bool, Error>
fn try_print_trimmed_def_path(&mut self, def_id: DefId) -> Result<bool, Error>
Try to see if this path can be trimmed to a unique symbol name.
source§fn try_print_visible_def_path_recur(
&mut self,
def_id: DefId,
callers: &mut Vec<DefId>
) -> Result<bool, Error>
fn try_print_visible_def_path_recur( &mut self, def_id: DefId, callers: &mut Vec<DefId> ) -> Result<bool, Error>
Does the work of
try_print_visible_def_path
, building the
full definition path recursively before attempting to
post-process it into the valid and visible version that
accounts for re-exports. Read morefn pretty_path_qualified( &mut self, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>> ) -> Result<(), Error>
fn pretty_path_append_impl( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), Error>, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>> ) -> Result<(), Error>
fn pretty_print_type(&mut self, ty: Ty<'tcx>) -> Result<(), Error>
fn pretty_print_opaque_impl_type( &mut self, def_id: DefId, args: &'tcx List<GenericArg<'tcx>> ) -> Result<(), Error>
source§fn insert_trait_and_projection(
&mut self,
trait_ref: Binder<'tcx, TraitRef<'tcx>>,
polarity: ImplPolarity,
proj_ty: Option<(DefId, Binder<'tcx, Term<'tcx>>)>,
traits: &mut IndexMap<(Binder<'tcx, TraitRef<'tcx>>, ImplPolarity), IndexMap<DefId, Binder<'tcx, Term<'tcx>>, BuildHasherDefault<FxHasher>>, BuildHasherDefault<FxHasher>>,
fn_traits: &mut IndexMap<Binder<'tcx, TraitRef<'tcx>>, OpaqueFnEntry<'tcx>, BuildHasherDefault<FxHasher>>
)
fn insert_trait_and_projection( &mut self, trait_ref: Binder<'tcx, TraitRef<'tcx>>, polarity: ImplPolarity, proj_ty: Option<(DefId, Binder<'tcx, Term<'tcx>>)>, traits: &mut IndexMap<(Binder<'tcx, TraitRef<'tcx>>, ImplPolarity), IndexMap<DefId, Binder<'tcx, Term<'tcx>>, BuildHasherDefault<FxHasher>>, BuildHasherDefault<FxHasher>>, fn_traits: &mut IndexMap<Binder<'tcx, TraitRef<'tcx>>, OpaqueFnEntry<'tcx>, BuildHasherDefault<FxHasher>> )
Insert the trait ref and optionally a projection type associated with it into either the
traits map or fn_traits map, depending on if the trait is in the Fn* family of traits.
fn pretty_print_inherent_projection( &mut self, alias_ty: &AliasTy<'tcx> ) -> Result<(), Error>
fn ty_infer_name(&self, _: TyVid) -> Option<Symbol>
fn const_infer_name(&self, _: ConstVid) -> Option<Symbol>
fn pretty_print_dyn_existential( &mut self, predicates: &'tcx List<Binder<'tcx, ExistentialPredicate<'tcx>>> ) -> Result<(), Error>
fn pretty_fn_sig( &mut self, inputs: &[Ty<'tcx>], c_variadic: bool, output: Ty<'tcx> ) -> Result<(), Error>
fn pretty_print_const( &mut self, ct: Const<'tcx>, print_ty: bool ) -> Result<(), Error>
fn pretty_print_const_scalar( &mut self, scalar: Scalar, ty: Ty<'tcx> ) -> Result<(), Error>
fn pretty_print_const_scalar_ptr( &mut self, ptr: Pointer, ty: Ty<'tcx> ) -> Result<(), Error>
fn pretty_print_const_scalar_int( &mut self, int: ScalarInt, ty: Ty<'tcx>, print_ty: bool ) -> Result<(), Error>
source§fn pretty_print_const_pointer<Prov>(
&mut self,
_: Pointer<Prov>,
ty: Ty<'tcx>
) -> Result<(), Error>where
Prov: Provenance,
fn pretty_print_const_pointer<Prov>(
&mut self,
_: Pointer<Prov>,
ty: Ty<'tcx>
) -> Result<(), Error>where
Prov: Provenance,
This is overridden for MIR printing because we only want to hide alloc ids from users, not
from MIR where it is actually useful.
fn pretty_print_byte_str(&mut self, byte_str: &'tcx [u8]) -> Result<(), Error>
fn pretty_print_const_valtree( &mut self, valtree: ValTree<'tcx>, ty: Ty<'tcx>, print_ty: bool ) -> Result<(), Error>
fn pretty_closure_as_impl( &mut self, closure: ClosureArgs<'tcx> ) -> Result<(), Error>
fn pretty_print_bound_constness( &mut self, trait_ref: TraitRef<'tcx> ) -> Result<(), Error>
fn should_print_verbose(&self) -> bool
source§impl<'tcx> Printer<'tcx> for SymbolPrinter<'tcx>
impl<'tcx> Printer<'tcx> for SymbolPrinter<'tcx>
fn tcx(&self) -> TyCtxt<'tcx>
fn print_region(&mut self, _region: Region<'_>) -> Result<(), PrintError>
fn print_type(&mut self, ty: Ty<'tcx>) -> Result<(), PrintError>
fn print_dyn_existential( &mut self, predicates: &'tcx List<PolyExistentialPredicate<'tcx>> ) -> Result<(), PrintError>
fn print_const(&mut self, ct: Const<'tcx>) -> Result<(), PrintError>
fn path_crate(&mut self, cnum: CrateNum) -> Result<(), PrintError>
fn path_qualified( &mut self, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>> ) -> Result<(), PrintError>
fn path_append_impl( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>, _disambiguated_data: &DisambiguatedDefPathData, self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>> ) -> Result<(), PrintError>
fn path_append( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>, disambiguated_data: &DisambiguatedDefPathData ) -> Result<(), PrintError>
fn path_generic_args( &mut self, print_prefix: impl FnOnce(&mut Self) -> Result<(), PrintError>, args: &[GenericArg<'tcx>] ) -> Result<(), PrintError>
fn print_def_path( &mut self, def_id: DefId, args: &'tcx [GenericArg<'tcx>] ) -> Result<(), Error>
fn print_impl_path( &mut self, impl_def_id: DefId, args: &'tcx [GenericArg<'tcx>], self_ty: Ty<'tcx>, trait_ref: Option<TraitRef<'tcx>> ) -> Result<(), Error>
fn default_print_def_path( &mut self, def_id: DefId, args: &'tcx [GenericArg<'tcx>] ) -> Result<(), Error>
fn default_print_impl_path( &mut self, impl_def_id: DefId, _args: &'tcx [GenericArg<'tcx>], self_ty: Ty<'tcx>, impl_trait_ref: Option<TraitRef<'tcx>> ) -> Result<(), Error>
Auto Trait Implementations§
impl<'tcx> DynSend for SymbolPrinter<'tcx>
impl<'tcx> DynSync for SymbolPrinter<'tcx>
impl<'tcx> Freeze for SymbolPrinter<'tcx>
impl<'tcx> !RefUnwindSafe for SymbolPrinter<'tcx>
impl<'tcx> !Send for SymbolPrinter<'tcx>
impl<'tcx> !Sync for SymbolPrinter<'tcx>
impl<'tcx> Unpin for SymbolPrinter<'tcx>
impl<'tcx> !UnwindSafe for SymbolPrinter<'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
§impl<T> Filterable for T
impl<T> Filterable for T
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<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
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> 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,
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: 64 bytes