Struct ProvenanceMap 

pub struct ProvenanceMap<Prov = CtfeProvenance> {
    ptrs: SortedMap<Size, Prov>,
    bytes: Option<Box<SortedMap<Size, (Prov, u8)>>>,
}

Stores the provenance information of pointers stored in memory.

Fields

ptrs: SortedMap<Size, Prov>

Provenance in this map applies from the given offset for an entire pointer-size worth of bytes. Two entries in this map are always at least a pointer size apart.

bytes: Option<Box<SortedMap<Size, (Prov, u8)>>>

This stores byte-sized provenance fragments. The u8 indicates the position of this byte inside its original 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.

Implementations

impl<Prov> ProvenanceMap<Prov>

pub fn new() -> Self

pub fn from_presorted_ptrs(r: Vec<(Size, Prov)>) -> Self

The caller must guarantee that the given provenance list is already sorted by address and contain no duplicates.

impl ProvenanceMap

pub fn ptrs(&self) -> &SortedMap<Size, CtfeProvenance>

Give access to the ptr-sized provenances (which can also be thought of as relocations, and indeed that is how codegen treats them).

Only use on interned allocations, as other allocations may have per-byte provenance!

impl<Prov: Provenance> ProvenanceMap<Prov>

fn adjusted_range_ptrs( range: AllocRange, cx: &impl HasDataLayout, ) -> Range<Size>

pub(super) fn range_ptrs_get( &self, range: AllocRange, cx: &impl HasDataLayout, ) -> &[(Size, Prov)]

Returns all ptr-sized provenance in the given range. If the range has length 0, returns provenance that crosses the edge between start-1 and start.

fn range_ptrs_is_empty( &self, range: AllocRange, cx: &impl HasDataLayout, ) -> bool

pm.range_ptrs_is_empty(r, cx) == pm.range_ptrs_get(r, cx).is_empty(), but is faster.

fn range_bytes_get(&self, range: AllocRange) -> &[(Size, (Prov, u8))]

Returns all byte-wise provenance in the given range.

fn range_bytes_is_empty(&self, range: AllocRange) -> bool

Same as range_bytes_get(range).is_empty(), but faster.

pub fn get_byte( &self, offset: Size, cx: &impl HasDataLayout, ) -> Option<(Prov, u8)>

Get the provenance of a single byte.

pub fn get_range( &self, cx: &impl HasDataLayout, range: AllocRange, ) -> impl Iterator<Item = Prov>

Gets the provenances of all bytes (including from pointers) in a range.

pub fn merge_bytes(&mut self, cx: &impl HasDataLayout) -> bool

Attempt to merge per-byte provenance back into ptr chunks, if the right fragments sit next to each other. Return false is that is not possible due to partial pointers.

pub fn get_ptr(&self, offset: Size) -> Option<Prov>

Check if there is ptr-sized provenance at the given index. Does not mean anything for bytewise provenance! But can be useful as an optimization.

pub fn range_empty(&self, range: AllocRange, cx: &impl HasDataLayout) -> bool

Returns whether this allocation has provenance overlapping with the given range.

Note: this function exists to allow range_get_provenance to be private, in order to somewhat limit access to provenance outside of the Allocation abstraction.

pub fn provenances(&self) -> impl Iterator<Item = Prov>

Yields all the provenances stored in this map.

pub fn insert_ptr(&mut self, offset: Size, prov: Prov, cx: &impl HasDataLayout)

pub fn clear(&mut self, range: AllocRange, cx: &impl HasDataLayout)

Removes all provenance inside the given range. If there is provenance overlapping with the edges, might result in an error.

pub fn write_wildcards(&mut self, cx: &impl HasDataLayout, range: AllocRange)

Overwrites all provenance in the given range with wildcard provenance. Pointers partially overwritten will have their provenances preserved bytewise on their remaining bytes.

Provided for usage in Miri and panics otherwise.

impl<Prov: Provenance> ProvenanceMap<Prov>

pub fn prepare_copy( &self, src: AllocRange, dest: Size, count: u64, cx: &impl HasDataLayout, ) -> AllocResult<ProvenanceCopy<Prov>>

pub fn apply_copy(&mut self, copy: ProvenanceCopy<Prov>)

Applies a provenance copy. The affected range, as defined in the parameters to prepare_copy is expected to be clear of provenance.

Trait Implementations

impl<Prov: Clone> Clone for ProvenanceMap<Prov>

fn clone(&self) -> ProvenanceMap<Prov>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Prov: Debug> Debug for ProvenanceMap<Prov>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<D: Decoder, Prov: Provenance + Decodable<D>> Decodable<D> for ProvenanceMap<Prov>

fn decode(d: &mut D) -> Self

impl<S: Encoder, Prov: Provenance + Encodable<S>> Encodable<S> for ProvenanceMap<Prov>

fn encode(&self, s: &mut S)

impl<Prov: Hash> Hash for ProvenanceMap<Prov>

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'__ctx, Prov> HashStable<StableHashingContext<'__ctx>> for ProvenanceMap<Prov>

where Prov: HashStable<StableHashingContext<'__ctx>>,

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )

impl<Prov: PartialEq> PartialEq for ProvenanceMap<Prov>

fn eq(&self, other: &ProvenanceMap<Prov>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Prov: Eq> Eq for ProvenanceMap<Prov>

impl<Prov> StructuralPartialEq for ProvenanceMap<Prov>

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: 32 bytes