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