1
0
Fork 0
mirror of https://github.com/alacritty/alacritty.git synced 2024-11-25 14:05:41 -05:00
alacritty/alacritty_terminal/src/sync.rs

50 lines
1.3 KiB
Rust
Raw Normal View History

2020-05-05 18:50:23 -04:00
//! Synchronization types.
//!
2020-05-05 18:50:23 -04:00
//! Most importantly, a fair mutex is included.
use parking_lot::{Mutex, MutexGuard};
2020-05-05 18:50:23 -04:00
/// A fair mutex.
///
/// Uses an extra lock to ensure that if one thread is waiting that it will get
/// the lock before a single thread can re-lock it.
pub struct FairMutex<T> {
2020-05-05 18:50:23 -04:00
/// Data.
data: Mutex<T>,
2020-05-05 18:50:23 -04:00
/// Next-to-access.
next: Mutex<()>,
}
impl<T> FairMutex<T> {
2020-05-05 18:50:23 -04:00
/// Create a new fair mutex.
pub fn new(data: T) -> FairMutex<T> {
2019-03-30 12:48:36 -04:00
FairMutex { data: Mutex::new(data), next: Mutex::new(()) }
}
/// Acquire a lease to reserve the mutex lock.
///
/// This will prevent others from acquiring a terminal lock, but block if anyone else is
/// already holding a lease.
pub fn lease(&self) -> MutexGuard<'_, ()> {
self.next.lock()
}
2020-05-05 18:50:23 -04:00
/// Lock the mutex.
pub fn lock(&self) -> MutexGuard<'_, T> {
// Must bind to a temporary or the lock will be freed before going
2020-05-05 18:50:23 -04:00
// into data.lock().
let _next = self.next.lock();
self.data.lock()
}
/// Unfairly lock the mutex.
pub fn lock_unfair(&self) -> MutexGuard<'_, T> {
self.data.lock()
}
/// Unfairly try to lock the mutex.
pub fn try_lock_unfair(&self) -> Option<MutexGuard<'_, T>> {
self.data.try_lock()
}
}