GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-07-05 02:36:18
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 1038 BigQueue() {
22 1038 Alloc(kNumInit);
23 1038 size_ = 0;
24 1038 }
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 26 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 177 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 177 times.
 177 if (&other == this)
36 ✗ return *this;
37
38 177 Dealloc();
39 177 CopyFrom(other);
40 177 return *this;
41 }
42
43 1028 ~BigQueue() { Dealloc(); }
44
45 520148400 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 1718 times.
✓ Branch 2 taken 520146682 times.
 520148400 if (GetAvailableSpace() == 0) {
47 1718 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1718 times.
 1718 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 96400 times.
✗ Branch 3 not taken.
 520148400 new (head_ + size_) Item(item);
51 520148400 size_++;
52 520148400 }
53
54 520039108 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 520039108 times.
 520039108 assert(!IsEmpty());
56 520039108 head_++;
57 520039108 size_--;
58
4/4
✓ Branch 0 taken 520033930 times.
✓ Branch 1 taken 5178 times.
✓ Branch 2 taken 1326 times.
✓ Branch 3 taken 520032604 times.
 520039108 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 1326 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 520039108 }
61
62 520136300 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 496 times.
✓ Branch 2 taken 520135804 times.
 520136300 if (IsEmpty())
64 496 return false;
65 520135804 *item = head_;
66 520135804 return true;
67 }
68
69 1040175408 bool IsEmpty() const { return size_ == 0; }
70
71 177 void Clear() {
72 177 Dealloc();
73 177 Alloc(kNumInit);
74 177 }
75
76 61162 size_t size() const { return size_; }
77 260 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 650250836 size_t GetHeadOffset() const { return head_ - buffer_; }
84 520150118 size_t GetAvailableSpace() const {
85 520150118 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 4462 void Alloc(const size_t num_elements) {
89 4462 size_t const num_bytes = sizeof(Item) * num_elements;
90 4462 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 4462 capacity_ = num_elements;
92 4462 head_ = buffer_;
93 4462 }
94
95 1382 void Dealloc() {
96 1382 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1382 buffer_ = NULL;
98 1382 head_ = NULL;
99 1382 capacity_ = 0;
100 1382 size_ = 0;
101 1382 }
102
103 3044 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3044 times.
 3044 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3044 times.
 3044 assert(new_capacity >= size_);
106
107 3044 size_t const head_offset = GetHeadOffset();
108 3044 Item *old_buffer = buffer_;
109
110 3044 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 1457133828 times.
✓ Branch 1 taken 3044 times.
 1457136872 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 157450 times.
✗ Branch 3 not taken.
 1457133828 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 3044 FreeBuffer(old_buffer, head_offset + size_);
115 3044 }
116
117 4426 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 2107378484 times.
✓ Branch 1 taken 4426 times.
 2107382910 for (size_t i = 0; i < nitems; ++i)
119 2107378484 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 4426 times.
✗ Branch 1 not taken.
 4426 if (buf)
122 4426 smunmap(buf);
123 4426 }
124
125 203 void CopyFrom(const BigQueue<Item> &other) {
126 203 size_t const min_items = kNumInit;
127 203 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 130096292 times.
✓ Branch 1 taken 203 times.
 130096495 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 96292 times.
✗ Branch 4 not taken.
 130096292 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 203 size_ = other.size_;
132 203 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141