Struct rstubs::util::ticket::Ticket

pub struct Ticket<T> {
    serving: AtomicUsize,
    ticket: AtomicUsize,
    value: UnsafeCell<T>,
}

By the use of Ticketlocks, it is possible to serialize blocks of code that might run parallel on multiple CPU cores.

Synchronization is implemented using a lock and a ticket variable. Once a thread tries to enter the critical area, it obtains a ticket by atomic increment of the ticket variable and waits until the lock variable is equal to its ticket. When a thread leaves the critical area, it increments the lock variable by one and thereby allows the next thread to enter the critical area.

Fields

serving: AtomicUsize

ticket: AtomicUsize

value: UnsafeCell<T>

Wrap the mutable data inside an unsafe cell, so that the compiler doesn’t optimize it away

Implementations

impl<T> Ticket<T>

pub const fn new(value: T) -> Self

Create a new ticket lock, protecting value

pub fn lock(&self) -> TicketGuard<'_, T>

Locks the lock and returns the protected data.

The data is wrapped in a guard, that unlocks the lock if it goes out of scope.

pub unsafe fn unlock(&self)

If you really want to unlock it. This is not protected by race conditions!

pub unsafe fn raw(&self) -> &mut T

If you really want to access the contents. This is not protected by race conditions!

Trait Implementations

impl<T: Debug> Debug for Ticket<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for Ticket<T>

fn default() -> Ticket<T>

Returns the “default value” for a type.

impl<T: Send> Send for Ticket<T>

impl<T> Sync for Ticket<T>