GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-01-04 02:35:37
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 889 BigQueue() {
22 889 Alloc(kNumInit);
23 889 size_ = 0;
24 889 }
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 34 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 105 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 105 times.
 105 if (&other == this)
36 ✗ return *this;
37
38 105 Dealloc();
39 105 CopyFrom(other);
40 105 return *this;
41 }
42
43 878 ~BigQueue() { Dealloc(); }
44
45 680109140 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 1832 times.
✓ Branch 2 taken 680107308 times.
 680109140 if (GetAvailableSpace() == 0) {
47 1832 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1832 times.
 1832 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 41140 times.
✗ Branch 3 not taken.
 680109140 new (head_ + size_) Item(item);
51 680109140 size_++;
52 680109140 }
53
54 680051135 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 680051135 times.
 680051135 assert(!IsEmpty());
56 680051135 head_++;
57 680051135 size_--;
58
4/4
✓ Branch 0 taken 680044370 times.
✓ Branch 1 taken 6765 times.
✓ Branch 2 taken 1734 times.
✓ Branch 3 taken 680042636 times.
 680051135 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 1734 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 680051135 }
61
62 680093037 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 547 times.
✓ Branch 2 taken 680092490 times.
 680093037 if (IsEmpty())
64 547 return false;
65 680092490 *item = head_;
66 680092490 return true;
67 }
68
69 1360144172 bool IsEmpty() const { return size_ == 0; }
70
71 105 void Clear() {
72 105 Dealloc();
73 105 Alloc(kNumInit);
74 105 }
75
76 26732 size_t size() const { return size_; }
77 340 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 850156631 size_t GetHeadOffset() const { return head_ - buffer_; }
84 680110972 size_t GetAvailableSpace() const {
85 680110972 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 4699 void Alloc(const size_t num_elements) {
89 4699 size_t num_bytes = sizeof(Item) * num_elements;
90 4699 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 4699 capacity_ = num_elements;
92 4699 head_ = buffer_;
93 4699 }
94
95 1088 void Dealloc() {
96 1088 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1088 buffer_ = NULL;
98 1088 head_ = NULL;
99 1088 capacity_ = 0;
100 1088 size_ = 0;
101 1088 }
102
103 3566 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3566 times.
 3566 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3566 times.
 3566 assert(new_capacity >= size_);
106
107 3566 size_t head_offset = GetHeadOffset();
108 3566 Item *old_buffer = buffer_;
109
110 3566 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 1905343802 times.
✓ Branch 1 taken 3566 times.
 1905347368 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 67000 times.
✗ Branch 3 not taken.
 1905343802 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 3566 FreeBuffer(old_buffer, head_offset + size_);
115 3566 }
116
117 4654 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 2755493902 times.
✓ Branch 1 taken 4654 times.
 2755498556 for (size_t i = 0; i < nitems; ++i)
119 2755493902 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 4654 times.
✗ Branch 1 not taken.
 4654 if (buf)
122 4654 smunmap(buf);
123 4654 }
124
125 139 void CopyFrom(const BigQueue<Item> &other) {
126 139 size_t min_items = kNumInit;
127 139 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 170041005 times.
✓ Branch 1 taken 139 times.
 170041144 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 41005 times.
✗ Branch 4 not taken.
 170041005 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 139 size_ = other.size_;
132 139 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141