GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-03-08 02:37:57
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 915 BigQueue() {
22 915 Alloc(kNumInit);
23 915 size_ = 0;
24 915 }
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 48 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 20 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20 times.
 20 if (&other == this)
36 ✗ return *this;
37
38 20 Dealloc();
39 20 CopyFrom(other);
40 20 return *this;
41 }
42
43 958 ~BigQueue() { Dealloc(); }
44
45 960106260 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 2354 times.
✓ Branch 2 taken 960103906 times.
 960106260 if (GetAvailableSpace() == 0) {
47 2354 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2354 times.
 2354 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 10260 times.
✗ Branch 3 not taken.
 960106260 new (head_ + size_) Item(item);
51 960106260 size_++;
52 960106260 }
53
54 960072015 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 960072015 times.
 960072015 assert(!IsEmpty());
56 960072015 head_++;
57 960072015 size_--;
58
4/4
✓ Branch 0 taken 960062640 times.
✓ Branch 1 taken 9375 times.
✓ Branch 2 taken 2448 times.
✓ Branch 3 taken 960060192 times.
 960072015 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 2448 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 960072015 }
61
62 960082509 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 199 times.
✓ Branch 2 taken 960082310 times.
 960082509 if (IsEmpty())
64 199 return false;
65 960082310 *item = head_;
66 960082310 return true;
67 }
68
69 1920154524 bool IsEmpty() const { return size_ == 0; }
70
71 20 void Clear() {
72 20 Dealloc();
73 20 Alloc(kNumInit);
74 20 }
75
76 7554 size_t size() const { return size_; }
77 480 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 1200124659 size_t GetHeadOffset() const { return head_ - buffer_; }
84 960108614 size_t GetAvailableSpace() const {
85 960108614 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 5805 void Alloc(const size_t num_elements) {
89 5805 size_t num_bytes = sizeof(Item) * num_elements;
90 5805 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 5805 capacity_ = num_elements;
92 5805 head_ = buffer_;
93 5805 }
94
95 998 void Dealloc() {
96 998 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 998 buffer_ = NULL;
98 998 head_ = NULL;
99 998 capacity_ = 0;
100 998 size_ = 0;
101 998 }
102
103 4802 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4802 times.
 4802 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4802 times.
 4802 assert(new_capacity >= size_);
106
107 4802 size_t head_offset = GetHeadOffset();
108 4802 Item *old_buffer = buffer_;
109
110 4802 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 2689819294 times.
✓ Branch 1 taken 4802 times.
 2689824096 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 16750 times.
✗ Branch 3 not taken.
 2689819294 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 4802 FreeBuffer(old_buffer, head_offset + size_);
115 4802 }
116
117 5800 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 3889935794 times.
✓ Branch 1 taken 5800 times.
 3889941594 for (size_t i = 0; i < nitems; ++i)
119 3889935794 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 5800 times.
✗ Branch 1 not taken.
 5800 if (buf)
122 5800 smunmap(buf);
123 5800 }
124
125 68 void CopyFrom(const BigQueue<Item> &other) {
126 68 size_t min_items = kNumInit;
127 68 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 240010245 times.
✓ Branch 1 taken 68 times.
 240010313 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 10245 times.
✗ Branch 4 not taken.
 240010245 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 68 size_ = other.size_;
132 68 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141