GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2025-11-16 02:35:16
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 968 BigQueue() {
22 968 Alloc(kNumInit);
23 968 size_ = 0;
24 968 }
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 39 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 48 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 48 times.
 48 if (&other == this)
36 ✗ return *this;
37
38 48 Dealloc();
39 48 CopyFrom(other);
40 48 return *this;
41 }
42
43 962 ~BigQueue() { Dealloc(); }
44
45 780080232 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 1882 times.
✓ Branch 2 taken 780078350 times.
 780080232 if (GetAvailableSpace() == 0) {
47 1882 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1882 times.
 1882 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 2232 times.
✗ Branch 3 not taken.
 780080232 new (head_ + size_) Item(item);
51 780080232 size_++;
52 780080232 }
53
54 780058639 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 780058639 times.
 780058639 assert(!IsEmpty());
56 780058639 head_++;
57 780058639 size_--;
58
4/4
✓ Branch 0 taken 780050895 times.
✓ Branch 1 taken 7744 times.
✓ Branch 2 taken 1989 times.
✓ Branch 3 taken 780048906 times.
 780058639 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 1989 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 780058639 }
61
62 780061544 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 532 times.
✓ Branch 2 taken 780061012 times.
 780061544 if (IsEmpty())
64 532 return false;
65 780061012 *item = head_;
66 780061012 return true;
67 }
68
69 1560120183 bool IsEmpty() const { return size_ == 0; }
70
71 48 void Clear() {
72 48 Dealloc();
73 48 Alloc(kNumInit);
74 48 }
75
76 2457 size_t size() const { return size_; }
77 390 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 975089136 size_t GetHeadOffset() const { return head_ - buffer_; }
84 780082114 size_t GetAvailableSpace() const {
85 780082114 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 4974 void Alloc(const size_t num_elements) {
89 4974 size_t num_bytes = sizeof(Item) * num_elements;
90 4974 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 4974 capacity_ = num_elements;
92 4974 head_ = buffer_;
93 4974 }
94
95 1058 void Dealloc() {
96 1058 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1058 buffer_ = NULL;
98 1058 head_ = NULL;
99 1058 capacity_ = 0;
100 1058 size_ = 0;
101 1058 }
102
103 3871 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3871 times.
 3871 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3871 times.
 3871 assert(new_capacity >= size_);
106
107 3871 size_t head_offset = GetHeadOffset();
108 3871 Item *old_buffer = buffer_;
109
110 3871 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 2185467917 times.
✓ Branch 1 taken 3871 times.
 2185471788 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 3350 times.
✗ Branch 3 not taken.
 2185467917 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 3871 FreeBuffer(old_buffer, head_offset + size_);
115 3871 }
116
117 4929 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 3160550197 times.
✓ Branch 1 taken 4929 times.
 3160555126 for (size_t i = 0; i < nitems; ++i)
119 3160550197 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 4929 times.
✗ Branch 1 not taken.
 4929 if (buf)
122 4929 smunmap(buf);
123 4929 }
124
125 87 void CopyFrom(const BigQueue<Item> &other) {
126 87 size_t min_items = kNumInit;
127 87 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 195002093 times.
✓ Branch 1 taken 87 times.
 195002180 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 2093 times.
✗ Branch 4 not taken.
 195002093 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 87 size_ = other.size_;
132 87 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141