pub struct PointerFrag<Prov> {
pub idx: u8,
pub prov: Prov,
pub bytes: [u8; 8],
}Expand description
A pointer fragment represents one byte of a pointer. If the bytes are re-assembled in their original order, the pointer can be used again. Wildcard provenance is allowed to have index 0 everywhere.
Fields§
§idx: u8The position of this fragment inside the pointer (in 0..8).
prov: ProvThe provenance of the pointer this is a fragment of.
bytes: [u8; 8]The raw bytes of the pointer this is a fragment of. This is taken as a direct subslice of the raw allocation data, so we don’t have to worry about endianness. If the pointer size is less than 8, only the first N bytes of this are ever non-zero.
Trait Implementations§
Source§impl<Prov: Clone> Clone for PointerFrag<Prov>
impl<Prov: Clone> Clone for PointerFrag<Prov>
Source§fn clone(&self) -> PointerFrag<Prov>
fn clone(&self) -> PointerFrag<Prov>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<Prov: Debug> Debug for PointerFrag<Prov>
impl<Prov: Debug> Debug for PointerFrag<Prov>
Source§impl<Prov: Hash> Hash for PointerFrag<Prov>
impl<Prov: Hash> Hash for PointerFrag<Prov>
Source§impl<'__ctx, Prov> HashStable<StableHashingContext<'__ctx>> for PointerFrag<Prov>where
Prov: HashStable<StableHashingContext<'__ctx>>,
impl<'__ctx, Prov> HashStable<StableHashingContext<'__ctx>> for PointerFrag<Prov>where
Prov: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Source§impl<Prov: PartialEq> PartialEq for PointerFrag<Prov>
impl<Prov: PartialEq> PartialEq for PointerFrag<Prov>
impl<Prov: Eq> Eq for PointerFrag<Prov>
impl<Prov> StructuralPartialEq for PointerFrag<Prov>
Auto Trait Implementations§
impl<Prov> DynSend for PointerFrag<Prov>where
Prov: DynSend,
impl<Prov> DynSync for PointerFrag<Prov>where
Prov: DynSync,
impl<Prov> Freeze for PointerFrag<Prov>where
Prov: Freeze,
impl<Prov> RefUnwindSafe for PointerFrag<Prov>where
Prov: RefUnwindSafe,
impl<Prov> Send for PointerFrag<Prov>where
Prov: Send,
impl<Prov> Sync for PointerFrag<Prov>where
Prov: Sync,
impl<Prov> Unpin for PointerFrag<Prov>where
Prov: Unpin,
impl<Prov> UnwindSafe for PointerFrag<Prov>where
Prov: UnwindSafe,
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
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
This method turns the parameters of a DepNodeConstructor into an opaque
Fingerprint to be used in DepNode.
Not all DepNodeParams support being turned into a Fingerprint (they
don’t need to if the corresponding DepNode is anonymous).
default fn to_debug_str(&self, tcx: Tcx) -> String
Source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
This method tries to recover the query key from the given
DepNode,
something which is needed when forcing DepNodes 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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.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
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,
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.