GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/util/tube.h
Date: 2025-06-22 02:36:02
Exec Total Coverage
Lines: 130 130 100.0%
Branches: 49 74 66.2%
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 <vector>
13
14 #include "util/atomic.h"
15 #include "util/concurrency.h"
16 #include "util/pointer.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 30675775 explicit Link(ItemT *item) : item_(item), next_(NULL), prev_(NULL) { }
46 1 ItemT *item() { return item_; }
47
48 private:
49 ItemT *item_;
50 Link *next_;
51 Link *prev_;
52 };
53
54 172496 Tube() : limit_(uint64_t(-1)), size_(0) { Init(); }
55 1702 explicit Tube(uint64_t limit) : limit_(limit), size_(0) { Init(); }
56 178331 ~Tube() {
57 178477 Link *cursor = head_;
58 do {
59 178526 Link *prev = cursor->prev_;
60
1/2
✓ Branch 0 taken 91245 times.
✗ Branch 1 not taken.
 178526 delete cursor;
61 178526 cursor = prev;
62
2/2
✓ Branch 0 taken 49 times.
✓ Branch 1 taken 91196 times.
 178526 } while (cursor != head_);
63 178477 pthread_cond_destroy(&cond_populated_);
64 178477 pthread_cond_destroy(&cond_capacious_);
65 178477 pthread_cond_destroy(&cond_empty_);
66 178477 pthread_mutex_destroy(&lock_);
67 178477 }
68
69 /**
70 * Push an item to the back of the queue. Block if queue is currently full.
71 */
72 10811594 Link *EnqueueBack(ItemT *item) {
73
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5985628 times.
 10811594 assert(item != NULL);
74 10811594 MutexLockGuard lock_guard(&lock_);
75
2/2
✓ Branch 0 taken 180952 times.
✓ Branch 1 taken 5995265 times.
 11192608 while (size_ == limit_)
76
1/2
✓ Branch 1 taken 181488 times.
✗ Branch 2 not taken.
 361904 pthread_cond_wait(&cond_capacious_, &lock_);
77
78
1/2
✓ Branch 1 taken 5997990 times.
✗ Branch 2 not taken.
 10830704 Link *link = new Link(item);
79 10746424 link->next_ = head_->next_;
80 10746424 link->prev_ = head_;
81 10746424 head_->next_->prev_ = link;
82 10746424 head_->next_ = link;
83 10746424 size_++;
84 10746424 int retval = pthread_cond_signal(&cond_populated_);
85
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6002553 times.
 10845280 assert(retval == 0);
86 10808940 return link;
87 10845280 }
88
89 /**
90 * Push an item to the front of the queue. Block if queue currently full.
91 */
92 19704424 Link *EnqueueFront(ItemT *item) {
93
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 19703348 times.
 19704424 assert(item != NULL);
94 19704424 MutexLockGuard lock_guard(&lock_);
95
2/2
✓ Branch 0 taken 30 times.
✓ Branch 1 taken 19703299 times.
 19704435 while (size_ == limit_)
96
1/2
✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
 60 pthread_cond_wait(&cond_capacious_, &lock_);
97
98
1/2
✓ Branch 1 taken 19703250 times.
✗ Branch 2 not taken.
 19704375 Link *link = new Link(item);
99 19704277 link->next_ = head_;
100 19704277 link->prev_ = head_->prev_;
101 19704277 head_->prev_->next_ = link;
102 19704277 head_->prev_ = link;
103 19704277 size_++;
104 19704277 int retval = pthread_cond_signal(&cond_populated_);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 19703103 times.
 19704179 assert(retval == 0);
106 19704081 return link;
107 19704179 }
108
109 /**
110 * Remove any link from the queue and return its item, including first/last
111 * element.
112 */
113 42 ItemT *Slice(Link *link) {
114 42 MutexLockGuard lock_guard(&lock_);
115 42 return SliceUnlocked(link);
116 42 }
117
118 /**
119 * Remove and return the first element from the queue. Block if tube is
120 * empty.
121 */
122 28824911 ItemT *PopFront() {
123 28824911 MutexLockGuard lock_guard(&lock_);
124
2/2
✓ Branch 0 taken 2054317 times.
✓ Branch 1 taken 24041158 times.
 32948497 while (size_ == 0)
125
1/2
✓ Branch 1 taken 2069999 times.
✗ Branch 2 not taken.
 4063805 pthread_cond_wait(&cond_populated_, &lock_);
126 57676740 return SliceUnlocked(head_->prev_);
127 28787674 }
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 19692292 ItemT *TryPopFront() {
137 19692292 MutexLockGuard lock_guard(&lock_);
138 // Note that we don't need to wait for a signal to arrive
139
2/2
✓ Branch 0 taken 18037801 times.
✓ Branch 1 taken 1663850 times.
 19701651 if (size_ == 0)
140 18037801 return NULL;
141 1663850 return SliceUnlocked(head_->prev_);
142 19701651 }
143
144 /**
145 * Remove and return the last element from the queue. Block if tube is
146 * empty.
147 */
148 2685 ItemT *PopBack() {
149 2685 MutexLockGuard lock_guard(&lock_);
150
2/2
✓ Branch 0 taken 180 times.
✓ Branch 1 taken 1609 times.
 3045 while (size_ == 0)
151
1/2
✓ Branch 1 taken 180 times.
✗ Branch 2 not taken.
 360 pthread_cond_wait(&cond_populated_, &lock_);
152 5370 return SliceUnlocked(head_->next_);
153 2685 }
154
155 /**
156 * Blocks until the tube is empty
157 */
158 1913 void Wait() {
159 1913 MutexLockGuard lock_guard(&lock_);
160
2/2
✓ Branch 0 taken 75 times.
✓ Branch 1 taken 1913 times.
 1988 while (size_ > 0)
161
1/2
✓ Branch 1 taken 75 times.
✗ Branch 2 not taken.
 75 pthread_cond_wait(&cond_empty_, &lock_);
162 1913 }
163
164 9424 bool IsEmpty() {
165 9424 MutexLockGuard lock_guard(&lock_);
166 18848 return size_ == 0;
167 9424 }
168
169 297 uint64_t size() {
170 297 MutexLockGuard lock_guard(&lock_);
171 594 return size_;
172 297 }
173
174 private:
175 175316 void Init() {
176 175316 Link *sentinel = new Link(NULL);
177 175316 head_ = sentinel;
178 175316 head_->next_ = head_->prev_ = sentinel;
179
180 175316 int retval = pthread_mutex_init(&lock_, NULL);
181
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 91272 times.
 175316 assert(retval == 0);
182 175316 retval = pthread_cond_init(&cond_populated_, NULL);
183
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 91272 times.
 175316 assert(retval == 0);
184 175316 retval = pthread_cond_init(&cond_capacious_, NULL);
185
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 91272 times.
 175316 assert(retval == 0);
186 175316 retval = pthread_cond_init(&cond_empty_, NULL);
187
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 91272 times.
 175316 assert(retval == 0);
188 175316 }
189
190 30491783 ItemT *SliceUnlocked(Link *link) {
191 // Cannot delete the sentinel link
192
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25676378 times.
 30491783 assert(link != head_);
193 30491783 link->prev_->next_ = link->next_;
194 30491783 link->next_->prev_ = link->prev_;
195 30491783 ItemT *item = link->item_;
196
2/2
✓ Branch 0 taken 25662519 times.
✓ Branch 1 taken 13859 times.
 30491783 delete link;
197 30549743 size_--;
198 30549743 int retval = pthread_cond_signal(&cond_capacious_);
199
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25670346 times.
 30479733 assert(retval == 0);
200
2/2
✓ Branch 0 taken 3637654 times.
✓ Branch 1 taken 22032692 times.
 30479733 if (size_ == 0) {
201 5547837 retval = pthread_cond_broadcast(&cond_empty_);
202
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3640340 times.
 5548097 assert(retval == 0);
203 }
204 30485153 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 14121 TubeGroup() : is_active_(false) { atomic_init32(&round_robin_); }
248
249 14110 ~TubeGroup() {
250
2/2
✓ Branch 1 taken 83465 times.
✓ Branch 2 taken 8413 times.
 177579 for (unsigned i = 0; i < tubes_.size(); ++i)
251
1/2
✓ Branch 1 taken 83465 times.
✗ Branch 2 not taken.
 163469 delete tubes_[i];
252 14110 }
253
254 163614 void TakeTube(Tube<ItemT> *t) {
255
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 83538 times.
 163614 assert(!is_active_);
256 163614 tubes_.push_back(t);
257 163614 }
258
259 14121 void Activate() {
260
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 8419 times.
 14121 assert(!is_active_);
261
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 8419 times.
 14121 assert(!tubes_.empty());
262 14121 is_active_ = true;
263 14121 }
264
265 /**
266 * Like Tube::EnqueueBack(), but pick a tube according to ItemT::tag()
267 */
268 3826279 typename Tube<ItemT>::Link *Dispatch(ItemT *item) {
269
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3826279 times.
 3826279 assert(is_active_);
270
2/2
✓ Branch 1 taken 2439894 times.
✓ Branch 2 taken 1380509 times.
 3826279 unsigned tube_idx = (tubes_.size() == 1) ? 0
271 2439894 : (item->tag() % tubes_.size());
272 3802232 return tubes_[tube_idx]->EnqueueBack(item);
273 }
274
275 /**
276 * Like Tube::EnqueueBack(), use tubes one after another
277 */
278 251891 typename Tube<ItemT>::Link *DispatchAny(ItemT *item) {
279
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 251891 times.
 251891 assert(is_active_);
280
2/2
✓ Branch 1 taken 251863 times.
✓ Branch 2 taken 28 times.
 251891 unsigned tube_idx = (tubes_.size() == 1)
281 ? 0
282 251863 : (atomic_xadd32(&round_robin_, 1) % tubes_.size());
283 251891 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