GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-03-01 02:36:14
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 787 BigQueue() {
22 787 Alloc(kNumInit);
23 787 size_ = 0;
24 787 }
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 43 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 93 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 93 times.
 93 if (&other == this)
36 ✗ return *this;
37
38 93 Dealloc();
39 93 CopyFrom(other);
40 93 return *this;
41 }
42
43 794 ~BigQueue() { Dealloc(); }
44
45 860125058 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 2254 times.
✓ Branch 2 taken 860122804 times.
 860125058 if (GetAvailableSpace() == 0) {
47 2254 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2254 times.
 2254 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 39058 times.
✗ Branch 3 not taken.
 860125058 new (head_ + size_) Item(item);
51 860125058 size_++;
52 860125058 }
53
54 860064610 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 860064610 times.
 860064610 assert(!IsEmpty());
56 860064610 head_++;
57 860064610 size_--;
58
4/4
✓ Branch 0 taken 860056115 times.
✓ Branch 1 taken 8495 times.
✓ Branch 2 taken 2193 times.
✓ Branch 3 taken 860053922 times.
 860064610 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 2193 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 860064610 }
61
62 860104353 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 499 times.
✓ Branch 2 taken 860103854 times.
 860104353 if (IsEmpty())
64 499 return false;
65 860103854 *item = head_;
66 860103854 return true;
67 }
68
69 1720168963 bool IsEmpty() const { return size_ == 0; }
70
71 93 void Clear() {
72 93 Dealloc();
73 93 Alloc(kNumInit);
74 93 }
75
76 25601 size_t size() const { return size_; }
77 430 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 1075171687 size_t GetHeadOffset() const { return head_ - buffer_; }
84 860127312 size_t GetAvailableSpace() const {
85 860127312 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 5463 void Alloc(const size_t num_elements) {
89 5463 size_t num_bytes = sizeof(Item) * num_elements;
90 5463 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 5463 capacity_ = num_elements;
92 5463 head_ = buffer_;
93 5463 }
94
95 980 void Dealloc() {
96 980 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 980 buffer_ = NULL;
98 980 head_ = NULL;
99 980 capacity_ = 0;
100 980 size_ = 0;
101 980 }
102
103 4447 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4447 times.
 4447 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4447 times.
 4447 assert(new_capacity >= size_);
106
107 4447 size_t head_offset = GetHeadOffset();
108 4447 Item *old_buffer = buffer_;
109
110 4447 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 2409678429 times.
✓ Branch 1 taken 4447 times.
 2409682876 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 63650 times.
✗ Branch 3 not taken.
 2409678429 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 4447 FreeBuffer(old_buffer, head_offset + size_);
115 4447 }
116
117 5427 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 3484842399 times.
✓ Branch 1 taken 5427 times.
 3484847826 for (size_t i = 0; i < nitems; ++i)
119 3484842399 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 5427 times.
✗ Branch 1 not taken.
 5427 if (buf)
122 5427 smunmap(buf);
123 5427 }
124
125 136 void CopyFrom(const BigQueue<Item> &other) {
126 136 size_t min_items = kNumInit;
127 136 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 215038948 times.
✓ Branch 1 taken 136 times.
 215039084 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 38948 times.
✗ Branch 4 not taken.
 215038948 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 136 size_ = other.size_;
132 136 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141