pub(crate) struct PoloniusContext<'tcx> {
graph: Option<LocalizedConstraintGraph>,
pub(crate) live_region_variances: IndexVec<RegionVid, Option<ConstraintDirection>>,
pub(crate) boring_nll_locals: FxHashSet<Local>,
pub(crate) deferred_locals_for_liveness: DeferredLocals<'tcx>,
pub(crate) local_use_map: Option<LocalUseMap>,
}Expand description
This struct holds the necessary
- liveness data, created during MIR typeck, and which will be used to lazily compute the polonius localized constraints, during NLL region inference as well as MIR dumping,
- data needed by the borrowck error computation and diagnostics.
Fields§
§graph: Option<LocalizedConstraintGraph>The graph from which we extract the localized outlives constraints.
live_region_variances: IndexVec<RegionVid, Option<ConstraintDirection>>The expected edge direction per live region: the kind of directed edge we’ll create as liveness constraints depends on the variance of types with respect to each contained region.
boring_nll_locals: FxHashSet<Local>The regions that outlive free regions are used to distinguish relevant live locals from boring locals. A boring local is one whose type contains only such regions. Polonius currently has more boring locals than NLLs so we record the latter to use in errors and diagnostics, to focus on the locals we consider relevant and match NLL diagnostics.
deferred_locals_for_liveness: DeferredLocals<'tcx>§local_use_map: Option<LocalUseMap>Implementations§
Source§impl<'tcx> PoloniusContext<'tcx>
impl<'tcx> PoloniusContext<'tcx>
Sourcepub(crate) fn compute_loan_liveness(
&mut self,
infcx: &BorrowckInferCtxt<'tcx>,
liveness: &mut LivenessValues,
outlives_constraints: impl Iterator<Item = OutlivesConstraint<'tcx>>,
universal_regions: &UniversalRegions<'tcx>,
body: &Body<'tcx>,
move_data: &MoveData<'tcx>,
location_map: Rc<DenseLocationMap>,
borrow_set: &BorrowSet<'tcx>,
)
pub(crate) fn compute_loan_liveness( &mut self, infcx: &BorrowckInferCtxt<'tcx>, liveness: &mut LivenessValues, outlives_constraints: impl Iterator<Item = OutlivesConstraint<'tcx>>, universal_regions: &UniversalRegions<'tcx>, body: &Body<'tcx>, move_data: &MoveData<'tcx>, location_map: Rc<DenseLocationMap>, borrow_set: &BorrowSet<'tcx>, )
Computes live loans using the set of loans model for -Zpolonius=next.
First, creates a constraint graph combining regions and CFG points, by:
- converting NLL typeck constraints to be localized
- encoding liveness constraints
Then, this graph is traversed, reachability is recorded as loan liveness, to be used by the loan scope and active loans computations.
The constraint data will be used to compute errors and diagnostics.
Trait Implementations§
Auto Trait Implementations§
impl<'tcx> !DynSend for PoloniusContext<'tcx>
impl<'tcx> !DynSync for PoloniusContext<'tcx>
impl<'tcx> !RefUnwindSafe for PoloniusContext<'tcx>
impl<'tcx> !Send for PoloniusContext<'tcx>
impl<'tcx> !Sync for PoloniusContext<'tcx>
impl<'tcx> !UnwindSafe for PoloniusContext<'tcx>
impl<'tcx> Freeze for PoloniusContext<'tcx>
impl<'tcx> Unpin for PoloniusContext<'tcx>
impl<'tcx> UnsafeUnpin for PoloniusContext<'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
impl<T> ErasedDestructor for Twhere
T: 'static,
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<K> IntoQueryKey<K> for K
impl<K> IntoQueryKey<K> for K
Source§fn into_query_key(self) -> K
fn into_query_key(self) -> K
Self to K.
This should always be a very cheap conversion, e.g. LocalDefId::to_def_id.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, 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<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> ⓘ
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: 264 bytes