dope-runtime 0.2.2

Thin io_uring adaptor with "Manifolds"
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

use std::cmp::Reverse;
use std::collections::{BinaryHeap, HashMap};
use std::{task::Waker, time::Instant};

use dambi::LocalCell;

pub(crate) struct TimerHeap {
    inner: LocalCell<TimerHeapInner>,
}

struct TimerHeapInner {
    next_id: u64,
    heap: BinaryHeap<Reverse<(Instant, u64)>>,
    entries: HashMap<u64, TimerEntry>,
}

struct TimerEntry {
    deadline: Instant,
    waker: Option<Waker>,
}

impl TimerHeap {
    pub(crate) fn new() -> Self {
        Self {
            inner: LocalCell::new(TimerHeapInner {
                next_id: 1,
                heap: BinaryHeap::new(),
                entries: HashMap::new(),
            }),
        }
    }

    pub(crate) fn register(&self, id: Option<u64>, deadline: Instant, waker: &Waker) -> u64 {
        let inner = self.inner.get_mut();

        if let Some(id) = id
            && let Some(ent) = inner.entries.get_mut(&id)
        {
            ent.deadline = deadline;
            ent.waker = Some(waker.clone());
            inner.heap.push(Reverse((deadline, id)));
            return id;
        }

        let id = inner.next_id;
        inner.next_id = inner.next_id.wrapping_add(1);

        inner.entries.insert(
            id,
            TimerEntry {
                deadline,
                waker: Some(waker.clone()),
            },
        );
        inner.heap.push(Reverse((deadline, id)));
        id
    }

    pub(crate) fn cancel(&self, id: u64) {
        let inner = self.inner.get_mut();
        let _ = inner.entries.remove(&id);
    }

    pub(crate) fn wake_due(&self) {
        let inner = self.inner.get_mut();
        if inner.heap.is_empty() {
            return;
        }
        let now = Instant::now();
        while let Some(Reverse((deadline, id))) = inner.heap.peek().copied() {
            if deadline > now {
                break;
            }
            let _ = inner.heap.pop();
            let Some(ent) = inner.entries.get(&id) else {
                continue;
            };
            if ent.deadline != deadline {
                continue;
            }
            let ent = inner.entries.remove(&id);
            if let Some(ent) = ent
                && let Some(w) = ent.waker
            {
                w.wake();
            }
        }
    }

    pub(crate) fn next_deadline(&self) -> Option<Instant> {
        let inner = self.inner.get_mut();
        loop {
            let Reverse((deadline, id)) = inner.heap.peek().copied()?;
            let Some(ent) = inner.entries.get(&id) else {
                let _ = inner.heap.pop();
                continue;
            };
            if ent.deadline == deadline {
                return Some(deadline);
            }
            let _ = inner.heap.pop();
        }
    }
}