aboutsummaryrefslogtreecommitdiff
path: root/embassy-executor/src/raw/run_queue_atomics.rs
diff options
context:
space:
mode:
Diffstat (limited to 'embassy-executor/src/raw/run_queue_atomics.rs')
-rw-r--r--embassy-executor/src/raw/run_queue_atomics.rs8
1 files changed, 4 insertions, 4 deletions
diff --git a/embassy-executor/src/raw/run_queue_atomics.rs b/embassy-executor/src/raw/run_queue_atomics.rs
index 08765e06b..65a9b7859 100644
--- a/embassy-executor/src/raw/run_queue_atomics.rs
+++ b/embassy-executor/src/raw/run_queue_atomics.rs
@@ -1,7 +1,7 @@
1use core::ptr::{addr_of_mut, NonNull}; 1use core::ptr::{addr_of_mut, NonNull};
2 2
3use cordyceps::sorted_list::Links; 3use cordyceps::sorted_list::Links;
4#[cfg(feature = "drs-scheduler")] 4#[cfg(feature = "edf-scheduler")]
5use cordyceps::SortedList; 5use cordyceps::SortedList;
6use cordyceps::{Linked, TransferStack}; 6use cordyceps::{Linked, TransferStack};
7 7
@@ -73,7 +73,7 @@ impl RunQueue {
73 /// Empty the queue, then call `on_task` for each task that was in the queue. 73 /// Empty the queue, then call `on_task` for each task that was in the queue.
74 /// NOTE: It is OK for `on_task` to enqueue more tasks. In this case they're left in the queue 74 /// NOTE: It is OK for `on_task` to enqueue more tasks. In this case they're left in the queue
75 /// and will be processed by the *next* call to `dequeue_all`, *not* the current one. 75 /// and will be processed by the *next* call to `dequeue_all`, *not* the current one.
76 #[cfg(not(feature = "drs-scheduler"))] 76 #[cfg(not(feature = "edf-scheduler"))]
77 pub(crate) fn dequeue_all(&self, on_task: impl Fn(TaskRef)) { 77 pub(crate) fn dequeue_all(&self, on_task: impl Fn(TaskRef)) {
78 let taken = self.stack.take_all(); 78 let taken = self.stack.take_all();
79 for taskref in taken { 79 for taskref in taken {
@@ -82,7 +82,7 @@ impl RunQueue {
82 } 82 }
83 } 83 }
84 84
85 /// # Deadline Ranked Sorted Scheduler 85 /// # Earliest Deadline First Scheduler
86 /// 86 ///
87 /// This algorithm will loop until all enqueued tasks are processed. 87 /// This algorithm will loop until all enqueued tasks are processed.
88 /// 88 ///
@@ -96,7 +96,7 @@ impl RunQueue {
96 /// 96 ///
97 /// This process will repeat until the local `sorted` queue AND the global 97 /// This process will repeat until the local `sorted` queue AND the global
98 /// runqueue are both empty, at which point this function will return. 98 /// runqueue are both empty, at which point this function will return.
99 #[cfg(feature = "drs-scheduler")] 99 #[cfg(feature = "edf-scheduler")]
100 pub(crate) fn dequeue_all(&self, on_task: impl Fn(TaskRef)) { 100 pub(crate) fn dequeue_all(&self, on_task: impl Fn(TaskRef)) {
101 // SAFETY: `deadline` can only be set through the `Deadline` interface, which 101 // SAFETY: `deadline` can only be set through the `Deadline` interface, which
102 // only allows access to this value while the given task is being polled. 102 // only allows access to this value while the given task is being polled.