-
Notifications
You must be signed in to change notification settings - Fork 71
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add cancellable lock-free synchronous channel #413
Merged
Merged
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,128 +1,136 @@ | ||
type 'a t = { | ||
mutex : Mutex.t; | ||
|
||
id : Ctf.id; | ||
|
||
capacity : int; | ||
items : 'a Queue.t; | ||
|
||
(* Readers suspended because [items] is empty. *) | ||
readers : 'a Waiters.t; | ||
|
||
(* Writers suspended because [items] is at capacity. *) | ||
writers : unit Waiters.t; | ||
} | ||
|
||
let with_mutex t f = | ||
Mutex.lock t.mutex; | ||
match f () with | ||
| x -> Mutex.unlock t.mutex; x | ||
| exception ex -> Mutex.unlock t.mutex; raise ex | ||
|
||
(* Invariants *) | ||
let _validate t = | ||
with_mutex t @@ fun () -> | ||
assert (Queue.length t.items <= t.capacity); | ||
assert (Waiters.is_empty t.readers || Queue.is_empty t.items); | ||
assert (Waiters.is_empty t.writers || Queue.length t.items = t.capacity) | ||
|
||
let create capacity = | ||
assert (capacity >= 0); | ||
let id = Ctf.mint_id () in | ||
Ctf.note_created id Ctf.Stream; | ||
{ | ||
mutex = Mutex.create (); | ||
id; | ||
capacity; | ||
items = Queue.create (); | ||
readers = Waiters.create (); | ||
writers = Waiters.create (); | ||
module Locking = struct | ||
type 'a t = { | ||
mutex : Mutex.t; | ||
|
||
id : Ctf.id; | ||
|
||
capacity : int; (* [capacity > 0] *) | ||
items : 'a Queue.t; | ||
|
||
(* Readers suspended because [items] is empty. *) | ||
readers : 'a Waiters.t; | ||
|
||
(* Writers suspended because [items] is at capacity. *) | ||
writers : unit Waiters.t; | ||
} | ||
|
||
let add t item = | ||
Mutex.lock t.mutex; | ||
match Waiters.wake_one t.readers item with | ||
| `Ok -> Mutex.unlock t.mutex | ||
| `Queue_empty -> | ||
(* No-one is waiting for an item. Queue it. *) | ||
if Queue.length t.items < t.capacity then ( | ||
Queue.add item t.items; | ||
Mutex.unlock t.mutex | ||
) else ( | ||
(* The queue is full. Wait for our turn first. *) | ||
Suspend.enter_unchecked @@ fun ctx enqueue -> | ||
Waiters.await_internal ~mutex:(Some t.mutex) t.writers t.id ctx (fun r -> | ||
(* This is called directly from [wake_one] and so we have the lock. | ||
We're still running in [wake_one]'s domain here. *) | ||
if Result.is_ok r then ( | ||
(* We get here immediately when called by [take], either: | ||
1. after removing an item, so there is space, or | ||
2. if [capacity = 0]; [take] will immediately remove the new item. *) | ||
Queue.add item t.items; | ||
); | ||
enqueue r | ||
) | ||
) | ||
|
||
let take t = | ||
Mutex.lock t.mutex; | ||
match Queue.take_opt t.items with | ||
| None -> | ||
(* There aren't any items, so we probably need to wait for one. | ||
However, there's also the special case of a zero-capacity queue to deal with. | ||
[is_empty writers || capacity = 0] *) | ||
begin match Waiters.wake_one t.writers () with | ||
| `Queue_empty -> | ||
Waiters.await ~mutex:(Some t.mutex) t.readers t.id | ||
| `Ok -> | ||
(* [capacity = 0] (this is the only way we can get waiters and no items). | ||
[wake_one] has just added an item to the queue; remove it to restore | ||
the invariant before closing the mutex. *) | ||
let x = Queue.take t.items in | ||
Mutex.unlock t.mutex; | ||
x | ||
end | ||
| Some v -> | ||
(* If anyone was waiting for space, let the next one go. | ||
[is_empty writers || length items = t.capacity - 1] *) | ||
begin match Waiters.wake_one t.writers () with | ||
| `Ok (* [length items = t.capacity] again *) | ||
| `Queue_empty -> () (* [is_empty writers] *) | ||
end; | ||
Mutex.unlock t.mutex; | ||
v | ||
|
||
let take_nonblocking t = | ||
Mutex.lock t.mutex; | ||
match Queue.take_opt t.items with | ||
| None -> | ||
(* There aren't any items. | ||
However, there's also the special case of a zero-capacity queue to deal with. | ||
[is_empty writers || capacity = 0] *) | ||
begin match Waiters.wake_one t.writers () with | ||
| `Queue_empty -> Mutex.unlock t.mutex; None | ||
| `Ok -> | ||
(* [capacity = 0] (this is the only way we can get waiters and no items). | ||
[wake_one] has just added an item to the queue; remove it to restore | ||
the invariant before closing the mutex. *) | ||
let x = Queue.take t.items in | ||
Mutex.unlock t.mutex; | ||
Some x | ||
end | ||
| Some v -> | ||
(* If anyone was waiting for space, let the next one go. | ||
[is_empty writers || length items = t.capacity - 1] *) | ||
begin match Waiters.wake_one t.writers () with | ||
| `Ok (* [length items = t.capacity] again *) | ||
| `Queue_empty -> () (* [is_empty writers] *) | ||
end; | ||
let with_mutex t f = | ||
Mutex.lock t.mutex; | ||
match f () with | ||
| x -> Mutex.unlock t.mutex; x | ||
| exception ex -> Mutex.unlock t.mutex; raise ex | ||
|
||
(* Invariants *) | ||
let _validate t = | ||
with_mutex t @@ fun () -> | ||
assert (Queue.length t.items <= t.capacity); | ||
assert (Waiters.is_empty t.readers || Queue.is_empty t.items); | ||
assert (Waiters.is_empty t.writers || Queue.length t.items = t.capacity) | ||
|
||
let create capacity = | ||
assert (capacity > 0); | ||
let id = Ctf.mint_id () in | ||
Ctf.note_created id Ctf.Stream; | ||
{ | ||
mutex = Mutex.create (); | ||
id; | ||
capacity; | ||
items = Queue.create (); | ||
readers = Waiters.create (); | ||
writers = Waiters.create (); | ||
} | ||
|
||
let add t item = | ||
Mutex.lock t.mutex; | ||
match Waiters.wake_one t.readers item with | ||
| `Ok -> Mutex.unlock t.mutex | ||
| `Queue_empty -> | ||
(* No-one is waiting for an item. Queue it. *) | ||
if Queue.length t.items < t.capacity then ( | ||
Queue.add item t.items; | ||
Mutex.unlock t.mutex | ||
) else ( | ||
(* The queue is full. Wait for our turn first. *) | ||
Suspend.enter_unchecked @@ fun ctx enqueue -> | ||
Waiters.await_internal ~mutex:(Some t.mutex) t.writers t.id ctx (fun r -> | ||
(* This is called directly from [wake_one] and so we have the lock. | ||
We're still running in [wake_one]'s domain here. *) | ||
if Result.is_ok r then ( | ||
(* We get here immediately when called by [take], after removing an item, | ||
so there is space *) | ||
Queue.add item t.items; | ||
); | ||
enqueue r | ||
) | ||
) | ||
|
||
let take t = | ||
Mutex.lock t.mutex; | ||
match Queue.take_opt t.items with | ||
| None -> | ||
(* There aren't any items, so we need to wait for one. *) | ||
Waiters.await ~mutex:(Some t.mutex) t.readers t.id | ||
| Some v -> | ||
(* If anyone was waiting for space, let the next one go. | ||
[is_empty writers || length items = t.capacity - 1] *) | ||
begin match Waiters.wake_one t.writers () with | ||
| `Ok (* [length items = t.capacity] again *) | ||
| `Queue_empty -> () (* [is_empty writers] *) | ||
end; | ||
Mutex.unlock t.mutex; | ||
v | ||
|
||
let take_nonblocking t = | ||
Mutex.lock t.mutex; | ||
match Queue.take_opt t.items with | ||
| None -> Mutex.unlock t.mutex; None (* There aren't any items. *) | ||
| Some v -> | ||
(* If anyone was waiting for space, let the next one go. | ||
[is_empty writers || length items = t.capacity - 1] *) | ||
begin match Waiters.wake_one t.writers () with | ||
| `Ok (* [length items = t.capacity] again *) | ||
| `Queue_empty -> () (* [is_empty writers] *) | ||
end; | ||
Mutex.unlock t.mutex; | ||
Some v | ||
|
||
let length t = | ||
Mutex.lock t.mutex; | ||
let len = Queue.length t.items in | ||
Mutex.unlock t.mutex; | ||
Some v | ||
len | ||
|
||
let dump f t = | ||
Fmt.pf f "<Locking stream: %d/%d items>" (length t) t.capacity | ||
end | ||
|
||
type 'a t = | ||
| Sync of 'a Sync.t | ||
| Locking of 'a Locking.t | ||
|
||
let create = function | ||
| 0 -> Sync (Sync.create ()) | ||
| capacity -> Locking (Locking.create capacity) | ||
|
||
let length t = | ||
Mutex.lock t.mutex; | ||
let len = Queue.length t.items in | ||
Mutex.unlock t.mutex; | ||
len | ||
let add t v = | ||
match t with | ||
| Sync x -> Sync.put x v | ||
| Locking x -> Locking.add x v | ||
|
||
let take = function | ||
| Sync x -> Sync.take x | ||
| Locking x -> Locking.take x | ||
|
||
let take_nonblocking = function | ||
| Sync x -> Sync.take_nonblocking x | ||
| Locking x -> Locking.take_nonblocking x | ||
|
||
let length = function | ||
| Sync _ -> 0 | ||
| Locking x -> Locking.length x | ||
|
||
let is_empty t = (length t = 0) | ||
|
||
let dump f = function | ||
| Sync x -> Sync.dump f x | ||
| Locking x -> Locking.dump f x |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
If I run
make dschek
on my mac, it only seems to run the first of these tests:There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
On the same note, running
make bench
fails:There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Well, the same also goes for
dune build
:It would be nice that the build wouldn't appear to fail on mac. I don't know how to fix this immediately, but I can take a look after reviewing this PR.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
make dscheck
currently requires a patched version of dscheck, as the official version is too slow to be useful: ocaml-multicore/dscheck#3. However, that version has a bug which means it may also miss some cases.Ideally, we'd replace the explicit commands in
make bench
andmake dscheck
with e.g.dune build @dscheck
. Then dune could be smarter about filtering things out on mac. But then you have to stop it running things in parallel, disable buffered output, and force it to let you run the benchmarks multiple times without changes to the code, which is a bit of a pain.Fixing the main build on mac is important, though! I don't know why dune is trying to build it though. We already have:
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
A related issue in dune: The documentation/value of %{system} is not consistent.
I also tried to work around this by using the
(* -*- tuareg -*- *)
magic, but that didn't work either as that hits a limitation in dune: (dirs ...) not recognised in dune2.There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I've reported it at ocaml/dune#6938