Struct holochain::prelude::dependencies::kitsune_p2p_types::dependencies::lair_keystore_api::dependencies::parking_lot::lock_api::RwLockUpgradableReadGuard
pub struct RwLockUpgradableReadGuard<'a, R, T>where
R: RawRwLockUpgrade,
T: ?Sized,{ /* private fields */ }
Expand description
RAII structure used to release the upgradable read access of a lock when dropped.
Implementations§
§impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
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 a 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 a 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: 'a + RawRwLockUpgradeFair,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgradeFair,
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: 'a + RawRwLockUpgradeDowngrade,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgradeDowngrade,
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.
§impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgradeTimed,
T: 'a + ?Sized,
impl<'a, R, T> RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgradeTimed,
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 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(
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 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.
Trait Implementations§
§impl<'a, R, T> Debug for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + Debug + ?Sized,
impl<'a, R, T> Debug for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + Debug + ?Sized,
§impl<'a, R, T> Deref for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + ?Sized,
impl<'a, R, T> Deref for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + ?Sized,
§impl<'a, R, T> Display for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + Display + ?Sized,
impl<'a, R, T> Display for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + Display + ?Sized,
§impl<'a, R, T> Drop for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + ?Sized,
impl<'a, R, T> Drop for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + ?Sized,
impl<'a, R, T> Sync for RwLockUpgradableReadGuard<'a, R, T>where
R: 'a + RawRwLockUpgrade,
T: 'a + Sync + ?Sized,
Auto Trait Implementations§
impl<'a, R, T> !RefUnwindSafe for RwLockUpgradableReadGuard<'a, R, T>
impl<'a, R, T: ?Sized> Send for RwLockUpgradableReadGuard<'a, R, T>where
R: Sync,
T: Send + Sync,
<R as RawRwLock>::GuardMarker: Send,
impl<'a, R, T: ?Sized> Unpin for RwLockUpgradableReadGuard<'a, R, T>where
<R as RawRwLock>::GuardMarker: Unpin,
impl<'a, R, T> !UnwindSafe for RwLockUpgradableReadGuard<'a, R, T>
Blanket Implementations§
§impl<T> Any for Twhere
T: Any + ?Sized,
impl<T> Any for Twhere
T: Any + ?Sized,
§fn type_id_compat(&self) -> TypeId
fn type_id_compat(&self) -> TypeId
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata
) -> <T as Pointee>::Metadata
§impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
impl<F, W, T, D> Deserialize<With<T, W>, D> for Fwhere
W: DeserializeWith<F, T, D>,
D: Fallible + ?Sized,
F: ?Sized,
§fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>
fn deserialize(
&self,
deserializer: &mut D
) -> Result<With<T, W>, <D as Fallible>::Error>
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
fn with_context(self, otel_cx: Context) -> WithContext<Self> ⓘ
§fn with_current_context(self) -> WithContext<Self> ⓘ
fn with_current_context(self) -> WithContext<Self> ⓘ
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.