hyperbridge 0.2.5

Fast multi-producer multi-consumer channel with async support
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
use crate::util::{Backoff, CachePadded};
use core::cell::UnsafeCell;
use core::mem::MaybeUninit;
use core::sync::atomic::Ordering::{AcqRel, Acquire, Relaxed, Release, SeqCst};
use core::sync::atomic::{fence, AtomicPtr, AtomicUsize};
use std::sync::Arc;
use std::{fmt, io};

// Slot states
const WRITE: usize = 1;
const READ: usize = 1 << 1;
const DESTROY: usize = 1 << 2;
// Read/Write round
const ROUND: usize = 64;
// Block capacity
const BLOCK_SIZE: usize = ROUND - 1;
// In a tail means that channel has been closed
const CLOSED_FLAG: usize = 1 << 63;
// In a head means head and tail are in a different blocks
const CROSSED_FLAG: usize = CLOSED_FLAG;

/// A place for storing a message
struct Slot<T> {
    state: AtomicUsize,
    message: UnsafeCell<MaybeUninit<T>>,
}

impl<T> fmt::Debug for Slot<T> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_struct("Slot")
            .field("state", &self.state.load(Acquire))
            .finish()
    }
}

/// A block in a linked list.
struct Block<T> {
    next: AtomicPtr<Block<T>>,
    slots: [Slot<T>; BLOCK_SIZE],
}

impl<T> Block<T> {
    /// Creates new empty block
    fn new() -> *mut Self {
        let block = unsafe { MaybeUninit::zeroed().assume_init() };
        Box::into_raw(Box::new(block))
    }

    /// Blocks current thread waiting the next block is set
    fn wait_next(&self) -> *mut Block<T> {
        let backoff = Backoff::new();
        loop {
            let next = self.next.load(Acquire);
            if !next.is_null() {
                return next;
            }
            backoff.spin();
        }
    }

    /// Stores new one allocated block inside `next`
    fn set_next(&self, next: *mut Block<T>) {
        let prev = self.next.swap(next, Release);
        debug_assert!(prev.is_null());
    }

    /// Returns block inside `next`
    fn get_next(&self) -> Option<*mut Block<T>> {
        let next = self.next.load(Acquire);
        if next.is_null() {
            return None;
        }
        Some(next)
    }

    /// Drop block if there are no readers using this block remains or leave dropping to a next thread
    fn destroy(this: *mut Block<T>, start: usize) {
        // we can skip marking the last block with DESTROY because it has started destroy process
        for i in start..BLOCK_SIZE - 1 {
            let slot = unsafe { (*this).slots.get_unchecked(i) };

            // set DESTROY bit if someone is still reading from this slot.
            if slot.state.load(Acquire) & READ == 0
                && slot.state.fetch_or(DESTROY, AcqRel) & READ == 0
            {
                // if someone is still using the slot, it will continue destruction of the block.
                return;
            }
        }

        // noone is using the block, now it is safe to destroy it.
        unsafe { drop(Box::from_raw(this)) };
    }
}

/// A pointer to a block/slot
#[derive(Debug)]
struct Cursor<T> {
    index: AtomicUsize,
    block: AtomicPtr<Block<T>>,
}

impl<T> Cursor<T> {
    fn from(block: *mut Block<T>) -> Self {
        Cursor {
            index: AtomicUsize::new(0),
            block: AtomicPtr::new(block),
        }
    }

    #[inline]
    fn slot<'a>(block: *mut Block<T>, index: usize) -> &'a Slot<T> {
        debug_assert!(index < BLOCK_SIZE);
        unsafe { (*block).slots.get_unchecked(index) }
    }
}

/// Unbounded channel
#[derive(Debug)]
struct Channel<T> {
    tail: CachePadded<Cursor<T>>,
    head: CachePadded<Cursor<T>>,
}

impl<T> Drop for Channel<T> {
    fn drop(&mut self) {
        // read all unread items to drop correctly
        while let Ok(Some(_)) = self.try_recv() {}

        let block = self.head.block.load(Acquire);

        // noone is using the block, now it is safe to destroy it.
        unsafe { drop(Box::from_raw(block)) };
    }
}

impl<T> Channel<T> {
    /// Creates new unbounded channel
    fn new() -> Channel<T> {
        let block = Block::<T>::new();
        Channel {
            tail: CachePadded::new(Cursor::from(block)),
            head: CachePadded::new(Cursor::from(block)),
        }
    }

    /// Try to send a message to a channel.
    /// Can not fail but when channel is closed
    #[inline]
    fn send(&self, msg: T) -> io::Result<()> {
        let backoff = Backoff::new();
        let mut tail = self.tail.index.load(Acquire);
        let mut block = self.tail.block.load(Acquire);

        loop {
            let index = tail & BLOCK_SIZE;

            // channel is closed
            if tail & CLOSED_FLAG == CLOSED_FLAG {
                return Err(io::Error::new(
                    io::ErrorKind::BrokenPipe,
                    "channel is closed",
                ));
            }

            // wait next block
            if index == BLOCK_SIZE {
                backoff.snooze();
                tail = self.tail.index.load(Acquire);
                block = self.tail.block.load(Acquire);
                continue;
            }

            // try to move tail forward
            match self
                .tail
                .index
                .compare_exchange_weak(tail, tail + 1, SeqCst, Relaxed)
            {
                Ok(_) => {
                    let slot = Cursor::slot(block, index);

                    // End of block, need to setup new one
                    if index + 1 == BLOCK_SIZE {
                        let next = Block::new();
                        self.tail.block.store(next, Release);
                        self.tail.index.fetch_add(1, Release);
                        unsafe { (*block).set_next(next) };
                    }

                    unsafe { slot.message.get().write(MaybeUninit::new(msg)) };
                    slot.state.fetch_or(WRITE, Release);
                    return Ok(());
                }
                Err(t) => {
                    tail = t;
                    block = self.tail.block.load(Acquire);
                    backoff.spin();
                }
            }
        }
    }

    /// Try to receive message from a channel.
    /// Can fail or return uncompleted.
    #[inline]
    fn try_recv(&self) -> io::Result<Option<T>> {
        let backoff = Backoff::new();
        let mut head = self.head.index.load(Acquire);
        let mut block = self.head.block.load(Acquire);

        loop {
            let index = head & BLOCK_SIZE;

            // wait next block
            if index == BLOCK_SIZE {
                backoff.snooze();
                head = self.head.index.load(Acquire);
                block = self.head.block.load(Acquire);
                continue;
            }

            let mut new_head = head + 1;

            // head and tail are in the same block
            if head & CROSSED_FLAG == 0 {
                fence(SeqCst);
                let tail = self.tail.index.load(Relaxed);

                // Nothing to read
                if head == tail & !CLOSED_FLAG {
                    // channel is closed
                    if tail & CLOSED_FLAG != 0 {
                        return Err(io::Error::new(
                            io::ErrorKind::BrokenPipe,
                            "channel is closed",
                        ));
                    }

                    return Ok(None);
                }

                // mark head that it is in a different blocks with tail
                if head / ROUND != (tail & !CLOSED_FLAG) / ROUND {
                    new_head |= CROSSED_FLAG;
                }
            }

            // try to move head forward
            match self
                .head
                .index
                .compare_exchange_weak(head, new_head, SeqCst, Relaxed)
            {
                Ok(_) => unsafe {
                    // last slot in a block
                    if index + 1 == BLOCK_SIZE {
                        let next_block = (*block).wait_next();
                        if (*next_block).get_next().is_some() {
                            new_head |= CROSSED_FLAG;
                        } else {
                            new_head &= !CROSSED_FLAG;
                        }
                        self.head.block.store(next_block, Release);
                        self.head.index.store(new_head + 1, Release);
                    }

                    let slot = Cursor::slot(block, index);

                    // wait until write operation completes
                    while slot.state.load(Acquire) & WRITE == 0 {
                        backoff.spin();
                    }

                    let msg = slot.message.get().read().assume_init();

                    // this is the last block, so start destroying it
                    if index + 1 == BLOCK_SIZE {
                        Block::destroy(block, 0);
                    }
                    // someone started block destroy
                    else if slot.state.fetch_or(READ, AcqRel) & DESTROY != 0 {
                        Block::destroy(block, index + 1);
                    }

                    return Ok(Some(msg));
                },

                Err(h) => {
                    head = h;
                    block = self.head.block.load(Acquire);
                    backoff.spin();
                }
            }
        }
    }

    /// Check if there are no mesages in a channel
    #[inline]
    fn is_empty(&self) -> bool {
        let head = self.head.index.load(SeqCst);
        let tail = self.tail.index.load(SeqCst);
        head & !CROSSED_FLAG == tail & !CLOSED_FLAG
    }

    // Closes a channel
    #[inline]
    fn close(&self) {
        self.tail.index.fetch_or(CLOSED_FLAG, AcqRel);
    }
}

// Helpers struct holds together receivers and senders rc's
// for handling drops of each side of channel (all senders or all receivers)
// and calling close on entire channel for that
pub(crate) struct Counters {
    pub(crate) receivers: AtomicUsize,
    pub(crate) senders: AtomicUsize,
}

/// Tx handle to a channel. Can be cloned
pub struct Sender<T> {
    chan: Arc<Channel<T>>,
    pub(crate) cnts: Arc<Counters>,
}

impl<T: fmt::Debug> fmt::Debug for Sender<T> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "{:?}", self.chan)
    }
}

impl<T> Sender<T> {
    #[inline]
    pub fn send(&self, item: T) -> io::Result<()> {
        self.chan.send(item)
    }

    #[inline]
    pub fn is_empty(&self) -> bool {
        self.chan.is_empty()
    }

    pub fn close(&self) {
        self.chan.close()
    }

    pub fn receiver(&self) -> Receiver<T> {
        self.cnts.receivers.fetch_add(1, SeqCst);
        Receiver {
            chan: Arc::clone(&self.chan),
            cnts: self.cnts.clone(),
        }
    }
}

impl<T> Clone for Sender<T> {
    fn clone(&self) -> Self {
        self.cnts.senders.fetch_add(1, SeqCst);
        Sender {
            chan: Arc::clone(&self.chan),
            cnts: self.cnts.clone(),
        }
    }
}

impl<T> Drop for Sender<T> {
    fn drop(&mut self) {
        let senders = self.cnts.senders.fetch_sub(1, SeqCst);
        // if it was the last sender - close channel
        if senders == 1 {
            self.chan.close();
        }
    }
}

unsafe impl<T> Send for Sender<T> {}

/// Rx handle to a channel. Can be cloned
pub struct Receiver<T> {
    chan: Arc<Channel<T>>,
    pub(crate) cnts: Arc<Counters>,
}

impl<T> Receiver<T> {
    #[inline]
    pub fn try_recv(&self) -> io::Result<Option<T>> {
        self.chan.try_recv()
    }

    pub fn sender(&self) -> Sender<T> {
        self.cnts.senders.fetch_add(1, SeqCst);
        Sender {
            chan: Arc::clone(&self.chan),
            cnts: self.cnts.clone(),
        }
    }
}

impl<T> Clone for Receiver<T> {
    fn clone(&self) -> Self {
        self.cnts.receivers.fetch_add(1, SeqCst);
        Receiver {
            chan: Arc::clone(&self.chan),
            cnts: self.cnts.clone(),
        }
    }
}

impl<T> Drop for Receiver<T> {
    fn drop(&mut self) {
        let receivers = self.cnts.receivers.fetch_sub(1, SeqCst);
        // if it was the last receiver - close channel
        if receivers == 1 {
            self.chan.close();
        }
    }
}

unsafe impl<T> Send for Receiver<T> {}

/// Creates a new channel and splits it ro a Tx, Rx pair
pub fn new<T>() -> (Sender<T>, Receiver<T>) {
    let chan = Arc::new(Channel::new());
    let cnts = Arc::new(Counters {
        receivers: AtomicUsize::new(1),
        senders: AtomicUsize::new(1),
    });
    let tx = Sender {
        chan: chan.clone(),
        cnts: cnts.clone(),
    };
    let rx = Receiver {
        chan: chan.clone(),
        cnts: cnts,
    };
    (tx, rx)
}