Struct ConcurrentMemory 

pub struct ConcurrentMemory<M>
where
    M: Memory + Obj,
{
    memory: M,
    accesses: List<Access>,
}

Fields

memory: M

accesses: List<Access>

Implementations

impl<M> ConcurrentMemory<M>

where M: Memory + Obj,

pub fn new(params: <M as Memory>::Params) -> ConcurrentMemory<M>

pub fn allocate( &mut self, kind: AllocationKind, size: Size, align: Align, ) -> NdResult<ThinPointer<<M as Memory>::Provenance>, TerminationInfo>

Create a new allocation. The initial contents of the allocation are AbstractByte::Uninit.

pub fn deallocate( &mut self, ptr: ThinPointer<<M as Memory>::Provenance>, kind: AllocationKind, size: Size, align: Align, ) -> Result<(), TerminationInfo>

Remove an allocation.

pub fn store( &mut self, ptr: ThinPointer<<M as Memory>::Provenance>, bytes: List<AbstractByte<<M as Memory>::Provenance>>, align: Align, atomicity: Atomicity, ) -> Result<(), TerminationInfo>

Write some bytes to memory and check for data races.

pub fn load( &mut self, ptr: ThinPointer<<M as Memory>::Provenance>, len: Size, align: Align, atomicity: Atomicity, ) -> Result<List<AbstractByte<<M as Memory>::Provenance>>, TerminationInfo>

Read some bytes from memory and check for data races.

pub fn dereferenceable( &self, ptr: ThinPointer<<M as Memory>::Provenance>, len: Size, ) -> Result<(), TerminationInfo>

Test whether the given pointer is dereferenceable for the given size. Raises UB if that is not the case.

pub fn signed_dereferenceable( &self, ptr: ThinPointer<<M as Memory>::Provenance>, len: Int, ) -> Result<(), TerminationInfo>

A derived form of dereferenceable that works with a signed notion on “length”.

pub fn retag_ptr( &mut self, frame_extra: &mut <M as Memory>::FrameExtra, ptr: Pointer<<M as Memory>::Provenance>, ptr_type: PtrType, fn_entry: bool, fn_implicit_writes: bool, vtable_lookup: impl Fn(ThinPointer<<M as Memory>::Provenance>) -> VTable + 'static, ) -> Result<Pointer<<M as Memory>::Provenance>, TerminationInfo>

Return the retagged pointer.

pub fn end_call( &mut self, extra: <M as Memory>::FrameExtra, ) -> Result<(), TerminationInfo>

Memory model hook invoked at the end of each function call.

pub fn leak_check(&self) -> Result<(), TerminationInfo>

Check if there are any memory leaks.

pub fn check_data_races( &self, current_thread: Int, _: (Set<Int>, List<Access>), ) -> Result<(), TerminationInfo>

Given a list of previous accesses, checks if any of the current accesses is in a data race with any of those.

pub fn reset_accesses(&mut self) -> List<Access>

Prepare memory to track accesses of next step: reset the internal access list to be empty, and return the list of previously collected accesses.

Trait Implementations

impl<M> Clone for ConcurrentMemory<M>

where M: Clone + Memory + Obj,

fn clone(&self) -> ConcurrentMemory<M>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<M> Copy for ConcurrentMemory<M>

where M: Copy + Memory + Obj,

impl<M> Debug for ConcurrentMemory<M>

where M: Debug + Memory + Obj,

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

Formats the value using the given formatter.

impl<'de, M> Deserialize<'de> for ConcurrentMemory<M>

where M: Memory + Obj + Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<ConcurrentMemory<M>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<M> Eq for ConcurrentMemory<M>

where M: Eq + Memory + Obj,

impl<M> Hash for ConcurrentMemory<M>

where M: Hash + Memory + Obj,

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

where __H: Hasher,

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<M> Ord for ConcurrentMemory<M>

where M: Ord + Memory + Obj,

fn cmp(&self, other: &ConcurrentMemory<M>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl<M> PartialEq for ConcurrentMemory<M>

where M: PartialEq + Memory + Obj,

fn eq(&self, other: &ConcurrentMemory<M>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<M> PartialOrd for ConcurrentMemory<M>

where M: PartialOrd + Memory + Obj,

fn partial_cmp(&self, other: &ConcurrentMemory<M>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<M> Serialize for ConcurrentMemory<M>

where M: Memory + Obj + Serialize,

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<M> StructuralPartialEq for ConcurrentMemory<M>

where M: PartialEq + Memory + Obj,