GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2025-10-05 02:35:40
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 513 BigQueue() {
22 513 Alloc(kNumInit);
23 513 size_ = 0;
24 513 }
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 49 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 46 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 46 times.
 46 if (&other == this)
36 ✗ return *this;
37
38 46 Dealloc();
39 46 CopyFrom(other);
40 46 return *this;
41 }
42
43 549 ~BigQueue() { Dealloc(); }
44
45 980120580 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 2462 times.
✓ Branch 2 taken 980118118 times.
 980120580 if (GetAvailableSpace() == 0) {
47 2462 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2462 times.
 2462 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 22580 times.
✗ Branch 3 not taken.
 980120580 new (head_ + size_) Item(item);
51 980120580 size_++;
52 980120580 }
53
54 980073539 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 980073539 times.
 980073539 assert(!IsEmpty());
56 980073539 head_++;
57 980073539 size_--;
58
4/4
✓ Branch 0 taken 980063945 times.
✓ Branch 1 taken 9594 times.
✓ Branch 2 taken 2499 times.
✓ Branch 3 taken 980061446 times.
 980073539 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 2499 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 980073539 }
61
62 980096488 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 286 times.
✓ Branch 2 taken 980096202 times.
 980096488 if (IsEmpty())
64 286 return false;
65 980096202 *item = head_;
66 980096202 return true;
67 }
68
69 1960170027 bool IsEmpty() const { return size_ == 0; }
70
71 46 void Clear() {
72 46 Dealloc();
73 46 Alloc(kNumInit);
74 46 }
75
76 15329 size_t size() const { return size_; }
77 490 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 1225151185 size_t GetHeadOffset() const { return head_ - buffer_; }
84 980123042 size_t GetAvailableSpace() const {
85 980123042 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 5615 void Alloc(const size_t num_elements) {
89 5615 size_t num_bytes = sizeof(Item) * num_elements;
90 5615 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 5615 capacity_ = num_elements;
92 5615 head_ = buffer_;
93 5615 }
94
95 641 void Dealloc() {
96 641 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 641 buffer_ = NULL;
98 641 head_ = NULL;
99 641 capacity_ = 0;
100 641 size_ = 0;
101 641 }
102
103 4961 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4961 times.
 4961 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4961 times.
 4961 assert(new_capacity >= size_);
106
107 4961 size_t head_offset = GetHeadOffset();
108 4961 Item *old_buffer = buffer_;
109
110 4961 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 2745876947 times.
✓ Branch 1 taken 4961 times.
 2745881908 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 36850 times.
✗ Branch 3 not taken.
 2745876947 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 4961 FreeBuffer(old_buffer, head_offset + size_);
115 4961 }
116
117 5602 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 3971020055 times.
✓ Branch 1 taken 5602 times.
 3971025657 for (size_t i = 0; i < nitems; ++i)
119 3971020055 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 5602 times.
✗ Branch 1 not taken.
 5602 if (buf)
122 5602 smunmap(buf);
123 5602 }
124
125 95 void CopyFrom(const BigQueue<Item> &other) {
126 95 size_t min_items = kNumInit;
127 95 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 245022541 times.
✓ Branch 1 taken 95 times.
 245022636 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 22541 times.
✗ Branch 4 not taken.
 245022541 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 95 size_ = other.size_;
132 95 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141