mirror of
https://github.com/fluencelabs/rust-libp2p
synced 2025-05-08 17:12:16 +00:00
Fix the deadlock in futures-mutex
This commit is contained in:
parent
c2d4b75988
commit
e57f3059db
@ -12,4 +12,4 @@ categories = ["asynchronous", "concurrency"]
|
|||||||
|
|
||||||
[dependencies]
|
[dependencies]
|
||||||
futures = "0.1.14"
|
futures = "0.1.14"
|
||||||
crossbeam = "0.2.10"
|
parking_lot = "0.5.3"
|
||||||
|
@ -5,33 +5,21 @@
|
|||||||
//!
|
//!
|
||||||
|
|
||||||
extern crate futures;
|
extern crate futures;
|
||||||
extern crate crossbeam;
|
extern crate parking_lot;
|
||||||
|
|
||||||
use std::ops::{Deref, DerefMut};
|
use std::ops::{Deref, DerefMut};
|
||||||
use std::mem;
|
use std::mem;
|
||||||
use std::sync::Arc;
|
use std::sync::Arc;
|
||||||
use std::sync::atomic::{Ordering, AtomicBool};
|
|
||||||
use std::cell::UnsafeCell;
|
|
||||||
use crossbeam::sync::MsQueue;
|
|
||||||
use futures::task::{current, Task};
|
use futures::task::{current, Task};
|
||||||
use futures::{Future, Poll, Async};
|
use futures::{Future, Poll, Async};
|
||||||
|
use parking_lot::{Mutex as RegularMutex, MutexGuard as RegularMutexGuard};
|
||||||
|
|
||||||
#[derive(Debug)]
|
#[derive(Debug)]
|
||||||
struct Inner<T> {
|
struct Inner<T> {
|
||||||
wait_queue: MsQueue<Task>,
|
data: RegularMutex<T>,
|
||||||
locked: AtomicBool,
|
wait_queue: RegularMutex<Vec<Task>>,
|
||||||
data: UnsafeCell<T>
|
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<T> Drop for Inner<T> {
|
|
||||||
fn drop(&mut self) {
|
|
||||||
assert!(!self.locked.load(Ordering::SeqCst))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
unsafe impl<T: Send> Send for Inner<T> {}
|
|
||||||
unsafe impl<T: Send> Sync for Inner<T> {}
|
|
||||||
|
|
||||||
/// A Mutex designed for use inside Futures. Works like `BiLock<T>` from the `futures` crate, but
|
/// A Mutex designed for use inside Futures. Works like `BiLock<T>` from the `futures` crate, but
|
||||||
/// with more than 2 handles.
|
/// with more than 2 handles.
|
||||||
///
|
///
|
||||||
@ -43,16 +31,15 @@ unsafe impl<T: Send> Sync for Inner<T> {}
|
|||||||
/// *As of now, there is no strong guarantee that a particular handle of the lock won't be starved. Hopefully the use of the queue will prevent this, but I haven't tried to test that.*
|
/// *As of now, there is no strong guarantee that a particular handle of the lock won't be starved. Hopefully the use of the queue will prevent this, but I haven't tried to test that.*
|
||||||
#[derive(Debug)]
|
#[derive(Debug)]
|
||||||
pub struct Mutex<T> {
|
pub struct Mutex<T> {
|
||||||
inner: Arc<Inner<T>>
|
inner: Arc<Inner<T>>,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<T> Mutex<T> {
|
impl<T> Mutex<T> {
|
||||||
/// Create a new Mutex wrapping around a value `t`
|
/// Create a new Mutex wrapping around a value `t`
|
||||||
pub fn new(t: T) -> Mutex<T> {
|
pub fn new(t: T) -> Mutex<T> {
|
||||||
let inner = Arc::new(Inner {
|
let inner = Arc::new(Inner {
|
||||||
wait_queue: MsQueue::new(),
|
wait_queue: RegularMutex::new(Vec::new()),
|
||||||
locked: AtomicBool::new(false),
|
data: RegularMutex::new(t),
|
||||||
data: UnsafeCell::new(t)
|
|
||||||
});
|
});
|
||||||
|
|
||||||
Mutex {
|
Mutex {
|
||||||
@ -73,11 +60,18 @@ impl<T> Mutex<T> {
|
|||||||
///
|
///
|
||||||
/// This function will panic if called outside the context of a future's task.
|
/// This function will panic if called outside the context of a future's task.
|
||||||
pub fn poll_lock(&self) -> Async<MutexGuard<T>> {
|
pub fn poll_lock(&self) -> Async<MutexGuard<T>> {
|
||||||
if self.inner.locked.compare_and_swap(false, true, Ordering::SeqCst) {
|
let mut ext_lock = self.inner.wait_queue.lock();
|
||||||
self.inner.wait_queue.push(current());
|
match self.inner.data.try_lock() {
|
||||||
Async::NotReady
|
Some(guard) => {
|
||||||
} else {
|
Async::Ready(MutexGuard {
|
||||||
Async::Ready(MutexGuard{ inner: self })
|
inner: &self.inner,
|
||||||
|
guard: Some(guard),
|
||||||
|
})
|
||||||
|
},
|
||||||
|
None => {
|
||||||
|
ext_lock.push(current());
|
||||||
|
Async::NotReady
|
||||||
|
},
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -91,22 +85,6 @@ impl<T> Mutex<T> {
|
|||||||
inner: self
|
inner: self
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/// We unlock the mutex and wait for someone to lock. We try and unpark as many tasks as we
|
|
||||||
/// can to prevents dead tasks from deadlocking the mutex, or tasks that have finished their
|
|
||||||
/// critical section and were awakened.
|
|
||||||
fn unlock(&self) {
|
|
||||||
if !self.inner.locked.swap(false, Ordering::SeqCst) {
|
|
||||||
panic!("Tried to unlock an already unlocked Mutex, something has gone terribly wrong");
|
|
||||||
}
|
|
||||||
|
|
||||||
while !self.inner.locked.load(Ordering::SeqCst) {
|
|
||||||
match self.inner.wait_queue.try_pop() {
|
|
||||||
Some(task) => task.notify(),
|
|
||||||
None => return
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<T> Clone for Mutex<T> {
|
impl<T> Clone for Mutex<T> {
|
||||||
@ -122,27 +100,34 @@ impl<T> Clone for Mutex<T> {
|
|||||||
/// This structure acts as a sentinel to the data in the `Mutex<T>` itself,
|
/// This structure acts as a sentinel to the data in the `Mutex<T>` itself,
|
||||||
/// implementing `Deref` and `DerefMut` to `T`. When dropped, the lock will be
|
/// implementing `Deref` and `DerefMut` to `T`. When dropped, the lock will be
|
||||||
/// unlocked.
|
/// unlocked.
|
||||||
#[derive(Debug)]
|
// TODO: implement Debug
|
||||||
pub struct MutexGuard<'a, T: 'a> {
|
pub struct MutexGuard<'a, T: 'a> {
|
||||||
inner: &'a Mutex<T>
|
inner: &'a Inner<T>,
|
||||||
|
guard: Option<RegularMutexGuard<'a, T>>,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<'a, T> Deref for MutexGuard<'a, T> {
|
impl<'a, T> Deref for MutexGuard<'a, T> {
|
||||||
type Target = T;
|
type Target = T;
|
||||||
|
#[inline]
|
||||||
fn deref(&self) -> &Self::Target {
|
fn deref(&self) -> &Self::Target {
|
||||||
unsafe { &*self.inner.inner.data.get() }
|
self.guard.as_ref().expect("mutex wasn't locked").deref()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<'a, T> DerefMut for MutexGuard<'a, T> {
|
impl<'a, T> DerefMut for MutexGuard<'a, T> {
|
||||||
|
#[inline]
|
||||||
fn deref_mut(&mut self) -> &mut T {
|
fn deref_mut(&mut self) -> &mut T {
|
||||||
unsafe { &mut *self.inner.inner.data.get() }
|
self.guard.as_mut().expect("mutex wasn't locked").deref_mut()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<'a, T> Drop for MutexGuard<'a, T> {
|
impl<'a, T> Drop for MutexGuard<'a, T> {
|
||||||
fn drop(&mut self) {
|
fn drop(&mut self) {
|
||||||
self.inner.unlock();
|
let mut wait_queue_lock = self.inner.wait_queue.lock();
|
||||||
|
let _ = self.guard.take().expect("mutex was unlocked");
|
||||||
|
for task in wait_queue_lock.drain(..) {
|
||||||
|
task.notify();
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user