| commit | ebae16c6f4c5f0553439c7e6b8084434f062671f | [log] [tgz] |
|---|---|---|
| author | Android Build Coastguard Worker <[email protected]> | Tue May 10 06:56:30 2022 +0000 |
| committer | Android Build Coastguard Worker <[email protected]> | Tue May 10 06:56:30 2022 +0000 |
| tree | a8c0195dcd49ed82252eacb02eecc46b2bc3cc63 | |
| parent | 3b9ccd1daed9870e484cf8921cf349713d62d11b [diff] | |
| parent | de861550982f984d861521fdde94390d4eb60003 [diff] |
Snap for 8564071 from de861550982f984d861521fdde94390d4eb60003 to mainline-cellbroadcast-release Change-Id: I0aaa4aa5e306cc40d9de7ef989adeaab03204b7d
Task abstraction for building executors.
To spawn a future onto an executor, we first need to allocate it on the heap and keep some state attached to it. The state indicates whether the future is ready for polling, waiting to be woken up, or completed. Such a stateful future is called a task.
All executors have a queue that holds scheduled tasks:
let (sender, receiver) = flume::unbounded();
A task is created using either spawn(), spawn_local(), or spawn_unchecked() which return a Runnable and a Task:
// A future that will be spawned. let future = async { 1 + 2 }; // A function that schedules the task when it gets woken up. let schedule = move |runnable| sender.send(runnable).unwrap(); // Construct a task. let (runnable, task) = async_task::spawn(future, schedule); // Push the task into the queue by invoking its schedule function. runnable.schedule();
The Runnable is used to poll the task's future, and the Task is used to await its output.
Finally, we need a loop that takes scheduled tasks from the queue and runs them:
for runnable in receiver { runnable.run(); }
Method run() polls the task's future once. Then, the Runnable vanishes and only reappears when its Waker wakes the task, thus scheduling it to be run again.
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.