Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 1 | #pragma once |
2 | |||||
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 3 | #include <boost/circular_buffer.hpp> |
4 | #include <boost/circular_buffer/space_optimized.hpp> | ||||
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 5 | #include <chrono> |
6 | #include <functional> | ||||
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 7 | |
Ed Tanous | c94ad49 | 2019-10-10 15:39:33 -0700 | [diff] [blame] | 8 | #include "logging.h" |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 9 | |
10 | namespace crow | ||||
11 | { | ||||
12 | namespace detail | ||||
13 | { | ||||
James Feist | f0af859 | 2020-03-27 16:28:59 -0700 | [diff] [blame] | 14 | |
15 | constexpr const size_t timerQueueTimeoutSeconds = 5; | ||||
16 | |||||
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 17 | // fast timer queue for fixed tick value. |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 18 | class TimerQueue |
19 | { | ||||
20 | public: | ||||
21 | TimerQueue() | ||||
22 | { | ||||
23 | dq.set_capacity(100); | ||||
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 24 | } |
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 25 | |
Ed Tanous | 271584a | 2019-07-09 16:24:22 -0700 | [diff] [blame] | 26 | void cancel(size_t k) |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 27 | { |
Ed Tanous | 271584a | 2019-07-09 16:24:22 -0700 | [diff] [blame] | 28 | size_t index = k - step; |
Ed Tanous | b01bf29 | 2019-03-25 19:25:26 +0000 | [diff] [blame] | 29 | if (index < dq.size()) |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 30 | { |
Ed Tanous | b01bf29 | 2019-03-25 19:25:26 +0000 | [diff] [blame] | 31 | dq[index].second = nullptr; |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 32 | } |
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 33 | } |
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 34 | |
Ed Tanous | 271584a | 2019-07-09 16:24:22 -0700 | [diff] [blame] | 35 | size_t add(std::function<void()> f) |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 36 | { |
37 | dq.push_back( | ||||
38 | std::make_pair(std::chrono::steady_clock::now(), std::move(f))); | ||||
Ed Tanous | 271584a | 2019-07-09 16:24:22 -0700 | [diff] [blame] | 39 | size_t ret = step + dq.size() - 1; |
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 40 | |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 41 | BMCWEB_LOG_DEBUG << "timer add inside: " << this << ' ' << ret; |
42 | return ret; | ||||
43 | } | ||||
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 44 | |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 45 | void process() |
46 | { | ||||
47 | auto now = std::chrono::steady_clock::now(); | ||||
48 | while (!dq.empty()) | ||||
49 | { | ||||
50 | auto& x = dq.front(); | ||||
Jan Sowinski | 2b5e08e | 2020-01-09 17:16:02 +0100 | [diff] [blame] | 51 | // Check expiration time only for active handlers, |
52 | // remove canceled ones immediately | ||||
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 53 | if (x.second) |
54 | { | ||||
James Feist | f0af859 | 2020-03-27 16:28:59 -0700 | [diff] [blame] | 55 | if (now - x.first < |
56 | std::chrono::seconds(timerQueueTimeoutSeconds)) | ||||
Jan Sowinski | 2b5e08e | 2020-01-09 17:16:02 +0100 | [diff] [blame] | 57 | { |
58 | break; | ||||
59 | } | ||||
60 | |||||
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 61 | BMCWEB_LOG_DEBUG << "timer call: " << this << ' ' << step; |
62 | // we know that timer handlers are very simple currenty; call | ||||
63 | // here | ||||
64 | x.second(); | ||||
65 | } | ||||
66 | dq.pop_front(); | ||||
67 | step++; | ||||
68 | } | ||||
69 | } | ||||
70 | |||||
71 | private: | ||||
72 | using storage_type = | ||||
73 | std::pair<std::chrono::time_point<std::chrono::steady_clock>, | ||||
74 | std::function<void()>>; | ||||
75 | |||||
76 | boost::circular_buffer_space_optimized<storage_type, | ||||
77 | std::allocator<storage_type>> | ||||
78 | dq{}; | ||||
79 | |||||
80 | // boost::circular_buffer<storage_type> dq{20}; | ||||
81 | // std::deque<storage_type> dq{}; | ||||
Ed Tanous | 271584a | 2019-07-09 16:24:22 -0700 | [diff] [blame] | 82 | size_t step{}; |
Ed Tanous | e0d918b | 2018-03-27 17:41:04 -0700 | [diff] [blame] | 83 | }; |
Ed Tanous | 1abe55e | 2018-09-05 08:30:59 -0700 | [diff] [blame] | 84 | } // namespace detail |
85 | } // namespace crow |