parkring 0.4.0

Bounded MPMC queues (Vyukov and SCQ), a Chase-Lev work-stealing deque and a work-stealing thread pool, with futex-based parking, verified with loom and Miri.
Documentation 
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154

//! Every item is dropped exactly once: by the consumer that pops it, by the
//! caller that gets it back in an error, or by the queue's own `Drop`.
#![allow(clippy::cast_possible_truncation)] // small test counts

mod common;

use std::sync::Arc;
use std::thread;

use common::drop_counter::{DropStats, Tracked};
use common::{TestQueue, scale};
use parkring::{BlockingQueue, LockFreeQueue, ScqQueue};

fn empty_queue_drops_nothing<Q: TestQueue<Tracked>>() {
    let stats = DropStats::new();
    drop(Q::with_capacity(8));
    assert_eq!(stats.created(), 0);
}

fn partially_full_queue_drops_its_items<Q: TestQueue<Tracked>>() {
    let stats = DropStats::new();
    let q = Q::with_capacity(8);
    for i in 0..5 {
        q.push(Tracked::new(i, &stats)).unwrap();
    }
    drop(q.pop().unwrap());
    assert_eq!(stats.live(), 4);
    drop(q);
    assert_eq!(stats.live(), 0);
    assert_eq!(stats.dropped(), 5);
}

/// After several laps the live items straddle the end of the ring, so `Drop`
/// must follow head..tail rather than scanning slots.
fn wrapped_queue_drops_exactly_live_items<Q: TestQueue<Tracked>>() {
    let stats = DropStats::new();
    let q = Q::with_capacity(4);
    let cap = q.capacity() as u64;
    for lap in 0..3 {
        for i in 0..cap {
            q.push(Tracked::new(lap * 100 + i, &stats)).unwrap();
        }
        for _ in 0..cap {
            drop(q.pop().unwrap());
        }
    }
    for i in 0..cap - 1 {
        q.push(Tracked::new(i, &stats)).unwrap();
    }
    drop(q.pop().unwrap());
    q.push(Tracked::new(999, &stats)).unwrap();
    assert_eq!(stats.live(), cap as usize - 1);
    drop(q);
    assert_eq!(stats.live(), 0);
}

fn rejected_items_are_returned_not_dropped<Q: TestQueue<Tracked>>() {
    let stats = DropStats::new();
    let q = Q::with_capacity(1);
    for i in 0..q.capacity() as u64 {
        q.push(Tracked::new(i, &stats)).unwrap();
    }
    let rejected = q
        .try_push(Tracked::new(42, &stats))
        .unwrap_err()
        .into_inner();
    assert_eq!(rejected.id, 42);
    assert_eq!(stats.dropped(), 0);
    drop(rejected);
    q.close();
    let rejected = q.push(Tracked::new(43, &stats)).unwrap_err().into_inner();
    assert_eq!(rejected.id, 43);
    assert_eq!(stats.dropped(), 1);
    drop((rejected, q));
    assert_eq!(stats.live(), 0);
}

fn closed_queue_with_items_drops_them<Q: TestQueue<Tracked>>() {
    let stats = DropStats::new();
    let q = Q::with_capacity(8);
    for i in 0..6 {
        q.push(Tracked::new(i, &stats)).unwrap();
    }
    q.close();
    drop(q.pop().unwrap());
    drop(q);
    assert_eq!(stats.live(), 0);
    assert_eq!(stats.dropped(), 6);
}

fn concurrent_run_leaves_nothing_behind<Q: TestQueue<Tracked>>() {
    let stats = DropStats::new();
    let q = Arc::new(Q::with_capacity(8));
    let per = scale(2000) as u64;
    thread::scope(|s| {
        for p in 0..3 {
            let (q, stats) = (&q, &stats);
            s.spawn(move || {
                for i in 0..per {
                    q.push(Tracked::new(p * per + i, stats)).unwrap();
                }
            });
        }
        for _ in 0..2 {
            let q = &q;
            s.spawn(move || {
                // Leave a few items in the queue for Drop to clean up.
                for _ in 0..(3 * per - 5) / 2 {
                    drop(q.pop().unwrap());
                }
            });
        }
    });
    assert_eq!(stats.created(), 3 * per as usize);
    assert_eq!(stats.live(), q.len());
    drop(q);
    assert_eq!(stats.live(), 0);
}

macro_rules! drop_tests {
    ($module:ident, $Q:ident) => {
        mod $module {
            use super::*;
            #[test]
            fn empty_queue_drops_nothing() {
                super::empty_queue_drops_nothing::<$Q<Tracked>>();
            }
            #[test]
            fn partially_full_queue_drops_its_items() {
                super::partially_full_queue_drops_its_items::<$Q<Tracked>>();
            }
            #[test]
            fn wrapped_queue_drops_exactly_live_items() {
                super::wrapped_queue_drops_exactly_live_items::<$Q<Tracked>>();
            }
            #[test]
            fn rejected_items_are_returned_not_dropped() {
                super::rejected_items_are_returned_not_dropped::<$Q<Tracked>>();
            }
            #[test]
            fn closed_queue_with_items_drops_them() {
                super::closed_queue_with_items_drops_them::<$Q<Tracked>>();
            }
            #[test]
            fn concurrent_run_leaves_nothing_behind() {
                super::concurrent_run_leaves_nothing_behind::<$Q<Tracked>>();
            }
        }
    };
}

drop_tests!(lockfree, LockFreeQueue);
drop_tests!(blocking, BlockingQueue);
drop_tests!(scq, ScqQueue);