Struct RwLockUpgradableReadGuard
pub struct RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade,
T: ?Sized,{
rwlock: &'a RwLock<R, T>,
marker: PhantomData<(&'a T, <R as RawRwLock>::GuardMarker)>,
}
Expand description
RAII structure used to release the upgradable read access of a lock when dropped.
Fields§
§rwlock: &'a RwLock<R, T>
§marker: PhantomData<(&'a T, <R as RawRwLock>::GuardMarker)>
Implementations§
§impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade + 'a,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade + 'a,
T: 'a + ?Sized,
pub fn rwlock(s: &RwLockUpgradableReadGuard<'a, R, T>) -> &'a RwLock<R, T>
pub fn rwlock(s: &RwLockUpgradableReadGuard<'a, R, T>) -> &'a RwLock<R, T>
Returns a reference to the original reader-writer lock object.
pub fn unlocked<F, U>(s: &mut RwLockUpgradableReadGuard<'a, R, T>, f: F) -> Uwhere
F: FnOnce() -> U,
pub fn unlocked<F, U>(s: &mut RwLockUpgradableReadGuard<'a, R, T>, f: F) -> Uwhere
F: FnOnce() -> U,
Temporarily unlocks the RwLock
to execute the given function.
This is safe because &mut
guarantees that there exist no other
references to the data protected by the RwLock
.
pub fn upgrade(
s: RwLockUpgradableReadGuard<'a, R, T>,
) -> RwLockWriteGuard<'a, R, T>
pub fn upgrade( s: RwLockUpgradableReadGuard<'a, R, T>, ) -> RwLockWriteGuard<'a, R, T>
Atomically upgrades an upgradable read lock lock into an exclusive write lock, blocking the current thread until it can be acquired.
pub fn try_upgrade(
s: RwLockUpgradableReadGuard<'a, R, T>,
) -> Result<RwLockWriteGuard<'a, R, T>, RwLockUpgradableReadGuard<'a, R, T>>
pub fn try_upgrade( s: RwLockUpgradableReadGuard<'a, R, T>, ) -> Result<RwLockWriteGuard<'a, R, T>, RwLockUpgradableReadGuard<'a, R, T>>
Tries to atomically upgrade an upgradable read lock into an exclusive write lock.
If the access could not be granted at this time, then the current guard is returned.
§impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgradeFair + 'a,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgradeFair + 'a,
T: 'a + ?Sized,
pub fn unlock_fair(s: RwLockUpgradableReadGuard<'a, R, T>)
pub fn unlock_fair(s: RwLockUpgradableReadGuard<'a, R, T>)
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.
pub fn unlocked_fair<F, U>(
s: &mut RwLockUpgradableReadGuard<'a, R, T>,
f: F,
) -> Uwhere
F: FnOnce() -> U,
pub fn unlocked_fair<F, U>(
s: &mut RwLockUpgradableReadGuard<'a, R, T>,
f: F,
) -> Uwhere
F: FnOnce() -> U,
Temporarily unlocks the RwLock
to execute the given function.
The RwLock
is unlocked a fair unlock protocol.
This is safe because &mut
guarantees that there exist no other
references to the data protected by the RwLock
.
pub fn bump(s: &mut RwLockUpgradableReadGuard<'a, R, T>)
pub fn bump(s: &mut RwLockUpgradableReadGuard<'a, R, T>)
Temporarily yields the RwLock
to a waiting thread if there is one.
This method is functionally equivalent to calling unlock_fair
followed
by upgradable_read
, however it can be much more efficient in the case where there
are no waiting threads.
§impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgradeDowngrade + 'a,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgradeDowngrade + 'a,
T: 'a + ?Sized,
pub fn downgrade(
s: RwLockUpgradableReadGuard<'a, R, T>,
) -> RwLockReadGuard<'a, R, T>
pub fn downgrade( s: RwLockUpgradableReadGuard<'a, R, T>, ) -> RwLockReadGuard<'a, R, 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 with_upgraded<Ret, F>(&mut self, f: F) -> Ret
pub fn with_upgraded<Ret, F>(&mut self, f: F) -> Ret
First, atomically upgrades an upgradable read lock lock into an exclusive write lock, blocking the current thread until it can be acquired.
Then, calls the provided closure with an exclusive reference to the lock’s data.
Finally, atomically downgrades the lock back to an upgradable read lock.
The closure’s return value is wrapped in Some
and returned.
This function only requires a mutable reference to the guard, unlike
upgrade
which takes the guard by value.
pub fn try_with_upgraded<Ret, F>(&mut self, f: F) -> Option<Ret>
pub fn try_with_upgraded<Ret, F>(&mut self, f: F) -> Option<Ret>
First, tries to atomically upgrade an upgradable read lock into an exclusive write lock.
If the access could not be granted at this time, then None
is returned.
Otherwise, calls the provided closure with an exclusive reference to the lock’s data,
and finally downgrades the lock back to an upgradable read lock.
The closure’s return value is wrapped in Some
and returned.
This function only requires a mutable reference to the guard, unlike
try_upgrade
which takes the guard by value.
§impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgradeTimed + 'a,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgradeTimed + 'a,
T: 'a + ?Sized,
pub fn try_upgrade_for(
s: RwLockUpgradableReadGuard<'a, R, T>,
timeout: <R as RawRwLockTimed>::Duration,
) -> Result<RwLockWriteGuard<'a, R, T>, RwLockUpgradableReadGuard<'a, R, T>>
pub fn try_upgrade_for( s: RwLockUpgradableReadGuard<'a, R, T>, timeout: <R as RawRwLockTimed>::Duration, ) -> Result<RwLockWriteGuard<'a, R, T>, RwLockUpgradableReadGuard<'a, R, T>>
Tries to atomically upgrade an upgradable read lock into an 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(
s: RwLockUpgradableReadGuard<'a, R, T>,
timeout: <R as RawRwLockTimed>::Instant,
) -> Result<RwLockWriteGuard<'a, R, T>, RwLockUpgradableReadGuard<'a, R, T>>
pub fn try_upgrade_until( s: RwLockUpgradableReadGuard<'a, R, T>, timeout: <R as RawRwLockTimed>::Instant, ) -> Result<RwLockWriteGuard<'a, R, T>, RwLockUpgradableReadGuard<'a, R, T>>
Tries to atomically upgrade an upgradable read lock into an 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.
§impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>
pub fn try_with_upgraded_for<Ret, F>(
&mut self,
timeout: <R as RawRwLockTimed>::Duration,
f: F,
) -> Option<Ret>
pub fn try_with_upgraded_for<Ret, F>( &mut self, timeout: <R as RawRwLockTimed>::Duration, f: F, ) -> Option<Ret>
Tries to atomically upgrade an upgradable read lock into an exclusive write lock, until a timeout is reached.
If the access could not be granted before the timeout expires, then
None
is returned.
Otherwise, calls the provided closure with an exclusive reference to the lock’s data,
and finally downgrades the lock back to an upgradable read lock.
The closure’s return value is wrapped in Some
and returned.
This function only requires a mutable reference to the guard, unlike
try_upgrade_for
which takes the guard by value.
pub fn try_with_upgraded_until<Ret, F>(
&mut self,
timeout: <R as RawRwLockTimed>::Instant,
f: F,
) -> Option<Ret>
pub fn try_with_upgraded_until<Ret, F>( &mut self, timeout: <R as RawRwLockTimed>::Instant, f: F, ) -> Option<Ret>
Tries to atomically upgrade an upgradable read lock into an exclusive write lock, until a timeout is reached.
If the access could not be granted before the timeout expires, then
None
is returned.
Otherwise, calls the provided closure with an exclusive reference to the lock’s data,
and finally downgrades the lock back to an upgradable read lock.
The closure’s return value is wrapped in Some
and returned.
This function only requires a mutable reference to the guard, unlike
try_upgrade_until
which takes the guard by value.
Trait Implementations§
§impl<'a, R, T> Debug for RwLockUpgradableReadGuard<'a, R, T>
impl<'a, R, T> Debug for RwLockUpgradableReadGuard<'a, R, T>
§impl<'a, R, T> Deref for RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade + 'a,
T: 'a + ?Sized,
impl<'a, R, T> Deref for RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade + 'a,
T: 'a + ?Sized,
§impl<'a, R, T> Display for RwLockUpgradableReadGuard<'a, R, T>
impl<'a, R, T> Display for RwLockUpgradableReadGuard<'a, R, T>
§impl<'a, R, T> Drop for RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade + 'a,
T: 'a + ?Sized,
impl<'a, R, T> Drop for RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade + 'a,
T: 'a + ?Sized,
impl<'a, R, T> Sync for RwLockUpgradableReadGuard<'a, R, T>
Auto Trait Implementations§
impl<'a, R, T> Freeze for RwLockUpgradableReadGuard<'a, R, T>where
T: ?Sized,
impl<'a, R, T> !RefUnwindSafe for RwLockUpgradableReadGuard<'a, R, T>
impl<'a, R, T> Send for RwLockUpgradableReadGuard<'a, R, T>
impl<'a, R, T> Unpin for RwLockUpgradableReadGuard<'a, R, T>
impl<'a, R, T> !UnwindSafe for RwLockUpgradableReadGuard<'a, R, T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CheckedAs for T
impl<T> CheckedAs for T
Source§fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
Source§impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
Source§fn checked_cast_from(src: Src) -> Option<Dst>
fn checked_cast_from(src: Src) -> Option<Dst>
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request
Source§impl<Src, Dst> LosslessTryInto<Dst> for Srcwhere
Dst: LosslessTryFrom<Src>,
impl<Src, Dst> LosslessTryInto<Dst> for Srcwhere
Dst: LosslessTryFrom<Src>,
Source§fn lossless_try_into(self) -> Option<Dst>
fn lossless_try_into(self) -> Option<Dst>
Source§impl<Src, Dst> LossyInto<Dst> for Srcwhere
Dst: LossyFrom<Src>,
impl<Src, Dst> LossyInto<Dst> for Srcwhere
Dst: LossyFrom<Src>,
Source§fn lossy_into(self) -> Dst
fn lossy_into(self) -> Dst
Source§impl<T> OverflowingAs for T
impl<T> OverflowingAs for T
Source§fn overflowing_as<Dst>(self) -> (Dst, bool)where
T: OverflowingCast<Dst>,
fn overflowing_as<Dst>(self) -> (Dst, bool)where
T: OverflowingCast<Dst>,
Source§impl<Src, Dst> OverflowingCastFrom<Src> for Dstwhere
Src: OverflowingCast<Dst>,
impl<Src, Dst> OverflowingCastFrom<Src> for Dstwhere
Src: OverflowingCast<Dst>,
Source§fn overflowing_cast_from(src: Src) -> (Dst, bool)
fn overflowing_cast_from(src: Src) -> (Dst, bool)
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self
, then passes self.deref()
into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> SaturatingAs for T
impl<T> SaturatingAs for T
Source§fn saturating_as<Dst>(self) -> Dstwhere
T: SaturatingCast<Dst>,
fn saturating_as<Dst>(self) -> Dstwhere
T: SaturatingCast<Dst>,
Source§impl<Src, Dst> SaturatingCastFrom<Src> for Dstwhere
Src: SaturatingCast<Dst>,
impl<Src, Dst> SaturatingCastFrom<Src> for Dstwhere
Src: SaturatingCast<Dst>,
Source§fn saturating_cast_from(src: Src) -> Dst
fn saturating_cast_from(src: Src) -> Dst
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref()
only in debug builds, and is erased in release
builds.