struct PoloniusOutOfScopePrecomputer<'a, 'tcx> {
visited: BitSet<BasicBlock>,
visit_stack: Vec<BasicBlock>,
body: &'a Body<'tcx>,
regioncx: &'a RegionInferenceContext<'tcx>,
loans_out_of_scope_at_location: FxIndexMap<Location, Vec<BorrowIndex>>,
}
Fields§
§visited: BitSet<BasicBlock>
§visit_stack: Vec<BasicBlock>
§body: &'a Body<'tcx>
§regioncx: &'a RegionInferenceContext<'tcx>
§loans_out_of_scope_at_location: FxIndexMap<Location, Vec<BorrowIndex>>
Implementations§
Source§impl<'a, 'tcx> PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> PoloniusOutOfScopePrecomputer<'a, 'tcx>
fn new(body: &'a Body<'tcx>, regioncx: &'a RegionInferenceContext<'tcx>) -> Self
Source§impl<'tcx> PoloniusOutOfScopePrecomputer<'_, 'tcx>
impl<'tcx> PoloniusOutOfScopePrecomputer<'_, 'tcx>
Sourcefn precompute_loans_out_of_scope(
&mut self,
loan_idx: BorrowIndex,
issuing_region: RegionVid,
loan_issued_at: Location,
)
fn precompute_loans_out_of_scope( &mut self, loan_idx: BorrowIndex, issuing_region: RegionVid, loan_issued_at: Location, )
Loans are in scope while they are live: whether they are contained within any live region. In the location-insensitive analysis, a loan will be contained in a region if the issuing region can reach it in the subset graph. So this is a reachability problem.
Sourcefn loan_kill_location(
&self,
loan_idx: BorrowIndex,
loan_issued_at: Location,
block: BasicBlock,
start: usize,
end: usize,
) -> Option<Location>
fn loan_kill_location( &self, loan_idx: BorrowIndex, loan_issued_at: Location, block: BasicBlock, start: usize, end: usize, ) -> Option<Location>
Returns the lowest statement in start..=end
, where the loan goes out of scope, if any.
This is the statement where the issuing region can’t reach any of the regions that are live
at this point.
Auto Trait Implementations§
impl<'a, 'tcx> !DynSend for PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> !DynSync for PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> Freeze for PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> !RefUnwindSafe for PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> !Send for PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> !Sync for PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> Unpin for PoloniusOutOfScopePrecomputer<'a, 'tcx>
impl<'a, 'tcx> !UnwindSafe for PoloniusOutOfScopePrecomputer<'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
Mutably borrows from an owned value. Read more
§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<T> Pointable for T
impl<T> Pointable for T
§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
§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: 128 bytes