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 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542
//! This library provides a timer driver for scheduling and executing timed operations. The driver
//! allows you to create handles for sleeping for a specific duration or until a specified timeout.
//! It operates in a concurrent environment and uses a binary heap for efficient scheduling of
//! events.
//!
//! # Example
//!
//! ```rust
//! use async_spin_sleep::Builder;
//! use std::time::Duration;
//!
//! // Create a handle for sleeping for 1 second
//! let (handle, driver) = Builder::default().build();
//!
//! // Spawn the driver on a separate thread.
//! // The timer will be dropped when all handles are dropped.
//! std::thread::spawn(driver);
//!
//! let sleep_future = handle.sleep_for(Duration::from_secs(1));
//!
//! // Wait for the sleep future to complete
//! let result = futures::executor::block_on(sleep_future);
//! if let Ok(overly) = result {
//! println!("Slept {overly:?} more than requested");
//! } else {
//! println!("Sleep error: {:?}", result.err());
//! }
//! ```
use std::{
mem::replace,
pin::Pin,
sync::{
atomic::{AtomicIsize, Ordering},
Arc,
},
task::{Context, Poll},
time::{Duration, Instant},
};
use crossbeam::channel;
use driver::{NodeDesc, WakerCell};
/* -------------------------------------------- Init -------------------------------------------- */
#[cfg(windows)]
const DEFAULT_SCHEDULE_RESOLUTION: Duration = Duration::from_millis(33);
#[cfg(unix)]
const DEFAULT_SCHEDULE_RESOLUTION: Duration = Duration::from_millis(3);
#[derive(Debug)]
pub struct Builder {
/// Default scheduling resolution for this driver. Setting this to a lower value may decrease
/// CPU usage of the driver, but may also dangerously increase the chance of missing a wakeup
/// event due to the OS scheduler.
pub schedule_resolution: Duration,
/// Aborted nodes that are too far from execution may remain in the driver's memory for a long
/// time. This value specifies the maximum number of aborted nodes that can be stored in the
/// driver's memory. If this value is exceeded, the driver will collect garbage.
pub collect_garbage_at: usize,
/// Set channel capacity. This value is used to initialize the channel that connects the driver
/// and its handles. If the channel is full, the driver will block until the channel is
/// available.
///
/// When [`None`] is specified, an unbounded channel will be used.
pub channel_capacity: Option<usize>,
/// A shared handle to represent naive number of garbage nodes to collect
///
/// # How it works
///
/// [future]
/// 1. node is aborted
/// 2. downgrade handle
/// - if node is alive -> worker already locked the weak handle, thus we don't touch
/// the `gc_count`, as the server is going to call waker
/// - if node dead -> worker didn't lock the weak handle, it may persist in the queue. thus
/// we should increment `gc_count`
///
/// [worker]
/// - on every new node insertion, check if `gc_count` is greater than `collect_garbage_at`
/// - on node execution, try to lock the handle, and if it fails, decrement `gc_count` and
/// consume the node.
gc_counter: Arc<AtomicIsize>,
// Force 'default' only
_0: (),
}
impl Default for Builder {
fn default() -> Self {
Self {
schedule_resolution: DEFAULT_SCHEDULE_RESOLUTION,
collect_garbage_at: 1000,
channel_capacity: None,
gc_counter: Default::default(),
_0: (),
}
}
}
impl Builder {
pub fn build(self) -> (Handle, impl FnOnce()) {
self.build_d_ary::<2>()
}
pub fn build_d_ary<const D: usize>(self) -> (Handle, impl FnOnce()) {
let (tx, rx) = if let Some(cap) = self.channel_capacity {
channel::bounded(cap)
} else {
channel::unbounded()
};
let handle = Handle { tx: tx.clone(), gc_counter: self.gc_counter.clone() };
let driver = move || driver::execute::<D>(self, rx);
(handle, driver)
}
}
pub fn create() -> (Handle, impl FnOnce()) {
Builder::default().build()
}
pub fn create_d_ary<const D: usize>() -> (Handle, impl FnOnce()) {
Builder::default().build_d_ary::<D>()
}
/* ------------------------------------------- Driver ------------------------------------------- */
mod driver {
use std::{
cell::UnsafeCell,
sync::{atomic::Ordering, Weak},
task::Waker,
time::{Duration, Instant},
};
use crossbeam::channel::{self, TryRecvError};
use dary_heap::DaryHeap;
use educe::Educe;
use crate::Builder;
#[derive(Debug)]
pub(crate) enum Event {
SleepUntil(NodeDesc),
}
/// ```plain
/// if exists foremost-node
/// if node is far from execution
/// condvar-sleep until safety limit
/// continue
/// else
/// while until foremost-node is executed
/// else
/// wait condvar
/// ```
pub(crate) fn execute<const D: usize>(this: Builder, rx: channel::Receiver<Event>) {
let mut nodes = DaryHeap::<Node, D>::new();
let pivot = Instant::now();
let to_usec = |x: Instant| x.duration_since(pivot).as_micros() as u64;
let resolution_usec = this.schedule_resolution.as_micros() as u64;
let gc_counter = this.gc_counter;
'outer: loop {
let now = to_usec(Instant::now());
let mut event = if let Some(node) = nodes.peek() {
let remain = node.timeout_usec.saturating_sub(now);
if remain > resolution_usec {
let system_sleep_for = remain - resolution_usec;
let Ok(x) = rx.recv_timeout(Duration::from_micros( system_sleep_for)) else { continue };
x
} else {
loop {
let now = to_usec(Instant::now());
if now >= node.timeout_usec {
let node = nodes.pop().unwrap();
if let Some(waker) = node.weak_waker.upgrade() {
// SAFETY: No other thread access value of this pointer.
unsafe { (*waker.get()).take().unwrap().wake() }
} else {
gc_counter.fetch_sub(1, Ordering::AcqRel);
}
continue 'outer;
} else {
match rx.try_recv() {
Ok(x) => break x,
Err(TryRecvError::Disconnected) if nodes.is_empty() => break 'outer,
Err(TryRecvError::Disconnected) | Err(TryRecvError::Empty) => {
std::thread::yield_now()
}
}
}
}
}
} else {
let Ok(x) = rx.recv() else {
break
};
x
};
if gc_counter.load(Ordering::Acquire) as usize > this.collect_garbage_at {
let fn_retain = |x: &Node| x.weak_waker.strong_count() > 0;
let mut vec = nodes.into_vec();
let num_total = vec.len();
vec.retain(fn_retain);
nodes = DaryHeap::from(vec);
let n_collected = num_total - nodes.len();
gc_counter.fetch_sub(n_collected as _, Ordering::AcqRel);
}
loop {
match event {
Event::SleepUntil(desc) => nodes
.push(Node { timeout_usec: to_usec(desc.timeout), weak_waker: desc.waker }),
};
// Consume all events in the channel.
match rx.try_recv() {
Ok(x) => event = x,
Err(TryRecvError::Disconnected) if nodes.is_empty() => break 'outer,
Err(TryRecvError::Disconnected) | Err(TryRecvError::Empty) => break,
}
}
}
}
#[derive(Debug, Clone)]
pub(crate) struct NodeDesc {
pub timeout: Instant,
pub waker: Weak<WakerCell>,
}
#[derive(Debug, Clone, Educe)]
#[educe(Eq, PartialEq, PartialOrd, Ord)]
pub(crate) struct Node {
#[educe(PartialOrd(method = "cmp_rev_partial"), Ord(method = "cmp_rev"))]
pub timeout_usec: u64,
#[educe(Eq(ignore), PartialEq(ignore), PartialOrd(ignore), Ord(ignore))]
pub weak_waker: Weak<WakerCell>,
}
fn cmp_rev(a: &u64, b: &u64) -> std::cmp::Ordering {
b.cmp(a)
}
fn cmp_rev_partial(a: &u64, b: &u64) -> Option<std::cmp::Ordering> {
b.partial_cmp(a)
}
#[derive(Debug)]
pub(crate) struct WakerCell {
// SAFETY: This UnsafeCell is only used to take the value out of the waker.
// dsa sads
waker: UnsafeCell<Option<Waker>>,
}
unsafe impl Sync for WakerCell {}
unsafe impl Send for WakerCell {}
impl std::ops::Deref for WakerCell {
type Target = UnsafeCell<Option<Waker>>;
fn deref(&self) -> &Self::Target {
&self.waker
}
}
impl WakerCell {
pub fn new(waker: Waker) -> Self {
Self { waker: UnsafeCell::new(Some(waker)) }
}
}
}
/* ------------------------------------------- Handle ------------------------------------------- */
#[derive(Debug, Clone)]
pub struct Handle {
tx: channel::Sender<driver::Event>,
gc_counter: Arc<AtomicIsize>,
}
impl Handle {
/// Returns a future that sleeps for the specified duration.
///
/// [`SleepFuture`] returns the duration that overly passed the specified duration.
pub fn sleep_for(&self, duration: Duration) -> SleepFuture {
self.sleep_until(Instant::now() + duration)
}
/// Returns a future that sleeps until the specified instant.
///
/// [`SleepFuture`] returns the duration that overly passed the specified instant.
pub fn sleep_until(&self, timeout: Instant) -> SleepFuture {
SleepFuture {
tx: self.tx.clone(),
state: SleepState::Pending,
timeout,
gc_counter: self.gc_counter.clone(),
}
}
/// Create an interval controller which wakes up after specified `interval` duration on
/// every call to [`util::Interval::wait`]
pub fn interval(&self, interval: Duration) -> util::Interval {
util::Interval { handle: self.clone(), wakeup: Instant::now() + interval, interval }
}
}
pub mod util {
use std::time::{Duration, Instant};
use crate::{instant, SleepResult};
#[derive(Debug, Clone)]
pub struct Interval {
pub(crate) handle: super::Handle,
pub(crate) wakeup: Instant,
pub(crate) interval: Duration,
}
impl Interval {
pub async fn wait(&mut self) -> SleepResult {
let Self { handle, wakeup: sleep_until, interval } = self;
let result = handle.sleep_until(*sleep_until).await;
let now = Instant::now();
*sleep_until = *sleep_until + *interval;
if now > *sleep_until {
// XXX: We use 128 bit integer to avoid overflow in nanosecond domain.
// This is not a perfect solution, but it should be enough for most cases,
// as 'over-sleep' is relatively rare case thus slow path is not a big deal.
let interval_ns = interval.as_nanos();
let num_ticks = ((now - *sleep_until).as_nanos() - 1) / interval_ns + 1;
*sleep_until += Duration::from_nanos((interval_ns * num_ticks) as _);
}
result
}
/// Reset interval to the specified duration.
///
/// > **_warning_** This method will break the alignment set up by [`Self::wakeup_at`].
/// > If you want to keep the alignment,
pub fn set_interval(&mut self, interval: Duration) {
assert!(interval > Duration::default());
self.wakeup -= self.interval;
self.wakeup += interval;
self.interval = interval;
}
pub fn interval(&self) -> Duration {
self.interval
}
pub fn next_wakeup(&self) -> Instant {
self.wakeup
}
/// Sets next tick at the specified instant. After this point, timestamp will be aligned
/// to given instant. This may break the alignment set up by [`Self::set_interval`].
pub fn wakeup_at(&mut self, instant: Instant) {
self.wakeup = instant;
}
/// Align with
///
/// ```no_run
/// let handle: Interval = todo!();
/// let func = || std::time::SystemTime::now() - std::time::SystemTime::UNIX_EPOCH;
/// handle.align_with_clock(func, handle.interval(), Default::default());
/// ```
pub fn align_with_clock(
&mut self,
now_time_since_epoch: impl Fn() -> Duration,
interval: Duration,
early_wakeup_tolerance: Duration,
) {
assert!(interval > Duration::default());
let src_now = instant::time_since_epoch();
let src_now_ns = src_now.as_nanos();
let dst_now_ns = now_time_since_epoch().as_nanos();
let interval_ns = interval.as_nanos();
let src_now_gap = (src_now_ns % interval_ns) as i64;
let dst_now_gap = (dst_now_ns % interval_ns) as i64;
let mut src_delay_ns = dst_now_gap - src_now_gap;
if src_delay_ns < 0 {
src_delay_ns += interval_ns as i64;
}
// calculate target alignment timestamp
let n_ticks = (src_now_ns / interval_ns).saturating_sub(1); // naively align to previous tick
let mut aligned_ts_ns = n_ticks * interval_ns + src_delay_ns as u128;
let previous_wakeup = self.wakeup.checked_duration_since(instant::origin());
if let Some(prev) = previous_wakeup {
let tolerance_ns = early_wakeup_tolerance.as_nanos();
let prev_ns = prev.as_nanos().saturating_sub(tolerance_ns);
if let Some(wait_time_ns) = prev_ns.checked_sub(aligned_ts_ns) {
// we have to trigger *after* previous target alignment,
let n_ticks = wait_time_ns / interval_ns;
aligned_ts_ns += n_ticks * interval_ns;
}
}
let aligned_ts = Duration::new(
(aligned_ts_ns / 1_000_000_000) as u64,
(aligned_ts_ns % 1_000_000_000) as u32,
);
self.wakeup = instant::origin() + aligned_ts;
self.interval = interval;
}
/// Align with system clock. This is a shortcut for [`Interval::align_with_clock`].
#[cfg(feature = "interval-align-system")]
pub fn align_with_system_clock(
&mut self,
offset_sec: f64,
interval: Duration,
early_wakeup_tolerance: Duration,
) {
self.align_with_clock(
|| {
let ts = std::time::SystemTime::now()
.duration_since(std::time::SystemTime::UNIX_EPOCH)
.unwrap();
if offset_sec >= 0. {
ts + Duration::from_secs_f64(offset_sec)
} else {
ts - Duration::from_secs_f64(-offset_sec)
}
},
interval,
early_wakeup_tolerance,
);
}
}
}
mod instant {
use std::time::{Duration, Instant};
pub(crate) fn origin() -> Instant {
lazy_static::lazy_static!(
static ref PIVOT: Instant = Instant::now();
);
*PIVOT
}
pub(crate) fn time_since_epoch() -> Duration {
Instant::now() - origin()
}
}
/* ------------------------------------------- Future ------------------------------------------- */
#[derive(Debug)]
pub struct SleepFuture {
tx: channel::Sender<driver::Event>,
gc_counter: Arc<AtomicIsize>,
timeout: Instant,
state: SleepState,
}
#[cfg(test)]
static_assertions::assert_impl_all!(SleepFuture: Send, Sync, Unpin);
#[derive(Debug, thiserror::Error)]
pub enum SleepError {
#[error("driver shutdown")]
Shutdown,
}
#[derive(Debug)]
enum SleepState {
Pending,
Sleeping(Arc<WakerCell>),
Woken,
}
unsafe impl Sync for SleepState {}
unsafe impl Send for SleepState {}
pub type SleepResult = Result<Duration, SleepError>;
impl std::future::Future for SleepFuture {
type Output = SleepResult;
fn poll(mut self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> {
let now = Instant::now();
if let Some(over) = now.checked_duration_since(self.timeout) {
self.state = SleepState::Woken;
return Poll::Ready(Ok(over));
}
if matches!(self.state, SleepState::Pending) {
let waker = Arc::new(WakerCell::new(cx.waker().clone()));
let event = driver::Event::SleepUntil(NodeDesc {
timeout: self.timeout,
waker: Arc::downgrade(&waker),
});
if let Err(_) = self.tx.send(event) {
return Poll::Ready(Err(SleepError::Shutdown));
}
self.state = SleepState::Sleeping(waker);
}
Poll::Pending
}
}
impl Drop for SleepFuture {
fn drop(&mut self) {
if let SleepState::Sleeping(n) = replace(&mut self.state, SleepState::Woken) {
if let Some(_) = Arc::into_inner(n) {
// okay, we got the last reference, server is guaranteed to decrement the gc_counter.
self.gc_counter.fetch_add(1, Ordering::AcqRel);
} else {
// otherwise, server got the last reference, thus gc_counter won't be decremented.
// so we don't touch this here either.
}
}
}
}