Struct rustc_borrowck::constraints::OutlivesConstraintSet
source · pub(crate) struct OutlivesConstraintSet<'tcx> {
outlives: IndexVec<OutlivesConstraintIndex, OutlivesConstraint<'tcx>>,
}
Expand description
A set of NLL region constraints. These include “outlives”
constraints of the form R1: R2
. Each constraint is identified by
a unique OutlivesConstraintIndex
and you can index into the set
(constraint_set[i]
) to access the constraint details.
Fields§
§outlives: IndexVec<OutlivesConstraintIndex, OutlivesConstraint<'tcx>>
Implementations§
source§impl<'tcx> OutlivesConstraintSet<'tcx>
impl<'tcx> OutlivesConstraintSet<'tcx>
pub(crate) fn push(&mut self, constraint: OutlivesConstraint<'tcx>)
sourcepub(crate) fn graph(&self, num_region_vars: usize) -> ConstraintGraph<Normal>
pub(crate) fn graph(&self, num_region_vars: usize) -> ConstraintGraph<Normal>
Constructs a “normal” graph from the constraint set; the graph makes it easy to find the constraints affecting a particular region.
N.B., this graph contains a “frozen” view of the current
constraints. Any new constraints added to the OutlivesConstraintSet
after the graph is built will not be present in the graph.
sourcepub(crate) fn reverse_graph(
&self,
num_region_vars: usize,
) -> ConstraintGraph<Reverse>
pub(crate) fn reverse_graph( &self, num_region_vars: usize, ) -> ConstraintGraph<Reverse>
Like graph
, but constraints a reverse graph where R1: R2
represents an edge R2 -> R1
.
pub(crate) fn outlives( &self, ) -> &IndexSlice<OutlivesConstraintIndex, OutlivesConstraint<'tcx>>
sourcepub(crate) fn compute_sccs(
&self,
static_region: RegionVid,
definitions: &IndexVec<RegionVid, RegionDefinition<'tcx>>,
) -> Sccs<RegionVid, ConstraintSccIndex, RegionTracker>
pub(crate) fn compute_sccs( &self, static_region: RegionVid, definitions: &IndexVec<RegionVid, RegionDefinition<'tcx>>, ) -> Sccs<RegionVid, ConstraintSccIndex, RegionTracker>
Computes cycles (SCCs) in the graph of regions. In particular, find all regions R1, R2 such that R1: R2 and R2: R1 and group them into an SCC, and find the relationships between SCCs.
sourcepub(crate) fn add_outlives_static(
&mut self,
universal_regions: &UniversalRegions<'tcx>,
definitions: &IndexVec<RegionVid, RegionDefinition<'tcx>>,
) -> Sccs<RegionVid, ConstraintSccIndex, RegionTracker>
pub(crate) fn add_outlives_static( &mut self, universal_regions: &UniversalRegions<'tcx>, definitions: &IndexVec<RegionVid, RegionDefinition<'tcx>>, ) -> Sccs<RegionVid, ConstraintSccIndex, RegionTracker>
This method handles Universe errors by rewriting the constraint graph. For each strongly connected component in the constraint graph such that there is a series of constraints A: B: C: … : X where A’s universe is smaller than X’s and A is a placeholder, add a constraint that A: ’static. This is a safe upper bound in the face of borrow checker/trait solver limitations that will eventually go away.
For a more precise definition, see the documentation for
RegionTracker::has_incompatible_universes()
.
This edge case used to be handled during constraint propagation
by iterating over the strongly connected components in the constraint
graph while maintaining a set of bookkeeping mappings similar
to what is stored in RegionTracker
and manually adding ’sttaic as
needed.
It was rewritten as part of the Polonius project with the goal of moving higher-kindedness concerns out of the path of the borrow checker, for two reasons:
- Implementing Polonius is difficult enough without also handling them.
- The long-term goal is to handle higher-kinded concerns in the trait solver, where they belong. This avoids logic duplication and allows future trait solvers to compute better bounds than for example our “must outlive ’static” here.
This code is a stop-gap measure in preparation for the future trait solver.
Every constraint added by this method is an
internal IllegalUniverse
constraint.
Trait Implementations§
source§impl<'tcx> Clone for OutlivesConstraintSet<'tcx>
impl<'tcx> Clone for OutlivesConstraintSet<'tcx>
source§fn clone(&self) -> OutlivesConstraintSet<'tcx>
fn clone(&self) -> OutlivesConstraintSet<'tcx>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'tcx> Debug for OutlivesConstraintSet<'tcx>
impl<'tcx> Debug for OutlivesConstraintSet<'tcx>
source§impl<'tcx> Default for OutlivesConstraintSet<'tcx>
impl<'tcx> Default for OutlivesConstraintSet<'tcx>
source§fn default() -> OutlivesConstraintSet<'tcx>
fn default() -> OutlivesConstraintSet<'tcx>
source§impl<'tcx> Index<OutlivesConstraintIndex> for OutlivesConstraintSet<'tcx>
impl<'tcx> Index<OutlivesConstraintIndex> for OutlivesConstraintSet<'tcx>
source§type Output = OutlivesConstraint<'tcx>
type Output = OutlivesConstraint<'tcx>
Auto Trait Implementations§
impl<'tcx> DynSend for OutlivesConstraintSet<'tcx>
impl<'tcx> DynSync for OutlivesConstraintSet<'tcx>
impl<'tcx> Freeze for OutlivesConstraintSet<'tcx>
impl<'tcx> !RefUnwindSafe for OutlivesConstraintSet<'tcx>
impl<'tcx> Send for OutlivesConstraintSet<'tcx>
impl<'tcx> Sync for OutlivesConstraintSet<'tcx>
impl<'tcx> Unpin for OutlivesConstraintSet<'tcx>
impl<'tcx> !UnwindSafe for OutlivesConstraintSet<'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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)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<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<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<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,
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: 24 bytes