Struct SpscQueue 

pub struct SpscQueue {
    buffer: Vec<Mutex<Option<MessageEnvelope>>>,
    capacity: usize,
    mask: usize,
    head: AtomicU64,
    tail: AtomicU64,
    stats: QueueStatsInner,
}

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

This implementation is optimized for the common case of one producer (host) and one consumer (GPU kernel).

Fields

buffer: Vec<Mutex<Option<MessageEnvelope>>>

Ring buffer storage.

capacity: usize

Capacity (power of 2).

mask: usize

Mask for index wrapping.

head: AtomicU64

Head pointer (producer writes here).

tail: AtomicU64

Tail pointer (consumer reads from here).

stats: QueueStatsInner

Statistics.

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.

fn depth(&self) -> u64

Get current depth.

fn update_max_depth(&self)

Update max depth statistic.

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.