pub struct Mutex<T: ?Sized> { /* private fields */ }Expand description
A mutual exclusion primitive useful for protecting shared data
This mutex will block threads waiting for the lock to become available. The
mutex can be created via a new constructor. Each mutex has a type parameter
which represents the data that it is protecting. The data can only be accessed
through the RAII guards returned from lock and try_lock, which
guarantees that the data is only ever accessed when the mutex is locked.
§Poisoning
The mutexes in this module implement a strategy called “poisoning” where a mutex is considered poisoned whenever a thread panics while holding the mutex. Once a mutex is poisoned, all other threads are unable to access the data by default as it is likely tainted (some invariant is not being upheld).
For a mutex, this means that the lock and try_lock methods return a
Result which indicates whether a mutex has been poisoned or not. Most
usage of a mutex will simply unwrap() these results, propagating panics
among threads to ensure that a possibly invalid invariant is not witnessed.
A poisoned mutex, however, does not prevent all access to the underlying
data. The PoisonError type has an into_inner method which will return
the guard that would have otherwise been returned on a successful lock. This
allows access to the data, despite the lock being poisoned.
Implementations§
Source§impl<T: ?Sized> Mutex<T>
impl<T: ?Sized> Mutex<T>
Sourcepub fn lock(&self) -> LockResult<MutexGuard<'_, T>>
pub fn lock(&self) -> LockResult<MutexGuard<'_, T>>
Acquires a mutex, blocking the current thread until it is able to do so.
This function will block the local thread until it is available to acquire the mutex. Upon returning, the thread is the only thread with the lock held. An RAII guard is returned to allow scoped unlock of the lock. When the guard goes out of scope, the mutex will be unlocked.
The exact behavior on locking a mutex in the thread which already holds the lock is left unspecified. However, this function will not return on the second call (it might panic or deadlock, for example).
§Errors
If another user of this mutex panicked while holding the mutex, then this call will return an error once the mutex is acquired.
§Panics
This function might panic when called if the lock is already held by the current thread.
Sourcepub fn try_lock(&self) -> TryLockResult<MutexGuard<'_, T>>
pub fn try_lock(&self) -> TryLockResult<MutexGuard<'_, T>>
Attempts to acquire this lock.
If the lock could not be acquired at this time, then Err is returned.
Otherwise, an RAII guard is returned. The lock will be unlocked when the
guard is dropped.
This function does not block.
§Errors
If another user of this mutex panicked while holding the mutex, then
this call will return the Poisoned error if the mutex would
otherwise be acquired.
If the mutex could not be acquired because it is already locked, then
this call will return the WouldBlock error.
Sourcepub fn unlock(guard: MutexGuard<'_, T>)
pub fn unlock(guard: MutexGuard<'_, T>)
Immediately drops the guard, and consequently unlocks the mutex.
This function is equivalent to calling drop on the guard but is more self-documenting.
Alternately, the guard will be automatically dropped when it goes out of scope.
#![feature(mutex_unlock)]
use std::sync::Mutex;
let mutex = Mutex::new(0);
let mut guard = mutex.lock().unwrap();
*guard += 20;
Mutex::unlock(guard);Sourcepub fn is_poisoned(&self) -> bool
pub fn is_poisoned(&self) -> bool
Determines whether the mutex is poisoned.
If another thread is active, the mutex can still become poisoned at any
time. You should not trust a false value for program correctness
without additional synchronization.
Sourcepub fn clear_poison(&self)
pub fn clear_poison(&self)
Clear the poisoned state from a mutex
If the mutex is poisoned, it will remain poisoned until this function is called. This allows recovering from a poisoned state and marking that it has recovered. For example, if the value is overwritten by a known good value, then the mutex can be marked as un-poisoned. Or possibly, the value could be inspected to determine if it is in a consistent state, and if so the poison is removed.
Sourcepub fn into_inner(self) -> LockResult<T>where
T: Sized,
pub fn into_inner(self) -> LockResult<T>where
T: Sized,
Sourcepub fn get_mut(&mut self) -> LockResult<&mut T>
pub fn get_mut(&mut self) -> LockResult<&mut T>
Returns a mutable reference to the underlying data.
Since this call borrows the Mutex mutably, no actual locking needs to
take place – the mutable borrow statically guarantees no locks exist.
§Errors
If another user of this mutex panicked while holding the mutex, then this call will return an error instead.
§Examples
use std::sync::Mutex;
let mut mutex = Mutex::new(0);
*mutex.get_mut().unwrap() = 10;
assert_eq!(*mutex.lock().unwrap(), 10);Trait Implementations§
Source§impl<T> From<T> for Mutex<T>
impl<T> From<T> for Mutex<T>
Source§fn from(t: T) -> Self
fn from(t: T) -> Self
Creates a new mutex in an unlocked state ready for use.
This is equivalent to Mutex::new.