GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-02-08 02:36:20
Exec Total Coverage
Lines: 76 77 98.7%
Branches: 23 32 71.9%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 *
4 * Similar to bigvector, but queue semantics. Used by the negative entry
5 * tracker. Allocates with mmap in order to avoid memory fragmentation.
6 */
7
8 #ifndef CVMFS_BIGQUEUE_H_
9 #define CVMFS_BIGQUEUE_H_
10
11 #include <algorithm>
12 #include <cassert>
13 #include <cstdlib>
14 #include <new>
15
16 #include "util/smalloc.h"
17
18 template<class Item>
19 class BigQueue {
20 public:
21 1024 BigQueue() {
22 1024 Alloc(kNumInit);
23 1024 size_ = 0;
24 1024 }
25
26 explicit BigQueue(const size_t num_items) {
27 const size_t min_items = kNumInit;
28 Alloc(std::max(num_items, min_items));
29 size_ = 0;
30 }
31
32 1 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 190 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 190 times.
 190 if (&other == this)
36 ✗ return *this;
37
38 190 Dealloc();
39 190 CopyFrom(other);
40 190 return *this;
41 }
42
43 982 ~BigQueue() { Dealloc(); }
44
45 20102524 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 538 times.
✓ Branch 2 taken 20101986 times.
 20102524 if (GetAvailableSpace() == 0) {
47 538 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 538 times.
 538 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 100524 times.
✗ Branch 3 not taken.
 20102524 new (head_ + size_) Item(item);
51 20102524 size_++;
52 20102524 }
53
54 20001629 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 20001629 times.
 20001629 assert(!IsEmpty());
56 20001629 head_++;
57 20001629 size_--;
58
4/4
✓ Branch 0 taken 20001305 times.
✓ Branch 1 taken 324 times.
✓ Branch 2 taken 51 times.
✓ Branch 3 taken 20001254 times.
 20001629 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 51 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 20001629 }
61
62 20102966 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 488 times.
✓ Branch 2 taken 20102478 times.
 20102966 if (IsEmpty())
64 488 return false;
65 20102478 *item = head_;
66 20102478 return true;
67 }
68
69 40104595 bool IsEmpty() const { return size_ == 0; }
70
71 190 void Clear() {
72 190 Dealloc();
73 190 Alloc(kNumInit);
74 190 }
75
76 63197 size_t size() const { return size_; }
77 10 size_t capacity() const { return capacity_; }
78
79 private:
80 static const size_t kNumInit = 64;
81 static const size_t kCompactThreshold = 64;
82
83 25205408 size_t GetHeadOffset() const { return head_ - buffer_; }
84 20103062 size_t GetAvailableSpace() const {
85 20103062 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 1994 void Alloc(const size_t num_elements) {
89 1994 size_t num_bytes = sizeof(Item) * num_elements;
90 1994 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 1994 capacity_ = num_elements;
92 1994 head_ = buffer_;
93 1994 }
94
95 1362 void Dealloc() {
96 1362 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1362 buffer_ = NULL;
98 1362 head_ = NULL;
99 1362 capacity_ = 0;
100 1362 size_ = 0;
101 1362 }
102
103 589 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 589 times.
 589 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 589 times.
 589 assert(new_capacity >= size_);
106
107 589 size_t head_offset = GetHeadOffset();
108 589 Item *old_buffer = buffer_;
109
110 589 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 56201703 times.
✓ Branch 1 taken 589 times.
 56202292 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 164150 times.
✗ Branch 3 not taken.
 56201703 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 589 FreeBuffer(old_buffer, head_offset + size_);
115 589 }
116
117 1951 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 81404579 times.
✓ Branch 1 taken 1951 times.
 81406530 for (size_t i = 0; i < nitems; ++i)
119 81404579 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 1951 times.
✗ Branch 1 not taken.
 1951 if (buf)
122 1951 smunmap(buf);
123 1951 }
124
125 191 void CopyFrom(const BigQueue<Item> &other) {
126 191 size_t min_items = kNumInit;
127 191 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 5100395 times.
✓ Branch 1 taken 191 times.
 5100586 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 100395 times.
✗ Branch 4 not taken.
 5100395 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 191 size_ = other.size_;
132 191 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141