| 1 |
|
|
1 |
|
|
| 2 |
|
// Copyright (c) 2025 Vinnie Falco (vinnie.falco@gmail.com)
|
2 |
|
// Copyright (c) 2025 Vinnie Falco (vinnie.falco@gmail.com)
|
| 3 |
|
// Copyright (c) 2026 Steve Gerbino
|
3 |
|
// Copyright (c) 2026 Steve Gerbino
|
| 4 |
|
|
4 |
|
|
| 5 |
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
5 |
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
| 6 |
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
6 |
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
| 7 |
|
|
7 |
|
|
| 8 |
|
// Official repository: https://github.com/cppalliance/corosio
|
8 |
|
// Official repository: https://github.com/cppalliance/corosio
|
| 9 |
|
|
9 |
|
|
| 10 |
|
|
10 |
|
|
| 11 |
|
#ifndef BOOST_COROSIO_DETAIL_TIMER_SERVICE_HPP
|
11 |
|
#ifndef BOOST_COROSIO_DETAIL_TIMER_SERVICE_HPP
|
| 12 |
|
#define BOOST_COROSIO_DETAIL_TIMER_SERVICE_HPP
|
12 |
|
#define BOOST_COROSIO_DETAIL_TIMER_SERVICE_HPP
|
| 13 |
|
|
13 |
|
|
| 14 |
|
#include <boost/corosio/timer.hpp>
|
14 |
|
#include <boost/corosio/timer.hpp>
|
| 15 |
|
#include <boost/corosio/io_context.hpp>
|
15 |
|
#include <boost/corosio/io_context.hpp>
|
| 16 |
|
#include <boost/corosio/detail/scheduler_op.hpp>
|
16 |
|
#include <boost/corosio/detail/scheduler_op.hpp>
|
| 17 |
|
#include <boost/corosio/native/native_scheduler.hpp>
|
17 |
|
#include <boost/corosio/native/native_scheduler.hpp>
|
| 18 |
|
#include <boost/corosio/detail/intrusive.hpp>
|
18 |
|
#include <boost/corosio/detail/intrusive.hpp>
|
| 19 |
|
#include <boost/corosio/detail/thread_local_ptr.hpp>
|
19 |
|
#include <boost/corosio/detail/thread_local_ptr.hpp>
|
| 20 |
|
#include <boost/capy/error.hpp>
|
20 |
|
#include <boost/capy/error.hpp>
|
| 21 |
|
#include <boost/capy/ex/execution_context.hpp>
|
21 |
|
#include <boost/capy/ex/execution_context.hpp>
|
| 22 |
|
#include <boost/capy/ex/executor_ref.hpp>
|
22 |
|
#include <boost/capy/ex/executor_ref.hpp>
|
| 23 |
|
|
23 |
|
|
| 24 |
|
|
24 |
|
|
| 25 |
|
|
25 |
|
|
| 26 |
|
|
26 |
|
|
| 27 |
|
|
27 |
|
|
| 28 |
|
|
28 |
|
|
| 29 |
|
|
29 |
|
|
| 30 |
|
|
30 |
|
|
| 31 |
|
|
31 |
|
|
| 32 |
|
|
32 |
|
|
| 33 |
|
|
33 |
|
|
| 34 |
|
|
34 |
|
|
| 35 |
|
|
35 |
|
|
| 36 |
|
namespace boost::corosio::detail {
|
36 |
|
namespace boost::corosio::detail {
|
| 37 |
|
|
37 |
|
|
| 38 |
|
|
38 |
|
|
| 39 |
|
|
39 |
|
|
| 40 |
|
|
40 |
|
|
| 41 |
|
|
41 |
|
|
| 42 |
|
|
42 |
|
|
| 43 |
|
|
43 |
|
|
| 44 |
|
|
44 |
|
|
| 45 |
|
|
45 |
|
|
| 46 |
|
waiter_node holds per-waiter state: coroutine handle, executor,
|
46 |
|
waiter_node holds per-waiter state: coroutine handle, executor,
|
| 47 |
|
error output, stop_token, embedded completion_op. Each concurrent
|
47 |
|
error output, stop_token, embedded completion_op. Each concurrent
|
| 48 |
|
co_await t.wait() allocates one waiter_node.
|
48 |
|
co_await t.wait() allocates one waiter_node.
|
| 49 |
|
|
49 |
|
|
| 50 |
|
timer_service::implementation holds per-timer state: expiry,
|
50 |
|
timer_service::implementation holds per-timer state: expiry,
|
| 51 |
|
heap index, and an intrusive_list of waiter_nodes. Multiple
|
51 |
|
heap index, and an intrusive_list of waiter_nodes. Multiple
|
| 52 |
|
coroutines can wait on the same timer simultaneously.
|
52 |
|
coroutines can wait on the same timer simultaneously.
|
| 53 |
|
|
53 |
|
|
| 54 |
|
timer_service owns a min-heap of active timers, a free list
|
54 |
|
timer_service owns a min-heap of active timers, a free list
|
| 55 |
|
of recycled impls, and a free list of recycled waiter_nodes. The
|
55 |
|
of recycled impls, and a free list of recycled waiter_nodes. The
|
| 56 |
|
heap is ordered by expiry time; the scheduler queries
|
56 |
|
heap is ordered by expiry time; the scheduler queries
|
| 57 |
|
nearest_expiry() to set the epoll/timerfd timeout.
|
57 |
|
nearest_expiry() to set the epoll/timerfd timeout.
|
| 58 |
|
|
58 |
|
|
| 59 |
|
|
59 |
|
|
| 60 |
|
|
60 |
|
|
| 61 |
|
1. Deferred heap insertion — expires_after() stores the expiry
|
61 |
|
1. Deferred heap insertion — expires_after() stores the expiry
|
| 62 |
|
but does not insert into the heap. Insertion happens in wait().
|
62 |
|
but does not insert into the heap. Insertion happens in wait().
|
| 63 |
|
2. Thread-local impl cache — single-slot per-thread cache.
|
63 |
|
2. Thread-local impl cache — single-slot per-thread cache.
|
| 64 |
|
3. Embedded completion_op — eliminates heap allocation per fire/cancel.
|
64 |
|
3. Embedded completion_op — eliminates heap allocation per fire/cancel.
|
| 65 |
|
4. Cached nearest expiry — atomic avoids mutex in nearest_expiry().
|
65 |
|
4. Cached nearest expiry — atomic avoids mutex in nearest_expiry().
|
| 66 |
|
5. might_have_pending_waits_ flag — skips lock when no wait issued.
|
66 |
|
5. might_have_pending_waits_ flag — skips lock when no wait issued.
|
| 67 |
|
6. Thread-local waiter cache — single-slot per-thread cache.
|
67 |
|
6. Thread-local waiter cache — single-slot per-thread cache.
|
| 68 |
|
|
68 |
|
|
| 69 |
|
|
69 |
|
|
| 70 |
|
|
70 |
|
|
| 71 |
|
stop_token callbacks can fire from any thread. The impl_
|
71 |
|
stop_token callbacks can fire from any thread. The impl_
|
| 72 |
|
pointer on waiter_node is used as a "still in list" marker.
|
72 |
|
pointer on waiter_node is used as a "still in list" marker.
|
| 73 |
|
|
73 |
|
|
| 74 |
|
|
74 |
|
|
| 75 |
|
struct BOOST_COROSIO_SYMBOL_VISIBLE waiter_node;
|
75 |
|
struct BOOST_COROSIO_SYMBOL_VISIBLE waiter_node;
|
| 76 |
|
|
76 |
|
|
| 77 |
|
inline void timer_service_invalidate_cache() noexcept;
|
77 |
|
inline void timer_service_invalidate_cache() noexcept;
|
| 78 |
|
|
78 |
|
|
| 79 |
|
// timer_service class body — member function definitions are
|
79 |
|
// timer_service class body — member function definitions are
|
| 80 |
|
// out-of-class (after implementation and waiter_node are complete)
|
80 |
|
// out-of-class (after implementation and waiter_node are complete)
|
| 81 |
|
class BOOST_COROSIO_DECL timer_service final
|
81 |
|
class BOOST_COROSIO_DECL timer_service final
|
| 82 |
|
: public capy::execution_context::service
|
82 |
|
: public capy::execution_context::service
|
| 83 |
|
, public io_object::io_service
|
83 |
|
, public io_object::io_service
|
| 84 |
|
|
84 |
|
|
| 85 |
|
|
85 |
|
|
| 86 |
|
using clock_type = std::chrono::steady_clock;
|
86 |
|
using clock_type = std::chrono::steady_clock;
|
| 87 |
|
using time_point = clock_type::time_point;
|
87 |
|
using time_point = clock_type::time_point;
|
| 88 |
|
|
88 |
|
|
| 89 |
|
|
89 |
|
|
| 90 |
|
|
90 |
|
|
| 91 |
|
|
91 |
|
|
| 92 |
|
void (*fn_)(void*) = nullptr;
|
92 |
|
void (*fn_)(void*) = nullptr;
|
| 93 |
|
|
93 |
|
|
| 94 |
|
|
94 |
|
|
| 95 |
|
|
95 |
|
|
| 96 |
|
callback(void* ctx, void (*fn)(void*)) noexcept : ctx_(ctx), fn_(fn) {}
|
96 |
|
callback(void* ctx, void (*fn)(void*)) noexcept : ctx_(ctx), fn_(fn) {}
|
| 97 |
|
|
97 |
|
|
| 98 |
|
explicit operator bool() const noexcept
|
98 |
|
explicit operator bool() const noexcept
|
| 99 |
|
|
99 |
|
|
| 100 |
|
|
100 |
|
|
| 101 |
|
|
101 |
|
|
| 102 |
|
|
102 |
|
|
| 103 |
|
|
103 |
|
|
| 104 |
|
|
104 |
|
|
| 105 |
|
|
105 |
|
|
| 106 |
|
|
106 |
|
|
| 107 |
|
|
107 |
|
|
| 108 |
|
|
108 |
|
|
| 109 |
|
|
109 |
|
|
| 110 |
|
|
110 |
|
|
| 111 |
|
|
111 |
|
|
| 112 |
|
|
112 |
|
|
| 113 |
|
|
113 |
|
|
| 114 |
|
|
114 |
|
|
| 115 |
|
|
115 |
|
|
| 116 |
|
|
116 |
|
|
| 117 |
|
|
117 |
|
|
| 118 |
|
scheduler* sched_ = nullptr;
|
118 |
|
scheduler* sched_ = nullptr;
|
| 119 |
|
mutable std::mutex mutex_;
|
119 |
|
mutable std::mutex mutex_;
|
| 120 |
|
std::vector<heap_entry> heap_;
|
120 |
|
std::vector<heap_entry> heap_;
|
| 121 |
|
implementation* free_list_ = nullptr;
|
121 |
|
implementation* free_list_ = nullptr;
|
| 122 |
|
waiter_node* waiter_free_list_ = nullptr;
|
122 |
|
waiter_node* waiter_free_list_ = nullptr;
|
| 123 |
|
callback on_earliest_changed_;
|
123 |
|
callback on_earliest_changed_;
|
| 124 |
|
// Avoids mutex in nearest_expiry() and empty()
|
124 |
|
// Avoids mutex in nearest_expiry() and empty()
|
| 125 |
|
mutable std::atomic<std::int64_t> cached_nearest_ns_{
|
125 |
|
mutable std::atomic<std::int64_t> cached_nearest_ns_{
|
| 126 |
|
(std::numeric_limits<std::int64_t>::max)()};
|
126 |
|
(std::numeric_limits<std::int64_t>::max)()};
|
| 127 |
|
|
127 |
|
|
| 128 |
|
|
128 |
|
|
| 129 |
|
inline timer_service(capy::execution_context&, scheduler& sched)
|
129 |
|
inline timer_service(capy::execution_context&, scheduler& sched)
|
| 130 |
|
|
130 |
|
|
| 131 |
|
|
131 |
|
|
| 132 |
|
|
132 |
|
|
| 133 |
|
|
133 |
|
|
| 134 |
|
inline scheduler& get_scheduler() noexcept
|
134 |
|
inline scheduler& get_scheduler() noexcept
|
| 135 |
|
|
135 |
|
|
| 136 |
|
|
136 |
|
|
| 137 |
|
|
137 |
|
|
| 138 |
|
|
138 |
|
|
| 139 |
|
~timer_service() override = default;
|
139 |
|
~timer_service() override = default;
|
| 140 |
|
|
140 |
|
|
| 141 |
|
timer_service(timer_service const&) = delete;
|
141 |
|
timer_service(timer_service const&) = delete;
|
| 142 |
|
timer_service& operator=(timer_service const&) = delete;
|
142 |
|
timer_service& operator=(timer_service const&) = delete;
|
| 143 |
|
|
143 |
|
|
| 144 |
|
inline void set_on_earliest_changed(callback cb)
|
144 |
|
inline void set_on_earliest_changed(callback cb)
|
| 145 |
|
|
145 |
|
|
| 146 |
|
on_earliest_changed_ = cb;
|
146 |
|
on_earliest_changed_ = cb;
|
| 147 |
|
|
147 |
|
|
| 148 |
|
|
148 |
|
|
| 149 |
|
inline bool empty() const noexcept
|
149 |
|
inline bool empty() const noexcept
|
| 150 |
|
|
150 |
|
|
| 151 |
|
return cached_nearest_ns_.load(std::memory_order_acquire) ==
|
151 |
|
return cached_nearest_ns_.load(std::memory_order_acquire) ==
|
| 152 |
|
(std::numeric_limits<std::int64_t>::max)();
|
152 |
|
(std::numeric_limits<std::int64_t>::max)();
|
| 153 |
|
|
153 |
|
|
| 154 |
|
|
154 |
|
|
| 155 |
|
inline time_point nearest_expiry() const noexcept
|
155 |
|
inline time_point nearest_expiry() const noexcept
|
| 156 |
|
|
156 |
|
|
| 157 |
|
auto ns = cached_nearest_ns_.load(std::memory_order_acquire);
|
157 |
|
auto ns = cached_nearest_ns_.load(std::memory_order_acquire);
|
| 158 |
|
return time_point(time_point::duration(ns));
|
158 |
|
return time_point(time_point::duration(ns));
|
| 159 |
|
|
159 |
|
|
| 160 |
|
|
160 |
|
|
| 161 |
|
inline void shutdown() override;
|
161 |
|
inline void shutdown() override;
|
| 162 |
|
inline io_object::implementation* construct() override;
|
162 |
|
inline io_object::implementation* construct() override;
|
| 163 |
|
inline void destroy(io_object::implementation* p) override;
|
163 |
|
inline void destroy(io_object::implementation* p) override;
|
| 164 |
|
inline void destroy_impl(implementation& impl);
|
164 |
|
inline void destroy_impl(implementation& impl);
|
| 165 |
|
inline waiter_node* create_waiter();
|
165 |
|
inline waiter_node* create_waiter();
|
| 166 |
|
inline void destroy_waiter(waiter_node* w);
|
166 |
|
inline void destroy_waiter(waiter_node* w);
|
| 167 |
|
inline std::size_t update_timer(implementation& impl, time_point new_time);
|
167 |
|
inline std::size_t update_timer(implementation& impl, time_point new_time);
|
| 168 |
|
inline void insert_waiter(implementation& impl, waiter_node* w);
|
168 |
|
inline void insert_waiter(implementation& impl, waiter_node* w);
|
| 169 |
|
inline std::size_t cancel_timer(implementation& impl);
|
169 |
|
inline std::size_t cancel_timer(implementation& impl);
|
| 170 |
|
inline void cancel_waiter(waiter_node* w);
|
170 |
|
inline void cancel_waiter(waiter_node* w);
|
| 171 |
|
inline std::size_t cancel_one_waiter(implementation& impl);
|
171 |
|
inline std::size_t cancel_one_waiter(implementation& impl);
|
| 172 |
|
inline std::size_t process_expired();
|
172 |
|
inline std::size_t process_expired();
|
| 173 |
|
|
173 |
|
|
| 174 |
|
|
174 |
|
|
| 175 |
|
inline void refresh_cached_nearest() noexcept
|
175 |
|
inline void refresh_cached_nearest() noexcept
|
| 176 |
|
|
176 |
|
|
| 177 |
|
auto ns = heap_.empty() ? (std::numeric_limits<std::int64_t>::max)()
|
177 |
|
auto ns = heap_.empty() ? (std::numeric_limits<std::int64_t>::max)()
|
| 178 |
|
: heap_[0].time_.time_since_epoch().count();
|
178 |
|
: heap_[0].time_.time_since_epoch().count();
|
| 179 |
|
cached_nearest_ns_.store(ns, std::memory_order_release);
|
179 |
|
cached_nearest_ns_.store(ns, std::memory_order_release);
|
| 180 |
|
|
180 |
|
|
| 181 |
|
|
181 |
|
|
| 182 |
|
inline void remove_timer_impl(implementation& impl);
|
182 |
|
inline void remove_timer_impl(implementation& impl);
|
| 183 |
|
inline void up_heap(std::size_t index);
|
183 |
|
inline void up_heap(std::size_t index);
|
| 184 |
|
inline void down_heap(std::size_t index);
|
184 |
|
inline void down_heap(std::size_t index);
|
| 185 |
|
inline void swap_heap(std::size_t i1, std::size_t i2);
|
185 |
|
inline void swap_heap(std::size_t i1, std::size_t i2);
|
| 186 |
|
|
186 |
|
|
| 187 |
|
|
187 |
|
|
| 188 |
|
struct BOOST_COROSIO_SYMBOL_VISIBLE waiter_node
|
188 |
|
struct BOOST_COROSIO_SYMBOL_VISIBLE waiter_node
|
| 189 |
|
: intrusive_list<waiter_node>::node
|
189 |
|
: intrusive_list<waiter_node>::node
|
| 190 |
|
|
190 |
|
|
| 191 |
|
// Embedded completion op — avoids heap allocation per fire/cancel
|
191 |
|
// Embedded completion op — avoids heap allocation per fire/cancel
|
| 192 |
|
struct completion_op final : scheduler_op
|
192 |
|
struct completion_op final : scheduler_op
|
| 193 |
|
|
193 |
|
|
| 194 |
|
waiter_node* waiter_ = nullptr;
|
194 |
|
waiter_node* waiter_ = nullptr;
|
| 195 |
|
|
195 |
|
|
| 196 |
|
|
196 |
|
|
| 197 |
|
void* owner, scheduler_op* base, std::uint32_t, std::uint32_t);
|
197 |
|
void* owner, scheduler_op* base, std::uint32_t, std::uint32_t);
|
| 198 |
|
|
198 |
|
|
| 199 |
|
completion_op() noexcept : scheduler_op(&do_complete) {}
|
199 |
|
completion_op() noexcept : scheduler_op(&do_complete) {}
|
| 200 |
|
|
200 |
|
|
| 201 |
|
void operator()() override;
|
201 |
|
void operator()() override;
|
| 202 |
|
|
202 |
|
|
| 203 |
|
|
203 |
|
|
| 204 |
|
|
204 |
|
|
| 205 |
|
// Per-waiter stop_token cancellation
|
205 |
|
// Per-waiter stop_token cancellation
|
| 206 |
|
|
206 |
|
|
| 207 |
|
|
207 |
|
|
| 208 |
|
|
208 |
|
|
| 209 |
|
|
209 |
|
|
| 210 |
|
|
210 |
|
|
| 211 |
|
|
211 |
|
|
| 212 |
|
// nullptr once removed from timer's waiter list (concurrency marker)
|
212 |
|
// nullptr once removed from timer's waiter list (concurrency marker)
|
| 213 |
|
timer_service::implementation* impl_ = nullptr;
|
213 |
|
timer_service::implementation* impl_ = nullptr;
|
| 214 |
|
timer_service* svc_ = nullptr;
|
214 |
|
timer_service* svc_ = nullptr;
|
| 215 |
|
std::coroutine_handle<> h_;
|
215 |
|
std::coroutine_handle<> h_;
|
| 216 |
|
|
216 |
|
|
| 217 |
|
std::error_code* ec_out_ = nullptr;
|
217 |
|
std::error_code* ec_out_ = nullptr;
|
| 218 |
|
|
218 |
|
|
| 219 |
|
std::optional<std::stop_callback<canceller>> stop_cb_;
|
219 |
|
std::optional<std::stop_callback<canceller>> stop_cb_;
|
| 220 |
|
|
220 |
|
|
| 221 |
|
std::error_code ec_value_;
|
221 |
|
std::error_code ec_value_;
|
| 222 |
|
waiter_node* next_free_ = nullptr;
|
222 |
|
waiter_node* next_free_ = nullptr;
|
| 223 |
|
|
223 |
|
|
| 224 |
|
|
224 |
|
|
| 225 |
|
|
225 |
|
|
| 226 |
|
|
226 |
|
|
| 227 |
|
|
227 |
|
|
| 228 |
|
|
228 |
|
|
| 229 |
|
|
229 |
|
|
| 230 |
|
struct timer_service::implementation final : timer::implementation
|
230 |
|
struct timer_service::implementation final : timer::implementation
|
| 231 |
|
|
231 |
|
|
| 232 |
|
using clock_type = std::chrono::steady_clock;
|
232 |
|
using clock_type = std::chrono::steady_clock;
|
| 233 |
|
using time_point = clock_type::time_point;
|
233 |
|
using time_point = clock_type::time_point;
|
| 234 |
|
using duration = clock_type::duration;
|
234 |
|
using duration = clock_type::duration;
|
| 235 |
|
|
235 |
|
|
| 236 |
|
timer_service* svc_ = nullptr;
|
236 |
|
timer_service* svc_ = nullptr;
|
| 237 |
|
intrusive_list<waiter_node> waiters_;
|
237 |
|
intrusive_list<waiter_node> waiters_;
|
| 238 |
|
|
238 |
|
|
| 239 |
|
// Free list linkage (reused when impl is on free_list)
|
239 |
|
// Free list linkage (reused when impl is on free_list)
|
| 240 |
|
implementation* next_free_ = nullptr;
|
240 |
|
implementation* next_free_ = nullptr;
|
| 241 |
|
|
241 |
|
|
| 242 |
|
inline explicit implementation(timer_service& svc) noexcept;
|
242 |
|
inline explicit implementation(timer_service& svc) noexcept;
|
| 243 |
|
|
243 |
|
|
| 244 |
|
inline std::coroutine_handle<> wait(
|
244 |
|
inline std::coroutine_handle<> wait(
|
| 245 |
|
|
245 |
|
|
| 246 |
|
|
246 |
|
|
| 247 |
|
|
247 |
|
|
| 248 |
|
std::error_code*) override;
|
248 |
|
std::error_code*) override;
|
| 249 |
|
|
249 |
|
|
| 250 |
|
|
250 |
|
|
| 251 |
|
// Thread-local caches avoid hot-path mutex acquisitions:
|
251 |
|
// Thread-local caches avoid hot-path mutex acquisitions:
|
| 252 |
|
// 1. Impl cache — single-slot, validated by comparing svc_
|
252 |
|
// 1. Impl cache — single-slot, validated by comparing svc_
|
| 253 |
|
// 2. Waiter cache — single-slot, no service affinity
|
253 |
|
// 2. Waiter cache — single-slot, no service affinity
|
| 254 |
|
// All caches are cleared by timer_service_invalidate_cache() during shutdown.
|
254 |
|
// All caches are cleared by timer_service_invalidate_cache() during shutdown.
|
| 255 |
|
|
255 |
|
|
| 256 |
|
inline thread_local_ptr<timer_service::implementation> tl_cached_impl;
|
256 |
|
inline thread_local_ptr<timer_service::implementation> tl_cached_impl;
|
| 257 |
|
inline thread_local_ptr<waiter_node> tl_cached_waiter;
|
257 |
|
inline thread_local_ptr<waiter_node> tl_cached_waiter;
|
| 258 |
|
|
258 |
|
|
| 259 |
|
inline timer_service::implementation*
|
259 |
|
inline timer_service::implementation*
|
| 260 |
|
try_pop_tl_cache(timer_service* svc) noexcept
|
260 |
|
try_pop_tl_cache(timer_service* svc) noexcept
|
| 261 |
|
|
261 |
|
|
| 262 |
|
auto* impl = tl_cached_impl.get();
|
262 |
|
auto* impl = tl_cached_impl.get();
|
| 263 |
|
|
263 |
|
|
| 264 |
|
|
264 |
|
|
| 265 |
|
tl_cached_impl.set(nullptr);
|
265 |
|
tl_cached_impl.set(nullptr);
|
| 266 |
|
|
266 |
|
|
| 267 |
|
|
267 |
|
|
| 268 |
|
// Stale impl from a destroyed service
|
268 |
|
// Stale impl from a destroyed service
|
| 269 |
|
|
269 |
|
|
| 270 |
|
|
270 |
|
|
| 271 |
|
|
271 |
|
|
| 272 |
|
|
272 |
|
|
| 273 |
|
|
273 |
|
|
| 274 |
|
|
274 |
|
|
| 275 |
|
try_push_tl_cache(timer_service::implementation* impl) noexcept
|
275 |
|
try_push_tl_cache(timer_service::implementation* impl) noexcept
|
| 276 |
|
|
276 |
|
|
| 277 |
|
if (!tl_cached_impl.get())
|
277 |
|
if (!tl_cached_impl.get())
|
| 278 |
|
|
278 |
|
|
| 279 |
|
tl_cached_impl.set(impl);
|
279 |
|
tl_cached_impl.set(impl);
|
| 280 |
|
|
280 |
|
|
| 281 |
|
|
281 |
|
|
| 282 |
|
|
282 |
|
|
| 283 |
|
|
283 |
|
|
| 284 |
|
|
284 |
|
|
| 285 |
|
|
285 |
|
|
| 286 |
|
try_pop_waiter_tl_cache() noexcept
|
286 |
|
try_pop_waiter_tl_cache() noexcept
|
| 287 |
|
|
287 |
|
|
| 288 |
|
auto* w = tl_cached_waiter.get();
|
288 |
|
auto* w = tl_cached_waiter.get();
|
| 289 |
|
|
289 |
|
|
| 290 |
|
|
290 |
|
|
| 291 |
|
tl_cached_waiter.set(nullptr);
|
291 |
|
tl_cached_waiter.set(nullptr);
|
| 292 |
|
|
292 |
|
|
| 293 |
|
|
293 |
|
|
| 294 |
|
|
294 |
|
|
| 295 |
|
|
295 |
|
|
| 296 |
|
|
296 |
|
|
| 297 |
|
|
297 |
|
|
| 298 |
|
try_push_waiter_tl_cache(waiter_node* w) noexcept
|
298 |
|
try_push_waiter_tl_cache(waiter_node* w) noexcept
|
| 299 |
|
|
299 |
|
|
| 300 |
|
if (!tl_cached_waiter.get())
|
300 |
|
if (!tl_cached_waiter.get())
|
| 301 |
|
|
301 |
|
|
| 302 |
|
|
302 |
|
|
| 303 |
|
|
303 |
|
|
| 304 |
|
|
304 |
|
|
| 305 |
|
|
305 |
|
|
| 306 |
|
|
306 |
|
|
| 307 |
|
|
307 |
|
|
| 308 |
|
|
308 |
|
|
| 309 |
|
timer_service_invalidate_cache() noexcept
|
309 |
|
timer_service_invalidate_cache() noexcept
|
| 310 |
|
|
310 |
|
|
| 311 |
|
delete tl_cached_impl.get();
|
311 |
|
delete tl_cached_impl.get();
|
| 312 |
|
tl_cached_impl.set(nullptr);
|
312 |
|
tl_cached_impl.set(nullptr);
|
| 313 |
|
|
313 |
|
|
| 314 |
|
delete tl_cached_waiter.get();
|
314 |
|
delete tl_cached_waiter.get();
|
| 315 |
|
tl_cached_waiter.set(nullptr);
|
315 |
|
tl_cached_waiter.set(nullptr);
|
| 316 |
|
|
316 |
|
|
| 317 |
|
|
317 |
|
|
| 318 |
|
// timer_service out-of-class member function definitions
|
318 |
|
// timer_service out-of-class member function definitions
|
| 319 |
|
|
319 |
|
|
| 320 |
|
inline timer_service::implementation::implementation(
|
320 |
|
inline timer_service::implementation::implementation(
|
| 321 |
|
timer_service& svc) noexcept
|
321 |
|
timer_service& svc) noexcept
|
| 322 |
|
|
322 |
|
|
| 323 |
|
|
323 |
|
|
| 324 |
|
|
324 |
|
|
| 325 |
|
|
325 |
|
|
| 326 |
|
|
326 |
|
|
| 327 |
|
timer_service::shutdown()
|
327 |
|
timer_service::shutdown()
|
| 328 |
|
|
328 |
|
|
| 329 |
|
timer_service_invalidate_cache();
|
329 |
|
timer_service_invalidate_cache();
|
| 330 |
|
|
330 |
|
|
| 331 |
|
// Cancel waiting timers still in the heap.
|
331 |
|
// Cancel waiting timers still in the heap.
|
| 332 |
|
// Each waiter called work_started() in implementation::wait().
|
332 |
|
// Each waiter called work_started() in implementation::wait().
|
| 333 |
|
// On IOCP the scheduler shutdown loop exits when outstanding_work_
|
333 |
|
// On IOCP the scheduler shutdown loop exits when outstanding_work_
|
| 334 |
|
// reaches zero, so we must call work_finished() here to balance it.
|
334 |
|
// reaches zero, so we must call work_finished() here to balance it.
|
| 335 |
|
// On other backends this is harmless (their drain loops exit when
|
335 |
|
// On other backends this is harmless (their drain loops exit when
|
| 336 |
|
// the queue is empty, not based on outstanding_work_).
|
336 |
|
// the queue is empty, not based on outstanding_work_).
|
| 337 |
|
for (auto& entry : heap_)
|
337 |
|
for (auto& entry : heap_)
|
| 338 |
|
|
338 |
|
|
| 339 |
|
auto* impl = entry.timer_;
|
339 |
|
auto* impl = entry.timer_;
|
| 340 |
|
while (auto* w = impl->waiters_.pop_front())
|
340 |
|
while (auto* w = impl->waiters_.pop_front())
|
| 341 |
|
|
341 |
|
|
| 342 |
|
|
342 |
|
|
| 343 |
|
auto h = std::exchange(w->h_, {});
|
343 |
|
auto h = std::exchange(w->h_, {});
|
| 344 |
|
|
344 |
|
|
| 345 |
|
|
345 |
|
|
| 346 |
|
|
346 |
|
|
| 347 |
|
|
347 |
|
|
| 348 |
|
|
348 |
|
|
| 349 |
|
impl->heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
349 |
|
impl->heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
| 350 |
|
|
350 |
|
|
| 351 |
|
|
351 |
|
|
| 352 |
|
|
352 |
|
|
| 353 |
|
cached_nearest_ns_.store(
|
353 |
|
cached_nearest_ns_.store(
|
| 354 |
|
(std::numeric_limits<std::int64_t>::max)(), std::memory_order_release);
|
354 |
|
(std::numeric_limits<std::int64_t>::max)(), std::memory_order_release);
|
| 355 |
|
|
355 |
|
|
| 356 |
|
// Delete free-listed impls
|
356 |
|
// Delete free-listed impls
|
| 357 |
|
|
357 |
|
|
| 358 |
|
|
358 |
|
|
| 359 |
|
auto* next = free_list_->next_free_;
|
359 |
|
auto* next = free_list_->next_free_;
|
| 360 |
|
|
360 |
|
|
| 361 |
|
|
361 |
|
|
| 362 |
|
|
362 |
|
|
| 363 |
|
|
363 |
|
|
| 364 |
|
// Delete free-listed waiters
|
364 |
|
// Delete free-listed waiters
|
| 365 |
|
while (waiter_free_list_)
|
365 |
|
while (waiter_free_list_)
|
| 366 |
|
|
366 |
|
|
| 367 |
|
auto* next = waiter_free_list_->next_free_;
|
367 |
|
auto* next = waiter_free_list_->next_free_;
|
| 368 |
|
delete waiter_free_list_;
|
368 |
|
delete waiter_free_list_;
|
| 369 |
|
waiter_free_list_ = next;
|
369 |
|
waiter_free_list_ = next;
|
| 370 |
|
|
370 |
|
|
| 371 |
|
|
371 |
|
|
| 372 |
|
|
372 |
|
|
| 373 |
|
inline io_object::implementation*
|
373 |
|
inline io_object::implementation*
|
| 374 |
|
timer_service::construct()
|
374 |
|
timer_service::construct()
|
| 375 |
|
|
375 |
|
|
| 376 |
|
implementation* impl = try_pop_tl_cache(this);
|
376 |
|
implementation* impl = try_pop_tl_cache(this);
|
| 377 |
|
|
377 |
|
|
| 378 |
|
|
378 |
|
|
| 379 |
|
|
379 |
|
|
| 380 |
|
impl->heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
380 |
|
impl->heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
| 381 |
|
impl->might_have_pending_waits_ = false;
|
381 |
|
impl->might_have_pending_waits_ = false;
|
| 382 |
|
|
382 |
|
|
| 383 |
|
|
383 |
|
|
| 384 |
|
|
384 |
|
|
| 385 |
|
std::lock_guard lock(mutex_);
|
385 |
|
std::lock_guard lock(mutex_);
|
| 386 |
|
|
386 |
|
|
| 387 |
|
|
387 |
|
|
| 388 |
|
|
388 |
|
|
| 389 |
|
free_list_ = impl->next_free_;
|
389 |
|
free_list_ = impl->next_free_;
|
| 390 |
|
impl->next_free_ = nullptr;
|
390 |
|
impl->next_free_ = nullptr;
|
| 391 |
|
|
391 |
|
|
| 392 |
|
impl->heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
392 |
|
impl->heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
| 393 |
|
impl->might_have_pending_waits_ = false;
|
393 |
|
impl->might_have_pending_waits_ = false;
|
| 394 |
|
|
394 |
|
|
| 395 |
|
|
395 |
|
|
| 396 |
|
|
396 |
|
|
| 397 |
|
impl = new implementation(*this);
|
397 |
|
impl = new implementation(*this);
|
| 398 |
|
|
398 |
|
|
| 399 |
|
|
399 |
|
|
| 400 |
|
|
400 |
|
|
| 401 |
|
|
401 |
|
|
| 402 |
|
|
402 |
|
|
| 403 |
|
timer_service::destroy(io_object::implementation* p)
|
403 |
|
timer_service::destroy(io_object::implementation* p)
|
| 404 |
|
|
404 |
|
|
| 405 |
|
destroy_impl(static_cast<implementation&>(*p));
|
405 |
|
destroy_impl(static_cast<implementation&>(*p));
|
| 406 |
|
|
406 |
|
|
| 407 |
|
|
407 |
|
|
| 408 |
|
|
408 |
|
|
| 409 |
|
timer_service::destroy_impl(implementation& impl)
|
409 |
|
timer_service::destroy_impl(implementation& impl)
|
| 410 |
|
|
410 |
|
|
| 411 |
|
|
411 |
|
|
| 412 |
|
|
412 |
|
|
| 413 |
|
if (impl.heap_index_ != (std::numeric_limits<std::size_t>::max)())
|
413 |
|
if (impl.heap_index_ != (std::numeric_limits<std::size_t>::max)())
|
| 414 |
|
|
414 |
|
|
| 415 |
|
std::lock_guard lock(mutex_);
|
415 |
|
std::lock_guard lock(mutex_);
|
| 416 |
|
|
416 |
|
|
| 417 |
|
refresh_cached_nearest();
|
417 |
|
refresh_cached_nearest();
|
| 418 |
|
|
418 |
|
|
| 419 |
|
|
419 |
|
|
| 420 |
|
if (try_push_tl_cache(&impl))
|
420 |
|
if (try_push_tl_cache(&impl))
|
| 421 |
|
|
421 |
|
|
| 422 |
|
|
422 |
|
|
| 423 |
|
std::lock_guard lock(mutex_);
|
423 |
|
std::lock_guard lock(mutex_);
|
| 424 |
|
impl.next_free_ = free_list_;
|
424 |
|
impl.next_free_ = free_list_;
|
| 425 |
|
|
425 |
|
|
| 426 |
|
|
426 |
|
|
| 427 |
|
|
427 |
|
|
| 428 |
|
|
428 |
|
|
| 429 |
|
timer_service::create_waiter()
|
429 |
|
timer_service::create_waiter()
|
| 430 |
|
|
430 |
|
|
| 431 |
|
if (auto* w = try_pop_waiter_tl_cache())
|
431 |
|
if (auto* w = try_pop_waiter_tl_cache())
|
| 432 |
|
|
432 |
|
|
| 433 |
|
|
433 |
|
|
| 434 |
|
std::lock_guard lock(mutex_);
|
434 |
|
std::lock_guard lock(mutex_);
|
| 435 |
|
|
435 |
|
|
| 436 |
|
|
436 |
|
|
| 437 |
|
auto* w = waiter_free_list_;
|
437 |
|
auto* w = waiter_free_list_;
|
| 438 |
|
waiter_free_list_ = w->next_free_;
|
438 |
|
waiter_free_list_ = w->next_free_;
|
| 439 |
|
|
439 |
|
|
| 440 |
|
|
440 |
|
|
| 441 |
|
|
441 |
|
|
| 442 |
|
|
442 |
|
|
| 443 |
|
return new waiter_node();
|
443 |
|
return new waiter_node();
|
| 444 |
|
|
444 |
|
|
| 445 |
|
|
445 |
|
|
| 446 |
|
|
446 |
|
|
| 447 |
|
timer_service::destroy_waiter(waiter_node* w)
|
447 |
|
timer_service::destroy_waiter(waiter_node* w)
|
| 448 |
|
|
448 |
|
|
| 449 |
|
if (try_push_waiter_tl_cache(w))
|
449 |
|
if (try_push_waiter_tl_cache(w))
|
| 450 |
|
|
450 |
|
|
| 451 |
|
|
451 |
|
|
| 452 |
|
std::lock_guard lock(mutex_);
|
452 |
|
std::lock_guard lock(mutex_);
|
| 453 |
|
w->next_free_ = waiter_free_list_;
|
453 |
|
w->next_free_ = waiter_free_list_;
|
| 454 |
|
|
454 |
|
|
| 455 |
|
|
455 |
|
|
| 456 |
|
|
456 |
|
|
| 457 |
|
|
457 |
|
|
| 458 |
|
timer_service::update_timer(implementation& impl, time_point new_time)
|
458 |
|
timer_service::update_timer(implementation& impl, time_point new_time)
|
| 459 |
|
|
459 |
|
|
| 460 |
|
|
460 |
|
|
| 461 |
|
(impl.heap_index_ != (std::numeric_limits<std::size_t>::max)());
|
461 |
|
(impl.heap_index_ != (std::numeric_limits<std::size_t>::max)());
|
| 462 |
|
if (!in_heap && impl.waiters_.empty())
|
462 |
|
if (!in_heap && impl.waiters_.empty())
|
| 463 |
|
|
463 |
|
|
| 464 |
|
|
464 |
|
|
| 465 |
|
|
465 |
|
|
| 466 |
|
intrusive_list<waiter_node> canceled;
|
466 |
|
intrusive_list<waiter_node> canceled;
|
| 467 |
|
|
467 |
|
|
| 468 |
|
|
468 |
|
|
| 469 |
|
std::lock_guard lock(mutex_);
|
469 |
|
std::lock_guard lock(mutex_);
|
| 470 |
|
|
470 |
|
|
| 471 |
|
while (auto* w = impl.waiters_.pop_front())
|
471 |
|
while (auto* w = impl.waiters_.pop_front())
|
| 472 |
|
|
472 |
|
|
| 473 |
|
|
473 |
|
|
| 474 |
|
|
474 |
|
|
| 475 |
|
|
475 |
|
|
| 476 |
|
|
476 |
|
|
| 477 |
|
if (impl.heap_index_ < heap_.size())
|
477 |
|
if (impl.heap_index_ < heap_.size())
|
| 478 |
|
|
478 |
|
|
| 479 |
|
time_point old_time = heap_[impl.heap_index_].time_;
|
479 |
|
time_point old_time = heap_[impl.heap_index_].time_;
|
| 480 |
|
heap_[impl.heap_index_].time_ = new_time;
|
480 |
|
heap_[impl.heap_index_].time_ = new_time;
|
| 481 |
|
|
481 |
|
|
| 482 |
|
|
482 |
|
|
| 483 |
|
up_heap(impl.heap_index_);
|
483 |
|
up_heap(impl.heap_index_);
|
| 484 |
|
|
484 |
|
|
| 485 |
|
down_heap(impl.heap_index_);
|
485 |
|
down_heap(impl.heap_index_);
|
| 486 |
|
|
486 |
|
|
| 487 |
|
notify = (impl.heap_index_ == 0);
|
487 |
|
notify = (impl.heap_index_ == 0);
|
| 488 |
|
|
488 |
|
|
| 489 |
|
|
489 |
|
|
| 490 |
|
refresh_cached_nearest();
|
490 |
|
refresh_cached_nearest();
|
| 491 |
|
|
491 |
|
|
| 492 |
|
|
492 |
|
|
| 493 |
|
|
493 |
|
|
| 494 |
|
while (auto* w = canceled.pop_front())
|
494 |
|
while (auto* w = canceled.pop_front())
|
| 495 |
|
|
495 |
|
|
| 496 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
496 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
| 497 |
|
|
497 |
|
|
| 498 |
|
|
498 |
|
|
| 499 |
|
|
499 |
|
|
| 500 |
|
|
500 |
|
|
| 501 |
|
|
501 |
|
|
| 502 |
|
|
502 |
|
|
| 503 |
|
|
503 |
|
|
| 504 |
|
|
504 |
|
|
| 505 |
|
|
505 |
|
|
| 506 |
|
|
506 |
|
|
| 507 |
|
|
507 |
|
|
| 508 |
|
timer_service::insert_waiter(implementation& impl, waiter_node* w)
|
508 |
|
timer_service::insert_waiter(implementation& impl, waiter_node* w)
|
| 509 |
|
|
509 |
|
|
| 510 |
|
|
510 |
|
|
| 511 |
|
|
511 |
|
|
| 512 |
|
std::lock_guard lock(mutex_);
|
512 |
|
std::lock_guard lock(mutex_);
|
| 513 |
|
if (impl.heap_index_ == (std::numeric_limits<std::size_t>::max)())
|
513 |
|
if (impl.heap_index_ == (std::numeric_limits<std::size_t>::max)())
|
| 514 |
|
|
514 |
|
|
| 515 |
|
impl.heap_index_ = heap_.size();
|
515 |
|
impl.heap_index_ = heap_.size();
|
| 516 |
|
heap_.push_back({impl.expiry_, &impl});
|
516 |
|
heap_.push_back({impl.expiry_, &impl});
|
| 517 |
|
up_heap(heap_.size() - 1);
|
517 |
|
up_heap(heap_.size() - 1);
|
| 518 |
|
notify = (impl.heap_index_ == 0);
|
518 |
|
notify = (impl.heap_index_ == 0);
|
| 519 |
|
refresh_cached_nearest();
|
519 |
|
refresh_cached_nearest();
|
| 520 |
|
|
520 |
|
|
| 521 |
|
impl.waiters_.push_back(w);
|
521 |
|
impl.waiters_.push_back(w);
|
| 522 |
|
|
522 |
|
|
| 523 |
|
|
523 |
|
|
| 524 |
|
|
524 |
|
|
| 525 |
|
|
525 |
|
|
| 526 |
|
|
526 |
|
|
| 527 |
|
|
527 |
|
|
| 528 |
|
timer_service::cancel_timer(implementation& impl)
|
528 |
|
timer_service::cancel_timer(implementation& impl)
|
| 529 |
|
|
529 |
|
|
| 530 |
|
if (!impl.might_have_pending_waits_)
|
530 |
|
if (!impl.might_have_pending_waits_)
|
| 531 |
|
|
531 |
|
|
| 532 |
|
|
532 |
|
|
| 533 |
|
// Not in heap and no waiters — just clear the flag
|
533 |
|
// Not in heap and no waiters — just clear the flag
|
| 534 |
|
if (impl.heap_index_ == (std::numeric_limits<std::size_t>::max)() &&
|
534 |
|
if (impl.heap_index_ == (std::numeric_limits<std::size_t>::max)() &&
|
| 535 |
|
|
535 |
|
|
| 536 |
|
|
536 |
|
|
| 537 |
|
impl.might_have_pending_waits_ = false;
|
537 |
|
impl.might_have_pending_waits_ = false;
|
| 538 |
|
|
538 |
|
|
| 539 |
|
|
539 |
|
|
| 540 |
|
|
540 |
|
|
| 541 |
|
intrusive_list<waiter_node> canceled;
|
541 |
|
intrusive_list<waiter_node> canceled;
|
| 542 |
|
|
542 |
|
|
| 543 |
|
|
543 |
|
|
| 544 |
|
std::lock_guard lock(mutex_);
|
544 |
|
std::lock_guard lock(mutex_);
|
| 545 |
|
|
545 |
|
|
| 546 |
|
while (auto* w = impl.waiters_.pop_front())
|
546 |
|
while (auto* w = impl.waiters_.pop_front())
|
| 547 |
|
|
547 |
|
|
| 548 |
|
|
548 |
|
|
| 549 |
|
|
549 |
|
|
| 550 |
|
|
550 |
|
|
| 551 |
|
refresh_cached_nearest();
|
551 |
|
refresh_cached_nearest();
|
| 552 |
|
|
552 |
|
|
| 553 |
|
|
553 |
|
|
| 554 |
|
impl.might_have_pending_waits_ = false;
|
554 |
|
impl.might_have_pending_waits_ = false;
|
| 555 |
|
|
555 |
|
|
| 556 |
|
|
556 |
|
|
| 557 |
|
while (auto* w = canceled.pop_front())
|
557 |
|
while (auto* w = canceled.pop_front())
|
| 558 |
|
|
558 |
|
|
| 559 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
559 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
| 560 |
|
|
560 |
|
|
| 561 |
|
|
561 |
|
|
| 562 |
|
|
562 |
|
|
| 563 |
|
|
563 |
|
|
| 564 |
|
|
564 |
|
|
| 565 |
|
|
565 |
|
|
| 566 |
|
|
566 |
|
|
| 567 |
|
|
567 |
|
|
| 568 |
|
timer_service::cancel_waiter(waiter_node* w)
|
568 |
|
timer_service::cancel_waiter(waiter_node* w)
|
| 569 |
|
|
569 |
|
|
| 570 |
|
|
570 |
|
|
| 571 |
|
std::lock_guard lock(mutex_);
|
571 |
|
std::lock_guard lock(mutex_);
|
| 572 |
|
// Already removed by cancel_timer or process_expired
|
572 |
|
// Already removed by cancel_timer or process_expired
|
| 573 |
|
|
573 |
|
|
| 574 |
|
|
574 |
|
|
| 575 |
|
|
575 |
|
|
| 576 |
|
|
576 |
|
|
| 577 |
|
impl->waiters_.remove(w);
|
577 |
|
impl->waiters_.remove(w);
|
| 578 |
|
if (impl->waiters_.empty())
|
578 |
|
if (impl->waiters_.empty())
|
| 579 |
|
|
579 |
|
|
| 580 |
|
remove_timer_impl(*impl);
|
580 |
|
remove_timer_impl(*impl);
|
| 581 |
|
impl->might_have_pending_waits_ = false;
|
581 |
|
impl->might_have_pending_waits_ = false;
|
| 582 |
|
|
582 |
|
|
| 583 |
|
refresh_cached_nearest();
|
583 |
|
refresh_cached_nearest();
|
| 584 |
|
|
584 |
|
|
| 585 |
|
|
585 |
|
|
| 586 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
586 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
| 587 |
|
|
587 |
|
|
| 588 |
|
|
588 |
|
|
| 589 |
|
|
589 |
|
|
| 590 |
|
|
590 |
|
|
| 591 |
|
timer_service::cancel_one_waiter(implementation& impl)
|
591 |
|
timer_service::cancel_one_waiter(implementation& impl)
|
| 592 |
|
|
592 |
|
|
| 593 |
|
if (!impl.might_have_pending_waits_)
|
593 |
|
if (!impl.might_have_pending_waits_)
|
| 594 |
|
|
594 |
|
|
| 595 |
|
|
595 |
|
|
| 596 |
|
waiter_node* w = nullptr;
|
596 |
|
waiter_node* w = nullptr;
|
| 597 |
|
|
597 |
|
|
| 598 |
|
|
598 |
|
|
| 599 |
|
std::lock_guard lock(mutex_);
|
599 |
|
std::lock_guard lock(mutex_);
|
| 600 |
|
w = impl.waiters_.pop_front();
|
600 |
|
w = impl.waiters_.pop_front();
|
| 601 |
|
|
601 |
|
|
| 602 |
|
|
602 |
|
|
| 603 |
|
|
603 |
|
|
| 604 |
|
if (impl.waiters_.empty())
|
604 |
|
if (impl.waiters_.empty())
|
| 605 |
|
|
605 |
|
|
| 606 |
|
|
606 |
|
|
| 607 |
|
impl.might_have_pending_waits_ = false;
|
607 |
|
impl.might_have_pending_waits_ = false;
|
| 608 |
|
|
608 |
|
|
| 609 |
|
refresh_cached_nearest();
|
609 |
|
refresh_cached_nearest();
|
| 610 |
|
|
610 |
|
|
| 611 |
|
|
611 |
|
|
| 612 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
612 |
|
w->ec_value_ = make_error_code(capy::error::canceled);
|
| 613 |
|
|
613 |
|
|
| 614 |
|
|
614 |
|
|
| 615 |
|
|
615 |
|
|
| 616 |
|
|
616 |
|
|
| 617 |
|
|
617 |
|
|
| 618 |
|
timer_service::process_expired()
|
618 |
|
timer_service::process_expired()
|
| 619 |
|
|
619 |
|
|
| 620 |
|
intrusive_list<waiter_node> expired;
|
620 |
|
intrusive_list<waiter_node> expired;
|
| 621 |
|
|
621 |
|
|
| 622 |
|
|
622 |
|
|
| 623 |
|
std::lock_guard lock(mutex_);
|
623 |
|
std::lock_guard lock(mutex_);
|
| 624 |
|
auto now = clock_type::now();
|
624 |
|
auto now = clock_type::now();
|
| 625 |
|
|
625 |
|
|
| 626 |
|
while (!heap_.empty() && heap_[0].time_ <= now)
|
626 |
|
while (!heap_.empty() && heap_[0].time_ <= now)
|
| 627 |
|
|
627 |
|
|
| 628 |
|
implementation* t = heap_[0].timer_;
|
628 |
|
implementation* t = heap_[0].timer_;
|
| 629 |
|
|
629 |
|
|
| 630 |
|
while (auto* w = t->waiters_.pop_front())
|
630 |
|
while (auto* w = t->waiters_.pop_front())
|
| 631 |
|
|
631 |
|
|
| 632 |
|
|
632 |
|
|
| 633 |
|
|
633 |
|
|
| 634 |
|
|
634 |
|
|
| 635 |
|
|
635 |
|
|
| 636 |
|
t->might_have_pending_waits_ = false;
|
636 |
|
t->might_have_pending_waits_ = false;
|
| 637 |
|
|
637 |
|
|
| 638 |
|
|
638 |
|
|
| 639 |
|
refresh_cached_nearest();
|
639 |
|
refresh_cached_nearest();
|
| 640 |
|
|
640 |
|
|
| 641 |
|
|
641 |
|
|
| 642 |
|
|
642 |
|
|
| 643 |
|
while (auto* w = expired.pop_front())
|
643 |
|
while (auto* w = expired.pop_front())
|
| 644 |
|
|
644 |
|
|
| 645 |
|
|
645 |
|
|
| 646 |
|
|
646 |
|
|
| 647 |
|
|
647 |
|
|
| 648 |
|
|
648 |
|
|
| 649 |
|
|
649 |
|
|
| 650 |
|
|
650 |
|
|
| 651 |
|
|
651 |
|
|
| 652 |
|
|
652 |
|
|
| 653 |
|
timer_service::remove_timer_impl(implementation& impl)
|
653 |
|
timer_service::remove_timer_impl(implementation& impl)
|
| 654 |
|
|
654 |
|
|
| 655 |
|
std::size_t index = impl.heap_index_;
|
655 |
|
std::size_t index = impl.heap_index_;
|
| 656 |
|
if (index >= heap_.size())
|
656 |
|
if (index >= heap_.size())
|
| 657 |
|
|
657 |
|
|
| 658 |
|
|
658 |
|
|
| 659 |
|
if (index == heap_.size() - 1)
|
659 |
|
if (index == heap_.size() - 1)
|
| 660 |
|
|
660 |
|
|
| 661 |
|
// Last element, just pop
|
661 |
|
// Last element, just pop
|
| 662 |
|
impl.heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
662 |
|
impl.heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
| 663 |
|
|
663 |
|
|
| 664 |
|
|
664 |
|
|
| 665 |
|
|
665 |
|
|
| 666 |
|
|
666 |
|
|
| 667 |
|
// Swap with last and reheapify
|
667 |
|
// Swap with last and reheapify
|
| 668 |
|
swap_heap(index, heap_.size() - 1);
|
668 |
|
swap_heap(index, heap_.size() - 1);
|
| 669 |
|
impl.heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
669 |
|
impl.heap_index_ = (std::numeric_limits<std::size_t>::max)();
|
| 670 |
|
|
670 |
|
|
| 671 |
|
|
671 |
|
|
| 672 |
|
if (index > 0 && heap_[index].time_ < heap_[(index - 1) / 2].time_)
|
672 |
|
if (index > 0 && heap_[index].time_ < heap_[(index - 1) / 2].time_)
|
| 673 |
|
|
673 |
|
|
| 674 |
|
|
674 |
|
|
| 675 |
|
|
675 |
|
|
| 676 |
|
|
676 |
|
|
| 677 |
|
|
677 |
|
|
| 678 |
|
|
678 |
|
|
| 679 |
|
|
679 |
|
|
| 680 |
|
timer_service::up_heap(std::size_t index)
|
680 |
|
timer_service::up_heap(std::size_t index)
|
| 681 |
|
|
681 |
|
|
| 682 |
|
|
682 |
|
|
| 683 |
|
|
683 |
|
|
| 684 |
|
std::size_t parent = (index - 1) / 2;
|
684 |
|
std::size_t parent = (index - 1) / 2;
|
| 685 |
|
if (!(heap_[index].time_ < heap_[parent].time_))
|
685 |
|
if (!(heap_[index].time_ < heap_[parent].time_))
|
| 686 |
|
|
686 |
|
|
| 687 |
|
swap_heap(index, parent);
|
687 |
|
swap_heap(index, parent);
|
| 688 |
|
|
688 |
|
|
| 689 |
|
|
689 |
|
|
| 690 |
|
|
690 |
|
|
| 691 |
|
|
691 |
|
|
| 692 |
|
|
692 |
|
|
| 693 |
|
timer_service::down_heap(std::size_t index)
|
693 |
|
timer_service::down_heap(std::size_t index)
|
| 694 |
|
|
694 |
|
|
| 695 |
|
std::size_t child = index * 2 + 1;
|
695 |
|
std::size_t child = index * 2 + 1;
|
| 696 |
|
while (child < heap_.size())
|
696 |
|
while (child < heap_.size())
|
| 697 |
|
|
697 |
|
|
| 698 |
|
std::size_t min_child = (child + 1 == heap_.size() ||
|
698 |
|
std::size_t min_child = (child + 1 == heap_.size() ||
|
| 699 |
|
heap_[child].time_ < heap_[child + 1].time_)
|
699 |
|
heap_[child].time_ < heap_[child + 1].time_)
|
| 700 |
|
|
700 |
|
|
| 701 |
|
|
701 |
|
|
| 702 |
|
|
702 |
|
|
| 703 |
|
if (heap_[index].time_ < heap_[min_child].time_)
|
703 |
|
if (heap_[index].time_ < heap_[min_child].time_)
|
| 704 |
|
|
704 |
|
|
| 705 |
|
|
705 |
|
|
| 706 |
|
swap_heap(index, min_child);
|
706 |
|
swap_heap(index, min_child);
|
| 707 |
|
|
707 |
|
|
| 708 |
|
|
708 |
|
|
| 709 |
|
|
709 |
|
|
| 710 |
|
|
710 |
|
|
| 711 |
|
|
711 |
|
|
| 712 |
|
|
712 |
|
|
| 713 |
|
timer_service::swap_heap(std::size_t i1, std::size_t i2)
|
713 |
|
timer_service::swap_heap(std::size_t i1, std::size_t i2)
|
| 714 |
|
|
714 |
|
|
| 715 |
|
heap_entry tmp = heap_[i1];
|
715 |
|
heap_entry tmp = heap_[i1];
|
| 716 |
|
|
716 |
|
|
| 717 |
|
|
717 |
|
|
| 718 |
|
heap_[i1].timer_->heap_index_ = i1;
|
718 |
|
heap_[i1].timer_->heap_index_ = i1;
|
| 719 |
|
heap_[i2].timer_->heap_index_ = i2;
|
719 |
|
heap_[i2].timer_->heap_index_ = i2;
|
| 720 |
|
|
720 |
|
|
| 721 |
|
|
721 |
|
|
| 722 |
|
// waiter_node out-of-class member function definitions
|
722 |
|
// waiter_node out-of-class member function definitions
|
| 723 |
|
|
723 |
|
|
| 724 |
|
|
724 |
|
|
| 725 |
|
waiter_node::canceller::operator()() const
|
725 |
|
waiter_node::canceller::operator()() const
|
| 726 |
|
|
726 |
|
|
| 727 |
|
waiter_->svc_->cancel_waiter(waiter_);
|
727 |
|
waiter_->svc_->cancel_waiter(waiter_);
|
| 728 |
|
|
728 |
|
|
| 729 |
|
|
729 |
|
|
| 730 |
|
|
730 |
|
|
| 731 |
|
waiter_node::completion_op::do_complete(
|
731 |
|
waiter_node::completion_op::do_complete(
|
| 732 |
|
[[maybe_unused]] void* owner, scheduler_op* base, std::uint32_t, std::uint32_t)
|
732 |
|
[[maybe_unused]] void* owner, scheduler_op* base, std::uint32_t, std::uint32_t)
|
| 733 |
|
|
733 |
|
|
| 734 |
|
// owner is always non-null here. The destroy path (owner == nullptr)
|
734 |
|
// owner is always non-null here. The destroy path (owner == nullptr)
|
| 735 |
|
// is unreachable because completion_op overrides destroy() directly,
|
735 |
|
// is unreachable because completion_op overrides destroy() directly,
|
| 736 |
|
// bypassing scheduler_op::destroy() which would call func_(nullptr, ...).
|
736 |
|
// bypassing scheduler_op::destroy() which would call func_(nullptr, ...).
|
| 737 |
|
BOOST_COROSIO_ASSERT(owner);
|
737 |
|
BOOST_COROSIO_ASSERT(owner);
|
| 738 |
|
static_cast<completion_op*>(base)->operator()();
|
738 |
|
static_cast<completion_op*>(base)->operator()();
|
| 739 |
|
|
739 |
|
|
| 740 |
|
|
740 |
|
|
| 741 |
|
|
741 |
|
|
| 742 |
|
waiter_node::completion_op::operator()()
|
742 |
|
waiter_node::completion_op::operator()()
|
| 743 |
|
|
743 |
|
|
| 744 |
|
|
744 |
|
|
| 745 |
|
|
745 |
|
|
| 746 |
|
|
746 |
|
|
| 747 |
|
*w->ec_out_ = w->ec_value_;
|
747 |
|
*w->ec_out_ = w->ec_value_;
|
| 748 |
|
|
748 |
|
|
| 749 |
|
|
749 |
|
|
| 750 |
|
|
750 |
|
|
| 751 |
|
|
751 |
|
|
| 752 |
|
auto& sched = svc->get_scheduler();
|
752 |
|
auto& sched = svc->get_scheduler();
|
| 753 |
|
|
753 |
|
|
| 754 |
|
|
754 |
|
|
| 755 |
|
|
755 |
|
|
| 756 |
|
|
756 |
|
|
| 757 |
|
|
757 |
|
|
| 758 |
|
|
758 |
|
|
| 759 |
|
|
759 |
|
|
| 760 |
|
|
760 |
|
|
| 761 |
|
waiter_node::completion_op::destroy()
|
761 |
|
waiter_node::completion_op::destroy()
|
| 762 |
|
|
762 |
|
|
| 763 |
|
// Called during scheduler shutdown drain when this completion_op is
|
763 |
|
// Called during scheduler shutdown drain when this completion_op is
|
| 764 |
|
// in the scheduler's ready queue (posted by cancel_timer() or
|
764 |
|
// in the scheduler's ready queue (posted by cancel_timer() or
|
| 765 |
|
// process_expired()). Balances the work_started() from
|
765 |
|
// process_expired()). Balances the work_started() from
|
| 766 |
|
// implementation::wait(). The scheduler drain loop separately
|
766 |
|
// implementation::wait(). The scheduler drain loop separately
|
| 767 |
|
// balances the work_started() from post(). On IOCP both decrements
|
767 |
|
// balances the work_started() from post(). On IOCP both decrements
|
| 768 |
|
// are required for outstanding_work_ to reach zero; on other
|
768 |
|
// are required for outstanding_work_ to reach zero; on other
|
| 769 |
|
// backends this is harmless.
|
769 |
|
// backends this is harmless.
|
| 770 |
|
|
770 |
|
|
| 771 |
|
// This override also prevents scheduler_op::destroy() from calling
|
771 |
|
// This override also prevents scheduler_op::destroy() from calling
|
| 772 |
|
// do_complete(nullptr, ...). See also: timer_service::shutdown()
|
772 |
|
// do_complete(nullptr, ...). See also: timer_service::shutdown()
|
| 773 |
|
// which drains waiters still in the timer heap (the other path).
|
773 |
|
// which drains waiters still in the timer heap (the other path).
|
| 774 |
|
|
774 |
|
|
| 775 |
|
|
775 |
|
|
| 776 |
|
auto h = std::exchange(w->h_, {});
|
776 |
|
auto h = std::exchange(w->h_, {});
|
| 777 |
|
auto& sched = w->svc_->get_scheduler();
|
777 |
|
auto& sched = w->svc_->get_scheduler();
|
| 778 |
|
|
778 |
|
|
| 779 |
|
|
779 |
|
|
| 780 |
|
|
780 |
|
|
| 781 |
|
|
781 |
|
|
| 782 |
|
|
782 |
|
|
| 783 |
|
|
783 |
|
|
| 784 |
|
inline std::coroutine_handle<>
|
784 |
|
inline std::coroutine_handle<>
|
| 785 |
|
timer_service::implementation::wait(
|
785 |
|
timer_service::implementation::wait(
|
| 786 |
|
std::coroutine_handle<> h,
|
786 |
|
std::coroutine_handle<> h,
|
| 787 |
|
|
787 |
|
|
| 788 |
|
|
788 |
|
|
| 789 |
|
|
789 |
|
|
| 790 |
|
|
790 |
|
|
| 791 |
|
// Already-expired fast path — no waiter_node, no mutex.
|
791 |
|
// Already-expired fast path — no waiter_node, no mutex.
|
| 792 |
|
// Post instead of dispatch so the coroutine yields to the
|
792 |
|
// Post instead of dispatch so the coroutine yields to the
|
| 793 |
|
// scheduler, allowing other queued work to run.
|
793 |
|
// scheduler, allowing other queued work to run.
|
| 794 |
|
if (heap_index_ == (std::numeric_limits<std::size_t>::max)())
|
794 |
|
if (heap_index_ == (std::numeric_limits<std::size_t>::max)())
|
| 795 |
|
|
795 |
|
|
| 796 |
|
if (expiry_ == (time_point::min)() || expiry_ <= clock_type::now())
|
796 |
|
if (expiry_ == (time_point::min)() || expiry_ <= clock_type::now())
|
| 797 |
|
|
797 |
|
|
| 798 |
|
|
798 |
|
|
| 799 |
|
|
799 |
|
|
| 800 |
|
|
800 |
|
|
| 801 |
|
return std::noop_coroutine();
|
801 |
|
return std::noop_coroutine();
|
| 802 |
|
|
802 |
|
|
| 803 |
|
|
803 |
|
|
| 804 |
|
|
804 |
|
|
| 805 |
|
auto* w = svc_->create_waiter();
|
805 |
|
auto* w = svc_->create_waiter();
|
| 806 |
|
|
806 |
|
|
| 807 |
|
|
807 |
|
|
| 808 |
|
|
808 |
|
|
| 809 |
|
|
809 |
|
|
| 810 |
|
w->token_ = std::move(token);
|
810 |
|
w->token_ = std::move(token);
|
| 811 |
|
|
811 |
|
|
| 812 |
|
|
812 |
|
|
| 813 |
|
svc_->insert_waiter(*this, w);
|
813 |
|
svc_->insert_waiter(*this, w);
|
| 814 |
|
might_have_pending_waits_ = true;
|
814 |
|
might_have_pending_waits_ = true;
|
| 815 |
|
svc_->get_scheduler().work_started();
|
815 |
|
svc_->get_scheduler().work_started();
|
| 816 |
|
|
816 |
|
|
| 817 |
|
if (w->token_.stop_possible())
|
817 |
|
if (w->token_.stop_possible())
|
| 818 |
|
w->stop_cb_.emplace(w->token_, waiter_node::canceller{w});
|
818 |
|
w->stop_cb_.emplace(w->token_, waiter_node::canceller{w});
|
| 819 |
|
|
819 |
|
|
| 820 |
|
return std::noop_coroutine();
|
820 |
|
return std::noop_coroutine();
|
| 821 |
|
|
821 |
|
|
| 822 |
|
|
822 |
|
|
| 823 |
|
|
823 |
|
|
| 824 |
|
|
824 |
|
|
| 825 |
|
struct timer_service_access
|
825 |
|
struct timer_service_access
|
| 826 |
|
|
826 |
|
|
| 827 |
|
static native_scheduler& get_scheduler(io_context& ctx) noexcept
|
827 |
|
static native_scheduler& get_scheduler(io_context& ctx) noexcept
|
| 828 |
|
|
828 |
|
|
| 829 |
|
return static_cast<native_scheduler&>(*ctx.sched_);
|
829 |
|
return static_cast<native_scheduler&>(*ctx.sched_);
|
| 830 |
|
|
830 |
|
|
| 831 |
|
|
831 |
|
|
| 832 |
|
|
832 |
|
|
| 833 |
|
// Bypass find_service() mutex by reading the scheduler's cached pointer
|
833 |
|
// Bypass find_service() mutex by reading the scheduler's cached pointer
|
| 834 |
|
inline io_object::io_service&
|
834 |
|
inline io_object::io_service&
|
| 835 |
|
timer_service_direct(capy::execution_context& ctx) noexcept
|
835 |
|
timer_service_direct(capy::execution_context& ctx) noexcept
|
| 836 |
|
|
836 |
|
|
| 837 |
|
return *timer_service_access::get_scheduler(static_cast<io_context&>(ctx))
|
837 |
|
return *timer_service_access::get_scheduler(static_cast<io_context&>(ctx))
|
| 838 |
|
|
838 |
|
|
| 839 |
|
|
839 |
|
|
| 840 |
|
|
840 |
|
|
| 841 |
|
|
841 |
|
|
| 842 |
|
timer_service_update_expiry(timer::implementation& base)
|
842 |
|
timer_service_update_expiry(timer::implementation& base)
|
| 843 |
|
|
843 |
|
|
| 844 |
|
auto& impl = static_cast<timer_service::implementation&>(base);
|
844 |
|
auto& impl = static_cast<timer_service::implementation&>(base);
|
| 845 |
|
return impl.svc_->update_timer(impl, impl.expiry_);
|
845 |
|
return impl.svc_->update_timer(impl, impl.expiry_);
|
| 846 |
|
|
846 |
|
|
| 847 |
|
|
847 |
|
|
| 848 |
|
|
848 |
|
|
| 849 |
|
timer_service_cancel(timer::implementation& base) noexcept
|
849 |
|
timer_service_cancel(timer::implementation& base) noexcept
|
| 850 |
|
|
850 |
|
|
| 851 |
|
auto& impl = static_cast<timer_service::implementation&>(base);
|
851 |
|
auto& impl = static_cast<timer_service::implementation&>(base);
|
| 852 |
|
return impl.svc_->cancel_timer(impl);
|
852 |
|
return impl.svc_->cancel_timer(impl);
|
| 853 |
|
|
853 |
|
|
| 854 |
|
|
854 |
|
|
| 855 |
|
|
855 |
|
|
| 856 |
|
timer_service_cancel_one(timer::implementation& base) noexcept
|
856 |
|
timer_service_cancel_one(timer::implementation& base) noexcept
|
| 857 |
|
|
857 |
|
|
| 858 |
|
auto& impl = static_cast<timer_service::implementation&>(base);
|
858 |
|
auto& impl = static_cast<timer_service::implementation&>(base);
|
| 859 |
|
return impl.svc_->cancel_one_waiter(impl);
|
859 |
|
return impl.svc_->cancel_one_waiter(impl);
|
| 860 |
|
|
860 |
|
|
| 861 |
|
|
861 |
|
|
| 862 |
|
|
862 |
|
|
| 863 |
|
get_timer_service(capy::execution_context& ctx, scheduler& sched)
|
863 |
|
get_timer_service(capy::execution_context& ctx, scheduler& sched)
|
| 864 |
|
|
864 |
|
|
| 865 |
|
return ctx.make_service<timer_service>(sched);
|
865 |
|
return ctx.make_service<timer_service>(sched);
|
| 866 |
|
|
866 |
|
|
| 867 |
|
|
867 |
|
|
| 868 |
|
} // namespace boost::corosio::detail
|
868 |
|
} // namespace boost::corosio::detail
|
| 869 |
|
|
869 |
|
|
| 870 |
|
|
870 |
|
|