Skip to main content

ic_timers/
schedule.rs

1//! Checked cadence and scheduling decisions.
2
3use crate::snapshot::{TimerControlFailure, TimerSchedulingMode};
4use std::time::Duration;
5use thiserror::Error;
6
7/// Validated positive recurrence cadence.
8#[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]
9pub struct TimerCadence(u64);
10
11impl TimerCadence {
12    /// Validate a recurrence cadence.
13    pub fn new(cadence: Duration) -> Result<Self, ScheduleError> {
14        let cadence_ns = duration_ns(cadence)?;
15        Self::from_nanos(cadence_ns)
16    }
17
18    /// Validate an already encoded nanosecond cadence.
19    pub const fn from_nanos(cadence_ns: u64) -> Result<Self, ScheduleError> {
20        if cadence_ns == 0 {
21            Err(ScheduleError::ZeroCadence)
22        } else {
23            Ok(Self(cadence_ns))
24        }
25    }
26
27    /// Return the encoded cadence in nanoseconds.
28    #[must_use]
29    pub const fn as_nanos(self) -> u64 {
30        self.0
31    }
32
33    /// Resolve one successor relative to the supplied dispatch time.
34    pub(super) const fn deadline_after(self, now_ns: u64) -> Result<u64, ScheduleError> {
35        checked_deadline_after(now_ns, self.0)
36    }
37}
38
39/// Initial or explicit request for a timer deadline.
40#[derive(Clone, Copy, Debug, Eq, PartialEq)]
41pub enum TimerSchedule {
42    /// Schedule relative to the current IC time.
43    After(Duration),
44    /// Schedule at an absolute IC timestamp in nanoseconds.
45    At(u64),
46}
47
48impl TimerSchedule {
49    /// Resolve the request with its absolute deadline, relative delay and mode.
50    pub(super) fn resolve(self, now_ns: u64) -> Result<ResolvedSchedule, ScheduleError> {
51        match self {
52            Self::After(delay) => {
53                let delay_ns = duration_ns(delay)?;
54                Ok(ResolvedSchedule {
55                    deadline_ns: checked_deadline_after(now_ns, delay_ns)?,
56                    requested_delay_ns: Some(delay_ns),
57                    mode: TimerSchedulingMode::Once,
58                })
59            }
60            Self::At(deadline_ns) => Ok(ResolvedSchedule {
61                deadline_ns,
62                requested_delay_ns: None,
63                mode: TimerSchedulingMode::Deadline,
64            }),
65        }
66    }
67}
68
69/// Scheduling decision returned after one bounded ordinary invocation.
70#[derive(Clone, Copy, Debug, Eq, PartialEq)]
71pub enum TimerDirective {
72    /// Do not schedule another invocation.
73    Stop,
74    /// Continue as soon as the runtime can execute another message.
75    ContinueImmediately,
76    /// Retry after the provided delay.
77    RetryAfter(Duration),
78    /// Schedule at an absolute IC timestamp in nanoseconds.
79    ScheduleAt(u64),
80    /// Recur using the registration's configured after-completion cadence.
81    RecurAfterCompletion,
82}
83
84impl TimerDirective {
85    pub(super) fn resolve(
86        self,
87        now_ns: u64,
88        cadence: Option<TimerCadence>,
89    ) -> Result<Option<ResolvedSchedule>, TimerControlFailure> {
90        match self {
91            Self::Stop => Ok(None),
92            Self::ContinueImmediately => Ok(Some(ResolvedSchedule {
93                deadline_ns: now_ns,
94                requested_delay_ns: Some(0),
95                mode: TimerSchedulingMode::Continuation,
96            })),
97            Self::RetryAfter(delay) => {
98                let delay_ns = duration_ns(delay).map_err(ScheduleError::control_failure)?;
99                Ok(Some(ResolvedSchedule {
100                    deadline_ns: checked_deadline_after(now_ns, delay_ns)
101                        .map_err(ScheduleError::control_failure)?,
102                    requested_delay_ns: Some(delay_ns),
103                    mode: TimerSchedulingMode::Retry,
104                }))
105            }
106            Self::ScheduleAt(deadline_ns) => Ok(Some(ResolvedSchedule {
107                deadline_ns,
108                requested_delay_ns: None,
109                mode: TimerSchedulingMode::Deadline,
110            })),
111            Self::RecurAfterCompletion => {
112                let cadence = cadence.ok_or(TimerControlFailure::DirectiveNotAllowed)?;
113                Ok(Some(ResolvedSchedule {
114                    deadline_ns: cadence
115                        .deadline_after(now_ns)
116                        .map_err(ScheduleError::control_failure)?,
117                    requested_delay_ns: Some(cadence.as_nanos()),
118                    mode: TimerSchedulingMode::AfterCompletion,
119                }))
120            }
121        }
122    }
123}
124
125/// Failure to represent a cadence or requested deadline.
126#[non_exhaustive]
127#[derive(Clone, Copy, Debug, Eq, Error, PartialEq)]
128pub enum ScheduleError {
129    /// A recurring timer must advance by a positive duration.
130    #[error("timer cadence must be greater than zero")]
131    ZeroCadence,
132    /// The duration cannot be represented as nanoseconds in a `u64`.
133    #[error("timer delay exceeds the supported nanosecond range")]
134    DelayOutOfRange,
135    /// Adding the delay to the current time overflows a `u64`.
136    #[error("timer deadline exceeds the supported timestamp range")]
137    DeadlineOverflow,
138}
139
140impl ScheduleError {
141    // Invalid callback successors are terminal control failures; explicit
142    // scheduling requests keep returning ScheduleError at their input boundary.
143    const fn control_failure(self) -> TimerControlFailure {
144        match self {
145            Self::ZeroCadence => TimerControlFailure::DirectiveNotAllowed,
146            Self::DelayOutOfRange => TimerControlFailure::DelayOutOfRange,
147            Self::DeadlineOverflow => TimerControlFailure::DeadlineOverflow,
148        }
149    }
150}
151
152#[derive(Clone, Copy, Debug, Eq, PartialEq)]
153pub struct ResolvedSchedule {
154    pub(crate) deadline_ns: u64,
155    pub(crate) requested_delay_ns: Option<u64>,
156    pub(crate) mode: TimerSchedulingMode,
157}
158
159const fn checked_deadline_after(now_ns: u64, delay_ns: u64) -> Result<u64, ScheduleError> {
160    match now_ns.checked_add(delay_ns) {
161        Some(deadline_ns) => Ok(deadline_ns),
162        None => Err(ScheduleError::DeadlineOverflow),
163    }
164}
165
166pub fn duration_ns(duration: Duration) -> Result<u64, ScheduleError> {
167    u64::try_from(duration.as_nanos()).map_err(|_| ScheduleError::DelayOutOfRange)
168}
169
170#[cfg(test)]
171mod tests {
172    use super::*;
173
174    #[test]
175    fn cadence_is_positive_bounded_and_checked() {
176        assert_eq!(
177            TimerCadence::new(Duration::ZERO),
178            Err(ScheduleError::ZeroCadence)
179        );
180        assert_eq!(
181            TimerCadence::new(Duration::from_secs(u64::MAX)),
182            Err(ScheduleError::DelayOutOfRange)
183        );
184
185        let cadence =
186            TimerCadence::new(Duration::from_nanos(5)).expect("positive cadence should be valid");
187        assert_eq!(cadence.as_nanos(), 5);
188        assert_eq!(cadence.deadline_after(10), Ok(15));
189        assert_eq!(
190            cadence.deadline_after(u64::MAX),
191            Err(ScheduleError::DeadlineOverflow)
192        );
193    }
194
195    #[test]
196    fn schedules_and_directives_resolve_without_truncation() {
197        assert_eq!(
198            TimerSchedule::After(Duration::from_nanos(5)).resolve(10),
199            Ok(ResolvedSchedule {
200                deadline_ns: 15,
201                requested_delay_ns: Some(5),
202                mode: TimerSchedulingMode::Once,
203            })
204        );
205        assert_eq!(
206            TimerSchedule::At(7).resolve(10),
207            Ok(ResolvedSchedule {
208                deadline_ns: 7,
209                requested_delay_ns: None,
210                mode: TimerSchedulingMode::Deadline,
211            })
212        );
213        assert_eq!(TimerDirective::Stop.resolve(10, None), Ok(None));
214        assert_eq!(
215            TimerDirective::ContinueImmediately.resolve(10, None),
216            Ok(Some(ResolvedSchedule {
217                deadline_ns: 10,
218                requested_delay_ns: Some(0),
219                mode: TimerSchedulingMode::Continuation,
220            }))
221        );
222        assert_eq!(
223            TimerDirective::RetryAfter(Duration::from_nanos(5)).resolve(10, None),
224            Ok(Some(ResolvedSchedule {
225                deadline_ns: 15,
226                requested_delay_ns: Some(5),
227                mode: TimerSchedulingMode::Retry,
228            }))
229        );
230        assert_eq!(
231            TimerDirective::ScheduleAt(7).resolve(10, None),
232            Ok(Some(ResolvedSchedule {
233                deadline_ns: 7,
234                requested_delay_ns: None,
235                mode: TimerSchedulingMode::Deadline,
236            }))
237        );
238
239        let cadence = TimerCadence::from_nanos(9).expect("fixture cadence should be valid");
240        assert_eq!(
241            TimerDirective::RecurAfterCompletion.resolve(10, Some(cadence)),
242            Ok(Some(ResolvedSchedule {
243                deadline_ns: 19,
244                requested_delay_ns: Some(9),
245                mode: TimerSchedulingMode::AfterCompletion,
246            }))
247        );
248        assert_eq!(
249            TimerDirective::RecurAfterCompletion.resolve(10, None),
250            Err(TimerControlFailure::DirectiveNotAllowed)
251        );
252        assert_eq!(
253            TimerDirective::RetryAfter(Duration::from_nanos(1)).resolve(u64::MAX, None),
254            Err(TimerControlFailure::DeadlineOverflow)
255        );
256        assert_eq!(
257            TimerDirective::RetryAfter(Duration::MAX).resolve(0, None),
258            Err(TimerControlFailure::DelayOutOfRange)
259        );
260        assert_eq!(
261            TimerDirective::RecurAfterCompletion.resolve(u64::MAX, Some(cadence)),
262            Err(TimerControlFailure::DeadlineOverflow)
263        );
264    }
265}