Struct SpscQueue 

pub struct SpscQueue { /* private fields */ }

Single-producer single-consumer lock-free ring buffer.

This implementation is truly lock-free: no mutexes, no blocking. It uses atomic head/tail pointers with acquire/release ordering. Since SPSC has exactly one producer and one consumer, no CAS is needed — ordered loads and stores are sufficient.

Memory Ordering

• Producer: writes data, then Release-stores head (publishes the write)
• Consumer: Acquire-loads head (observes the write), reads data, then Release-stores tail
• This matches the GPU-side H2K/K2H queue protocol (volatile + fence)

Implementations

impl SpscQueue

pub fn new(capacity: usize) -> Self

Create a new queue with the given capacity.

Capacity will be rounded up to the next power of 2.

Trait Implementations

impl MessageQueue for SpscQueue

fn capacity(&self) -> usize

Get the queue capacity.

fn len(&self) -> usize

Get current queue size.

fn try_enqueue(&self, envelope: MessageEnvelope) -> Result<()>

Try to enqueue a message envelope.

fn try_dequeue(&self) -> Result<MessageEnvelope>

Try to dequeue a message envelope.

fn stats(&self) -> QueueStats

Get queue statistics.

fn reset_stats(&self)

Reset queue statistics.

fn is_empty(&self) -> bool

Check if queue is empty.

fn is_full(&self) -> bool

Check if queue is full.

impl Send for SpscQueue

impl Sync for SpscQueue