// Currently, rust warns when an unsafe fn contains an unsafe {} block. However, // in the future, this will change to the reverse. For now, suppress this // warning and generally stick with being explicit about unsafety. #![allow(unused_unsafe)] #![cfg_attr(not(feature = "rt"), allow(dead_code))]
//! Time driver.
mod entry; pub(crate) use entry::TimerEntry; use entry::{EntryList, TimerHandle, TimerShared, MAX_SAFE_MILLIS_DURATION};
use std::fmt; use std::{num::NonZeroU64, ptr::NonNull};
/// Time implementation that drives [`Sleep`][sleep], [`Interval`][interval], and [`Timeout`][timeout]. /// /// A `Driver` instance tracks the state necessary for managing time and /// notifying the [`Sleep`][sleep] instances once their deadlines are reached. /// /// It is expected that a single instance manages many individual [`Sleep`][sleep] /// instances. The `Driver` implementation is thread-safe and, as such, is able /// to handle callers from across threads. /// /// After creating the `Driver` instance, the caller must repeatedly call `park` /// or `park_timeout`. The time driver will perform no work unless `park` or /// `park_timeout` is called repeatedly. /// /// The driver has a resolution of one millisecond. Any unit of time that falls /// between milliseconds are rounded up to the next millisecond. /// /// When an instance is dropped, any outstanding [`Sleep`][sleep] instance that has not /// elapsed will be notified with an error. At this point, calling `poll` on the /// [`Sleep`][sleep] instance will result in panic. /// /// # Implementation /// /// The time driver is based on the [paper by Varghese and Lauck][paper]. /// /// A hashed timing wheel is a vector of slots, where each slot handles a time /// slice. As time progresses, the timer walks over the slot for the current /// instant, and processes each entry for that slot. When the timer reaches the /// end of the wheel, it starts again at the beginning. /// /// The implementation maintains six wheels arranged in a set of levels. As the /// levels go up, the slots of the associated wheel represent larger intervals /// of time. At each level, the wheel has 64 slots. Each slot covers a range of /// time equal to the wheel at the lower level. At level zero, each slot /// represents one millisecond of time. /// /// The wheels are: /// /// * Level 0: 64 x 1 millisecond slots. /// * Level 1: 64 x 64 millisecond slots. /// * Level 2: 64 x ~4 second slots. /// * Level 3: 64 x ~4 minute slots. /// * Level 4: 64 x ~4 hour slots. /// * Level 5: 64 x ~12 day slots. /// /// When the timer processes entries at level zero, it will notify all the /// `Sleep` instances as their deadlines have been reached. For all higher /// levels, all entries will be redistributed across the wheel at the next level /// down. Eventually, as time progresses, entries with [`Sleep`][sleep] instances will /// either be canceled (dropped) or their associated entries will reach level /// zero and be notified. /// /// [paper]: http://www.cs.columbia.edu/~nahum/w6998/papers/ton97-timing-wheels.pdf /// [sleep]: crate::time::Sleep /// [timeout]: crate::time::Timeout /// [interval]: crate::time::Interval #[derive(Debug)] pub(crate) struct Driver { /// Parker to delegate to.
park: IoStack,
}
enum Inner {
Traditional { // The state is split like this so `Handle` can access `is_shutdown` without locking the mutex
state: Mutex<InnerState>,
/// True if the driver is being shutdown.
is_shutdown: AtomicBool,
// When `true`, a call to `park_timeout` should immediately return and time // should not advance. One reason for this to be `true` is if the task // passed to `Runtime::block_on` called `task::yield_now()`. // // While it may look racy, it only has any effect when the clock is paused // and pausing the clock is restricted to a single-threaded runtime. #[cfg(feature = "test-util")]
did_wake: AtomicBool,
},
#[cfg(all(tokio_unstable, feature = "rt-multi-thread"))]
Alternative { /// True if the driver is being shutdown.
is_shutdown: AtomicBool,
// When `true`, a call to `park_timeout` should immediately return and time // should not advance. One reason for this to be `true` is if the task // passed to `Runtime::block_on` called `task::yield_now()`. // // While it may look racy, it only has any effect when the clock is paused // and pausing the clock is restricted to a single-threaded runtime. #[cfg(feature = "test-util")]
did_wake: AtomicBool,
},
}
/// Time state shared which must be protected by a `Mutex` struct InnerState { /// The earliest time at which we promise to wake up without unparking.
next_wake: Option<NonZeroU64>,
/// Timer wheel.
wheel: wheel::Wheel,
}
// ===== impl Driver =====
impl Driver { /// Creates a new `Driver` instance that uses `park` to block the current /// thread and `time_source` to get the current time and convert to ticks. /// /// Specifying the source of time is useful when testing. pub(crate) fn new(park: IoStack, clock: &Clock) -> (Driver, Handle) { let time_source = TimeSource::new(clock);
let next_wake = lock.wheel.next_expiration_time();
lock.next_wake =
next_wake.map(|t| NonZeroU64::new(t).unwrap_or_else(|| NonZeroU64::new(1).unwrap()));
drop(lock);
match next_wake {
Some(when) => { let now = handle.time_source.now(rt_handle.clock()); // Note that we effectively round up to 1ms here - this avoids // very short-duration microsecond-resolution sleeps that the OS // might treat as zero-length. letmut duration = handle
.time_source
.tick_to_duration(when.saturating_sub(now));
// Process pending timers after waking up
handle.process(rt_handle.clock());
}
cfg_test_util! { fn park_thread_timeout(&mutself, rt_handle: &driver::Handle, duration: Duration) { let handle = rt_handle.time(); let clock = rt_handle.clock();
if clock.can_auto_advance() { self.park.park_timeout(rt_handle, Duration::from_secs(0));
// If the time driver was woken, then the park completed // before the "duration" elapsed (usually caused by a // yield in `Runtime::block_on`). In this case, we don't // advance the clock. if !handle.did_wake() { // Simulate advancing time iflet Err(msg) = clock.advance(duration) {
panic!("{}", msg);
}
}
} else { self.park.park_timeout(rt_handle, duration);
}
}
}
if now < lock.wheel.elapsed() { // Time went backwards! This normally shouldn't happen as the Rust language // guarantees that an Instant is monotonic, but can happen when running // Linux in a VM on a Windows host due to std incorrectly trusting the // hardware clock to be monotonic. // // See <https://github.com/tokio-rs/tokio/issues/3619> for more information.
now = lock.wheel.elapsed();
}
// SAFETY: We hold the driver lock, and just removed the entry from any linked lists. iflet Some(waker) = unsafe { entry.fire(Ok(())) } {
waker_list.push(waker);
if !waker_list.can_push() { // Wake a batch of wakers. To avoid deadlock, we must do this with the lock temporarily dropped.
drop(lock);
#[cfg(all(tokio_unstable, feature = "rt-multi-thread"))] pub(crate) fn process_at_time_alt(
&self,
wheel: &mut time_alt::Wheel, mut now: u64,
wake_queue: &mut time_alt::WakeQueue,
) { if now < wheel.elapsed() { // Time went backwards! This normally shouldn't happen as the Rust language // guarantees that an Instant is monotonic, but can happen when running // Linux in a VM on a Windows host due to std incorrectly trusting the // hardware clock to be monotonic. // // See <https://github.com/tokio-rs/tokio/issues/3619> for more information.
now = wheel.elapsed();
}
wheel.take_expired(now, wake_queue);
}
#[cfg(all(tokio_unstable, feature = "rt-multi-thread"))] pub(crate) fn shutdown_alt(&self, wheel: &mut time_alt::Wheel) { // self.is_shutdown.store(true, Ordering::SeqCst); // Advance time forward to the end of time. // This will ensure that all timers are fired. let max_tick = u64::MAX; letmut wake_queue = time_alt::WakeQueue::new(); self.process_at_time_alt(wheel, max_tick, &mut wake_queue);
wake_queue.wake_all();
}
/// Removes a registered timer from the driver. /// /// The timer will be moved to the cancelled state. Wakers will _not_ be /// invoked. If the timer is already completed, this function is a no-op. /// /// This function always acquires the driver lock, even if the entry does /// not appear to be registered. /// /// SAFETY: The timer must not be registered with some other driver, and /// `add_entry` must not be called concurrently. pub(self) unsafefn clear_entry(&self, entry: NonNull<TimerShared>) { unsafe { letmut lock = self.inner.lock();
if entry.as_ref().might_be_registered() {
lock.wheel.remove(entry);
}
entry.as_ref().handle().fire(Ok(()));
}
}
/// Removes and re-adds an entry to the driver. /// /// SAFETY: The timer must be either unregistered, or registered with this /// driver. No other threads are allowed to concurrently manipulate the /// timer at all (the current thread should hold an exclusive reference to /// the `TimerEntry`) pub(self) unsafefn reregister(
&self,
unpark: &IoHandle,
new_tick: u64,
entry: NonNull<TimerShared>,
) { let waker = unsafe { letmut lock = self.inner.lock();
// We may have raced with a firing/deregistration, so check before // deregistering. ifunsafe { entry.as_ref().might_be_registered() } {
lock.wheel.remove(entry);
}
// Now that we have exclusive control of this entry, mint a handle to reinsert it. let entry = entry.as_ref().handle();
// Note: We don't have to worry about racing with some other resetting // thread, because add_entry and reregister require exclusive control of // the timer entry. matchunsafe { lock.wheel.insert(entry) } {
Ok(when) => { if lock
.next_wake
.map(|next_wake| when < next_wake.get())
.unwrap_or(true)
{
unpark.unpark();
}
// Must release lock before invoking waker to avoid the risk of deadlock.
};
// The timer was fired synchronously as a result of the reregistration. // Wake the waker; this is needed because we might reset _after_ a poll, // and otherwise the task won't be awoken to poll again. iflet Some(waker) = waker {
waker.wake();
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.