GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2025-11-23 02:35:30
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 813 BigQueue() {
22 813 Alloc(kNumInit);
23 813 size_ = 0;
24 813 }
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 30 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 138 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 138 times.
 138 if (&other == this)
36 ✗ return *this;
37
38 138 Dealloc();
39 138 CopyFrom(other);
40 138 return *this;
41 }
42
43 840 ~BigQueue() { Dealloc(); }
44
45 600152170 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 1890 times.
✓ Branch 2 taken 600150280 times.
 600152170 if (GetAvailableSpace() == 0) {
47 1890 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1890 times.
 1890 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 92170 times.
✗ Branch 3 not taken.
 600152170 new (head_ + size_) Item(item);
51 600152170 size_++;
52 600152170 }
53
54 600045007 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 600045007 times.
 600045007 assert(!IsEmpty());
56 600045007 head_++;
57 600045007 size_--;
58
4/4
✓ Branch 0 taken 600039150 times.
✓ Branch 1 taken 5857 times.
✓ Branch 2 taken 1530 times.
✓ Branch 3 taken 600037620 times.
 600045007 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 1530 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 600045007 }
61
62 600137563 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 199 times.
✓ Branch 2 taken 600137364 times.
 600137563 if (IsEmpty())
64 199 return false;
65 600137364 *item = head_;
66 600137364 return true;
67 }
68
69 1200182570 bool IsEmpty() const { return size_ == 0; }
70
71 138 void Clear() {
72 138 Dealloc();
73 138 Alloc(kNumInit);
74 138 }
75
76 58488 size_t size() const { return size_; }
77 300 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 750250759 size_t GetHeadOffset() const { return head_ - buffer_; }
84 600154060 size_t GetAvailableSpace() const {
85 600154060 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 4539 void Alloc(const size_t num_elements) {
89 4539 size_t num_bytes = sizeof(Item) * num_elements;
90 4539 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 4539 capacity_ = num_elements;
92 4539 head_ = buffer_;
93 4539 }
94
95 1116 void Dealloc() {
96 1116 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1116 buffer_ = NULL;
98 1116 head_ = NULL;
99 1116 capacity_ = 0;
100 1116 size_ = 0;
101 1116 }
102
103 3420 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3420 times.
 3420 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3420 times.
 3420 assert(new_capacity >= size_);
106
107 3420 size_t head_offset = GetHeadOffset();
108 3420 Item *old_buffer = buffer_;
109
110 3420 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 1681277340 times.
✓ Branch 1 taken 3420 times.
 1681280760 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 150750 times.
✗ Branch 3 not taken.
 1681277340 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 3420 FreeBuffer(old_buffer, head_offset + size_);
115 3420 }
116
117 4536 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 2431521670 times.
✓ Branch 1 taken 4536 times.
 2431526206 for (size_t i = 0; i < nitems; ++i)
119 2431521670 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 4536 times.
✗ Branch 1 not taken.
 4536 if (buf)
122 4536 smunmap(buf);
123 4536 }
124
125 168 void CopyFrom(const BigQueue<Item> &other) {
126 168 size_t min_items = kNumInit;
127 168 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 150092163 times.
✓ Branch 1 taken 168 times.
 150092331 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 92163 times.
✗ Branch 4 not taken.
 150092163 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 168 size_ = other.size_;
132 168 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141