Struct scheduler::FifoScheduler

pub struct FifoScheduler<T> { /* private fields */ }

A simple FIFO (First-In-First-Out) cooperative scheduler.

When a task is added to the scheduler, it’s placed at the end of the ready queue. When picking the next task to run, the head of the ready queue is taken.

As it’s a cooperative scheduler, it does nothing when the timer tick occurs.

It internally uses a linked list as the ready queue.

Implementations

impl<T> FifoScheduler<T>

pub const fn new() -> Self

Creates a new empty FifoScheduler.

pub fn scheduler_name() -> &'static str

get the name of scheduler

Trait Implementations

impl<T> BaseScheduler for FifoScheduler<T>

type SchedItem = Arc<FifoTask<T>>

Type of scheduled entities. Often a task struct.

fn init(&mut self)

Initializes the scheduler.

fn add_task(&mut self, task: Self::SchedItem)

Adds a task to the scheduler.

fn remove_task(&mut self, task: &Self::SchedItem) -> Option<Self::SchedItem>

Removes a task by its reference from the scheduler. Returns the owned removed task with ownership if it exists.

fn pick_next_task(&mut self) -> Option<Self::SchedItem>

Picks the next task to run, it will be removed from the scheduler. Returns None if there is not runnable task.

fn put_prev_task(&mut self, prev: Self::SchedItem, _preempt: bool)

Puts the previous task back to the scheduler. The previous task is usually placed at the end of the ready queue, making it less likely to be re-scheduled.

fn task_tick(&mut self, _current: &Self::SchedItem) -> bool

Advances the scheduler state at each timer tick. Returns true if re-scheduling is required.

fn set_priority(&mut self, _task: &Self::SchedItem, _prio: isize) -> bool

set priority for a task