pub(crate) struct MemCategorizationContext<'a, 'tcx> {
pub(crate) typeck_results: &'a TypeckResults<'tcx>,
infcx: &'a InferCtxt<'tcx>,
param_env: ParamEnv<'tcx>,
body_owner: LocalDefId,
upvars: Option<&'tcx FxIndexMap<HirId, Upvar>>,
}
Fields§
§typeck_results: &'a TypeckResults<'tcx>
§infcx: &'a InferCtxt<'tcx>
§param_env: ParamEnv<'tcx>
§body_owner: LocalDefId
§upvars: Option<&'tcx FxIndexMap<HirId, Upvar>>
Implementations§
source§impl<'a, 'tcx> MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> MemCategorizationContext<'a, 'tcx>
sourcepub(crate) fn new(
infcx: &'a InferCtxt<'tcx>,
param_env: ParamEnv<'tcx>,
body_owner: LocalDefId,
typeck_results: &'a TypeckResults<'tcx>
) -> MemCategorizationContext<'a, 'tcx>
pub(crate) fn new( infcx: &'a InferCtxt<'tcx>, param_env: ParamEnv<'tcx>, body_owner: LocalDefId, typeck_results: &'a TypeckResults<'tcx> ) -> MemCategorizationContext<'a, 'tcx>
Creates a MemCategorizationContext
.
pub(crate) fn tcx(&self) -> TyCtxt<'tcx>
pub(crate) fn type_is_copy_modulo_regions(&self, ty: Ty<'tcx>) -> bool
fn resolve_vars_if_possible<T>(&self, value: T) -> Twhere
T: TypeFoldable<TyCtxt<'tcx>>,
fn is_tainted_by_errors(&self) -> bool
fn resolve_type_vars_or_error( &self, id: HirId, ty: Option<Ty<'tcx>> ) -> Result<Ty<'tcx>, ()>
pub(crate) fn node_ty(&self, hir_id: HirId) -> Result<Ty<'tcx>, ()>
fn expr_ty(&self, expr: &Expr<'_>) -> Result<Ty<'tcx>, ()>
pub(crate) fn expr_ty_adjusted(&self, expr: &Expr<'_>) -> Result<Ty<'tcx>, ()>
sourcepub(crate) fn pat_ty_adjusted(&self, pat: &Pat<'_>) -> Result<Ty<'tcx>, ()>
pub(crate) fn pat_ty_adjusted(&self, pat: &Pat<'_>) -> Result<Ty<'tcx>, ()>
Returns the type of value that this pattern matches against. Some non-obvious cases:
- a
ref x
binding matches against a value of typeT
and givesx
the type&T
; we returnT
. - a pattern with implicit derefs (thanks to default binding
modes #42640) may look like
Some(x)
but in fact have implicit deref patterns attached (e.g., it is really&Some(x)
). In that case, we return the “outermost” type (e.g.,&Option<T>
).
sourcefn pat_ty_unadjusted(&self, pat: &Pat<'_>) -> Result<Ty<'tcx>, ()>
fn pat_ty_unadjusted(&self, pat: &Pat<'_>) -> Result<Ty<'tcx>, ()>
Like pat_ty
, but ignores implicit &
patterns.
pub(crate) fn cat_expr( &self, expr: &Expr<'_> ) -> Result<PlaceWithHirId<'tcx>, ()>
pub(crate) fn cat_expr_adjusted( &self, expr: &Expr<'_>, previous: PlaceWithHirId<'tcx>, adjustment: &Adjustment<'tcx> ) -> Result<PlaceWithHirId<'tcx>, ()>
fn cat_expr_adjusted_with<F>( &self, expr: &Expr<'_>, previous: F, adjustment: &Adjustment<'tcx> ) -> Result<PlaceWithHirId<'tcx>, ()>
pub(crate) fn cat_expr_unadjusted( &self, expr: &Expr<'_> ) -> Result<PlaceWithHirId<'tcx>, ()>
pub(crate) fn cat_res( &self, hir_id: HirId, span: Span, expr_ty: Ty<'tcx>, res: Res ) -> Result<PlaceWithHirId<'tcx>, ()>
sourcefn cat_upvar(
&self,
hir_id: HirId,
var_id: HirId
) -> Result<PlaceWithHirId<'tcx>, ()>
fn cat_upvar( &self, hir_id: HirId, var_id: HirId ) -> Result<PlaceWithHirId<'tcx>, ()>
Categorize an upvar.
Note: the actual upvar access contains invisible derefs of closure environment and upvar reference as appropriate. Only regionck cares about these dereferences, so we let it compute them as needed.
pub(crate) fn cat_rvalue( &self, hir_id: HirId, expr_ty: Ty<'tcx> ) -> PlaceWithHirId<'tcx>
pub(crate) fn cat_projection<N: HirNode>( &self, node: &N, base_place: PlaceWithHirId<'tcx>, ty: Ty<'tcx>, kind: ProjectionKind ) -> PlaceWithHirId<'tcx>
fn cat_overloaded_place( &self, expr: &Expr<'_>, base: &Expr<'_> ) -> Result<PlaceWithHirId<'tcx>, ()>
fn cat_deref( &self, node: &impl HirNode, base_place: PlaceWithHirId<'tcx> ) -> Result<PlaceWithHirId<'tcx>, ()>
pub(crate) fn cat_pattern<F>( &self, place: PlaceWithHirId<'tcx>, pat: &Pat<'_>, op: F ) -> Result<(), ()>
sourcefn variant_index_for_adt(
&self,
qpath: &QPath<'_>,
pat_hir_id: HirId,
span: Span
) -> Result<VariantIdx, ()>
fn variant_index_for_adt( &self, qpath: &QPath<'_>, pat_hir_id: HirId, span: Span ) -> Result<VariantIdx, ()>
Returns the variant index for an ADT used within a Struct or TupleStruct pattern
Here pat_hir_id
is the HirId of the pattern itself.
sourcefn total_fields_in_adt_variant(
&self,
pat_hir_id: HirId,
variant_index: VariantIdx,
span: Span
) -> Result<usize, ()>
fn total_fields_in_adt_variant( &self, pat_hir_id: HirId, variant_index: VariantIdx, span: Span ) -> Result<usize, ()>
Returns the total number of fields in an ADT variant used within a pattern.
Here pat_hir_id
is the HirId of the pattern itself.
sourcefn total_fields_in_tuple(
&self,
pat_hir_id: HirId,
span: Span
) -> Result<usize, ()>
fn total_fields_in_tuple( &self, pat_hir_id: HirId, span: Span ) -> Result<usize, ()>
Returns the total number of fields in a tuple used within a Tuple pattern.
Here pat_hir_id
is the HirId of the pattern itself.
sourcefn cat_pattern_<F>(
&self,
place_with_id: PlaceWithHirId<'tcx>,
pat: &Pat<'_>,
op: &mut F
) -> Result<(), ()>
fn cat_pattern_<F>( &self, place_with_id: PlaceWithHirId<'tcx>, pat: &Pat<'_>, op: &mut F ) -> Result<(), ()>
Here, place
is the PlaceWithHirId
being matched and pat is the pattern it
is being matched against.
In general, the way that this works is that we walk down the pattern,
constructing a PlaceWithHirId
that represents the path that will be taken
to reach the value being matched.
Trait Implementations§
source§impl<'a, 'tcx> Clone for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> Clone for MemCategorizationContext<'a, 'tcx>
source§fn clone(&self) -> MemCategorizationContext<'a, 'tcx>
fn clone(&self) -> MemCategorizationContext<'a, 'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreAuto Trait Implementations§
impl<'a, 'tcx> !DynSend for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> !DynSync for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> Freeze for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> !RefUnwindSafe for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> !Send for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> !Sync for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> Unpin for MemCategorizationContext<'a, 'tcx>
impl<'a, 'tcx> !UnwindSafe for MemCategorizationContext<'a, '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
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>
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
source§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: 40 bytes