use std::future::Future; use std::pin::Pin; use std::sync::atomic::{AtomicUsize, Ordering}; use std::task::{Context, Poll}; use std::thread; use std::time::Duration; use async_task::Runnable; use easy_parallel::Parallel; use smol::future; // Creates a future with event counters. // // Usage: `future!(f, POLL, DROP_F, DROP_T)` // // The future `f` outputs `Poll::Ready`. // When it gets polled, `POLL` is incremented. // When it gets dropped, `DROP_F` is incremented. // When the output gets dropped, `DROP_T` is incremented. macro_rules! future { ($name:pat, $poll:ident, $drop_f:ident, $drop_t:ident) => { static $poll: AtomicUsize = AtomicUsize::new(0); static $drop_f: AtomicUsize = AtomicUsize::new(0); static $drop_t: AtomicUsize = AtomicUsize::new(0); let $name = { struct Fut(Box); impl Future for Fut { type Output = Out; fn poll(self: Pin<&mut Self>, _cx: &mut Context<'_>) -> Poll { $poll.fetch_add(1, Ordering::SeqCst); thread::sleep(ms(400)); Poll::Ready(Out(Box::new(0), true)) } } impl Drop for Fut { fn drop(&mut self) { $drop_f.fetch_add(1, Ordering::SeqCst); } } #[derive(Default)] struct Out(Box, bool); impl Drop for Out { fn drop(&mut self) { if self.1 { $drop_t.fetch_add(1, Ordering::SeqCst); } } } Fut(Box::new(0)) }; }; } // Creates a schedule function with event counters. // // Usage: `schedule!(s, SCHED, DROP)` // // The schedule function `s` does nothing. // When it gets invoked, `SCHED` is incremented. // When it gets dropped, `DROP` is incremented. macro_rules! schedule { ($name:pat, $sched:ident, $drop:ident) => { static $drop: AtomicUsize = AtomicUsize::new(0); static $sched: AtomicUsize = AtomicUsize::new(0); let $name = { struct Guard(Box); impl Drop for Guard { fn drop(&mut self) { $drop.fetch_add(1, Ordering::SeqCst); } } let guard = Guard(Box::new(0)); move |runnable: Runnable| { &guard; runnable.schedule(); $sched.fetch_add(1, Ordering::SeqCst); } }; }; } fn ms(ms: u64) -> Duration { Duration::from_millis(ms) } #[test] fn run_and_cancel() { future!(f, POLL, DROP_F, DROP_T); schedule!(s, SCHEDULE, DROP_S); let (runnable, task) = async_task::spawn(f, s); runnable.run(); assert_eq!(POLL.load(Ordering::SeqCst), 1); assert_eq!(SCHEDULE.load(Ordering::SeqCst), 0); assert_eq!(DROP_F.load(Ordering::SeqCst), 1); assert_eq!(DROP_T.load(Ordering::SeqCst), 0); assert_eq!(DROP_S.load(Ordering::SeqCst), 0); assert!(future::block_on(task.cancel()).is_some()); assert_eq!(POLL.load(Ordering::SeqCst), 1); assert_eq!(SCHEDULE.load(Ordering::SeqCst), 0); assert_eq!(DROP_F.load(Ordering::SeqCst), 1); assert_eq!(DROP_T.load(Ordering::SeqCst), 1); assert_eq!(DROP_S.load(Ordering::SeqCst), 1); } #[test] fn cancel_and_run() { future!(f, POLL, DROP_F, DROP_T); schedule!(s, SCHEDULE, DROP_S); let (runnable, task) = async_task::spawn(f, s); Parallel::new() .add(|| { thread::sleep(ms(200)); runnable.run(); assert_eq!(POLL.load(Ordering::SeqCst), 0); assert_eq!(SCHEDULE.load(Ordering::SeqCst), 0); assert_eq!(DROP_F.load(Ordering::SeqCst), 1); assert_eq!(DROP_T.load(Ordering::SeqCst), 0); thread::sleep(ms(200)); assert_eq!(DROP_S.load(Ordering::SeqCst), 1); }) .add(|| { assert!(future::block_on(task.cancel()).is_none()); thread::sleep(ms(200)); assert_eq!(POLL.load(Ordering::SeqCst), 0); assert_eq!(SCHEDULE.load(Ordering::SeqCst), 0); assert_eq!(DROP_F.load(Ordering::SeqCst), 1); assert_eq!(DROP_T.load(Ordering::SeqCst), 0); thread::sleep(ms(200)); assert_eq!(DROP_S.load(Ordering::SeqCst), 1); }) .run(); } #[test] fn cancel_during_run() { future!(f, POLL, DROP_F, DROP_T); schedule!(s, SCHEDULE, DROP_S); let (runnable, task) = async_task::spawn(f, s); Parallel::new() .add(|| { runnable.run(); thread::sleep(ms(200)); assert_eq!(POLL.load(Ordering::SeqCst), 1); assert_eq!(SCHEDULE.load(Ordering::SeqCst), 0); assert_eq!(DROP_F.load(Ordering::SeqCst), 1); assert_eq!(DROP_T.load(Ordering::SeqCst), 1); assert_eq!(DROP_S.load(Ordering::SeqCst), 1); }) .add(|| { thread::sleep(ms(200)); assert!(future::block_on(task.cancel()).is_none()); assert_eq!(POLL.load(Ordering::SeqCst), 1); assert_eq!(SCHEDULE.load(Ordering::SeqCst), 0); assert_eq!(DROP_F.load(Ordering::SeqCst), 1); assert_eq!(DROP_T.load(Ordering::SeqCst), 1); assert_eq!(DROP_S.load(Ordering::SeqCst), 1); }) .run(); }