nexus-slot 1.1.2

High-performance conflation slots (SPSC + SPMC) for latest-value-wins scenarios
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
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
//! Single-producer, multiple-consumer conflation slot.
//!
//! Same seqlock design as [`spsc`](crate::spsc), but the reader is `Clone`.
//! Each clone maintains independent consumption state — all readers see
//! every write (unless conflated by a subsequent write before they read).
//!
//! Writer disconnect detection uses an explicit flag rather than reference
//! counting, since multiple readers make `Arc::strong_count` ambiguous
//! for that check.
//!
//! # Example
//!
//! ```rust
//! let (mut writer, mut reader1) = nexus_slot::spmc::shared_slot::<u64>();
//! let mut reader2 = reader1.clone();
//!
//! writer.write(42);
//!
//! // Both readers see the value independently
//! assert_eq!(reader1.read(), Some(42));
//! assert_eq!(reader2.read(), Some(42));
//!
//! // Both consumed — returns None until next write
//! assert!(reader1.read().is_none());
//! assert!(reader2.read().is_none());
//! ```

use std::cell::UnsafeCell;
use std::fmt;
use std::mem::MaybeUninit;
use std::sync::Arc;
use std::sync::atomic::{AtomicBool, AtomicUsize, Ordering, fence};

use crate::{Pod, atomic_load, atomic_store};

/// Shared state between writer and readers.
#[repr(C)]
struct Inner<T> {
    /// Sequence number. Odd = write in progress, even = stable, 0 = never written.
    seq: AtomicUsize,
    /// Set to `false` when the writer is dropped.
    writer_alive: AtomicBool,
    data: UnsafeCell<MaybeUninit<T>>,
}

unsafe impl<T: Send> Send for Inner<T> {}
unsafe impl<T: Send> Sync for Inner<T> {}

/// The writing half of a shared conflated slot.
pub struct Writer<T> {
    local_seq: usize,
    inner: Arc<Inner<T>>,
}

unsafe impl<T: Send> Send for Writer<T> {}

/// The reading half of a shared conflated slot.
///
/// `Clone` creates an independent reader starting from the same consumption
/// position as the original. Each reader tracks its own "last seen" sequence
/// and consumes writes independently.
pub struct SharedReader<T> {
    cached_seq: usize,
    inner: Arc<Inner<T>>,
}

unsafe impl<T: Send> Send for SharedReader<T> {}

impl<T> Clone for SharedReader<T> {
    fn clone(&self) -> Self {
        Self {
            cached_seq: self.cached_seq,
            inner: Arc::clone(&self.inner),
        }
    }
}

/// Creates a new SPMC conflated slot.
///
/// Returns a `(Writer, SharedReader)` pair. The reader can be cloned
/// for multiple consumers.
pub fn shared_slot<T: Pod>() -> (Writer<T>, SharedReader<T>) {
    const {
        assert!(
            !std::mem::needs_drop::<T>(),
            "Pod types must not require drop"
        );
    };

    // Start at 2 instead of 0 so that wrapping on 32-bit never hits
    // 0 (the "never written" sentinel). See spsc.rs for detailed rationale.
    let inner = Arc::new(Inner {
        seq: AtomicUsize::new(2),
        writer_alive: AtomicBool::new(true),
        data: UnsafeCell::new(MaybeUninit::uninit()),
    });

    (
        Writer {
            local_seq: 2,
            inner: Arc::clone(&inner),
        },
        SharedReader {
            cached_seq: 2,
            inner,
        },
    )
}

impl<T: Pod> Writer<T> {
    /// Writes a value, overwriting any previous.
    ///
    /// Never blocks. If any reader is mid-read, they detect and retry.
    #[inline]
    pub fn write(&mut self, value: T) {
        let inner = &*self.inner;
        let seq = self.local_seq;

        // Odd = write in progress
        inner.seq.store(seq.wrapping_add(1), Ordering::Relaxed);
        fence(Ordering::Release);

        // SAFETY: Same as spsc::Writer::write — sole writer, data accessed
        // through word-at-a-time atomics, no references created.
        unsafe { atomic_store(inner.data.get().cast::<T>(), &value) };

        fence(Ordering::Release);
        self.local_seq = seq.wrapping_add(2);
        inner.seq.store(self.local_seq, Ordering::Relaxed);
    }

    /// Returns `true` if all readers have been dropped.
    #[inline]
    pub fn is_disconnected(&self) -> bool {
        Arc::strong_count(&self.inner) == 1
    }
}

impl<T> Drop for Writer<T> {
    fn drop(&mut self) {
        self.inner.writer_alive.store(false, Ordering::Release);
    }
}

impl<T: Pod> fmt::Debug for Writer<T> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_struct("Writer")
            .field("seq", &self.local_seq)
            .finish_non_exhaustive()
    }
}

impl<T: Pod> SharedReader<T> {
    /// Reads the latest value if new data is available.
    ///
    /// Returns `Some(value)` if a new write occurred since the last read.
    /// Returns `None` if no value has been written or the current value
    /// was already consumed by this reader.
    ///
    /// Each cloned reader consumes independently — one reader's `read()`
    /// does not affect another's.
    #[inline]
    pub fn read(&mut self) -> Option<T> {
        let inner = &*self.inner;

        loop {
            let seq1 = inner.seq.load(Ordering::Relaxed);

            // Never written or already consumed
            if seq1 == 0 || seq1 == self.cached_seq {
                return None;
            }

            // Write in progress
            if seq1 & 1 != 0 {
                core::hint::spin_loop();
                continue;
            }

            fence(Ordering::Acquire);

            // SAFETY: Same as spsc::Reader::read.
            let value = unsafe { atomic_load(inner.data.get().cast::<T>()) };

            fence(Ordering::Acquire);
            let seq2 = inner.seq.load(Ordering::Relaxed);

            if seq1 == seq2 {
                self.cached_seq = seq1;
                return Some(value);
            }

            // Torn read, retry
            core::hint::spin_loop();
        }
    }

    /// Read with version tracking for conflation detection.
    ///
    /// See [`spsc::Reader::read_versioned`](crate::spsc::Reader::read_versioned)
    /// for details. Each cloned reader tracks versions independently.
    #[inline]
    pub fn read_versioned(&mut self) -> Option<(T, u64)> {
        let inner = &*self.inner;

        loop {
            let seq1 = inner.seq.load(Ordering::Relaxed);

            if seq1 == 0 || seq1 == self.cached_seq {
                return None;
            }

            if seq1 & 1 != 0 {
                core::hint::spin_loop();
                continue;
            }

            fence(Ordering::Acquire);

            // SAFETY: Same as spsc::Reader::read_versioned.
            let value = unsafe { atomic_load(inner.data.get().cast::<T>()) };

            fence(Ordering::Acquire);
            let seq2 = inner.seq.load(Ordering::Relaxed);

            if seq1 == seq2 {
                self.cached_seq = seq1;
                return Some((value, seq1 as u64 / 2));
            }

            core::hint::spin_loop();
        }
    }

    /// Checks if new data is available without consuming it.
    ///
    /// Returns `true` if [`read()`](Self::read) would return `Some`.
    #[inline]
    pub fn has_update(&self) -> bool {
        let seq = self.inner.seq.load(Ordering::Relaxed);
        seq != 0 && seq != self.cached_seq && seq & 1 == 0
    }

    /// Returns `true` if the writer has been dropped.
    #[inline]
    pub fn is_disconnected(&self) -> bool {
        !self.inner.writer_alive.load(Ordering::Acquire)
    }
}

impl<T: Pod> fmt::Debug for SharedReader<T> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_struct("SharedReader")
            .field("cached_seq", &self.cached_seq)
            .finish_non_exhaustive()
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[derive(Clone, Default, PartialEq, Debug)]
    #[repr(C)]
    struct TestData {
        a: u64,
        b: u64,
    }

    unsafe impl Pod for TestData {}

    // ========================================================================
    // Basic Semantics (same as SPSC)
    // ========================================================================

    #[test]
    fn read_before_write_returns_none() {
        let (_, mut reader) = shared_slot::<TestData>();
        assert!(reader.read().is_none());
    }

    #[test]
    fn read_consumes_value() {
        let (mut writer, mut reader) = shared_slot::<TestData>();

        writer.write(TestData { a: 1, b: 2 });
        assert_eq!(reader.read(), Some(TestData { a: 1, b: 2 }));
        assert!(reader.read().is_none());
    }

    #[test]
    fn multiple_writes_conflate() {
        let (mut writer, mut reader) = shared_slot::<TestData>();

        writer.write(TestData { a: 1, b: 0 });
        writer.write(TestData { a: 2, b: 0 });
        writer.write(TestData { a: 3, b: 0 });

        assert_eq!(reader.read(), Some(TestData { a: 3, b: 0 }));
        assert!(reader.read().is_none());
    }

    #[test]
    fn has_update_does_not_consume() {
        let (mut writer, mut reader) = shared_slot::<TestData>();

        assert!(!reader.has_update());
        writer.write(TestData { a: 1, b: 0 });
        assert!(reader.has_update());
        assert!(reader.has_update());
        reader.read();
        assert!(!reader.has_update());
    }

    // ========================================================================
    // Multi-Reader
    // ========================================================================

    #[test]
    fn two_readers_independent_consumption() {
        let (mut writer, mut reader1) = shared_slot::<u64>();
        let mut reader2 = reader1.clone();

        writer.write(42);

        // Both see it
        assert_eq!(reader1.read(), Some(42));
        assert_eq!(reader2.read(), Some(42));

        // Both consumed
        assert!(reader1.read().is_none());
        assert!(reader2.read().is_none());
    }

    #[test]
    fn clone_after_read_starts_at_parent_position() {
        let (mut writer, mut reader1) = shared_slot::<u64>();

        writer.write(1);
        assert_eq!(reader1.read(), Some(1));

        // Clone after consuming — clone has same cached_seq
        let mut reader2 = reader1.clone();

        // Neither sees old value
        assert!(reader1.read().is_none());
        assert!(reader2.read().is_none());

        // New write — both see it
        writer.write(2);
        assert_eq!(reader1.read(), Some(2));
        assert_eq!(reader2.read(), Some(2));
    }

    #[test]
    fn clone_before_read_both_see_value() {
        let (mut writer, mut reader1) = shared_slot::<u64>();
        let mut reader2 = reader1.clone();

        writer.write(99);

        assert_eq!(reader1.read(), Some(99));
        assert_eq!(reader2.read(), Some(99));
    }

    #[test]
    fn reader1_consumes_reader2_unaffected() {
        let (mut writer, mut reader1) = shared_slot::<u64>();
        let mut reader2 = reader1.clone();

        writer.write(10);

        // reader1 consumes
        assert_eq!(reader1.read(), Some(10));
        assert!(reader1.read().is_none());

        // reader2 still sees it
        assert!(reader2.has_update());
        assert_eq!(reader2.read(), Some(10));
    }

    #[test]
    fn many_readers() {
        let (mut writer, reader) = shared_slot::<u64>();
        let mut readers: Vec<_> = (0..10).map(|_| reader.clone()).collect();
        drop(reader);

        writer.write(42);

        for r in &mut readers {
            assert_eq!(r.read(), Some(42));
        }
    }

    // ========================================================================
    // Disconnection
    // ========================================================================

    #[test]
    fn writer_detects_all_readers_dropped() {
        let (writer, reader1) = shared_slot::<TestData>();
        let reader2 = reader1.clone();

        assert!(!writer.is_disconnected());
        drop(reader1);
        assert!(!writer.is_disconnected()); // reader2 still alive
        drop(reader2);
        assert!(writer.is_disconnected());
    }

    #[test]
    fn reader_detects_writer_dropped() {
        let (writer, reader) = shared_slot::<TestData>();
        assert!(!reader.is_disconnected());
        drop(writer);
        assert!(reader.is_disconnected());
    }

    #[test]
    fn cloned_reader_detects_writer_dropped() {
        let (writer, reader1) = shared_slot::<TestData>();
        let reader2 = reader1.clone();

        drop(writer);

        assert!(reader1.is_disconnected());
        assert!(reader2.is_disconnected());
    }

    #[test]
    fn can_read_after_writer_disconnect() {
        let (mut writer, mut reader) = shared_slot::<TestData>();

        writer.write(TestData { a: 42, b: 0 });
        drop(writer);

        assert!(reader.is_disconnected());
        assert_eq!(reader.read(), Some(TestData { a: 42, b: 0 }));
    }

    // ========================================================================
    // Cross-Thread
    // ========================================================================

    #[test]
    fn cross_thread_two_readers() {
        use std::thread;

        let (mut writer, mut reader1) = shared_slot::<u64>();
        let mut reader2 = reader1.clone();

        let h1 = thread::spawn(move || {
            let mut last = 0;
            loop {
                if reader1.is_disconnected() && !reader1.has_update() {
                    break;
                }
                if let Some(v) = reader1.read() {
                    assert!(v >= last, "reader1: monotonicity violation");
                    last = v;
                }
            }
            last
        });

        let h2 = thread::spawn(move || {
            let mut last = 0;
            loop {
                if reader2.is_disconnected() && !reader2.has_update() {
                    break;
                }
                if let Some(v) = reader2.read() {
                    assert!(v >= last, "reader2: monotonicity violation");
                    last = v;
                }
            }
            last
        });

        for i in 0..100_000u64 {
            writer.write(i);
        }
        drop(writer);

        let last1 = h1.join().unwrap();
        let last2 = h2.join().unwrap();

        assert_eq!(last1, 99_999);
        assert_eq!(last2, 99_999);
    }

    #[test]
    fn cross_thread_data_integrity() {
        use std::thread;

        #[derive(Clone)]
        #[repr(C)]
        struct Checkable {
            value: u64,
            check: u64,
        }
        unsafe impl Pod for Checkable {}

        let (mut writer, mut reader1) = shared_slot::<Checkable>();
        let mut reader2 = reader1.clone();

        let h1 = thread::spawn(move || {
            loop {
                if reader1.is_disconnected() && !reader1.has_update() {
                    break;
                }
                if let Some(data) = reader1.read() {
                    assert_eq!(data.check, !data.value, "reader1: torn read!");
                }
            }
        });

        let h2 = thread::spawn(move || {
            loop {
                if reader2.is_disconnected() && !reader2.has_update() {
                    break;
                }
                if let Some(data) = reader2.read() {
                    assert_eq!(data.check, !data.value, "reader2: torn read!");
                }
            }
        });

        for i in 0..100_000u64 {
            writer.write(Checkable {
                value: i,
                check: !i,
            });
        }
        drop(writer);

        h1.join().unwrap();
        h2.join().unwrap();
    }
}