Struct futures_util::stream::futures_unordered::task::Task

pub(super) struct Task<Fut> {
    pub(super) future: UnsafeCell<Option<Fut>>,
    pub(super) next_all: AtomicPtr<Task<Fut>>,
    pub(super) prev_all: UnsafeCell<*const Task<Fut>>,
    pub(super) len_all: UnsafeCell<usize>,
    pub(super) next_ready_to_run: AtomicPtr<Task<Fut>>,
    pub(super) ready_to_run_queue: Weak<ReadyToRunQueue<Fut>>,
    pub(super) queued: AtomicBool,
    pub(super) woken: AtomicBool,
}

Fields

future: UnsafeCell<Option<Fut>>

next_all: AtomicPtr<Task<Fut>>

prev_all: UnsafeCell<*const Task<Fut>>

len_all: UnsafeCell<usize>

next_ready_to_run: AtomicPtr<Task<Fut>>

ready_to_run_queue: Weak<ReadyToRunQueue<Fut>>

queued: AtomicBool

woken: AtomicBool

Implementations

impl<Fut> Task<Fut>

pub(super) unsafe fn waker_ref(this: &Arc<Self>) -> WakerRef<'_>

Returns a waker reference for this task without cloning the Arc.

pub(super) fn spin_next_all( &self, pending_next_all: *mut Self, ordering: Ordering, ) -> *const Self

Spins until next_all is no longer set to pending_next_all.

The temporary pending_next_all value is typically overwritten fairly quickly after a node is inserted into the list of all futures, so this should rarely spin much.

When it returns, the correct next_all value is returned.

Relaxed or Acquire ordering can be used. Acquire ordering must be used before len_all can be safely read.

Trait Implementations

impl<Fut> ArcWake for Task<Fut>

fn wake_by_ref(arc_self: &Arc<Self>)

Indicates that the associated task is ready to make progress and should be polled.

fn wake(self: Arc<Self>)

Indicates that the associated task is ready to make progress and should be polled.

impl<Fut> Drop for Task<Fut>

fn drop(&mut self)

Executes the destructor for this type.

impl<Fut> Send for Task<Fut>

impl<Fut> Sync for Task<Fut>