# Struct miri::alloc_addresses::reuse_pool::ReusePool

source ·

    pub struct ReusePool {
        address_reuse_rate: f64,
        address_reuse_cross_thread_rate: f64,
        pool: Vec<Vec<(u64, Size, ThreadId, VClock)>>,
    }

Expand description

The pool strikes a balance between exploring more possible executions and making it more likely to find bugs. The hypothesis is that bugs are more likely to occur when reuse happens for allocations with the same layout, since that can trigger e.g. ABA issues in a concurrent data structure. Therefore we only reuse allocations when size and alignment match exactly.

## Fields§

§`address_reuse_rate: f64`§`address_reuse_cross_thread_rate: f64`§`pool: Vec<Vec<(u64, Size, ThreadId, VClock)>>`

The i-th element in `pool` stores allocations of alignment `2^i`. We store these reusable allocations as address-size pairs, the list must be sorted by the size and then the thread ID.

Each of these maps has at most MAX_POOL_SIZE elements, and since alignment is limited to less than 64 different possible value, that bounds the overall size of the pool.

We also store the ID and the data-race clock of the thread that donated this pool element, to ensure synchronization with the thread that picks up this address.

## Implementations§

source§

### impl ReusePool

source

#### pub fn new(config: &MiriConfig) -> Self

source

#### fn subpool(&mut self, align: Align) -> &mut Vec<(u64, Size, ThreadId, VClock)>

source

#### pub fn add_addr( &mut self, rng: &mut impl Rng, addr: u64, size: Size, align: Align, kind: MemoryKind, thread: ThreadId, clock: impl FnOnce() -> VClock, )

source

#### pub fn take_addr( &mut self, rng: &mut impl Rng, size: Size, align: Align, kind: MemoryKind, thread: ThreadId, ) -> Option<(u64, Option<VClock>)>

Returns the address to use and optionally a clock we have to synchronize with.

## Trait Implementations§

source§

### impl Debug for ReusePool

source§

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

Formats the value using the given formatter. Read more

## Auto Trait Implementations§

§

### impl Freeze for ReusePool

§

### impl RefUnwindSafe for ReusePool

§

### impl Send for ReusePool

§

### impl Sync for ReusePool

§

### impl Unpin for ReusePool

§

### impl UnwindSafe for ReusePool

## Blanket Implementations§

source§

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

source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
source§

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

source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

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

source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

source§

### impl<T> Same for T

§

#### type Output = T

Should always be `Self`
source§

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

§

#### type Error = Infallible

The type returned in the event of a conversion error.
source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

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

§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

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

§

#### fn vzip(self) -> V

## 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: 40 bytes