Struct parking_lot::RwLockUpgradableReadGuard

#[must_use]
pub struct RwLockUpgradableReadGuard<'a, T: ?Sized + 'a> { /* fields omitted */ }

RAII structure used to release the upgradable read access of a lock when dropped.

Methods

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

pub fn downgrade(self) -> RwLockReadGuard<'a, T>

Atomically downgrades an upgradable read lock lock into a shared read lock without allowing any writers to take exclusive access of the lock in the meantime.

Note that if there are any writers currently waiting to take the lock then other readers may not be able to acquire the lock even if it was downgraded.

pub fn upgrade(self) -> RwLockWriteGuard<'a, T>

Atomically upgrades an upgradable read lock lock into a exclusive write lock, blocking the current thread until it can be aquired.

pub fn try_upgrade(self) -> Result<RwLockWriteGuard<'a, T>, Self>

Tries to atomically upgrade an upgradable read lock into a exclusive write lock.

If the access could not be granted at this time, then the current guard is returned.

pub fn try_upgrade_for(     self,     timeout: Duration ) -> Result<RwLockWriteGuard<'a, T>, Self>

Tries to atomically upgrade an upgradable read lock into a exclusive write lock, until a timeout is reached.

If the access could not be granted before the timeout expires, then the current guard is returned.

pub fn try_upgrade_until(     self,     timeout: Instant ) -> Result<RwLockWriteGuard<'a, T>, Self>

Tries to atomically upgrade an upgradable read lock into a exclusive write lock, until a timeout is reached.

If the access could not be granted before the timeout expires, then the current guard is returned.

pub fn unlock_fair(self)

Unlocks the RwLock using a fair unlock protocol.

By default, RwLock is unfair and allow the current thread to re-lock the rwlock before another has the chance to acquire the lock, even if that thread has been blocked on the RwLock for a long time. This is the default because it allows much higher throughput as it avoids forcing a context switch on every rwlock unlock. This can result in one thread acquiring a RwLock 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 RwLockUpgradableReadGuard normally.

Trait Implementations

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

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

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

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

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, T: ?Sized> StableAddress for RwLockUpgradableReadGuard<'a, T>