. /include/boost/corosio /detail /ready_queue.hpp
100.00% Lines (49/49) 100.00% Functions (12/12)
[ ] prev/next file n p prev/next uncovered line
TLA Baseline Branch
Line Hits Code Line Hits Code
1   // 1   //
2   // Copyright (c) 2026 Steve Gerbino 2   // Copyright (c) 2026 Steve Gerbino
3   // 3   //
4   // Distributed under the Boost Software License, Version 1.0. (See accompanying 4   // Distributed under the Boost Software License, Version 1.0. (See accompanying
5   // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) 5   // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
6   // 6   //
7   // Official repository: https://github.com/cppalliance/corosio 7   // Official repository: https://github.com/cppalliance/corosio
8   // 8   //
9   9  
10   #ifndef BOOST_COROSIO_DETAIL_READY_QUEUE_HPP 10   #ifndef BOOST_COROSIO_DETAIL_READY_QUEUE_HPP
11   #define BOOST_COROSIO_DETAIL_READY_QUEUE_HPP 11   #define BOOST_COROSIO_DETAIL_READY_QUEUE_HPP
12   12  
13   #include <boost/corosio/detail/scheduler_op.hpp> 13   #include <boost/corosio/detail/scheduler_op.hpp>
14   #include <boost/capy/continuation.hpp> 14   #include <boost/capy/continuation.hpp>
15   15  
16   #include <cstdint> 16   #include <cstdint>
17   17  
18   namespace boost::corosio::detail { 18   namespace boost::corosio::detail {
19   19  
20   // A queue entry is a tagged pointer: low bit selects the node kind, the rest 20   // A queue entry is a tagged pointer: low bit selects the node kind, the rest
21   // is the address. We steal a LOW bit (guaranteed zero by alignment), never a 21   // is the address. We steal a LOW bit (guaranteed zero by alignment), never a
22   // high bit (which would depend on a fragile platform canonical-address 22   // high bit (which would depend on a fragile platform canonical-address
23   // assumption). Both node types are >= 8-aligned, so the low 3 bits are free. 23   // assumption). Both node types are >= 8-aligned, so the low 3 bits are free.
24   static_assert(alignof(scheduler_op) >= 2); 24   static_assert(alignof(scheduler_op) >= 2);
25   static_assert(alignof(capy::continuation) >= 2); 25   static_assert(alignof(capy::continuation) >= 2);
26   static_assert(sizeof(void*) == sizeof(std::uintptr_t)); 26   static_assert(sizeof(void*) == sizeof(std::uintptr_t));
27   static_assert(sizeof(capy::continuation::reserved) >= sizeof(void*)); 27   static_assert(sizeof(capy::continuation::reserved) >= sizeof(void*));
28   28  
29   inline constexpr std::uintptr_t ready_cont_bit = 1; 29   inline constexpr std::uintptr_t ready_cont_bit = 1;
30   30  
31   /// Return true if a queue entry refers to a continuation (vs a scheduler_op). 31   /// Return true if a queue entry refers to a continuation (vs a scheduler_op).
32   inline bool 32   inline bool
HITCBC 33   3222486 ready_is_continuation(void* e) noexcept 33   3194598 ready_is_continuation(void* e) noexcept
34   { 34   {
HITCBC 35   3222486 return (reinterpret_cast<std::uintptr_t>(e) & ready_cont_bit) != 0; 35   3194598 return (reinterpret_cast<std::uintptr_t>(e) & ready_cont_bit) != 0;
36   } 36   }
37   37  
38   /// Recover the scheduler_op from an op-tagged entry. 38   /// Recover the scheduler_op from an op-tagged entry.
39   inline scheduler_op* 39   inline scheduler_op*
HITCBC 40   1927800 ready_as_op(void* e) noexcept 40   1906280 ready_as_op(void* e) noexcept
41   { 41   {
42   // NOLINTNEXTLINE(performance-no-int-to-ptr) 42   // NOLINTNEXTLINE(performance-no-int-to-ptr)
43   return reinterpret_cast<scheduler_op*>( 43   return reinterpret_cast<scheduler_op*>(
HITCBC 44   1927800 reinterpret_cast<std::uintptr_t>(e) & ~ready_cont_bit); 44   1906280 reinterpret_cast<std::uintptr_t>(e) & ~ready_cont_bit);
45   } 45   }
46   46  
47   /// Recover the continuation from a continuation-tagged entry. 47   /// Recover the continuation from a continuation-tagged entry.
48   inline capy::continuation* 48   inline capy::continuation*
HITCBC 49   945276 ready_as_cont(void* e) noexcept 49   946050 ready_as_cont(void* e) noexcept
50   { 50   {
51   // NOLINTNEXTLINE(performance-no-int-to-ptr) 51   // NOLINTNEXTLINE(performance-no-int-to-ptr)
52   return reinterpret_cast<capy::continuation*>( 52   return reinterpret_cast<capy::continuation*>(
HITCBC 53   945276 reinterpret_cast<std::uintptr_t>(e) & ~ready_cont_bit); 53   946050 reinterpret_cast<std::uintptr_t>(e) & ~ready_cont_bit);
54   } 54   }
55   55  
56   /** A unified intrusive FIFO of scheduler_ops and continuations. 56   /** A unified intrusive FIFO of scheduler_ops and continuations.
57   57  
58   Carries both completion handlers (`scheduler_op`, dispatched via 58   Carries both completion handlers (`scheduler_op`, dispatched via
59   `(*op)()`) and posted coroutine resumptions (`capy::continuation`, 59   `(*op)()`) and posted coroutine resumptions (`capy::continuation`,
60   dispatched via `h.resume()`) in one ordered queue, with no per-entry 60   dispatched via `h.resume()`) in one ordered queue, with no per-entry
61   allocation. The next-link lives in the node: `scheduler_op::q_next_` 61   allocation. The next-link lives in the node: `scheduler_op::q_next_`
62   for ops, `capy::continuation::reserved` for continuations. 62   for ops, `capy::continuation::reserved` for continuations.
63   63  
64   @par Thread Safety 64   @par Thread Safety
65   Not thread-safe; external synchronization required (the schedulers 65   Not thread-safe; external synchronization required (the schedulers
66   hold their dispatch mutex while touching it). 66   hold their dispatch mutex while touching it).
67   */ 67   */
68   class ready_queue 68   class ready_queue
69   { 69   {
70   void* head_ = nullptr; // tagged first entry, nullptr when empty 70   void* head_ = nullptr; // tagged first entry, nullptr when empty
71   void* tail_ = nullptr; // tagged last entry, nullptr when empty 71   void* tail_ = nullptr; // tagged last entry, nullptr when empty
72   72  
73   // Read a node's next-link by value. A continuation's link lives in its 73   // Read a node's next-link by value. A continuation's link lives in its
74   // void* `reserved` slot. 74   // void* `reserved` slot.
75   // 75   //
76   // GCC 12/13 false-positive: when inlining proves an entry refers to a 76   // GCC 12/13 false-positive: when inlining proves an entry refers to a
77   // continuation, -Warray-bounds still diagnoses the untaken scheduler_op 77   // continuation, -Warray-bounds still diagnoses the untaken scheduler_op
78   // branch against the smaller object. Fixed in GCC 14. 78   // branch against the smaller object. Fixed in GCC 14.
79   BOOST_COROSIO_GCC_WARNING_PUSH 79   BOOST_COROSIO_GCC_WARNING_PUSH
80   BOOST_COROSIO_GCC_WARNING_DISABLE("-Warray-bounds") 80   BOOST_COROSIO_GCC_WARNING_DISABLE("-Warray-bounds")
HITCBC 81   723231 static void* next_of(void* e) noexcept 81   722107 static void* next_of(void* e) noexcept
82   { 82   {
HITCBC 83   723231 if (ready_is_continuation(e)) 83   722107 if (ready_is_continuation(e))
HITCBC 84   236890 return ready_as_cont(e)->reserved; 84   237023 return ready_as_cont(e)->reserved;
HITCBC 85   486341 return ready_as_op(e)->q_next_; 85   485084 return ready_as_op(e)->q_next_;
86   } 86   }
87   87  
HITCBC 88   1388965 static void set_next(void* e, void* nxt) noexcept 88   1373741 static void set_next(void* e, void* nxt) noexcept
89   { 89   {
HITCBC 90   1388965 if (ready_is_continuation(e)) 90   1373741 if (ready_is_continuation(e))
HITCBC 91   471496 ready_as_cont(e)->reserved = nxt; 91   472004 ready_as_cont(e)->reserved = nxt;
92   else 92   else
HITCBC 93   917469 ready_as_op(e)->q_next_ = nxt; 93   901737 ready_as_op(e)->q_next_ = nxt;
HITCBC 94   1388965 } 94   1373741 }
95   BOOST_COROSIO_GCC_WARNING_POP 95   BOOST_COROSIO_GCC_WARNING_POP
96   96  
HITCBC 97   723231 void push_entry(void* e) noexcept 97   722107 void push_entry(void* e) noexcept
98   { 98   {
HITCBC 99   723231 set_next(e, nullptr); 99   722107 set_next(e, nullptr);
HITCBC 100   723231 if (tail_) 100   722107 if (tail_)
HITCBC 101   342053 set_next(tail_, e); 101   338389 set_next(tail_, e);
102   else 102   else
HITCBC 103   381178 head_ = e; 103   383718 head_ = e;
HITCBC 104   723231 tail_ = e; 104   722107 tail_ = e;
HITCBC 105   723231 } 105   722107 }
106   106  
107   public: 107   public:
HITCBC 108   17591 ready_queue() = default; 108   17930 ready_queue() = default;
109   109  
110   ready_queue(ready_queue&& o) noexcept : head_(o.head_), tail_(o.tail_) 110   ready_queue(ready_queue&& o) noexcept : head_(o.head_), tail_(o.tail_)
111   { 111   {
112   o.head_ = nullptr; 112   o.head_ = nullptr;
113   o.tail_ = nullptr; 113   o.tail_ = nullptr;
114   } 114   }
115   115  
116   ready_queue(ready_queue const&) = delete; 116   ready_queue(ready_queue const&) = delete;
117   ready_queue& operator=(ready_queue const&) = delete; 117   ready_queue& operator=(ready_queue const&) = delete;
118   ready_queue& operator=(ready_queue&&) = delete; 118   ready_queue& operator=(ready_queue&&) = delete;
119   119  
120   /// Return true if the queue holds no entries. 120   /// Return true if the queue holds no entries.
HITCBC 121   2002561 bool empty() const noexcept 121   2001032 bool empty() const noexcept
122   { 122   {
HITCBC 123   2002561 return head_ == nullptr; 123   2001032 return head_ == nullptr;
124   } 124   }
125   125  
126   /// Append a scheduler_op to the back of the queue. 126   /// Append a scheduler_op to the back of the queue.
HITCBC 127   486341 void push(scheduler_op* op) noexcept 127   485084 void push(scheduler_op* op) noexcept
128   { 128   {
HITCBC 129   486341 push_entry(reinterpret_cast<void*>(op)); 129   485084 push_entry(reinterpret_cast<void*>(op));
HITCBC 130   486341 } 130   485084 }
131   131  
132   /// Append a continuation to the back of the queue. 132   /// Append a continuation to the back of the queue.
HITCBC 133   236890 void push(capy::continuation& c) noexcept 133   237023 void push(capy::continuation& c) noexcept
134   { 134   {
HITCBC 135   236890 push_entry( 135   237023 push_entry(
136   // NOLINTNEXTLINE(performance-no-int-to-ptr) 136   // NOLINTNEXTLINE(performance-no-int-to-ptr)
137   reinterpret_cast<void*>( 137   reinterpret_cast<void*>(
HITCBC 138   236890 reinterpret_cast<std::uintptr_t>(&c) | ready_cont_bit)); 138   237023 reinterpret_cast<std::uintptr_t>(&c) | ready_cont_bit));
HITCBC 139   236890 } 139   237023 }
140   140  
141   /// Move all entries of @p other to the back in O(1); @p other is emptied. 141   /// Move all entries of @p other to the back in O(1); @p other is emptied.
HITCBC 142   601110 void splice(ready_queue& other) noexcept 142   602004 void splice(ready_queue& other) noexcept
143   { 143   {
HITCBC 144   601110 if (other.empty()) 144   602004 if (other.empty())
HITCBC 145   253295 return; 145   265112 return;
HITCBC 146   347815 if (tail_) 146   336892 if (tail_)
HITCBC 147   323681 set_next(tail_, other.head_); 147   313245 set_next(tail_, other.head_);
148   else 148   else
HITCBC 149   24134 head_ = other.head_; 149   23647 head_ = other.head_;
HITCBC 150   347815 tail_ = other.tail_; 150   336892 tail_ = other.tail_;
HITCBC 151   347815 other.head_ = nullptr; 151   336892 other.head_ = nullptr;
HITCBC 152   347815 other.tail_ = nullptr; 152   336892 other.tail_ = nullptr;
153   } 153   }
154   154  
155   /// Remove and return the front entry as a tagged value, or nullptr when empty. 155   /// Remove and return the front entry as a tagged value, or nullptr when empty.
HITCBC 156   769906 void* pop() noexcept 156   765508 void* pop() noexcept
157   { 157   {
HITCBC 158   769906 auto e = head_; 158   765508 auto e = head_;
HITCBC 159   769906 if (!e) 159   765508 if (!e)
HITCBC 160   46675 return nullptr; 160   43401 return nullptr;
HITCBC 161   723231 head_ = next_of(e); 161   722107 head_ = next_of(e);
HITCBC 162   723231 if (!head_) 162   722107 if (!head_)
HITCBC 163   57497 tail_ = nullptr; 163   70473 tail_ = nullptr;
HITCBC 164   723231 return e; 164   722107 return e;
165   } 165   }
166   }; 166   };
167   167  
168   } // namespace boost::corosio::detail 168   } // namespace boost::corosio::detail
169   169  
170   #endif 170   #endif