Struct Executor 

pub struct Executor<'curr, 'next> {
    pub freq: u64,
    /* private fields */
}

Available on crate feature nano-alloc only.

A simple round-robin executor that manages a linked-list of tasks.

The executor polls tasks based on their scheduled next_run_time and supports dynamic task addition.

Fields

freq: u64

The hardware clock frequency, used to normalize task intervals.

Implementations

impl<'curr, 'next> Executor<'curr, 'next>

pub fn new() -> Self

Initializes a new executor and calculates the hardware frequency.

pub fn add(&mut self, node: &'next mut TaskNode<'curr, 'next>) -> &mut Self

Adds a task node to the executor.

This method converts the node’s frequency into a tick interval and pushes the node to the front of the linked-list.

pub fn run_forever(&mut self)

Enters an infinite loop, continuously ticking the executor.

pub fn init_step() -> Context<'curr>

Initializes a no-op Context required for polling futures.

pub fn run_step(&mut self, time: u64, cx: &mut Context<'_>)

Performs a single pass over all registered tasks.

For each node:

1. Checks if the current time has reached next_run_time.
2. Polls the future.
3. If Ready, the node is removed from the list.
4. If Pending, the next_run_time is updated by the node’s interval.