Struct TaskQueueSuper 

pub struct TaskQueueSuper<const N: usize> { /* private fields */ }

Implementations

impl<const N: usize> TaskQueueSuper<N>

pub const MOD_N_MASK: usize

pub const fn max_elems() -> usize

Maximum number of elements allowed in the queue. This is two less than the actual queue size, so that a full queue can be distinguished from underflow involving pop_local and concurrent pop_global operations in GenericTaskQueue.

pub const fn dirty_size(bot: usize, top: usize) -> usize

pub const fn clean_size(bot: usize, top: usize) -> usize

pub const fn assert_not_underflow(dirty_size: usize)

pub const fn increment_index(ind: usize) -> usize

pub const fn decrement_index(ind: usize) -> usize

pub fn age_top_relaxed(&self) -> Idx

pub fn cmpxchg_age(&self, old_age: Age, new_age: Age) -> Age

pub fn set_age_relaxed(&self, new_age: Age)

pub fn release_set_bottom(&self, new_bottom: usize)

pub fn set_bottom_relaxed(&self, new_bottom: usize)

pub fn bottom_acquire(&self) -> usize

pub fn bottom_relaxed(&self) -> usize

pub const fn new() -> Self

pub fn assert_empty(&self)

pub fn is_empty(&self) -> bool

pub fn size(&self) -> usize

Return an estimate of the number of elements in the queue. Treats pop_local/pop_global race that underflows as empty.

pub fn set_empty(&self)

pub fn age_relaxed(&self) -> Age