ax-task 0.8.2

OS-independent IRQ-safe SMP task scheduling core
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

//! Generation-bearing exit callback and reap candidate ownership.

use alloc::collections::VecDeque;

use crate::thread::ThreadId;

/// Exit work published exactly once by each occupied registry slot.
#[derive(Debug)]
pub(super) struct ExitedThreadWork {
    candidates: VecDeque<ThreadId>,
}

impl ExitedThreadWork {
    pub(super) fn new(capacity: usize) -> Result<Self, crate::thread::TaskError> {
        let mut candidates = VecDeque::new();
        candidates
            .try_reserve_exact(capacity)
            .map_err(|_| crate::thread::allocation::no_memory())?;
        Ok(Self { candidates })
    }

    /// Publishes an exited generation without allocating in the exit path.
    pub(super) fn publish(&mut self, thread: ThreadId, slot_count: usize) {
        debug_assert!(
            self.candidates.len() < slot_count,
            "each occupied slot can publish at most one exit candidate"
        );
        self.candidates.push_back(thread);
    }

    pub(super) fn candidate_count(&self) -> usize {
        self.candidates.len()
    }

    /// Rotates one candidate so a busy zombie cannot starve later work.
    pub(super) fn next_candidate(&mut self) -> Option<ThreadId> {
        let thread = self.candidates.pop_front()?;
        self.candidates.push_back(thread);
        Some(thread)
    }

    pub(super) fn remove(&mut self, thread: ThreadId) {
        self.candidates.retain(|candidate| *candidate != thread);
    }
}