Expand description
Represents a pointer in the Miri engine.
Pointers are “tagged” with provenance information; typically the AllocId
they belong to.
Fields
offset: Size
provenance: Prov
Implementations
sourceimpl<Prov> Pointer<Option<Prov>>
impl<Prov> Pointer<Option<Prov>>
sourcepub fn into_pointer_or_addr(self) -> Result<Pointer<Prov>, Size>
pub fn into_pointer_or_addr(self) -> Result<Pointer<Prov>, Size>
Convert this pointer that might have a provenance into a pointer that definitely has a provenance, or an absolute address.
This is rarely what you want; call ptr_try_get_alloc_id
instead.
sourcepub fn addr(self) -> Sizewhere
Prov: Provenance,
pub fn addr(self) -> Sizewhere
Prov: Provenance,
Returns the absolute address the pointer points to. Only works if Prov::OFFSET_IS_ADDR is true!
sourceimpl<'tcx, Prov> Pointer<Prov>
impl<'tcx, Prov> Pointer<Prov>
pub fn new(provenance: Prov, offset: Size) -> Self
sourcepub fn into_parts(self) -> (Prov, Size)
pub fn into_parts(self) -> (Prov, Size)
Obtain the constituents of this pointer. Not that the meaning of the offset depends on the type Prov
!
This function must only be used in the implementation of Machine::ptr_get_alloc
,
and when a Pointer
is taken apart to be stored efficiently in an Allocation
.
pub fn map_provenance(self, f: impl FnOnce(Prov) -> Prov) -> Self
pub fn offset(self, i: Size, cx: &impl HasDataLayout) -> InterpResult<'tcx, Self>
pub fn overflowing_offset(self, i: Size, cx: &impl HasDataLayout) -> (Self, bool)
pub fn wrapping_offset(self, i: Size, cx: &impl HasDataLayout) -> Self
pub fn signed_offset(
self,
i: i64,
cx: &impl HasDataLayout
) -> InterpResult<'tcx, Self>
pub fn overflowing_signed_offset(
self,
i: i64,
cx: &impl HasDataLayout
) -> (Self, bool)
pub fn wrapping_signed_offset(self, i: i64, cx: &impl HasDataLayout) -> Self
Trait Implementations
sourceimpl<Prov: Provenance> Debug for Pointer<Option<Prov>>
impl<Prov: Provenance> Debug for Pointer<Option<Prov>>
sourceimpl<Prov: Provenance> Debug for Pointer<Prov>
impl<Prov: Provenance> Debug for Pointer<Prov>
sourceimpl<'tcx, Prov, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Pointer<Prov>where
Prov: Decodable<__D>,
impl<'tcx, Prov, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Pointer<Prov>where
Prov: Decodable<__D>,
sourceimpl<Prov: Provenance> Display for Pointer<Option<Prov>>
impl<Prov: Provenance> Display for Pointer<Option<Prov>>
sourceimpl<'tcx, Prov, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Pointer<Prov>where
Prov: Encodable<__E>,
impl<'tcx, Prov, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Pointer<Prov>where
Prov: Encodable<__E>,
sourceimpl From<AllocId> for Pointer
impl From<AllocId> for Pointer
Produces a Pointer
that points to the beginning of the Allocation
.
sourceimpl<'__ctx, Prov> HashStable<StableHashingContext<'__ctx>> for Pointer<Prov>where
Prov: HashStable<StableHashingContext<'__ctx>>,
impl<'__ctx, Prov> HashStable<StableHashingContext<'__ctx>> for Pointer<Prov>where
Prov: HashStable<StableHashingContext<'__ctx>>,
fn hash_stable(
&self,
__hcx: &mut StableHashingContext<'__ctx>,
__hasher: &mut StableHasher
)
sourceimpl<Prov: Ord> Ord for Pointer<Prov>
impl<Prov: Ord> Ord for Pointer<Prov>
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
sourceimpl<Prov: PartialEq> PartialEq<Pointer<Prov>> for Pointer<Prov>
impl<Prov: PartialEq> PartialEq<Pointer<Prov>> for Pointer<Prov>
sourceimpl<Prov: PartialOrd> PartialOrd<Pointer<Prov>> for Pointer<Prov>
impl<Prov: PartialOrd> PartialOrd<Pointer<Prov>> for Pointer<Prov>
sourcefn partial_cmp(&self, other: &Pointer<Prov>) -> Option<Ordering>
fn partial_cmp(&self, other: &Pointer<Prov>) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read moreimpl<Prov: Copy> Copy for Pointer<Prov>
impl<Prov: Eq> Eq for Pointer<Prov>
impl<Prov> StructuralEq for Pointer<Prov>
impl<Prov> StructuralPartialEq for Pointer<Prov>
Auto Trait Implementations
impl<Prov> RefUnwindSafe for Pointer<Prov>where
Prov: RefUnwindSafe,
impl<Prov> Send for Pointer<Prov>where
Prov: Send,
impl<Prov> Sync for Pointer<Prov>where
Prov: Sync,
impl<Prov> Unpin for Pointer<Prov>where
Prov: Unpin,
impl<Prov> UnwindSafe for Pointer<Prov>where
Prov: UnwindSafe,
Blanket Implementations
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
default fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
DepNode
,
something which is needed when forcing DepNode
s 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. Read moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
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.