GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-02-01 02:35:56
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 985 BigQueue() {
22 985 Alloc(kNumInit);
23 985 size_ = 0;
24 985 }
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 37 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 132 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 132 times.
 132 if (&other == this)
36 ✗ return *this;
37
38 132 Dealloc();
39 132 CopyFrom(other);
40 132 return *this;
41 }
42
43 980 ~BigQueue() { Dealloc(); }
44
45 740135614 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 2076 times.
✓ Branch 2 taken 740133538 times.
 740135614 if (GetAvailableSpace() == 0) {
47 2076 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2076 times.
 2076 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 61614 times.
✗ Branch 3 not taken.
 740135614 new (head_ + size_) Item(item);
51 740135614 size_++;
52 740135614 }
53
54 740055632 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 740055632 times.
 740055632 assert(!IsEmpty());
56 740055632 head_++;
57 740055632 size_--;
58
4/4
✓ Branch 0 taken 740048285 times.
✓ Branch 1 taken 7347 times.
✓ Branch 2 taken 1887 times.
✓ Branch 3 taken 740046398 times.
 740055632 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 1887 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 740055632 }
61
62 740118061 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 565 times.
✓ Branch 2 taken 740117496 times.
 740118061 if (IsEmpty())
64 565 return false;
65 740117496 *item = head_;
66 740117496 return true;
67 }
68
69 1480173693 bool IsEmpty() const { return size_ == 0; }
70
71 132 void Clear() {
72 132 Dealloc();
73 132 Alloc(kNumInit);
74 132 }
75
76 39629 size_t size() const { return size_; }
77 370 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 925204379 size_t GetHeadOffset() const { return head_ - buffer_; }
84 740137690 size_t GetAvailableSpace() const {
85 740137690 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 5249 void Alloc(const size_t num_elements) {
89 5249 size_t num_bytes = sizeof(Item) * num_elements;
90 5249 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 5249 capacity_ = num_elements;
92 5249 head_ = buffer_;
93 5249 }
94
95 1244 void Dealloc() {
96 1244 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1244 buffer_ = NULL;
98 1244 head_ = NULL;
99 1244 capacity_ = 0;
100 1244 size_ = 0;
101 1244 }
102
103 3963 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3963 times.
 3963 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3963 times.
 3963 assert(new_capacity >= size_);
106
107 3963 size_t head_offset = GetHeadOffset();
108 3963 Item *old_buffer = buffer_;
109
110 3963 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 2073489961 times.
✓ Branch 1 taken 3963 times.
 2073493924 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 100500 times.
✗ Branch 3 not taken.
 2073489961 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 3963 FreeBuffer(old_buffer, head_offset + size_);
115 3963 }
116
117 5207 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 2998687015 times.
✓ Branch 1 taken 5207 times.
 2998692222 for (size_t i = 0; i < nitems; ++i)
119 2998687015 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 5207 times.
✗ Branch 1 not taken.
 5207 if (buf)
122 5207 smunmap(buf);
123 5207 }
124
125 169 void CopyFrom(const BigQueue<Item> &other) {
126 169 size_t min_items = kNumInit;
127 169 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 185061482 times.
✓ Branch 1 taken 169 times.
 185061651 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 61482 times.
✗ Branch 4 not taken.
 185061482 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 169 size_ = other.size_;
132 169 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141