pub struct TaskWaker { /* private fields */ }
Expand description
core
A handle for waking up a task by notifying its executor that it is ready to be run.
Re-exported from core
::task::
Waker
→TaskWaker
.
A Waker
is a handle for waking up a task by notifying its executor that it
is ready to be run.
This handle encapsulates a RawWaker
instance, which defines the
executor-specific wakeup behavior.
The typical life of a Waker
is that it is constructed by an executor, wrapped in a
Context
, then passed to Future::poll()
. Then, if the future chooses to return
Poll::Pending
, it must also store the waker somehow and call Waker::wake()
when
the future should be polled again.
Implements Clone
, Send
, and Sync
; therefore, a waker may be invoked
from any thread, including ones not in any way managed by the executor. For example,
this might be done to wake a future when a blocking function call completes on another
thread.
Note that it is preferable to use waker.clone_from(&new_waker)
instead
of *waker = new_waker.clone()
, as the former will avoid cloning the waker
unnecessarily if the two wakers wake the same task.
Constructing a Waker
from a RawWaker
is unsafe.
Implementing the Wake
trait is a safe alternative that requires memory allocation.
Implementations§
Source§impl Waker
impl Waker
1.36.0 · Sourcepub fn wake(self)
pub fn wake(self)
Wakes up the task associated with this Waker
.
As long as the executor keeps running and the task is not finished, it is
guaranteed that each invocation of wake()
(or
wake_by_ref()
) will be followed by at least one
poll()
of the task to which this Waker
belongs. This makes
it possible to temporarily yield to other tasks while running potentially
unbounded processing loops.
Note that the above implies that multiple wake-ups may be coalesced into a
single poll()
invocation by the runtime.
Also note that yielding to competing tasks is not guaranteed: it is the executor’s choice which task to run and the executor may choose to run the current task again.
1.36.0 · Sourcepub fn wake_by_ref(&self)
pub fn wake_by_ref(&self)
Wakes up the task associated with this Waker
without consuming the Waker
.
This is similar to wake()
, but may be slightly less efficient in
the case where an owned Waker
is available. This method should be preferred to
calling waker.clone().wake()
.
1.36.0 · Sourcepub fn will_wake(&self, other: &Waker) -> bool
pub fn will_wake(&self, other: &Waker) -> bool
Returns true
if this Waker
and another Waker
would awake the same task.
This function works on a best-effort basis, and may return false even
when the Waker
s would awaken the same task. However, if this function
returns true
, it is guaranteed that the Waker
s will awaken the same task.
This function is primarily used for optimization purposes — for example,
this type’s clone_from
implementation uses it to
avoid cloning the waker when they would wake the same task anyway.
1.83.0 (const: 1.83.0) · Sourcepub const unsafe fn new(
data: *const (),
vtable: &'static RawWakerVTable,
) -> Waker
pub const unsafe fn new( data: *const (), vtable: &'static RawWakerVTable, ) -> Waker
Creates a new Waker
from the provided data
pointer and vtable
.
The data
pointer can be used to store arbitrary data as required
by the executor. This could be e.g. a type-erased pointer to an Arc
that is associated with the task.
The value of this pointer will get passed to all functions that are part
of the vtable
as the first parameter.
It is important to consider that the data
pointer must point to a
thread safe type such as an Arc
.
The vtable
customizes the behavior of a Waker
. For each operation
on the Waker
, the associated function in the vtable
will be called.
§Safety
The behavior of the returned Waker
is undefined if the contract defined
in RawWakerVTable
’s documentation is not upheld.
(Authors wishing to avoid unsafe code may implement the Wake
trait instead, at the
cost of a required heap allocation.)
1.36.0 (const: 1.82.0) · Sourcepub const unsafe fn from_raw(waker: RawWaker) -> Waker
pub const unsafe fn from_raw(waker: RawWaker) -> Waker
Creates a new Waker
from RawWaker
.
§Safety
The behavior of the returned Waker
is undefined if the contract defined
in RawWaker
’s and RawWakerVTable
’s documentation is not upheld.
(Authors wishing to avoid unsafe code may implement the Wake
trait instead, at the
cost of a required heap allocation.)
1.85.0 (const: 1.85.0) · Sourcepub const fn noop() -> &'static Waker
pub const fn noop() -> &'static Waker
Returns a reference to a Waker
that does nothing when used.
This is mostly useful for writing tests that need a Context
to poll
some futures, but are not expecting those futures to wake the waker or
do not need to do anything specific if it happens.
More generally, using Waker::noop()
to poll a future
means discarding the notification of when the future should be polled again.
So it should only be used when such a notification will not be needed to make progress.
If an owned Waker
is needed, clone()
this one.
§Examples
use std::future::Future;
use std::task;
let mut cx = task::Context::from_waker(task::Waker::noop());
let mut future = Box::pin(async { 10 });
assert_eq!(future.as_mut().poll(&mut cx), task::Poll::Ready(10));
1.83.0 · Sourcepub fn vtable(&self) -> &'static RawWakerVTable
pub fn vtable(&self) -> &'static RawWakerVTable
Gets the vtable
pointer used to create this Waker
.
Trait Implementations§
Source§impl AsRef<LocalWaker> for Waker
impl AsRef<LocalWaker> for Waker
Source§fn as_ref(&self) -> &LocalWaker
fn as_ref(&self) -> &LocalWaker
1.36.0 · Source§impl Clone for Waker
impl Clone for Waker
Source§fn clone_from(&mut self, source: &Waker)
fn clone_from(&mut self, source: &Waker)
Assigns a clone of source
to self
, unless self.will_wake(source)
anyway.
This method is preferred over simply assigning source.clone()
to self
,
as it avoids cloning the waker if self
is already the same waker.
§Examples
use std::future::Future;
use std::pin::Pin;
use std::sync::{Arc, Mutex};
use std::task::{Context, Poll, Waker};
struct Waiter {
shared: Arc<Mutex<Shared>>,
}
struct Shared {
waker: Waker,
// ...
}
impl Future for Waiter {
type Output = ();
fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<()> {
let mut shared = self.shared.lock().unwrap();
// update the waker
shared.waker.clone_from(cx.waker());
// readiness logic ...
}
}
impl Send for Waker
impl Sync for Waker
impl Unpin for Waker
Auto Trait Implementations§
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.