GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-03-15 02:35:27
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 1146 BigQueue() {
22 1146 Alloc(kNumInit);
23 1146 size_ = 0;
24 1146 }
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 1 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 166 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 166 times.
 166 if (&other == this)
36 ✗ return *this;
37
38 166 Dealloc();
39 166 CopyFrom(other);
40 166 return *this;
41 }
42
43 1098 ~BigQueue() { Dealloc(); }
44
45 20082062 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 438 times.
✓ Branch 2 taken 20081624 times.
 20082062 if (GetAvailableSpace() == 0) {
47 438 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 438 times.
 438 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 80062 times.
✗ Branch 3 not taken.
 20082062 new (head_ + size_) Item(item);
51 20082062 size_++;
52 20082062 }
53
54 20001641 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 20001641 times.
 20001641 assert(!IsEmpty());
56 20001641 head_++;
57 20001641 size_--;
58
4/4
✓ Branch 0 taken 20001305 times.
✓ Branch 1 taken 336 times.
✓ Branch 2 taken 51 times.
✓ Branch 3 taken 20001254 times.
 20001641 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 51 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 20001641 }
61
62 20082508 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 506 times.
✓ Branch 2 taken 20082002 times.
 20082508 if (IsEmpty())
64 506 return false;
65 20082002 *item = head_;
66 20082002 return true;
67 }
68
69 40084149 bool IsEmpty() const { return size_ == 0; }
70
71 166 void Clear() {
72 166 Dealloc();
73 166 Alloc(kNumInit);
74 166 }
75
76 50387 size_t size() const { return size_; }
77 10 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 25164340 size_t GetHeadOffset() const { return head_ - buffer_; }
84 20082500 size_t GetAvailableSpace() const {
85 20082500 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 1968 void Alloc(const size_t num_elements) {
89 1968 size_t num_bytes = sizeof(Item) * num_elements;
90 1968 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 1968 capacity_ = num_elements;
92 1968 head_ = buffer_;
93 1968 }
94
95 1430 void Dealloc() {
96 1430 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1430 buffer_ = NULL;
98 1430 head_ = NULL;
99 1430 capacity_ = 0;
100 1430 size_ = 0;
101 1430 }
102
103 489 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 489 times.
 489 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 489 times.
 489 assert(new_capacity >= size_);
106
107 489 size_t head_offset = GetHeadOffset();
108 489 Item *old_buffer = buffer_;
109
110 489 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 56168203 times.
✓ Branch 1 taken 489 times.
 56168692 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 130650 times.
✗ Branch 3 not taken.
 56168203 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 489 FreeBuffer(old_buffer, head_offset + size_);
115 489 }
116
117 1919 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 81330137 times.
✓ Branch 1 taken 1919 times.
 81332056 for (size_t i = 0; i < nitems; ++i)
119 81330137 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 1919 times.
✗ Branch 1 not taken.
 1919 if (buf)
122 1919 smunmap(buf);
123 1919 }
124
125 167 void CopyFrom(const BigQueue<Item> &other) {
126 167 size_t min_items = kNumInit;
127 167 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 5079921 times.
✓ Branch 1 taken 167 times.
 5080088 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 79921 times.
✗ Branch 4 not taken.
 5079921 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 167 size_ = other.size_;
132 167 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141