GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2025-10-19 02:35:28
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 1073 BigQueue() {
22 1073 Alloc(kNumInit);
23 1073 size_ = 0;
24 1073 }
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 121 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 121 times.
 121 if (&other == this)
36 ✗ return *this;
37
38 121 Dealloc();
39 121 CopyFrom(other);
40 121 return *this;
41 }
42
43 1106 ~BigQueue() { Dealloc(); }
44
45 680149928 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 2032 times.
✓ Branch 2 taken 680147896 times.
 680149928 if (GetAvailableSpace() == 0) {
47 2032 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2032 times.
 2032 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 81928 times.
✗ Branch 3 not taken.
 680149928 new (head_ + size_) Item(item);
51 680149928 size_++;
52 680149928 }
53
54 680051007 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 680051007 times.
 680051007 assert(!IsEmpty());
56 680051007 head_++;
57 680051007 size_--;
58
4/4
✓ Branch 0 taken 680044370 times.
✓ Branch 1 taken 6637 times.
✓ Branch 2 taken 1734 times.
✓ Branch 3 taken 680042636 times.
 680051007 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 1734 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 680051007 }
61
62 680133299 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 199 times.
✓ Branch 2 taken 680133100 times.
 680133299 if (IsEmpty())
64 199 return false;
65 680133100 *item = head_;
66 680133100 return true;
67 }
68
69 1360184306 bool IsEmpty() const { return size_ == 0; }
70
71 121 void Clear() {
72 121 Dealloc();
73 121 Alloc(kNumInit);
74 121 }
75
76 52154 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 850238995 size_t GetHeadOffset() const { return head_ - buffer_; }
84 680151960 size_t GetAvailableSpace() const {
85 680151960 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 5115 void Alloc(const size_t num_elements) {
89 5115 size_t num_bytes = sizeof(Item) * num_elements;
90 5115 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 5115 capacity_ = num_elements;
92 5115 head_ = buffer_;
93 5115 }
94
95 1348 void Dealloc() {
96 1348 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1348 buffer_ = NULL;
98 1348 head_ = NULL;
99 1348 capacity_ = 0;
100 1348 size_ = 0;
101 1348 }
102
103 3766 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3766 times.
 3766 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3766 times.
 3766 assert(new_capacity >= size_);
106
107 3766 size_t head_offset = GetHeadOffset();
108 3766 Item *old_buffer = buffer_;
109
110 3766 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 1905410802 times.
✓ Branch 1 taken 3766 times.
 1905414568 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 134000 times.
✗ Branch 3 not taken.
 1905410802 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 3766 FreeBuffer(old_buffer, head_offset + size_);
115 3766 }
116
117 5114 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 2755642650 times.
✓ Branch 1 taken 5114 times.
 2755647764 for (size_t i = 0; i < nitems; ++i)
119 2755642650 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 5114 times.
✗ Branch 1 not taken.
 5114 if (buf)
122 5114 smunmap(buf);
123 5114 }
124
125 155 void CopyFrom(const BigQueue<Item> &other) {
126 155 size_t min_items = kNumInit;
127 155 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 170081921 times.
✓ Branch 1 taken 155 times.
 170082076 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 81921 times.
✗ Branch 4 not taken.
 170081921 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 155 size_ = other.size_;
132 155 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141