axtask/wait_queue.rs
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 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213
use alloc::collections::VecDeque;
use alloc::sync::Arc;
use kernel_guard::{NoOp, NoPreemptIrqSave};
use kspin::{SpinNoIrq, SpinNoIrqGuard};
use crate::{AxTaskRef, CurrentTask, current_run_queue, select_run_queue};
/// A queue to store sleeping tasks.
///
/// # Examples
///
/// ```
/// use axtask::WaitQueue;
/// use core::sync::atomic::{AtomicU32, Ordering};
///
/// static VALUE: AtomicU32 = AtomicU32::new(0);
/// static WQ: WaitQueue = WaitQueue::new();
///
/// axtask::init_scheduler();
/// // spawn a new task that updates `VALUE` and notifies the main task
/// axtask::spawn(|| {
/// assert_eq!(VALUE.load(Ordering::Relaxed), 0);
/// VALUE.fetch_add(1, Ordering::Relaxed);
/// WQ.notify_one(true); // wake up the main task
/// });
///
/// WQ.wait(); // block until `notify()` is called
/// assert_eq!(VALUE.load(Ordering::Relaxed), 1);
/// ```
pub struct WaitQueue {
queue: SpinNoIrq<VecDeque<AxTaskRef>>,
}
pub(crate) type WaitQueueGuard<'a> = SpinNoIrqGuard<'a, VecDeque<AxTaskRef>>;
impl WaitQueue {
/// Creates an empty wait queue.
pub const fn new() -> Self {
Self {
queue: SpinNoIrq::new(VecDeque::new()),
}
}
/// Creates an empty wait queue with space for at least `capacity` elements.
pub fn with_capacity(capacity: usize) -> Self {
Self {
queue: SpinNoIrq::new(VecDeque::with_capacity(capacity)),
}
}
/// Cancel events by removing the task from the wait queue.
/// If `from_timer_list` is true, try to remove the task from the timer list.
fn cancel_events(&self, curr: CurrentTask, _from_timer_list: bool) {
// A task can be wake up only one events (timer or `notify()`), remove
// the event from another queue.
if curr.in_wait_queue() {
// wake up by timer (timeout).
self.queue.lock().retain(|t| !curr.ptr_eq(t));
curr.set_in_wait_queue(false);
}
// Try to cancel a timer event from timer lists.
// Just mark task's current timer ticket ID as expired.
#[cfg(feature = "irq")]
if _from_timer_list {
curr.timer_ticket_expired();
// Note:
// this task is still not removed from timer list of target CPU,
// which may cause some redundant timer events because it still needs to
// go through the process of expiring an event from the timer list and invoking the callback.
// (it can be considered a lazy-removal strategy, it will be ignored when it is about to take effect.)
}
}
/// Blocks the current task and put it into the wait queue, until other task
/// notifies it.
pub fn wait(&self) {
current_run_queue::<NoPreemptIrqSave>().blocked_resched(self.queue.lock());
self.cancel_events(crate::current(), false);
}
/// Blocks the current task and put it into the wait queue, until the given
/// `condition` becomes true.
///
/// Note that even other tasks notify this task, it will not wake up until
/// the condition becomes true.
pub fn wait_until<F>(&self, condition: F)
where
F: Fn() -> bool,
{
let curr = crate::current();
loop {
let mut rq = current_run_queue::<NoPreemptIrqSave>();
let wq = self.queue.lock();
if condition() {
break;
}
rq.blocked_resched(wq);
// Preemption may occur here.
}
self.cancel_events(curr, false);
}
/// Blocks the current task and put it into the wait queue, until other tasks
/// notify it, or the given duration has elapsed.
#[cfg(feature = "irq")]
pub fn wait_timeout(&self, dur: core::time::Duration) -> bool {
let mut rq = current_run_queue::<NoPreemptIrqSave>();
let curr = crate::current();
let deadline = axhal::time::wall_time() + dur;
debug!(
"task wait_timeout: {} deadline={:?}",
curr.id_name(),
deadline
);
crate::timers::set_alarm_wakeup(deadline, curr.clone());
rq.blocked_resched(self.queue.lock());
let timeout = curr.in_wait_queue(); // still in the wait queue, must have timed out
// Always try to remove the task from the timer list.
self.cancel_events(curr, true);
timeout
}
/// Blocks the current task and put it into the wait queue, until the given
/// `condition` becomes true, or the given duration has elapsed.
///
/// Note that even other tasks notify this task, it will not wake up until
/// the above conditions are met.
#[cfg(feature = "irq")]
pub fn wait_timeout_until<F>(&self, dur: core::time::Duration, condition: F) -> bool
where
F: Fn() -> bool,
{
let curr = crate::current();
let deadline = axhal::time::wall_time() + dur;
debug!(
"task wait_timeout: {}, deadline={:?}",
curr.id_name(),
deadline
);
crate::timers::set_alarm_wakeup(deadline, curr.clone());
let mut timeout = true;
loop {
let mut rq = current_run_queue::<NoPreemptIrqSave>();
if axhal::time::wall_time() >= deadline {
break;
}
let wq = self.queue.lock();
if condition() {
timeout = false;
break;
}
rq.blocked_resched(wq);
// Preemption may occur here.
}
// Always try to remove the task from the timer list.
self.cancel_events(curr, true);
timeout
}
/// Wakes up one task in the wait queue, usually the first one.
///
/// If `resched` is true, the current task will be preempted when the
/// preemption is enabled.
pub fn notify_one(&self, resched: bool) -> bool {
let mut wq = self.queue.lock();
if let Some(task) = wq.pop_front() {
unblock_one_task(task, resched);
true
} else {
false
}
}
/// Wakes all tasks in the wait queue.
///
/// If `resched` is true, the current task will be preempted when the
/// preemption is enabled.
pub fn notify_all(&self, resched: bool) {
while self.notify_one(resched) {
// loop until the wait queue is empty
}
}
/// Wake up the given task in the wait queue.
///
/// If `resched` is true, the current task will be preempted when the
/// preemption is enabled.
pub fn notify_task(&mut self, resched: bool, task: &AxTaskRef) -> bool {
let mut wq = self.queue.lock();
if let Some(index) = wq.iter().position(|t| Arc::ptr_eq(t, task)) {
unblock_one_task(wq.remove(index).unwrap(), resched);
true
} else {
false
}
}
}
fn unblock_one_task(task: AxTaskRef, resched: bool) {
// Mark task as not in wait queue.
task.set_in_wait_queue(false);
// Select run queue by the CPU set of the task.
// Use `NoOp` kernel guard here because the function is called with holding the
// lock of wait queue, where the irq and preemption are disabled.
select_run_queue::<NoOp>(&task).unblock_task(task, resched)
}