ShardedQueueShardedQueue is needed for some schedulers and NonBlockingMutex to store and retrieve data concurrently in the most efficient way
ShardedQueue is a light-weight concurrent queue, which uses spin locking and fights lock contention with sharding
Notice that while it may seem that FIFO order is guaranteed, it is not, because there can be a situation, when multiple consumers or producers triggered long resize of very large shards, all but last, then passed enough time for resize to finish, then 1 consumer or producer triggers long resize of last shard, and all other threads start to consume or produce, and eventually start spinning on last shard, without guarantee which will acquire spin lock first, so we can't even guarantee that ShardedQueue::pop_front_or_spin will acquire lock before ShardedQueue::push_back on first attempt
Notice that this queue doesn't track length, since length's increment/decrement logic may change depending on use case, as well as logic when it goes from 1 to 0 or reverse(in some cases, like NonBlockingMutex, we don't even add action to queue when count reaches 1, but run it immediately in same thread), or even negative(to optimize some hot paths, like in some schedulers, since it is cheaper to restore count to correct state than to enforce that it can not go negative in some schedulers)
```rust use sharded_queue::ShardedQueue; use std::cell::UnsafeCell; use std::fmt::{Debug, Display, Formatter}; use std::marker::PhantomData; use std::ops::{Deref, DerefMut}; use std::sync::atomic::{AtomicUsize, Ordering};
pub struct NonBlockingMutex<'capturedvariables, State: ?Sized> {
taskcount: AtomicUsize,
taskqueue: ShardedQueue
/// [NonBlockingMutex] is needed to run actions atomically without thread blocking, or context /// switch, or spin lock contention, or rescheduling on some scheduler /// /// Notice that it uses [ShardedQueue] which doesn't guarantee order of retrieval, hence /// [NonBlockingMutex] doesn't guarantee order of execution too, even of already added /// items impl<'capturedvariables, State> NonBlockingMutex<'capturedvariables, State> { #[inline] pub fn new(maxconcurrentthreadcount: usize, state: State) -> Self { Self { taskcount: AtomicUsize::new(0), taskqueue: ShardedQueue::new(maxconcurrentthreadcount), unsafe_state: UnsafeCell::new(state), } }
/// Please don't forget that order of execution is not guaranteed. Atomicity of operations is guaranteed,
/// but order can be random
#[inline]
pub fn run_if_first_or_schedule_on_first(
&self,
run_with_state: impl FnOnce(MutexGuard<State>) + Send + 'captured_variables,
) {
if self.task_count.fetch_add(1, Ordering::Acquire) != 0 {
self.task_queue.push_back(Box::new(run_with_state));
} else {
// If we acquired first lock, run should be executed immediately and run loop started
run_with_state(unsafe { MutexGuard::new(self) });
/// Note that if [`fetch_sub`] != 1
/// => some thread entered first if block in method
/// => [ShardedQueue::push_back] is guaranteed to be called
/// => [ShardedQueue::pop_front_or_spin] will not deadlock while spins until it gets item
///
/// Notice that we run action first, and only then decrement count
/// with releasing(pushing) memory changes, even if it looks otherwise
while self.task_count.fetch_sub(1, Ordering::Release) != 1 {
self.task_queue.pop_front_or_spin()(unsafe { MutexGuard::new(self) });
}
}
}
}
/// [Send], [Sync], and [MutexGuard] logic was taken from [std::sync::Mutex]
/// and [std::sync::MutexGuard]
///
/// these are the only places where T: Send matters; all other
/// functionality works fine on a single thread.
unsafe impl<'capturedvariables, State: ?Sized + Send> Send
for NonBlockingMutex<'capturedvariables, State>
{
}
unsafe impl<'capturedvariables, State: ?Sized + Send> Sync
for NonBlockingMutex<'capturedvariables, State>
{
}
/// Code was mostly taken from [std::sync::MutexGuard], it is expected to protect [State] /// from moving out of synchronized loop pub struct MutexGuard< 'capturedvariables, 'nonblockingmutexref, State: ?Sized + 'nonblockingmutex_ref,