Struct static_locks::MutexGuard

#[must_use = "if unused the Mutex will immediately unlock"]
pub struct MutexGuard<'a, T: ?Sized> { /* fields omitted */ }

An RAII implementation of a "scoped lock" of a mutex. When this structure is dropped (falls out of scope), the lock will be unlocked.

The data protected by the mutex can be accessed through this guard via its Deref and DerefMut implementations.

Methods

impl<'a, T: ?Sized + 'a> MutexGuard<'a, T>

pub fn mutex(s: &Self) -> &'a Mutex<T>

Returns a reference to the original Mutex object.

pub fn map<U: ?Sized, F>(s: Self, f: F) -> MappedMutexGuard<'a, U> where
    F: FnOnce(&mut T) -> &mut U, 

Makes a new MappedMutexGuard for a component of the locked data.

This operation cannot fail as the MutexGuard passed in already locked the mutex.

This is an associated function that needs to be used as MutexGuard::map(...). A method would interfere with methods of the same name on the contents of the locked data.

pub fn try_map<U: ?Sized, F>(
    s: Self,
    f: F
) -> Result<MappedMutexGuard<'a, U>, Self> where
    F: FnOnce(&mut T) -> Option<&mut U>, 

Attempts to make a new MappedMutexGuard for a component of the locked data. The original guard is returned if the closure returns None.

This operation cannot fail as the MutexGuard passed in already locked the mutex.

This is an associated function that needs to be used as MutexGuard::try_map(...). A method would interfere with methods of the same name on the contents of the locked data.

pub fn unlocked<F, U>(s: &mut Self, f: F) -> U where
    F: FnOnce() -> U, 

Temporarily unlocks the mutex to execute the given function.

This is safe because &mut guarantees that there exist no other references to the data protected by the mutex.

impl<'a, T: ?Sized + 'a> MutexGuard<'a, T>

pub fn unlock_fair(s: Self)

Unlocks the mutex using a fair unlock protocol.

By default, mutexes are unfair and allow the current thread to re-lock the mutex before another has the chance to acquire the lock, even if that thread has been blocked on the mutex for a long time. This is the default because it allows much higher throughput as it avoids forcing a context switch on every mutex unlock. This can result in one thread acquiring a mutex many more times than other threads.

However in some cases it can be beneficial to ensure fairness by forcing the lock to pass on to a waiting thread if there is one. This is done by using this method instead of dropping the MutexGuard normally.

pub fn unlocked_fair<F, U>(s: &mut Self, f: F) -> U where
    F: FnOnce() -> U, 

Temporarily unlocks the mutex to execute the given function.

The mutex is unlocked using a fair unlock protocol.

This is safe because &mut guarantees that there exist no other references to the data protected by the mutex.

pub fn bump(s: &mut Self)

Temporarily yields the mutex to a waiting thread if there is one.

This method is functionally equivalent to calling unlock_fair followed by lock, however it can be much more efficient in the case where there are no waiting threads.

Trait Implementations

impl<'a, T: ?Sized + Sync + 'a> Sync for MutexGuard<'a, T>

impl<'a, T: ?Sized + 'a> Drop for MutexGuard<'a, T>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, T: ?Sized + 'a> Deref for MutexGuard<'a, T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<'a, T: ?Sized + 'a> DerefMut for MutexGuard<'a, T>

fn deref_mut(&mut self) -> &mut T

Mutably dereferences the value.

impl<'a, T: Debug + ?Sized + 'a> Debug for MutexGuard<'a, T>

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

Formats the value using the given formatter.

impl<'a, T: Display + ?Sized + 'a> Display for MutexGuard<'a, T>

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

Formats the value using the given formatter.