pub enum FakeReadCause {
ForMatchGuard,
ForMatchedPlace(Option<LocalDefId>),
ForGuardBinding,
ForLet(Option<LocalDefId>),
ForIndex,
}
Expand description
The FakeReadCause
describes the type of pattern why a FakeRead statement exists.
Variants§
ForMatchGuard
A fake read injected into a match guard to ensure that the discriminants that are being matched on aren’t modified while the match guard is being evaluated.
At the beginning of each match guard, a fake borrow is
inserted for each discriminant accessed in the entire match
statement.
Then, at the end of the match guard, a FakeRead(ForMatchGuard)
is
inserted to keep the fake borrows alive until that point.
This should ensure that you cannot change the variant for an enum while you are in the midst of matching on it.
ForMatchedPlace(Option<LocalDefId>)
Fake read of the scrutinee of a match
or destructuring let
(i.e. let
with non-trivial pattern).
In match x { ... }
, we generate a FakeRead(ForMatchedPlace, x)
and insert it into the otherwise_block
(which is supposed to be
unreachable for irrefutable pattern-matches like match
or let
).
This is necessary because let x: !; match x {}
doesn’t generate any
actual read of x, so we need to generate a FakeRead
to check that it
is initialized.
If the FakeRead(ForMatchedPlace)
is being performed with a closure
that doesn’t capture the required upvars, the FakeRead
within the
closure is omitted entirely.
To make sure that this is still sound, if a closure matches against
a Place starting with an Upvar, we hoist the FakeRead
to the
definition point of the closure.
If the FakeRead
comes from being hoisted out of a closure like this,
we record the LocalDefId
of the closure. Otherwise, the Option
will be None
.
ForGuardBinding
A fake read injected into a match guard to ensure that the places bound by the pattern are immutable for the duration of the match guard.
Within a match guard, references are created for each place that the
pattern creates a binding for — this is known as the RefWithinGuard
version of the variables. To make sure that the references stay
alive until the end of the match guard, and properly prevent the
places in question from being modified, a FakeRead(ForGuardBinding)
is inserted at the end of the match guard.
For details on how these references are created, see the extensive
documentation on bind_matched_candidate_for_guard
in
rustc_mir_build
.
ForLet(Option<LocalDefId>)
Officially, the semantics of
let pattern = <expr>;
is that <expr>
is evaluated into a temporary and then this temporary is
into the pattern.
However, if we see the simple pattern let var = <expr>
, we optimize this to
evaluate <expr>
directly into the variable var
. This is mostly unobservable,
but in some cases it can affect the borrow checker, as in #53695.
Therefore, we insert a FakeRead(ForLet)
immediately after each let
with a trivial pattern.
FIXME: ExprUseVisitor
has an entirely different opinion on what FakeRead(ForLet)
is supposed to mean. If it was accurate to what MIR lowering does,
would it even make sense to hoist these out of closures like
ForMatchedPlace
?
ForIndex
Currently, index expressions overloaded through the Index
trait
get lowered differently than index expressions with builtin semantics
for arrays and slices — the latter will emit code to perform
bound checks, and then return a MIR place that will only perform the
indexing “for real” when it gets incorporated into an instruction.
This is observable in the fact that the following compiles:
fn f(x: &mut [&mut [u32]], i: usize) {
x[i][x[i].len() - 1] += 1;
}
However, we need to be careful to not let the user invalidate the bound check with an expression like
(*x)[1][{ x = y; 4}]
Here, the first bounds check would be invalidated when we evaluate the
second index expression. To make sure that this doesn’t happen, we
create a fake borrow of x
and hold it while we evaluate the second
index.
This borrow is kept alive by a FakeRead(ForIndex)
at the end of its
scope.
Trait Implementations§
Source§impl Clone for FakeReadCause
impl Clone for FakeReadCause
Source§fn clone(&self) -> FakeReadCause
fn clone(&self) -> FakeReadCause
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for FakeReadCause
impl Debug for FakeReadCause
Source§impl<'tcx, __D: TyDecoder<'tcx>> Decodable<__D> for FakeReadCause
impl<'tcx, __D: TyDecoder<'tcx>> Decodable<__D> for FakeReadCause
Source§impl<'tcx, __E: TyEncoder<'tcx>> Encodable<__E> for FakeReadCause
impl<'tcx, __E: TyEncoder<'tcx>> Encodable<__E> for FakeReadCause
Source§impl Hash for FakeReadCause
impl Hash for FakeReadCause
Source§impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for FakeReadCause
impl<'__ctx> HashStable<StableHashingContext<'__ctx>> for FakeReadCause
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Source§impl PartialEq for FakeReadCause
impl PartialEq for FakeReadCause
Source§impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for FakeReadCause
impl<'tcx> TypeFoldable<TyCtxt<'tcx>> for FakeReadCause
Source§fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>(
self,
_: &mut F,
) -> Result<Self, F::Error>
fn try_fold_with<F: FallibleTypeFolder<TyCtxt<'tcx>>>( self, _: &mut F, ) -> Result<Self, F::Error>
Source§impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for FakeReadCause
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for FakeReadCause
Source§fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result
fn visit_with<F: TypeVisitor<TyCtxt<'tcx>>>(&self, _: &mut F) -> F::Result
impl Copy for FakeReadCause
impl StructuralPartialEq for FakeReadCause
Auto Trait Implementations§
impl DynSend for FakeReadCause
impl DynSync for FakeReadCause
impl Freeze for FakeReadCause
impl RefUnwindSafe for FakeReadCause
impl Send for FakeReadCause
impl Sync for FakeReadCause
impl Unpin for FakeReadCause
impl UnwindSafe for FakeReadCause
Blanket Implementations§
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
Source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'tcx Arena<'tcx>) -> &'tcx mut T
fn allocate_from_iter( arena: &'tcx Arena<'tcx>, iter: impl IntoIterator<Item = T>, ) -> &'tcx mut [T]
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
Source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s during red-green
evaluation. The query system will only call this method if
fingerprint_style()
is not FingerprintStyle::Opaque
.
It is always valid to return None
here, in which case incremental
compilation will treat the query as having changed instead of forcing it.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<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>
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>
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<'tcx, T> IsSuggestable<'tcx> for T
impl<'tcx, T> IsSuggestable<'tcx> for T
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<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
Source§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
Source§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it).Source§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn references_error(&self) -> bool
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
Source§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
Source§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
Source§fn is_global(&self) -> bool
fn is_global(&self) -> bool
Source§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
Source§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
Source§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
Source§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.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<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: 8 bytes
Size for each variant:
ForMatchGuard
: 0 bytesForMatchedPlace
: 4 bytesForGuardBinding
: 0 bytesForLet
: 4 bytesForIndex
: 0 bytes