GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/util/tube.h
Date: 2025-11-02 02:35:35
Exec Total Coverage
Lines: 130 130 100.0%
Branches: 50 74 67.6%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #ifndef CVMFS_UTIL_TUBE_H_
6 #define CVMFS_UTIL_TUBE_H_
7
8 #include <pthread.h>
9 #include <stdint.h>
10
11 #include <cassert>
12 #include <cstddef>
13 #include <vector>
14
15 #include "util/atomic.h"
16 #include "util/mutex.h"
17 #include "util/single_copy.h"
18
19 /**
20 * A thread-safe, doubly linked list of links containing pointers to ItemT. The
21 * ItemT elements are not owned by the Tube. FIFO or LIFO semantics. Using
22 * Slice(), items at arbitrary locations in the tube can be removed, too.
23 *
24 *
25 * The layout of the linked list is as follows:
26 *
27 * --------------------------------------------------------------
28 * | |
29 * --> I$n$ (back) <--> I2 <--> ... <--> I1 (front) <--> HEAD <--
30 *
31 * The tube links the steps in the file processing pipeline. It connects
32 * multiple producers to multiple consumers and can throttle the producers if a
33 * limit for the tube size is set.
34 *
35 * Internally, uses conditional variables to block when threads try to pop from
36 * the empty tube or insert into the full tube.
37 */
38 template<class ItemT>
39 class Tube : SingleCopy {
40 public:
41 class Link : SingleCopy {
42 friend class Tube<ItemT>;
43
44 public:
45 233957426 explicit Link(ItemT *item) : item_(item), next_(NULL), prev_(NULL) { }
46 37 ItemT *item() { return item_; }
47
48 private:
49 ItemT *item_;
50 Link *next_;
51 Link *prev_;
52 };
53
54 209017 Tube() : limit_(uint64_t(-1)), size_(0) { Init(); }
55 2589 explicit Tube(uint64_t limit) : limit_(limit), size_(0) { Init(); }
56 215697 ~Tube() {
57 216006 Link *cursor = head_;
58 do {
59 216055 Link *prev = cursor->prev_;
60
1/2
✓ Branch 0 taken 110909 times.
✗ Branch 1 not taken.
 216055 delete cursor;
61 216055 cursor = prev;
62
2/2
✓ Branch 0 taken 49 times.
✓ Branch 1 taken 110860 times.
 216055 } while (cursor != head_);
63 216006 pthread_cond_destroy(&cond_populated_);
64 216006 pthread_cond_destroy(&cond_capacious_);
65 216006 pthread_cond_destroy(&cond_empty_);
66 216006 pthread_mutex_destroy(&lock_);
67 216006 }
68
69 /**
70 * Push an item to the back of the queue. Block if queue is currently full.
71 */
72 215516282 Link *EnqueueBack(ItemT *item) {
73
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 117170084 times.
 215516282 assert(item != NULL);
74 215516282 MutexLockGuard lock_guard(&lock_);
75
2/2
✓ Branch 0 taken 5485176 times.
✓ Branch 1 taken 116564797 times.
 225269013 while (size_ == limit_)
76
1/2
✓ Branch 1 taken 5466558 times.
✗ Branch 2 not taken.
 10970352 pthread_cond_wait(&cond_capacious_, &lock_);
77
78
1/2
✓ Branch 1 taken 116696877 times.
✗ Branch 2 not taken.
 214298661 Link *link = new Link(item);
79 213131057 link->next_ = head_->next_;
80 213131057 link->prev_ = head_;
81 213131057 head_->next_->prev_ = link;
82 213131057 head_->next_ = link;
83 213131057 size_++;
84 213131057 int retval = pthread_cond_signal(&cond_populated_);
85
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 117552279 times.
 216273625 assert(retval == 0);
86 215517495 return link;
87 216273625 }
88
89 /**
90 * Push an item to the front of the queue. Block if queue currently full.
91 */
92 19720821 Link *EnqueueFront(ItemT *item) {
93
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 19718032 times.
 19720821 assert(item != NULL);
94 19720821 MutexLockGuard lock_guard(&lock_);
95
2/2
✓ Branch 0 taken 80 times.
✓ Branch 1 taken 19717983 times.
 19720932 while (size_ == limit_)
96
1/2
✓ Branch 1 taken 80 times.
✗ Branch 2 not taken.
 160 pthread_cond_wait(&cond_capacious_, &lock_);
97
98
1/2
✓ Branch 1 taken 19717983 times.
✗ Branch 2 not taken.
 19720772 Link *link = new Link(item);
99 19720772 link->next_ = head_;
100 19720772 link->prev_ = head_->prev_;
101 19720772 head_->prev_->next_ = link;
102 19720772 head_->prev_ = link;
103 19720772 size_++;
104 19720772 int retval = pthread_cond_signal(&cond_populated_);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 19717934 times.
 19720723 assert(retval == 0);
106 19720821 return link;
107 19720723 }
108
109 /**
110 * Remove any link from the queue and return its item, including first/last
111 * element.
112 */
113 64 ItemT *Slice(Link *link) {
114 64 MutexLockGuard lock_guard(&lock_);
115 64 return SliceUnlocked(link);
116 64 }
117
118 /**
119 * Remove and return the first element from the queue. Block if tube is
120 * empty.
121 */
122 233303023 ItemT *PopFront() {
123 233303023 MutexLockGuard lock_guard(&lock_);
124
2/2
✓ Branch 0 taken 42671437 times.
✓ Branch 1 taken 134856639 times.
 316978748 while (size_ == 0)
125
1/2
✓ Branch 1 taken 42736168 times.
✗ Branch 2 not taken.
 84146449 pthread_cond_wait(&cond_populated_, &lock_);
126 464812771 return SliceUnlocked(head_->prev_);
127 231585667 }
128
129 /**
130 * Remove and return the first element from the queue if there is any.
131 * Equivalent to an antomic
132 * ItemT item = NULL;
133 * if (!IsEmpty())
134 * item = PopFront();
135 */
136 19707001 ItemT *TryPopFront() {
137 19707001 MutexLockGuard lock_guard(&lock_);
138 // Note that we don't need to wait for a signal to arrive
139
2/2
✓ Branch 0 taken 18050157 times.
✓ Branch 1 taken 1664831 times.
 19714988 if (size_ == 0)
140 18050157 return NULL;
141 1664831 return SliceUnlocked(head_->prev_);
142 19714988 }
143
144 /**
145 * Remove and return the last element from the queue. Block if tube is
146 * empty.
147 */
148 5929 ItemT *PopBack() {
149 5929 MutexLockGuard lock_guard(&lock_);
150
2/2
✓ Branch 0 taken 869 times.
✓ Branch 1 taken 3140 times.
 7667 while (size_ == 0)
151
1/2
✓ Branch 1 taken 869 times.
✗ Branch 2 not taken.
 1738 pthread_cond_wait(&cond_populated_, &lock_);
152 11858 return SliceUnlocked(head_->next_);
153 5929 }
154
155 /**
156 * Blocks until the tube is empty
157 */
158 2069 void Wait() {
159 2069 MutexLockGuard lock_guard(&lock_);
160
2/2
✓ Branch 0 taken 637 times.
✓ Branch 1 taken 2069 times.
 2706 while (size_ > 0)
161
1/2
✓ Branch 1 taken 637 times.
✗ Branch 2 not taken.
 637 pthread_cond_wait(&cond_empty_, &lock_);
162 2069 }
163
164 17489 bool IsEmpty() {
165 17489 MutexLockGuard lock_guard(&lock_);
166 34978 return size_ == 0;
167 17489 }
168
169 491 uint64_t size() {
170 491 MutexLockGuard lock_guard(&lock_);
171 982 return size_;
172 491 }
173
174 private:
175 212959 void Init() {
176 212959 Link *sentinel = new Link(NULL);
177 212959 head_ = sentinel;
178 212959 head_->next_ = head_->prev_ = sentinel;
179
180 212959 int retval = pthread_mutex_init(&lock_, NULL);
181
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 110936 times.
 212959 assert(retval == 0);
182 212959 retval = pthread_cond_init(&cond_populated_, NULL);
183
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 110936 times.
 212959 assert(retval == 0);
184 212959 retval = pthread_cond_init(&cond_capacious_, NULL);
185
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 110936 times.
 212959 assert(retval == 0);
186 212959 retval = pthread_cond_init(&cond_empty_, NULL);
187
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 110936 times.
 212959 assert(retval == 0);
188 212959 }
189
190 233883734 ItemT *SliceUnlocked(Link *link) {
191 // Cannot delete the sentinel link
192
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 136213585 times.
 233883734 assert(link != head_);
193 233883734 link->prev_->next_ = link->next_;
194 233883734 link->next_->prev_ = link->prev_;
195 233883734 ItemT *item = link->item_;
196
2/2
✓ Branch 0 taken 135829553 times.
✓ Branch 1 taken 384032 times.
 233883734 delete link;
197 235596936 size_--;
198 235596936 int retval = pthread_cond_signal(&cond_capacious_);
199
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 136819878 times.
 235096320 assert(retval == 0);
200
2/2
✓ Branch 0 taken 49310005 times.
✓ Branch 1 taken 87509873 times.
 235096320 if (size_ == 0) {
201 95254385 retval = pthread_cond_broadcast(&cond_empty_);
202
2/2
✓ Branch 0 taken 433819 times.
✓ Branch 1 taken 48883554 times.
 95269121 assert(retval == 0);
203 }
204 234243418 return item;
205 }
206
207
208 /**
209 * Adding new item blocks as long as limit_ == size_
210 */
211 uint64_t limit_;
212 /**
213 * The current number of links in the list
214 */
215 uint64_t size_;
216 /**
217 * Sentinel element in front of the first (front) element
218 */
219 Link *head_;
220 /**
221 * Protects all internal state
222 */
223 pthread_mutex_t lock_;
224 /**
225 * Signals if there are items enqueued
226 */
227 pthread_cond_t cond_populated_;
228 /**
229 * Signals if there is space to enqueue more items
230 */
231 pthread_cond_t cond_capacious_;
232 /**
233 * Signals if the queue runs empty
234 */
235 pthread_cond_t cond_empty_;
236 };
237
238
239 /**
240 * A tube group manages a fixed set of Tubes and dispatches items among them in
241 * such a way that items with the same tag (a positive integer) are all sent
242 * to the same tube.
243 */
244 template<class ItemT>
245 class TubeGroup : SingleCopy {
246 public:
247 16792 TubeGroup() : is_active_(false) { atomic_init32(&round_robin_); }
248
249 16781 ~TubeGroup() {
250
2/2
✓ Branch 1 taken 100662 times.
✓ Branch 2 taken 9941 times.
 214487 for (unsigned i = 0; i < tubes_.size(); ++i)
251
1/2
✓ Branch 1 taken 100662 times.
✗ Branch 2 not taken.
 197706 delete tubes_[i];
252 16781 }
253
254 197851 void TakeTube(Tube<ItemT> *t) {
255
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 100735 times.
 197851 assert(!is_active_);
256 197851 tubes_.push_back(t);
257 197851 }
258
259 16792 void Activate() {
260
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 9947 times.
 16792 assert(!is_active_);
261
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 9947 times.
 16792 assert(!tubes_.empty());
262 16792 is_active_ = true;
263 16792 }
264
265 /**
266 * Like Tube::EnqueueBack(), but pick a tube according to ItemT::tag()
267 */
268 88237157 typename Tube<ItemT>::Link *Dispatch(ItemT *item) {
269
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 88237157 times.
 88237157 assert(is_active_);
270
2/2
✓ Branch 1 taken 69112400 times.
✓ Branch 2 taken 18983846 times.
 88237157 unsigned tube_idx = (tubes_.size() == 1) ? 0
271 69112400 : (item->tag() % tubes_.size());
272 87473964 return tubes_[tube_idx]->EnqueueBack(item);
273 }
274
275 /**
276 * Like Tube::EnqueueBack(), use tubes one after another
277 */
278 7252703 typename Tube<ItemT>::Link *DispatchAny(ItemT *item) {
279
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 7252703 times.
 7252703 assert(is_active_);
280
2/2
✓ Branch 1 taken 7252683 times.
✓ Branch 2 taken 20 times.
 7252703 unsigned tube_idx = (tubes_.size() == 1)
281 ? 0
282 7252683 : (atomic_xadd32(&round_robin_, 1) % tubes_.size());
283 7252703 return tubes_[tube_idx]->EnqueueBack(item);
284 }
285
286 private:
287 bool is_active_;
288 std::vector<Tube<ItemT> *> tubes_;
289 atomic_int32 round_robin_;
290 };
291
292 #endif // CVMFS_UTIL_TUBE_H_
293