Source file spsc_queue.ml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
type 'a t = {
array : 'a Option.t Array.t;
tail : int Atomic.t;
head : int Atomic.t;
mask : int;
}
exception Full
let create ~size_exponent =
let size = Int.shift_left 1 size_exponent in
{
head = Atomic.make 0;
tail = Atomic.make 0;
mask = size - 1;
array = Array.init size (fun _ -> None);
}
let push { array; head; tail; mask; _ } element =
let size = mask + 1 in
let head_val = Atomic.get head in
let tail_val = Atomic.get tail in
if head_val + size == tail_val then raise Full
else (
Array.set array (tail_val land mask) (Some element);
Atomic.set tail (tail_val + 1))
let pop { array; head; tail; mask; _ } =
let head_val = Atomic.get head in
let tail_val = Atomic.get tail in
if head_val == tail_val then None
else
let index = head_val land mask in
let v = Array.get array index in
Array.set array index None;
Atomic.set head (head_val + 1);
assert (Option.is_some v);
v
let size { head; tail; _ } = Atomic.get tail - Atomic.get head