Struct TaskPool 

pub struct TaskPool { /* private fields */ }

Implementations

impl TaskPool

pub fn new( engine: Engine, shared_memory: SharedMemory, interface: SimulatorInterface, ) -> Result<Self>

pub fn create_store(&mut self, host: &Host) -> Result<Store<Host>>

pub async fn instantiate( &mut self, store: &mut Store<Host>, module: &Module, interface: &SimulatorInterface, ) -> Result<Instance>

pub async fn spawn( &mut self, opts: TaskOptions, module: &Module, interface: &SimulatorInterface, ) -> Result<TaskHandle>

pub fn by_id(&self, task_id: u32) -> Option<TaskHandle>

pub fn current(&self) -> TaskHandle

pub async fn current_lock(&self) -> MutexGuard<'_, Task>

pub async fn yield_now()

pub fn suspend_all(&mut self)

Prevent context switches from happening until resume_all is called.

pub async fn resume_all(&mut self) -> Result<bool>

Resumes the scheduler, causing a yield if one is pending

Returns whether resuming the scheduler caused a yield.

pub async fn cycle_tasks(&mut self) -> bool

Switches to the next task in the task pool, if any. Returns whether there are running tasks remaining.

This function will loop through the tasks in a round-robin fashion, giving each task a chance to run before looping back around to the beginning. Only tasks with the highest priority will be considered.

pub async fn run_to_completion(host: &Host) -> Result<()>

pub async fn task_state(&self, task_id: u32) -> Option<TaskState>

pub async fn delete_task(&mut self, task_id: u32)

pub fn start_shutdown(&mut self)