GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2025-12-14 02:35:46
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 1066 BigQueue() {
22 1066 Alloc(kNumInit);
23 1066 size_ = 0;
24 1066 }
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 31 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 56 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 56 times.
 56 if (&other == this)
36 ✗ return *this;
37
38 56 Dealloc();
39 56 CopyFrom(other);
40 56 return *this;
41 }
42
43 1050 ~BigQueue() { Dealloc(); }
44
45 620068338 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 1518 times.
✓ Branch 2 taken 620066820 times.
 620068338 if (GetAvailableSpace() == 0) {
47 1518 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1518 times.
 1518 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 6338 times.
✗ Branch 3 not taken.
 620068338 new (head_ + size_) Item(item);
51 620068338 size_++;
52 620068338 }
53
54 620046647 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 620046647 times.
 620046647 assert(!IsEmpty());
56 620046647 head_++;
57 620046647 size_--;
58
4/4
✓ Branch 0 taken 620040455 times.
✓ Branch 1 taken 6192 times.
✓ Branch 2 taken 1581 times.
✓ Branch 3 taken 620038874 times.
 620046647 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 1581 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 620046647 }
61
62 620053680 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 538 times.
✓ Branch 2 taken 620053142 times.
 620053680 if (IsEmpty())
64 538 return false;
65 620053142 *item = head_;
66 620053142 return true;
67 }
68
69 1240100327 bool IsEmpty() const { return size_ == 0; }
70
71 56 void Clear() {
72 56 Dealloc();
73 56 Alloc(kNumInit);
74 56 }
75
76 4853 size_t size() const { return size_; }
77 310 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 775080308 size_t GetHeadOffset() const { return head_ - buffer_; }
84 620069856 size_t GetAvailableSpace() const {
85 620069856 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 4308 void Alloc(const size_t num_elements) {
89 4308 size_t num_bytes = sizeof(Item) * num_elements;
90 4308 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 4308 capacity_ = num_elements;
92 4308 head_ = buffer_;
93 4308 }
94
95 1162 void Dealloc() {
96 1162 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1162 buffer_ = NULL;
98 1162 head_ = NULL;
99 1162 capacity_ = 0;
100 1162 size_ = 0;
101 1162 }
102
103 3099 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3099 times.
 3099 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3099 times.
 3099 assert(new_capacity >= size_);
106
107 3099 size_t head_offset = GetHeadOffset();
108 3099 Item *old_buffer = buffer_;
109
110 3099 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 1737174193 times.
✓ Branch 1 taken 3099 times.
 1737177292 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 10050 times.
✗ Branch 3 not taken.
 1737174193 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 3099 FreeBuffer(old_buffer, head_offset + size_);
115 3099 }
116
117 4261 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 2512248675 times.
✓ Branch 1 taken 4261 times.
 2512252936 for (size_t i = 0; i < nitems; ++i)
119 2512248675 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 4261 times.
✗ Branch 1 not taken.
 4261 if (buf)
122 4261 smunmap(buf);
123 4261 }
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 155006191 times.
✓ Branch 1 taken 87 times.
 155006278 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 6191 times.
✗ Branch 4 not taken.
 155006191 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