dfir_rs/scheduled/
context.rs

1//! Module for the user-facing [`Context`] object.
2//!
3//! Provides APIs for state and scheduling.
4
5use std::any::Any;
6use std::cell::Cell;
7use std::collections::VecDeque;
8use std::future::Future;
9use std::marker::PhantomData;
10use std::ops::DerefMut;
11use std::pin::Pin;
12
13use tokio::sync::mpsc::{self, UnboundedReceiver, UnboundedSender};
14use tokio::task::JoinHandle;
15use web_time::SystemTime;
16
17use super::graph::StateLifespan;
18use super::state::StateHandle;
19use super::{LoopId, LoopTag, StateId, StateTag, SubgraphId, SubgraphTag};
20use crate::scheduled::ticks::TickInstant;
21use crate::util::priority_stack::PriorityStack;
22use crate::util::slot_vec::{SecondarySlotVec, SlotVec};
23
24/// The main state and scheduler of the runtime instance. Provided as the `context` API to each
25/// subgraph/operator as it is run.
26///
27/// Each instance stores eactly one Context inline. Before the `Context` is provided to
28/// a running operator, the `subgraph_id` field must be updated.
29pub struct Context {
30    /// Storage for the user-facing State API.
31    states: SlotVec<StateTag, StateData>,
32
33    /// Priority stack for handling strata within loops. Prioritized by loop depth.
34    pub(super) stratum_stack: PriorityStack<usize>,
35
36    /// Stack of loop nonces. Used to identify when a new loop iteration begins.
37    pub(super) loop_nonce_stack: Vec<usize>,
38
39    /// TODO(mingwei):
40    /// used for loop iteration scheduling.
41    pub(super) schedule_deferred: Vec<SubgraphId>,
42
43    /// TODO(mingwei): separate scheduler into its own struct/trait?
44    /// Index is stratum, value is FIFO queue for that stratum.
45    pub(super) stratum_queues: Vec<VecDeque<SubgraphId>>,
46
47    /// Receive events, if second arg indicates if it is an external "important" event (true).
48    pub(super) event_queue_recv: UnboundedReceiver<(SubgraphId, bool)>,
49    /// If external events or data can justify starting the next tick.
50    pub(super) can_start_tick: bool,
51    /// If the events have been received for this tick.
52    pub(super) events_received_tick: bool,
53
54    // TODO(mingwei): as long as this is here, it's impossible to know when all work is done.
55    // Second field (bool) is for if the event is an external "important" event (true).
56    pub(super) event_queue_send: UnboundedSender<(SubgraphId, bool)>,
57
58    /// If the current subgraph wants to reschedule the current loop block (in the current tick).
59    pub(super) reschedule_loop_block: Cell<bool>,
60    pub(super) allow_another_iteration: Cell<bool>,
61
62    pub(super) current_tick: TickInstant,
63    pub(super) current_stratum: usize,
64
65    pub(super) current_tick_start: SystemTime,
66    pub(super) is_first_run_this_tick: bool,
67    pub(super) loop_iter_count: usize,
68
69    /// Depth of loop (zero for top-level).
70    pub(super) loop_depth: SlotVec<LoopTag, usize>,
71    /// For each loop, state which needs to be reset between loop executions.
72    loop_states: SecondarySlotVec<LoopTag, Vec<StateId>>,
73    /// Used to differentiate between loop executions. Incremented at the start of each loop execution.
74    pub(super) loop_nonce: usize,
75
76    /// For each subgraph, state which needs to be reset between executions.
77    subgraph_states: SecondarySlotVec<SubgraphTag, Vec<StateId>>,
78
79    /// The SubgraphId of the currently running operator. When this context is
80    /// not being forwarded to a running operator, this field is meaningless.
81    pub(super) subgraph_id: SubgraphId,
82
83    tasks_to_spawn: Vec<Pin<Box<dyn Future<Output = ()> + 'static>>>,
84    /// Join handles for spawned tasks.
85    task_join_handles: Vec<JoinHandle<()>>,
86}
87/// Public APIs.
88impl Context {
89    /// Gets the current tick (local time) count.
90    pub fn current_tick(&self) -> TickInstant {
91        self.current_tick
92    }
93
94    /// Gets the timestamp of the beginning of the current tick.
95    pub fn current_tick_start(&self) -> SystemTime {
96        self.current_tick_start
97    }
98
99    /// Gets whether this is the first time this subgraph is being scheduled for this tick
100    pub fn is_first_run_this_tick(&self) -> bool {
101        self.is_first_run_this_tick
102    }
103
104    /// Gets the current loop iteration count.
105    pub fn loop_iter_count(&self) -> usize {
106        self.loop_iter_count
107    }
108
109    /// Gets the current stratum nubmer.
110    pub fn current_stratum(&self) -> usize {
111        self.current_stratum
112    }
113
114    /// Gets the ID of the current subgraph.
115    pub fn current_subgraph(&self) -> SubgraphId {
116        self.subgraph_id
117    }
118
119    /// Schedules a subgraph for the next tick.
120    ///
121    /// If `is_external` is `true`, the scheduling will trigger the next tick to begin. If it is
122    /// `false` then scheduling will be lazy and the next tick will not begin unless there is other
123    /// reason to.
124    pub fn schedule_subgraph(&self, sg_id: SubgraphId, is_external: bool) {
125        self.event_queue_send.send((sg_id, is_external)).unwrap()
126    }
127
128    /// Schedules the current loop block to be run again (_in this tick_).
129    pub fn reschedule_loop_block(&self) {
130        self.reschedule_loop_block.set(true);
131    }
132
133    /// Allow another iteration of the loop, if more data comes.
134    pub fn allow_another_iteration(&self) {
135        self.allow_another_iteration.set(true);
136    }
137
138    /// Returns a `Waker` for interacting with async Rust.
139    /// Waker events are considered to be extenral.
140    pub fn waker(&self) -> std::task::Waker {
141        use std::sync::Arc;
142
143        use futures::task::ArcWake;
144
145        struct ContextWaker {
146            subgraph_id: SubgraphId,
147            event_queue_send: UnboundedSender<(SubgraphId, bool)>,
148        }
149        impl ArcWake for ContextWaker {
150            fn wake_by_ref(arc_self: &Arc<Self>) {
151                let _recv_closed_error =
152                    arc_self.event_queue_send.send((arc_self.subgraph_id, true));
153            }
154        }
155
156        let context_waker = ContextWaker {
157            subgraph_id: self.subgraph_id,
158            event_queue_send: self.event_queue_send.clone(),
159        };
160        futures::task::waker(Arc::new(context_waker))
161    }
162
163    /// Returns a shared reference to the state.
164    ///
165    /// # Safety
166    /// `StateHandle<T>` must be from _this_ instance, created via [`Self::add_state`].
167    pub unsafe fn state_ref_unchecked<T>(&self, handle: StateHandle<T>) -> &'_ T
168    where
169        T: Any,
170    {
171        let state = self
172            .states
173            .get(handle.state_id)
174            .expect("Failed to find state with given handle.")
175            .state
176            .as_ref();
177
178        debug_assert!(state.is::<T>());
179
180        unsafe {
181            // SAFETY: `handle` is from this instance.
182            // TODO(shadaj): replace with `downcast_ref_unchecked` when it's stabilized
183            &*(state as *const dyn Any as *const T)
184        }
185    }
186
187    /// Returns a shared reference to the state.
188    pub fn state_ref<T>(&self, handle: StateHandle<T>) -> &'_ T
189    where
190        T: Any,
191    {
192        self.states
193            .get(handle.state_id)
194            .expect("Failed to find state with given handle.")
195            .state
196            .downcast_ref()
197            .expect("StateHandle wrong type T for casting.")
198    }
199
200    /// Returns an exclusive reference to the state.
201    pub fn state_mut<T>(&mut self, handle: StateHandle<T>) -> &'_ mut T
202    where
203        T: Any,
204    {
205        self.states
206            .get_mut(handle.state_id)
207            .expect("Failed to find state with given handle.")
208            .state
209            .downcast_mut()
210            .expect("StateHandle wrong type T for casting.")
211    }
212
213    /// Adds state to the context and returns the handle.
214    pub fn add_state<T>(&mut self, state: T) -> StateHandle<T>
215    where
216        T: Any,
217    {
218        let state_data = StateData {
219            state: Box::new(state),
220            lifespan_hook_fn: None,
221            lifespan: None,
222        };
223        let state_id = self.states.insert(state_data);
224
225        StateHandle {
226            state_id,
227            _phantom: PhantomData,
228        }
229    }
230
231    /// Sets a hook to modify the state at the end of each tick, using the supplied closure.
232    pub fn set_state_lifespan_hook<T>(
233        &mut self,
234        handle: StateHandle<T>,
235        lifespan: StateLifespan,
236        mut hook_fn: impl 'static + FnMut(&mut T),
237    ) where
238        T: Any,
239    {
240        let state_data = self
241            .states
242            .get_mut(handle.state_id)
243            .expect("Failed to find state with given handle.");
244        state_data.lifespan_hook_fn = Some(Box::new(move |state| {
245            (hook_fn)(state.downcast_mut::<T>().unwrap());
246        }));
247        state_data.lifespan = Some(lifespan);
248
249        match lifespan {
250            StateLifespan::Subgraph(key) => {
251                self.subgraph_states
252                    .get_or_insert_with(key, Vec::new)
253                    .push(handle.state_id);
254            }
255            StateLifespan::Loop(loop_id) => {
256                self.loop_states
257                    .get_or_insert_with(loop_id, Vec::new)
258                    .push(handle.state_id);
259            }
260            StateLifespan::Tick => {
261                // Already included in `run_state_hooks_tick`.
262            }
263            StateLifespan::Static => {
264                // Never resets.
265            }
266        }
267    }
268
269    /// Prepares an async task to be launched by [`Self::spawn_tasks`].
270    pub fn request_task<Fut>(&mut self, future: Fut)
271    where
272        Fut: Future<Output = ()> + 'static,
273    {
274        self.tasks_to_spawn.push(Box::pin(future));
275    }
276
277    /// Launches all tasks requested with [`Self::request_task`] on the internal Tokio executor.
278    pub fn spawn_tasks(&mut self) {
279        for task in self.tasks_to_spawn.drain(..) {
280            self.task_join_handles.push(tokio::task::spawn_local(task));
281        }
282    }
283
284    /// Aborts all tasks spawned with [`Self::spawn_tasks`].
285    pub fn abort_tasks(&mut self) {
286        for task in self.task_join_handles.drain(..) {
287            task.abort();
288        }
289    }
290
291    /// Waits for all tasks spawned with [`Self::spawn_tasks`] to complete.
292    ///
293    /// Will probably just hang.
294    pub async fn join_tasks(&mut self) {
295        futures::future::join_all(self.task_join_handles.drain(..)).await;
296    }
297}
298
299impl Default for Context {
300    fn default() -> Self {
301        let stratum_queues = vec![Default::default()]; // Always initialize stratum #0.
302        let (event_queue_send, event_queue_recv) = mpsc::unbounded_channel();
303        let (stratum_stack, loop_depth) = Default::default();
304        Self {
305            states: SlotVec::new(),
306
307            stratum_stack,
308
309            loop_nonce_stack: Vec::new(),
310
311            schedule_deferred: Vec::new(),
312
313            stratum_queues,
314            event_queue_recv,
315            can_start_tick: false,
316            events_received_tick: false,
317
318            event_queue_send,
319            reschedule_loop_block: Cell::new(false),
320            allow_another_iteration: Cell::new(false),
321
322            current_stratum: 0,
323            current_tick: TickInstant::default(),
324
325            current_tick_start: SystemTime::now(),
326            is_first_run_this_tick: false,
327            loop_iter_count: 0,
328
329            loop_depth,
330            loop_states: SecondarySlotVec::new(),
331            loop_nonce: 0,
332
333            subgraph_states: SecondarySlotVec::new(),
334
335            // Will be re-set before use.
336            subgraph_id: SubgraphId::from_raw(0),
337
338            tasks_to_spawn: Vec::new(),
339            task_join_handles: Vec::new(),
340        }
341    }
342}
343/// Internal APIs.
344impl Context {
345    /// Makes sure stratum STRATUM is initialized.
346    pub(super) fn init_stratum(&mut self, stratum: usize) {
347        if self.stratum_queues.len() <= stratum {
348            self.stratum_queues
349                .resize_with(stratum + 1, Default::default);
350        }
351    }
352
353    /// Call this at the end of a tick,
354    pub(super) fn run_state_hooks_tick(&mut self) {
355        tracing::trace!("Running state hooks for tick.");
356        for state_data in self.states.values_mut() {
357            let StateData {
358                state,
359                lifespan_hook_fn: Some(lifespan_hook_fn),
360                lifespan: Some(StateLifespan::Tick),
361            } = state_data
362            else {
363                continue;
364            };
365            (lifespan_hook_fn)(Box::deref_mut(state));
366        }
367    }
368
369    pub(super) fn run_state_hooks_subgraph(&mut self, subgraph_id: SubgraphId) {
370        tracing::trace!("Running state hooks for subgraph.");
371        for state_id in self.subgraph_states.get(subgraph_id).into_iter().flatten() {
372            let StateData {
373                state,
374                lifespan_hook_fn,
375                lifespan: _,
376            } = self
377                .states
378                .get_mut(*state_id)
379                .expect("Failed to find state with given ID.");
380
381            if let Some(lifespan_hook_fn) = lifespan_hook_fn {
382                (lifespan_hook_fn)(Box::deref_mut(state));
383            }
384        }
385    }
386
387    // Run the state hooks for each state in the loop.
388    // Call at the end of each loop execution.
389    pub(super) fn run_state_hooks_loop(&mut self, loop_id: LoopId) {
390        tracing::trace!(
391            loop_id = loop_id.to_string(),
392            "Running state hooks for loop."
393        );
394        for state_id in self.loop_states.get(loop_id).into_iter().flatten() {
395            let StateData {
396                state,
397                lifespan_hook_fn,
398                lifespan: _,
399            } = self
400                .states
401                .get_mut(*state_id)
402                .expect("Failed to find state with given ID.");
403
404            if let Some(lifespan_hook_fn) = lifespan_hook_fn {
405                (lifespan_hook_fn)(Box::deref_mut(state));
406            }
407        }
408    }
409}
410
411/// Internal struct containing a pointer to instance-owned state.
412struct StateData {
413    state: Box<dyn Any>,
414    lifespan_hook_fn: Option<LifespanResetFn>, // TODO(mingwei): replace with trait?
415    /// `None` for static.
416    lifespan: Option<StateLifespan>,
417}
418type LifespanResetFn = Box<dyn FnMut(&mut dyn Any)>;