Pausable Clock
This crate provides a clock that can be paused ... (duh?). The provided struct PausableClock allows you to get the current time in a way that respects the atomic state and history of the clock. Put more simply, a pausable clock's elapsed time increases at the same as real time but only when the clock is resumed.
Features
- Thread-Safe: (
Send/Sync) All operations on the clock are atomic or use std mutexes - Resume Notification: the
wait_for_resumemethod will block until the clock is resumed (if the clock is paused) - Guarantees: Just like
std::time::Instant::now()guarantees that time always increases,PausableClockguarantees that the time returned byclock.now()while the clock is paused is >= any other instant returned before the clock was paused. - Unpausable Tasks: We provide a method called
run_unpausablethat allows tasks to be run that can prevent the timer from being paused while they are still running.
Example
use PausableClock;
use Arc;
use thread;
use ;
let clock = new;
// With the default parameters, there should be no difference
// between the real time and the clock's time
assert!;
// Pause the clock right after creation
clock.pause;
// Clone the arc of the clock to pass to a new thread
let clock_clone = clock.clone;
let t = spawn;
// Sleep for a sec, then resume the clock
sleep;
clock.resume;
// Wait for the spawned thread to unblock
t.join.unwrap;
// After being paused for a second, the clock is now a second behind
// (with a small error margin here because sleep is not super accurate)
assert!;
Caveats
- We use an
AtomicU64to contain the entire state of the pausable clock, so the granularity of the instant's produced by the clock is milliseconds. This means the maximum time the timer can handle is on the order of hundreds of thousands of years. - Reads of the pause state for
PausableClock::is_pausedis done atomically withOrdering::Relaxed. That allows the call to be slightly faster, but it means you shouldn't think it as fencing a operations. You can usePausableClock::is_paused_orderedif you need that kind of guarantee. - There is a significant amount of weakly-ordered atomic operation going on in this library to make sure the calls to now and unpausable task don't require any locks. I can't claim that it is provably correct, but it has been tested to high degree of certainty on x86_64 processors. Tests on weakly ordered systems are forthcoming as are
loom-based tests.