. /include/boost/corosio /detail /timer_service.hpp
97.07% Lines (232/239) 100.00% Functions (27/27)
[ ] prev/next file n p prev/next uncovered line
TLA Baseline Branch
Line Hits Code Line Hits Code
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/detail/timer.hpp> 14   #include <boost/corosio/detail/timer.hpp>
15   #include <boost/corosio/detail/scheduler.hpp> 15   #include <boost/corosio/detail/scheduler.hpp>
16   #include <boost/corosio/detail/scheduler_op.hpp> 16   #include <boost/corosio/detail/scheduler_op.hpp>
17   #include <boost/corosio/detail/intrusive.hpp> 17   #include <boost/corosio/detail/intrusive.hpp>
18   #include <boost/corosio/detail/thread_local_ptr.hpp> 18   #include <boost/corosio/detail/thread_local_ptr.hpp>
19   #include <boost/capy/error.hpp> 19   #include <boost/capy/error.hpp>
20   #include <boost/capy/ex/execution_context.hpp> 20   #include <boost/capy/ex/execution_context.hpp>
21   #include <boost/capy/ex/executor_ref.hpp> 21   #include <boost/capy/ex/executor_ref.hpp>
22   #include <system_error> 22   #include <system_error>
23   23  
24   #include <atomic> 24   #include <atomic>
25   #include <chrono> 25   #include <chrono>
26   #include <coroutine> 26   #include <coroutine>
27   #include <cstddef> 27   #include <cstddef>
28   #include <limits> 28   #include <limits>
29   #include <mutex> 29   #include <mutex>
30   #include <stop_token> 30   #include <stop_token>
31   #include <utility> 31   #include <utility>
32   #include <vector> 32   #include <vector>
33   33  
34   namespace boost::corosio::detail { 34   namespace boost::corosio::detail {
35   35  
36   struct scheduler; 36   struct scheduler;
37   37  
38   /* 38   /*
39   Timer Service 39   Timer Service
40   ============= 40   =============
41   41  
42   Data Structures 42   Data Structures
43   --------------- 43   ---------------
44   waiter_node (defined in timer.hpp) holds per-waiter state: 44   waiter_node (defined in timer.hpp) holds per-waiter state:
45   coroutine handle, executor, error output, embedded 45   coroutine handle, executor, error output, embedded
46   completion_op. Each concurrent co_await t.wait() embeds one 46   completion_op. Each concurrent co_await t.wait() embeds one
47   waiter_node in the awaitable on the suspended coroutine's 47   waiter_node in the awaitable on the suspended coroutine's
48   frame — waits perform no allocation. 48   frame — waits perform no allocation.
49   49  
50   timer::implementation holds per-timer state: expiry, heap 50   timer::implementation holds per-timer state: expiry, heap
51   index, and the single published waiter. Each timer holds 51   index, and the single published waiter. Each timer holds
52   at most one waiter; process_expired's local cross-timer drain 52   at most one waiter; process_expired's local cross-timer drain
53   list still threads waiters through their intrusive hooks when 53   list still threads waiters through their intrusive hooks when
54   collecting several timers' waiters past the lock. 54   collecting several timers' waiters past the lock.
55   55  
56   timer_service owns a min-heap of active timers and a free list 56   timer_service owns a min-heap of active timers and a free list
57   of recycled impls. The heap is ordered by expiry time; the 57   of recycled impls. The heap is ordered by expiry time; the
58   scheduler queries nearest_expiry() to set the epoll/timerfd 58   scheduler queries nearest_expiry() to set the epoll/timerfd
59   timeout. 59   timeout.
60   60  
61   Optimization Strategy 61   Optimization Strategy
62   --------------------- 62   ---------------------
63   1. Deferred heap insertion — expires_after() stores the expiry 63   1. Deferred heap insertion — expires_after() stores the expiry
64   but does not insert into the heap. Insertion happens in wait(). 64   but does not insert into the heap. Insertion happens in wait().
65   2. Thread-local impl cache — single-slot per-thread cache. 65   2. Thread-local impl cache — single-slot per-thread cache.
66   3. Frame-resident waiter_node with embedded completion_op — 66   3. Frame-resident waiter_node with embedded completion_op —
67   eliminates heap allocation per wait/fire/cancel. 67   eliminates heap allocation per wait/fire/cancel.
68   4. Cached nearest expiry — atomic avoids mutex in nearest_expiry(). 68   4. Cached nearest expiry — atomic avoids mutex in nearest_expiry().
69   5. might_have_pending_waits_ flag — skips lock when no wait issued. 69   5. might_have_pending_waits_ flag — skips lock when no wait issued.
70   70  
71   Concurrency 71   Concurrency
72   ----------- 72   -----------
73   stop_token callbacks can fire from any thread. The impl_ 73   stop_token callbacks can fire from any thread. The impl_
74   pointer on waiter_node is used as a "still in list" marker. 74   pointer on waiter_node is used as a "still in list" marker.
75   A waiter_node's storage is the suspended coroutine's frame: 75   A waiter_node's storage is the suspended coroutine's frame:
76   every completion path must finish touching the node before 76   every completion path must finish touching the node before
77   posting the continuation or destroying the handle. 77   posting the continuation or destroying the handle.
78   */ 78   */
79   79  
80   inline void timer_service_invalidate_cache() noexcept; 80   inline void timer_service_invalidate_cache() noexcept;
81   81  
82   // timer_service class body — member function definitions are 82   // timer_service class body — member function definitions are
83   // out-of-class (after implementation and waiter_node are complete) 83   // out-of-class (after implementation and waiter_node are complete)
84   class BOOST_COROSIO_DECL timer_service final 84   class BOOST_COROSIO_DECL timer_service final
85   : public capy::execution_context::service 85   : public capy::execution_context::service
86   , public io_object::io_service 86   , public io_object::io_service
87   { 87   {
88   public: 88   public:
89   using clock_type = std::chrono::steady_clock; 89   using clock_type = std::chrono::steady_clock;
90   using time_point = clock_type::time_point; 90   using time_point = clock_type::time_point;
91   91  
92   /// Type-erased callback for earliest-expiry-changed notifications. 92   /// Type-erased callback for earliest-expiry-changed notifications.
93   class callback 93   class callback
94   { 94   {
95   void* ctx_ = nullptr; 95   void* ctx_ = nullptr;
96   void (*fn_)(void*) = nullptr; 96   void (*fn_)(void*) = nullptr;
97   97  
98   public: 98   public:
99   /// Construct an empty callback. 99   /// Construct an empty callback.
HITCBC 100   2095 callback() = default; 100   2106 callback() = default;
101   101  
102   /// Construct a callback with the given context and function. 102   /// Construct a callback with the given context and function.
HITCBC 103   2095 callback(void* ctx, void (*fn)(void*)) noexcept : ctx_(ctx), fn_(fn) {} 103   2106 callback(void* ctx, void (*fn)(void*)) noexcept : ctx_(ctx), fn_(fn) {}
104   104  
105   /// Return true if the callback is non-empty. 105   /// Return true if the callback is non-empty.
106   explicit operator bool() const noexcept 106   explicit operator bool() const noexcept
107   { 107   {
108   return fn_ != nullptr; 108   return fn_ != nullptr;
109   } 109   }
110   110  
111   /// Invoke the callback. 111   /// Invoke the callback.
HITCBC 112   9979 void operator()() const 112   9052 void operator()() const
113   { 113   {
HITCBC 114   9979 if (fn_) 114   9052 if (fn_)
HITCBC 115   9979 fn_(ctx_); 115   9052 fn_(ctx_);
HITCBC 116   9979 } 116   9052 }
117   }; 117   };
118   118  
119   private: 119   private:
120   struct heap_entry 120   struct heap_entry
121   { 121   {
122   time_point time_; 122   time_point time_;
123   timer::implementation* timer_; 123   timer::implementation* timer_;
124   }; 124   };
125   125  
126   scheduler* sched_ = nullptr; 126   scheduler* sched_ = nullptr;
127   BOOST_COROSIO_MSVC_WARNING_PUSH 127   BOOST_COROSIO_MSVC_WARNING_PUSH
128   BOOST_COROSIO_MSVC_WARNING_DISABLE(4251) // std:: members, dll-interface 128   BOOST_COROSIO_MSVC_WARNING_DISABLE(4251) // std:: members, dll-interface
129   mutable std::mutex mutex_; 129   mutable std::mutex mutex_;
130   std::vector<heap_entry> heap_; 130   std::vector<heap_entry> heap_;
131   timer::implementation* free_list_ = nullptr; 131   timer::implementation* free_list_ = nullptr;
132   callback on_earliest_changed_; 132   callback on_earliest_changed_;
133   bool shutting_down_ = false; 133   bool shutting_down_ = false;
134   // Avoids mutex in nearest_expiry() and empty() 134   // Avoids mutex in nearest_expiry() and empty()
135   mutable std::atomic<std::int64_t> cached_nearest_ns_{ 135   mutable std::atomic<std::int64_t> cached_nearest_ns_{
136   (std::numeric_limits<std::int64_t>::max)()}; 136   (std::numeric_limits<std::int64_t>::max)()};
137   BOOST_COROSIO_MSVC_WARNING_POP 137   BOOST_COROSIO_MSVC_WARNING_POP
138   138  
139   public: 139   public:
140   /// Construct the timer service bound to a scheduler. 140   /// Construct the timer service bound to a scheduler.
HITCBC 141   2095 inline timer_service(capy::execution_context&, scheduler& sched) 141   2106 inline timer_service(capy::execution_context&, scheduler& sched)
HITCBC 142   2095 : sched_(&sched) 142   2106 : sched_(&sched)
143   { 143   {
HITCBC 144   2095 } 144   2106 }
145   145  
146   /// Return the associated scheduler. 146   /// Return the associated scheduler.
HITCBC 147   34077 inline scheduler& get_scheduler() noexcept 147   32199 inline scheduler& get_scheduler() noexcept
148   { 148   {
HITCBC 149   34077 return *sched_; 149   32199 return *sched_;
150   } 150   }
151   151  
152   /// Destroy the timer service. 152   /// Destroy the timer service.
HITCBC 153   4190 ~timer_service() override = default; 153   4212 ~timer_service() override = default;
154   154  
155   timer_service(timer_service const&) = delete; 155   timer_service(timer_service const&) = delete;
156   timer_service& operator=(timer_service const&) = delete; 156   timer_service& operator=(timer_service const&) = delete;
157   157  
158   /// Register a callback invoked when the earliest expiry changes. 158   /// Register a callback invoked when the earliest expiry changes.
HITCBC 159   2095 inline void set_on_earliest_changed(callback cb) 159   2106 inline void set_on_earliest_changed(callback cb)
160   { 160   {
HITCBC 161   2095 on_earliest_changed_ = cb; 161   2106 on_earliest_changed_ = cb;
HITCBC 162   2095 } 162   2106 }
163   163  
164   /// Return true if no timers are in the heap. 164   /// Return true if no timers are in the heap.
165   inline bool empty() const noexcept 165   inline bool empty() const noexcept
166   { 166   {
167   return cached_nearest_ns_.load(std::memory_order_acquire) == 167   return cached_nearest_ns_.load(std::memory_order_acquire) ==
168   (std::numeric_limits<std::int64_t>::max)(); 168   (std::numeric_limits<std::int64_t>::max)();
169   } 169   }
170   170  
171   /// Return the nearest timer expiry without acquiring the mutex. 171   /// Return the nearest timer expiry without acquiring the mutex.
HITCBC 172   348644 inline time_point nearest_expiry() const noexcept 172   349374 inline time_point nearest_expiry() const noexcept
173   { 173   {
HITCBC 174   348644 auto ns = cached_nearest_ns_.load(std::memory_order_acquire); 174   349374 auto ns = cached_nearest_ns_.load(std::memory_order_acquire);
HITCBC 175   348644 return time_point(time_point::duration(ns)); 175   349374 return time_point(time_point::duration(ns));
176   } 176   }
177   177  
178   /// Cancel all pending timers and free cached resources. 178   /// Cancel all pending timers and free cached resources.
179   inline void shutdown() override; 179   inline void shutdown() override;
180   180  
181   /// Construct a new timer implementation. 181   /// Construct a new timer implementation.
182   inline io_object::implementation* construct() override; 182   inline io_object::implementation* construct() override;
183   183  
184   /// Destroy a timer implementation, cancelling pending waiters. 184   /// Destroy a timer implementation, cancelling pending waiters.
185   inline void destroy(io_object::implementation* p) override; 185   inline void destroy(io_object::implementation* p) override;
186   186  
187   /// Cancel and recycle a timer implementation. 187   /// Cancel and recycle a timer implementation.
188   inline void destroy_impl(timer::implementation& impl); 188   inline void destroy_impl(timer::implementation& impl);
189   189  
190   /// Publish the timer's waiter and insert the timer into the heap. 190   /// Publish the timer's waiter and insert the timer into the heap.
191   inline void insert_waiter(timer::implementation& impl, waiter_node* w); 191   inline void insert_waiter(timer::implementation& impl, waiter_node* w);
192   192  
193   /// Cancel the timer's published waiter, if any. 193   /// Cancel the timer's published waiter, if any.
194   inline void cancel_timer(timer::implementation& impl); 194   inline void cancel_timer(timer::implementation& impl);
195   195  
196   /// Cancel one specific waiter ( stop_token callback path ). 196   /// Cancel one specific waiter ( stop_token callback path ).
197   inline void cancel_waiter(waiter_node* w); 197   inline void cancel_waiter(waiter_node* w);
198   198  
199   /// Complete all waiters whose timers have expired. 199   /// Complete all waiters whose timers have expired.
200   inline std::size_t process_expired(); 200   inline std::size_t process_expired();
201   201  
202   private: 202   private:
HITCBC 203   393002 inline void refresh_cached_nearest() noexcept 203   391191 inline void refresh_cached_nearest() noexcept
204   { 204   {
HITCBC 205   393002 auto ns = heap_.empty() ? (std::numeric_limits<std::int64_t>::max)() 205   391191 auto ns = heap_.empty() ? (std::numeric_limits<std::int64_t>::max)()
HITCBC 206   388138 : heap_[0].time_.time_since_epoch().count(); 206   386342 : heap_[0].time_.time_since_epoch().count();
HITCBC 207   393002 cached_nearest_ns_.store(ns, std::memory_order_release); 207   391191 cached_nearest_ns_.store(ns, std::memory_order_release);
HITCBC 208   393002 } 208   391191 }
209   209  
210   inline void remove_timer_impl(timer::implementation& impl); 210   inline void remove_timer_impl(timer::implementation& impl);
211   inline void up_heap(std::size_t index); 211   inline void up_heap(std::size_t index);
212   inline void down_heap(std::size_t index); 212   inline void down_heap(std::size_t index);
213   inline void swap_heap(std::size_t i1, std::size_t i2); 213   inline void swap_heap(std::size_t i1, std::size_t i2);
214   }; 214   };
215   215  
216   // Thread-local cache avoids hot-path mutex acquisitions: 216   // Thread-local cache avoids hot-path mutex acquisitions:
217   // single-slot impl cache, validated by comparing svc_. Cleared by 217   // single-slot impl cache, validated by comparing svc_. Cleared by
218   // timer_service_invalidate_cache() during shutdown. 218   // timer_service_invalidate_cache() during shutdown.
219   219  
220   inline thread_local_ptr<timer::implementation> tl_cached_impl; 220   inline thread_local_ptr<timer::implementation> tl_cached_impl;
221   221  
222   // The POD TLS slot above never runs destructors, so a short-lived 222   // The POD TLS slot above never runs destructors, so a short-lived
223   // run() thread would leak its cached impl. Each push arms this 223   // run() thread would leak its cached impl. Each push arms this
224   // owner, whose destructor frees the slot at thread exit. A cached 224   // owner, whose destructor frees the slot at thread exit. A cached
225   // entry is a quiescent heap object (nothing in the heap or free 225   // entry is a quiescent heap object (nothing in the heap or free
226   // list) and deletion touches no service state, so it is safe after 226   // list) and deletion touches no service state, so it is safe after
227   // the owning service is gone (the stale-entry path in 227   // the owning service is gone (the stale-entry path in
228   // try_pop_tl_cache deletes the same way). 228   // try_pop_tl_cache deletes the same way).
229   struct tl_cache_owner 229   struct tl_cache_owner
230   { 230   {
HITCBC 231   42 ~tl_cache_owner() 231   41 ~tl_cache_owner()
232   { 232   {
HITCBC 233   42 delete tl_cached_impl.get(); 233   41 delete tl_cached_impl.get();
HITCBC 234   42 tl_cached_impl.set(nullptr); 234   41 tl_cached_impl.set(nullptr);
HITCBC 235   42 } 235   41 }
236   }; 236   };
237   237  
238   inline void 238   inline void
HITCBC 239   17043 arm_tl_cache_cleanup() noexcept 239   16041 arm_tl_cache_cleanup() noexcept
240   { 240   {
HITCBC 241   17043 [[maybe_unused]] thread_local tl_cache_owner owner; 241   16041 [[maybe_unused]] thread_local tl_cache_owner owner;
HITCBC 242   17043 } 242   16041 }
243   243  
244   inline timer::implementation* 244   inline timer::implementation*
HITCBC 245   17908 try_pop_tl_cache(timer_service* svc) noexcept 245   16968 try_pop_tl_cache(timer_service* svc) noexcept
246   { 246   {
HITCBC 247   17908 auto* impl = tl_cached_impl.get(); 247   16968 auto* impl = tl_cached_impl.get();
HITCBC 248   17908 if (impl) 248   16968 if (impl)
249   { 249   {
HITCBC 250   16634 tl_cached_impl.set(nullptr); 250   15629 tl_cached_impl.set(nullptr);
HITCBC 251   16634 if (impl->svc_ == svc) 251   15629 if (impl->svc_ == svc)
HITCBC 252   16634 return impl; 252   15629 return impl;
253   // Stale impl from a destroyed service 253   // Stale impl from a destroyed service
MISUBC 254   ✗ delete impl; 254   ✗ delete impl;
255   } 255   }
HITCBC 256   1274 return nullptr; 256   1339 return nullptr;
257   } 257   }
258   258  
259   inline bool 259   inline bool
HITCBC 260   17879 try_push_tl_cache(timer::implementation* impl) noexcept 260   16939 try_push_tl_cache(timer::implementation* impl) noexcept
261   { 261   {
HITCBC 262   17879 if (!tl_cached_impl.get()) 262   16939 if (!tl_cached_impl.get())
263   { 263   {
HITCBC 264   17043 arm_tl_cache_cleanup(); 264   16041 arm_tl_cache_cleanup();
HITCBC 265   17043 tl_cached_impl.set(impl); 265   16041 tl_cached_impl.set(impl);
HITCBC 266   17043 return true; 266   16041 return true;
267   } 267   }
HITCBC 268   836 return false; 268   898 return false;
269   } 269   }
270   270  
271   inline void 271   inline void
HITCBC 272   2095 timer_service_invalidate_cache() noexcept 272   2106 timer_service_invalidate_cache() noexcept
273   { 273   {
HITCBC 274   2095 delete tl_cached_impl.get(); 274   2106 delete tl_cached_impl.get();
HITCBC 275   2095 tl_cached_impl.set(nullptr); 275   2106 tl_cached_impl.set(nullptr);
HITCBC 276   2095 } 276   2106 }
277   277  
278   // timer_service out-of-class member function definitions 278   // timer_service out-of-class member function definitions
279   279  
280   inline void 280   inline void
HITCBC 281   2095 timer_service::shutdown() 281   2106 timer_service::shutdown()
282   { 282   {
HITCBC 283   2095 timer_service_invalidate_cache(); 283   2106 timer_service_invalidate_cache();
HITCBC 284   2095 shutting_down_ = true; 284   2106 shutting_down_ = true;
285   285  
286   // Snapshot impls and detach them from the heap so that 286   // Snapshot impls and detach them from the heap so that
287   // coroutine-owned timer destructors (triggered by h.destroy() 287   // coroutine-owned timer destructors (triggered by h.destroy()
288   // below) cannot re-enter remove_timer_impl() and mutate the 288   // below) cannot re-enter remove_timer_impl() and mutate the
289   // vector during iteration. 289   // vector during iteration.
HITCBC 290   2095 std::vector<timer::implementation*> impls; 290   2106 std::vector<timer::implementation*> impls;
HITCBC 291   2095 impls.reserve(heap_.size()); 291   2106 impls.reserve(heap_.size());
HITCBC 292   2124 for (auto& entry : heap_) 292   2135 for (auto& entry : heap_)
293   { 293   {
HITCBC 294   29 entry.timer_->heap_index_.store( 294   29 entry.timer_->heap_index_.store(
295   (std::numeric_limits<std::size_t>::max)(), 295   (std::numeric_limits<std::size_t>::max)(),
296   std::memory_order_relaxed); 296   std::memory_order_relaxed);
HITCBC 297   29 impls.push_back(entry.timer_); 297   29 impls.push_back(entry.timer_);
298   } 298   }
HITCBC 299   2095 heap_.clear(); 299   2106 heap_.clear();
HITCBC 300   2095 cached_nearest_ns_.store( 300   2106 cached_nearest_ns_.store(
301   (std::numeric_limits<std::int64_t>::max)(), std::memory_order_release); 301   (std::numeric_limits<std::int64_t>::max)(), std::memory_order_release);
302   302  
303   // Cancel waiting timers. Each waiter called work_started() 303   // Cancel waiting timers. Each waiter called work_started()
304   // in implementation::wait(). On IOCP the scheduler shutdown 304   // in implementation::wait(). On IOCP the scheduler shutdown
305   // loop exits when outstanding_work_ reaches zero, so we must 305   // loop exits when outstanding_work_ reaches zero, so we must
306   // call work_finished() here to balance it. On other backends 306   // call work_finished() here to balance it. On other backends
307   // this is harmless. 307   // this is harmless.
HITCBC 308   2124 for (auto* impl : impls) 308   2135 for (auto* impl : impls)
309   { 309   {
HITCBC 310   29 if (auto* w = std::exchange(impl->waiter_, nullptr)) 310   29 if (auto* w = std::exchange(impl->waiter_, nullptr))
311   { 311   {
HITCBC 312   29 w->reset_stop_cb(); 312   29 w->reset_stop_cb();
HITCBC 313   29 auto h = std::exchange(w->h_, {}); 313   29 auto h = std::exchange(w->h_, {});
HITCBC 314   29 sched_->work_finished(); 314   29 sched_->work_finished();
315   // Destroying the frame also ends the node's storage 315   // Destroying the frame also ends the node's storage
HITCBC 316   29 if (h) 316   29 if (h)
HITCBC 317   29 h.destroy(); 317   29 h.destroy();
318   } 318   }
HITCBC 319   29 delete impl; 319   29 delete impl;
320   } 320   }
321   321  
322   // Delete free-listed impls 322   // Delete free-listed impls
HITCBC 323   2929 while (free_list_) 323   3002 while (free_list_)
324   { 324   {
HITCBC 325   834 auto* next = free_list_->next_free_; 325   896 auto* next = free_list_->next_free_;
HITCBC 326   834 delete free_list_; 326   896 delete free_list_;
HITCBC 327   834 free_list_ = next; 327   896 free_list_ = next;
328   } 328   }
HITCBC 329   2095 } 329   2106 }
330   330  
331   inline io_object::implementation* 331   inline io_object::implementation*
HITCBC 332   17908 timer_service::construct() 332   16968 timer_service::construct()
333   { 333   {
HITCBC 334   17908 timer::implementation* impl = try_pop_tl_cache(this); 334   16968 timer::implementation* impl = try_pop_tl_cache(this);
HITCBC 335   17908 if (impl) 335   16968 if (impl)
336   { 336   {
HITCBC 337   16634 impl->svc_ = this; 337   15629 impl->svc_ = this;
338   // Reset expiry_ too: a recycled impl must behave like a fresh 338   // Reset expiry_ too: a recycled impl must behave like a fresh
339   // one, whose default expiry reads as already elapsed 339   // one, whose default expiry reads as already elapsed
HITCBC 340   16634 impl->expiry_ = {}; 340   15629 impl->expiry_ = {};
HITCBC 341   16634 impl->heap_index_.store( 341   15629 impl->heap_index_.store(
342   (std::numeric_limits<std::size_t>::max)(), 342   (std::numeric_limits<std::size_t>::max)(),
343   std::memory_order_relaxed); 343   std::memory_order_relaxed);
HITCBC 344   16634 impl->might_have_pending_waits_.store(false, std::memory_order_relaxed); 344   15629 impl->might_have_pending_waits_.store(false, std::memory_order_relaxed);
HITCBC 345   16634 BOOST_COROSIO_ASSERT(impl->waiter_ == nullptr); 345   15629 BOOST_COROSIO_ASSERT(impl->waiter_ == nullptr);
HITCBC 346   16634 return impl; 346   15629 return impl;
347   } 347   }
348   348  
HITCBC 349   1274 std::lock_guard lock(mutex_); 349   1339 std::lock_guard lock(mutex_);
HITCBC 350   1274 if (free_list_) 350   1339 if (free_list_)
351   { 351   {
HITCBC 352   2 impl = free_list_; 352   2 impl = free_list_;
HITCBC 353   2 free_list_ = impl->next_free_; 353   2 free_list_ = impl->next_free_;
HITCBC 354   2 impl->next_free_ = nullptr; 354   2 impl->next_free_ = nullptr;
HITCBC 355   2 impl->svc_ = this; 355   2 impl->svc_ = this;
HITCBC 356   2 impl->expiry_ = {}; 356   2 impl->expiry_ = {};
HITCBC 357   2 impl->heap_index_.store( 357   2 impl->heap_index_.store(
358   (std::numeric_limits<std::size_t>::max)(), 358   (std::numeric_limits<std::size_t>::max)(),
359   std::memory_order_relaxed); 359   std::memory_order_relaxed);
HITCBC 360   2 impl->might_have_pending_waits_.store(false, std::memory_order_relaxed); 360   2 impl->might_have_pending_waits_.store(false, std::memory_order_relaxed);
HITCBC 361   2 BOOST_COROSIO_ASSERT(impl->waiter_ == nullptr); 361   2 BOOST_COROSIO_ASSERT(impl->waiter_ == nullptr);
362   } 362   }
363   else 363   else
364   { 364   {
HITCBC 365   1272 impl = new timer::implementation(*this); 365   1337 impl = new timer::implementation(*this);
366   } 366   }
HITCBC 367   1274 return impl; 367   1339 return impl;
HITCBC 368   1274 } 368   1339 }
369   369  
370   inline void 370   inline void
HITCBC 371   17908 timer_service::destroy(io_object::implementation* p) 371   16968 timer_service::destroy(io_object::implementation* p)
372   { 372   {
373   // During shutdown the drain loop owns every impl and deletes 373   // During shutdown the drain loop owns every impl and deletes
374   // them directly. A frame destroyed by that loop can unwind a 374   // them directly. A frame destroyed by that loop can unwind a
375   // handle whose impl was freed in an earlier iteration (a 375   // handle whose impl was freed in an earlier iteration (a
376   // timeout's parent frame owns the timeout timer while 376   // timeout's parent frame owns the timeout timer while
377   // suspended on the inner delay's timer), so bail out before 377   // suspended on the inner delay's timer), so bail out before
378   // even downcasting the pointer. 378   // even downcasting the pointer.
HITCBC 379   17908 if (shutting_down_) 379   16968 if (shutting_down_)
HITCBC 380   29 return; 380   29 return;
HITCBC 381   17879 destroy_impl(static_cast<timer::implementation&>(*p)); 381   16939 destroy_impl(static_cast<timer::implementation&>(*p));
382   } 382   }
383   383  
384   inline void 384   inline void
HITCBC 385   17879 timer_service::destroy_impl(timer::implementation& impl) 385   16939 timer_service::destroy_impl(timer::implementation& impl)
386   { 386   {
387   // During shutdown the impl is owned by the shutdown loop. 387   // During shutdown the impl is owned by the shutdown loop.
388   // Re-entering here (from a coroutine-owned timer destructor 388   // Re-entering here (from a coroutine-owned timer destructor
389   // triggered by h.destroy()) must not modify the heap or 389   // triggered by h.destroy()) must not modify the heap or
390   // recycle the impl — shutdown deletes it directly. 390   // recycle the impl — shutdown deletes it directly.
HITCBC 391   17879 if (shutting_down_) 391   16939 if (shutting_down_)
HITCBC 392   17043 return; 392   16041 return;
393   393  
HITCBC 394   17879 cancel_timer(impl); 394   16939 cancel_timer(impl);
395   395  
HITCBC 396   35758 if (impl.heap_index_.load(std::memory_order_relaxed) != 396   33878 if (impl.heap_index_.load(std::memory_order_relaxed) !=
HITCBC 397   17879 (std::numeric_limits<std::size_t>::max)()) 397   16939 (std::numeric_limits<std::size_t>::max)())
398   { 398   {
MISUBC 399   ✗ std::lock_guard lock(mutex_); 399   ✗ std::lock_guard lock(mutex_);
MISUBC 400   ✗ remove_timer_impl(impl); 400   ✗ remove_timer_impl(impl);
MISUBC 401   ✗ refresh_cached_nearest(); 401   ✗ refresh_cached_nearest();
MISUBC 402   ✗ } 402   ✗ }
403   403  
HITCBC 404   17879 if (try_push_tl_cache(&impl)) 404   16939 if (try_push_tl_cache(&impl))
HITCBC 405   17043 return; 405   16041 return;
406   406  
HITCBC 407   836 std::lock_guard lock(mutex_); 407   898 std::lock_guard lock(mutex_);
HITCBC 408   836 impl.next_free_ = free_list_; 408   898 impl.next_free_ = free_list_;
HITCBC 409   836 free_list_ = &impl; 409   898 free_list_ = &impl;
HITCBC 410   836 } 410   898 }
411   411  
412   inline void 412   inline void
HITCBC 413   21141 timer_service::insert_waiter(timer::implementation& impl, waiter_node* w) 413   20176 timer_service::insert_waiter(timer::implementation& impl, waiter_node* w)
414   { 414   {
HITCBC 415   21141 bool notify = false; 415   20176 bool notify = false;
HITCBC 416   21141 bool lost_cancel = false; 416   20176 bool lost_cancel = false;
417   { 417   {
HITCBC 418   21141 std::lock_guard lock(mutex_); 418   20176 std::lock_guard lock(mutex_);
419   // Grow before publishing anything, so the push_back below 419   // Grow before publishing anything, so the push_back below
420   // cannot throw: a failure here leaves the waiter untouched, 420   // cannot throw: a failure here leaves the waiter untouched,
421   // the strong guarantee rearm_wait's recovery relies on. 421   // the strong guarantee rearm_wait's recovery relies on.
HITCBC 422   21141 if (impl.heap_index_.load(std::memory_order_relaxed) == 422   20176 if (impl.heap_index_.load(std::memory_order_relaxed) ==
HITCBC 423   42282 (std::numeric_limits<std::size_t>::max)() && 423   40352 (std::numeric_limits<std::size_t>::max)() &&
HITCBC 424   21141 heap_.size() == heap_.capacity()) 424   20176 heap_.size() == heap_.capacity())
HITCBC 425   418 heap_.reserve( 425   426 heap_.reserve(
HITCBC 426   418 heap_.capacity() == 0 ? 16 : 2 * heap_.capacity()); 426   426 heap_.capacity() == 0 ? 16 : 2 * heap_.capacity());
427   // Publish: from here the waiter is visible to the fire path and 427   // Publish: from here the waiter is visible to the fire path and
428   // to its own stop callback (impl_ non-null enables cancel_waiter). 428   // to its own stop callback (impl_ non-null enables cancel_waiter).
HITCBC 429   21141 w->impl_ = &impl; 429   20176 w->impl_ = &impl;
HITCBC 430   42282 if (impl.heap_index_.load(std::memory_order_relaxed) == 430   40352 if (impl.heap_index_.load(std::memory_order_relaxed) ==
HITCBC 431   21141 (std::numeric_limits<std::size_t>::max)()) 431   20176 (std::numeric_limits<std::size_t>::max)())
432   { 432   {
HITCBC 433   21141 impl.heap_index_.store(heap_.size(), std::memory_order_relaxed); 433   20176 impl.heap_index_.store(heap_.size(), std::memory_order_relaxed);
HITCBC 434   21141 heap_.push_back({impl.expiry_, &impl}); 434   20176 heap_.push_back({impl.expiry_, &impl});
HITCBC 435   21141 up_heap(heap_.size() - 1); 435   20176 up_heap(heap_.size() - 1);
HITCBC 436   21141 notify = 436   20176 notify =
HITCBC 437   21141 (impl.heap_index_.load(std::memory_order_relaxed) == 0); 437   20176 (impl.heap_index_.load(std::memory_order_relaxed) == 0);
HITCBC 438   21141 refresh_cached_nearest(); 438   20176 refresh_cached_nearest();
439   } 439   }
HITCBC 440   21141 BOOST_COROSIO_ASSERT(impl.waiter_ == nullptr); 440   20176 BOOST_COROSIO_ASSERT(impl.waiter_ == nullptr);
HITCBC 441   21141 impl.waiter_ = w; 441   20176 impl.waiter_ = w;
442   442  
443   // Lost-cancel re-check: a stop requested after the canceller was 443   // Lost-cancel re-check: a stop requested after the canceller was
444   // armed in wait() but before this publication found impl_ null 444   // armed in wait() but before this publication found impl_ null
445   // and returned a no-op. Observe it now and undo the insertion. 445   // and returned a no-op. Observe it now and undo the insertion.
HITCBC 446   21141 if (w->token_->stop_requested()) 446   20176 if (w->token_->stop_requested())
447   { 447   {
HITCBC 448   1 w->impl_ = nullptr; 448   3 w->impl_ = nullptr;
HITCBC 449   1 impl.waiter_ = nullptr; 449   3 impl.waiter_ = nullptr;
HITCBC 450   1 remove_timer_impl(impl); 450   3 remove_timer_impl(impl);
HITCBC 451   1 impl.might_have_pending_waits_.store( 451   3 impl.might_have_pending_waits_.store(
452   false, std::memory_order_relaxed); 452   false, std::memory_order_relaxed);
HITCBC 453   1 refresh_cached_nearest(); 453   3 refresh_cached_nearest();
HITCBC 454   1 lost_cancel = true; 454   3 lost_cancel = true;
HITCBC 455   1 notify = false; // insertion undone; nearest unchanged 455   3 notify = false; // insertion undone; nearest unchanged
456   } 456   }
HITCBC 457   21141 } 457   20176 }
HITCBC 458   21141 if (notify) 458   20176 if (notify)
HITCBC 459   9979 on_earliest_changed_(); 459   9052 on_earliest_changed_();
HITCBC 460   21141 if (lost_cancel) 460   20176 if (lost_cancel)
461   { 461   {
HITCBC 462   1 w->ec_ = make_error_code(capy::error::canceled); 462   3 w->ec_ = make_error_code(capy::error::canceled);
HITCBC 463   1 sched_->post(&w->op_); 463   3 sched_->post(&w->op_);
464   } 464   }
HITCBC 465   21141 } 465   20176 }
466   466  
467   inline void 467   inline void
HITCBC 468   17879 timer_service::cancel_timer(timer::implementation& impl) 468   16939 timer_service::cancel_timer(timer::implementation& impl)
469   { 469   {
HITCBC 470   17879 if (!impl.might_have_pending_waits_.load(std::memory_order_relaxed)) 470   16939 if (!impl.might_have_pending_waits_.load(std::memory_order_relaxed))
HITCBC 471   17877 return; 471   16937 return;
472   472  
473   // No unlocked already-done fast-out here: it would need the 473   // No unlocked already-done fast-out here: it would need the
474   // non-atomic waiter_ (a race with concurrent drains), and an 474   // non-atomic waiter_ (a race with concurrent drains), and an
475   // index-only check is lifetime-unsafe because npos is stored 475   // index-only check is lifetime-unsafe because npos is stored
476   // before the drain finishes touching the impl. A stale-true 476   // before the drain finishes touching the impl. A stale-true
477   // flag is rare with the stateless API; the locked path below 477   // flag is rare with the stateless API; the locked path below
478   // re-validates. 478   // re-validates.
479   479  
HITCBC 480   2 waiter_node* canceled = nullptr; 480   2 waiter_node* canceled = nullptr;
481   481  
482   { 482   {
HITCBC 483   2 std::lock_guard lock(mutex_); 483   2 std::lock_guard lock(mutex_);
HITCBC 484   2 remove_timer_impl(impl); 484   2 remove_timer_impl(impl);
HITCBC 485   2 canceled = std::exchange(impl.waiter_, nullptr); 485   2 canceled = std::exchange(impl.waiter_, nullptr);
HITCBC 486   2 if (canceled) 486   2 if (canceled)
HITCBC 487   2 canceled->impl_ = nullptr; 487   2 canceled->impl_ = nullptr;
488   // Store false as the final touch of the impl under the lock so 488   // Store false as the final touch of the impl under the lock so
489   // a pre-lock false-flag check trusts it unqualified. 489   // a pre-lock false-flag check trusts it unqualified.
HITCBC 490   2 impl.might_have_pending_waits_.store(false, std::memory_order_relaxed); 490   2 impl.might_have_pending_waits_.store(false, std::memory_order_relaxed);
HITCBC 491   2 refresh_cached_nearest(); 491   2 refresh_cached_nearest();
HITCBC 492   2 } 492   2 }
493   493  
HITCBC 494   2 if (canceled) 494   2 if (canceled)
495   { 495   {
HITCBC 496   2 canceled->ec_ = make_error_code(capy::error::canceled); 496   2 canceled->ec_ = make_error_code(capy::error::canceled);
HITCBC 497   2 sched_->post(&canceled->op_); 497   2 sched_->post(&canceled->op_);
498   } 498   }
499   } 499   }
500   500  
501   inline void 501   inline void
HITCBC 502   1479 timer_service::cancel_waiter(waiter_node* w) 502   1512 timer_service::cancel_waiter(waiter_node* w)
503   { 503   {
504   { 504   {
HITCBC 505   1479 std::lock_guard lock(mutex_); 505   1512 std::lock_guard lock(mutex_);
506   // Already removed by another drain: cancel_timer, 506   // Already removed by another drain: cancel_timer,
507   // process_expired, or insert_waiter's lost-cancel recheck 507   // process_expired, or insert_waiter's lost-cancel recheck
HITCBC 508   1479 if (!w->impl_) 508   1512 if (!w->impl_)
HITCBC 509   1 return; 509   4 return;
HITCBC 510   1478 auto* impl = w->impl_; 510   1508 auto* impl = w->impl_;
HITCBC 511   1478 w->impl_ = nullptr; 511   1508 w->impl_ = nullptr;
HITCBC 512   1478 impl->waiter_ = nullptr; 512   1508 impl->waiter_ = nullptr;
HITCBC 513   1478 remove_timer_impl(*impl); 513   1508 remove_timer_impl(*impl);
HITCBC 514   1478 impl->might_have_pending_waits_.store( 514   1508 impl->might_have_pending_waits_.store(
515   false, std::memory_order_relaxed); 515   false, std::memory_order_relaxed);
HITCBC 516   1478 refresh_cached_nearest(); 516   1508 refresh_cached_nearest();
HITCBC 517   1479 } 517   1512 }
518   518  
HITCBC 519   1478 w->ec_ = make_error_code(capy::error::canceled); 519   1508 w->ec_ = make_error_code(capy::error::canceled);
HITCBC 520   1478 sched_->post(&w->op_); 520   1508 sched_->post(&w->op_);
521   } 521   }
522   522  
523   inline std::size_t 523   inline std::size_t
HITCBC 524   370380 timer_service::process_expired() 524   369502 timer_service::process_expired()
525   { 525   {
HITCBC 526   370380 intrusive_list<waiter_node> expired; 526   369502 intrusive_list<waiter_node> expired;
527   527  
528   { 528   {
HITCBC 529   370380 std::lock_guard lock(mutex_); 529   369502 std::lock_guard lock(mutex_);
HITCBC 530   370380 auto now = clock_type::now(); 530   369502 auto now = clock_type::now();
531   531  
HITCBC 532   390011 while (!heap_.empty() && heap_[0].time_ <= now) 532   388136 while (!heap_.empty() && heap_[0].time_ <= now)
533   { 533   {
HITCBC 534   19631 timer::implementation* t = heap_[0].timer_; 534   18634 timer::implementation* t = heap_[0].timer_;
HITCBC 535   19631 remove_timer_impl(*t); 535   18634 remove_timer_impl(*t);
HITCBC 536   19631 if (auto* w = std::exchange(t->waiter_, nullptr)) 536   18634 if (auto* w = std::exchange(t->waiter_, nullptr))
537   { 537   {
HITCBC 538   19631 w->impl_ = nullptr; 538   18634 w->impl_ = nullptr;
HITCBC 539   19631 w->ec_ = {}; 539   18634 w->ec_ = {};
HITCBC 540   19631 expired.push_back(w); 540   18634 expired.push_back(w);
541   } 541   }
HITCBC 542   19631 t->might_have_pending_waits_.store( 542   18634 t->might_have_pending_waits_.store(
543   false, std::memory_order_relaxed); 543   false, std::memory_order_relaxed);
544   } 544   }
545   545  
HITCBC 546   370380 refresh_cached_nearest(); 546   369502 refresh_cached_nearest();
HITCBC 547   370380 } 547   369502 }
548   548  
HITCBC 549   370380 std::size_t count = 0; 549   369502 std::size_t count = 0;
HITCBC 550   390011 while (auto* w = expired.pop_front()) 550   388136 while (auto* w = expired.pop_front())
551   { 551   {
HITCBC 552   19631 sched_->post(&w->op_); 552   18634 sched_->post(&w->op_);
HITCBC 553   19631 ++count; 553   18634 ++count;
HITCBC 554   19631 } 554   18634 }
555   555  
HITCBC 556   370380 return count; 556   369502 return count;
557   } 557   }
558   558  
559   inline void 559   inline void
HITCBC 560   21112 timer_service::remove_timer_impl(timer::implementation& impl) 560   20147 timer_service::remove_timer_impl(timer::implementation& impl)
561   { 561   {
HITCBC 562   21112 std::size_t index = impl.heap_index_.load(std::memory_order_relaxed); 562   20147 std::size_t index = impl.heap_index_.load(std::memory_order_relaxed);
HITCBC 563   21112 if (index >= heap_.size()) 563   20147 if (index >= heap_.size())
MISUBC 564   ✗ return; // Not in heap 564   ✗ return; // Not in heap
565   565  
HITCBC 566   21112 if (index == heap_.size() - 1) 566   20147 if (index == heap_.size() - 1)
567   { 567   {
568   // Last element, just pop 568   // Last element, just pop
HITCBC 569   2622 impl.heap_index_.store( 569   2605 impl.heap_index_.store(
570   (std::numeric_limits<std::size_t>::max)(), 570   (std::numeric_limits<std::size_t>::max)(),
571   std::memory_order_relaxed); 571   std::memory_order_relaxed);
HITCBC 572   2622 heap_.pop_back(); 572   2605 heap_.pop_back();
573   } 573   }
574   else 574   else
575   { 575   {
576   // Swap with last and reheapify 576   // Swap with last and reheapify
HITCBC 577   18490 swap_heap(index, heap_.size() - 1); 577   17542 swap_heap(index, heap_.size() - 1);
HITCBC 578   18490 impl.heap_index_.store( 578   17542 impl.heap_index_.store(
579   (std::numeric_limits<std::size_t>::max)(), 579   (std::numeric_limits<std::size_t>::max)(),
580   std::memory_order_relaxed); 580   std::memory_order_relaxed);
HITCBC 581   18490 heap_.pop_back(); 581   17542 heap_.pop_back();
582   582  
HITCBC 583   18490 if (index > 0 && heap_[index].time_ < heap_[(index - 1) / 2].time_) 583   17542 if (index > 0 && heap_[index].time_ < heap_[(index - 1) / 2].time_)
MISUBC 584   ✗ up_heap(index); 584   ✗ up_heap(index);
585   else 585   else
HITCBC 586   18490 down_heap(index); 586   17542 down_heap(index);
587   } 587   }
588   } 588   }
589   589  
590   inline void 590   inline void
HITCBC 591   21141 timer_service::up_heap(std::size_t index) 591   20176 timer_service::up_heap(std::size_t index)
592   { 592   {
HITCBC 593   30762 while (index > 0) 593   29067 while (index > 0)
594   { 594   {
HITCBC 595   20782 std::size_t parent = (index - 1) / 2; 595   20012 std::size_t parent = (index - 1) / 2;
HITCBC 596   20782 if (!(heap_[index].time_ < heap_[parent].time_)) 596   20012 if (!(heap_[index].time_ < heap_[parent].time_))
HITCBC 597   11161 break; 597   11121 break;
HITCBC 598   9621 swap_heap(index, parent); 598   8891 swap_heap(index, parent);
HITCBC 599   9621 index = parent; 599   8891 index = parent;
600   } 600   }
HITCBC 601   21141 } 601   20176 }
602   602  
603   inline void 603   inline void
HITCBC 604   18490 timer_service::down_heap(std::size_t index) 604   17542 timer_service::down_heap(std::size_t index)
605   { 605   {
HITCBC 606   18490 std::size_t child = index * 2 + 1; 606   17542 std::size_t child = index * 2 + 1;
HITCBC 607   36266 while (child < heap_.size()) 607   35156 while (child < heap_.size())
608   { 608   {
HITCBC 609   19499 std::size_t min_child = (child + 1 == heap_.size() || 609   19419 std::size_t min_child = (child + 1 == heap_.size() ||
HITCBC 610   15926 heap_[child].time_ < heap_[child + 1].time_) 610   15702 heap_[child].time_ < heap_[child + 1].time_)
HITCBC 611   35425 ? child 611   35121 ? child
HITCBC 612   19499 : child + 1; 612   19419 : child + 1;
613   613  
HITCBC 614   19499 if (heap_[index].time_ < heap_[min_child].time_) 614   19419 if (heap_[index].time_ < heap_[min_child].time_)
HITCBC 615   1723 break; 615   1805 break;
616   616  
HITCBC 617   17776 swap_heap(index, min_child); 617   17614 swap_heap(index, min_child);
HITCBC 618   17776 index = min_child; 618   17614 index = min_child;
HITCBC 619   17776 child = index * 2 + 1; 619   17614 child = index * 2 + 1;
620   } 620   }
HITCBC 621   18490 } 621   17542 }
622   622  
623   inline void 623   inline void
HITCBC 624   45887 timer_service::swap_heap(std::size_t i1, std::size_t i2) 624   44047 timer_service::swap_heap(std::size_t i1, std::size_t i2)
625   { 625   {
HITCBC 626   45887 heap_entry tmp = heap_[i1]; 626   44047 heap_entry tmp = heap_[i1];
HITCBC 627   45887 heap_[i1] = heap_[i2]; 627   44047 heap_[i1] = heap_[i2];
HITCBC 628   45887 heap_[i2] = tmp; 628   44047 heap_[i2] = tmp;
HITCBC 629   45887 heap_[i1].timer_->heap_index_.store(i1, std::memory_order_relaxed); 629   44047 heap_[i1].timer_->heap_index_.store(i1, std::memory_order_relaxed);
HITCBC 630   45887 heap_[i2].timer_->heap_index_.store(i2, std::memory_order_relaxed); 630   44047 heap_[i2].timer_->heap_index_.store(i2, std::memory_order_relaxed);
HITCBC 631   45887 } 631   44047 }
632   632  
633   // waiter_node's completion_op and canceller members are defined in 633   // waiter_node's completion_op and canceller members are defined in
634   // timer.cpp alongside implementation::wait(), for the same reason 634   // timer.cpp alongside implementation::wait(), for the same reason
635   // wait() lives there (see below). 635   // wait() lives there (see below).
636   636  
637   // timer::implementation::wait() is defined in timer.cpp, not here. 637   // timer::implementation::wait() is defined in timer.cpp, not here.
638   // It must be a non-inline definition in a translation unit that is 638   // It must be a non-inline definition in a translation unit that is
639   // always pulled into the link whenever detail::timer is used (every 639   // always pulled into the link whenever detail::timer is used (every
640   // consumer needs timer's constructors from that same object file). 640   // consumer needs timer's constructors from that same object file).
641   // An inline definition in this header would only be emitted in 641   // An inline definition in this header would only be emitted in
642   // translation units that happen to also include this header, which 642   // translation units that happen to also include this header, which
643   // is not guaranteed for every caller of wait_awaitable::await_suspend 643   // is not guaranteed for every caller of wait_awaitable::await_suspend
644   // in timer.hpp (e.g. code that only reaches timer.hpp through 644   // in timer.hpp (e.g. code that only reaches timer.hpp through
645   // delay.hpp, without transitively including a scheduler header). 645   // delay.hpp, without transitively including a scheduler header).
646   646  
647   // Free functions 647   // Free functions
648   648  
649   inline timer_service& 649   inline timer_service&
HITCBC 650   2095 get_timer_service(capy::execution_context& ctx, scheduler& sched) 650   2106 get_timer_service(capy::execution_context& ctx, scheduler& sched)
651   { 651   {
HITCBC 652   2095 return ctx.make_service<timer_service>(sched); 652   2106 return ctx.make_service<timer_service>(sched);
653   } 653   }
654   654  
655   } // namespace boost::corosio::detail 655   } // namespace boost::corosio::detail
656   656  
657   #endif 657   #endif