Struct LocalizedNode

Source

pub(super) struct LocalizedNode {
    pub region: RegionVid,
    pub point: PointIndex,
}

Expand description

A localized outlives constraint reifies the CFG location where the outlives constraint holds, within the origins themselves as if they were different from point to point: from a: b outlives constraints to a@p: b@p, where p is the point in the CFG.

This models two sources of constraints:

constraints that traverse the subsets between regions at a given point, a@p: b@p. These depend on typeck constraints generated via assignments, calls, etc.
constraints that traverse the CFG via the same region, a@p: a@q, where p is a predecessor of q. These depend on the liveness of the regions at these points, as well as their variance.

This dual of NLL’s crate::constraints::OutlivesConstraint therefore encodes the position-dependent outlives constraints used by Polonius, to model the flow-sensitive loan propagation via reachability within a graph of localized constraints.

That LocalizedConstraintGraph can create these edges on-demand during traversal, and we therefore model them as a pair of LocalizedNode vertices.

Fields§

§region: RegionVid§point: PointIndex

LocalizedNode

Struct LocalizedNode Copy item path

Fields§

Trait Implementations§

impl Clone for LocalizedNode

fn clone(&self) -> LocalizedNode

fn clone_from(&mut self, source: &Self)

impl Hash for LocalizedNode

fn hash<__H: Hasher>(&self, state: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

impl PartialEq for LocalizedNode

fn eq(&self, other: &LocalizedNode) -> bool

fn ne(&self, other: &Rhs) -> bool

impl Copy for LocalizedNode

impl Eq for LocalizedNode

impl StructuralPartialEq for LocalizedNode

Auto Trait Implementations§

impl DynSend for LocalizedNode

impl DynSync for LocalizedNode

impl Freeze for LocalizedNode

impl RefUnwindSafe for LocalizedNode

impl Send for LocalizedNode

impl Sync for LocalizedNode

impl Unpin for LocalizedNode

impl UnsafeUnpin for LocalizedNode

impl UnwindSafe for LocalizedNode

Blanket Implementations§

impl<T> Aligned for T

const ALIGN: Alignment

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> AnyEq for Twhere T: Any + PartialEq,

fn equals(&self, other: &(dyn Any + 'static)) -> bool

fn as_any(&self) -> &(dyn Any + 'static)

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]

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]

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<T, R> CollectAndApply<T, R> for T

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

type Output = R

impl<T> DynClone for Twhere T: Clone,

fn __clone_box(&self, _: Private) -> *mut ()

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<P> IntoQueryParam<P> for P

fn into_query_param(self) -> P

impl<T> MaybeResult<T> for T

type Error = !

fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

impl<T> Pointable for T

const ALIGN: usize

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

Struct LocalizedNode

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> AnyEq for T
where T: Any + PartialEq,

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for T
where T: Copy,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

impl<T> DynClone for T
where T: Clone,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T> ToOwned for T
where T: Clone,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

impl<T> ErasedDestructor for T
where T: 'static,