dope-manifold 0.35.0

Owned application and service composition for dope
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132

use std::{task, time};

use dope_core::driver::{
    route::Identity,
    schedule::{
        clock::{self, timer},
        maint,
        ready::{self, wake},
    },
};

use crate::client::conn::engine::drive::phase;

pub(in crate::client::conn::engine) struct Cycle<'d, ID: Identity, P> {
    backoff: timer::Alarm<'d>,
    retry: timer::Alarm<'d>,
    attempts: Attempts,
    phase: P,
    slot: ready::Slot<'d, ID>,
}

#[derive(Clone, Copy)]
#[repr(transparent)]
pub(in crate::client) struct Attempts(u8);

impl Attempts {
    pub(in crate::client) const INITIAL: Self = Self(0);
    const MAX_SHIFT: u8 = 10;

    pub(in crate::client) const fn retry_millis(self) -> u64 {
        1_u64 << self.0 as u32
    }

    /// Advances this attempt count and returns the exact retry instant it schedules.
    pub(in crate::client) fn defer<'d>(&mut self, now: clock::Moment<'d>) -> clock::Deadline<'d> {
        let at = now.clamp_add(time::Duration::from_millis(self.retry_millis()));
        self.advance();
        at
    }

    pub(in crate::client) fn advance(&mut self) {
        if self.0 < Self::MAX_SHIFT {
            self.0 += 1;
        }
    }
}

impl<'d, ID: Identity, P: phase::Sequence> Cycle<'d, ID, P> {
    pub(in crate::client::conn::engine) fn advance(
        &mut self,
        work: maint::Work<'_, 'd>,
        active: bool,
    ) -> Option<P::Step> {
        if work.remaining() == 0 {
            if active {
                self.slot.activate();
            }
            return None;
        }
        Some(self.phase.advance())
    }
}

impl<'d, ID: Identity, P> Cycle<'d, ID, P> {
    pub(in crate::client::conn::engine) fn new(
        timer: timer::Timer<'d>,
        slot: ready::Slot<'d, ID>,
        phase: P,
    ) -> Result<Self, timer::Exhausted> {
        Ok(Self {
            backoff: timer.try_alarm()?,
            retry: timer.try_alarm()?,
            attempts: Attempts::INITIAL,
            phase,
            slot,
        })
    }

    pub(in crate::client::conn::engine) fn target(&self) -> ready::Target<'d> {
        self.slot.target()
    }

    pub(in crate::client::conn::engine) fn activate(&self) {
        self.slot.activate();
    }

    pub(in crate::client::conn::engine) fn poll_backoff(
        &mut self,
        now: clock::Moment<'d>,
        wake: wake::Waker<'d>,
    ) -> task::Poll<()> {
        self.backoff.poll(now, wake)
    }

    pub(in crate::client::conn::engine) fn arm_backoff(
        &mut self,
        deadline: clock::Deadline<'d>,
        wake: wake::Waker<'d>,
    ) {
        self.backoff.arm(deadline, wake);
    }

    pub(in crate::client::conn::engine) fn has_retry(&self) -> bool {
        self.retry.is_armed()
    }

    pub(in crate::client::conn::engine) fn poll_retry(
        &mut self,
        now: clock::Moment<'d>,
        wake: wake::Waker<'d>,
    ) -> task::Poll<()> {
        self.retry.poll(now, wake)
    }

    pub(in crate::client::conn::engine) fn defer_retry(
        &mut self,
        now: clock::Moment<'d>,
        wake: wake::Waker<'d>,
    ) {
        let at = self.attempts.defer(now);
        self.retry.arm(at, wake);
    }

    pub(in crate::client::conn::engine) fn reset_retry(&mut self) {
        self.attempts = Attempts::INITIAL;
    }

    pub(in crate::client::conn::engine) fn stop(&mut self) {
        self.backoff.clear();
        self.retry.clear();
    }
}