GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2025-11-30 02:35:17
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 627 BigQueue() {
22 627 Alloc(kNumInit);
23 627 size_ = 0;
24 627 }
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 46 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 44 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 44 times.
 44 if (&other == this)
36 ✗ return *this;
37
38 44 Dealloc();
39 44 CopyFrom(other);
40 44 return *this;
41 }
42
43 662 ~BigQueue() { Dealloc(); }
44
45 920114572 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 2318 times.
✓ Branch 2 taken 920112254 times.
 920114572 if (GetAvailableSpace() == 0) {
47 2318 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2318 times.
 2318 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 22572 times.
✗ Branch 3 not taken.
 920114572 new (head_ + size_) Item(item);
51 920114572 size_++;
52 920114572 }
53
54 920069033 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 920069033 times.
 920069033 assert(!IsEmpty());
56 920069033 head_++;
57 920069033 size_--;
58
4/4
✓ Branch 0 taken 920060030 times.
✓ Branch 1 taken 9003 times.
✓ Branch 2 taken 2346 times.
✓ Branch 3 taken 920057684 times.
 920069033 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 2346 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 920069033 }
61
62 920091941 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 259 times.
✓ Branch 2 taken 920091682 times.
 920091941 if (IsEmpty())
64 259 return false;
65 920091682 *item = head_;
66 920091682 return true;
67 }
68
69 1840160974 bool IsEmpty() const { return size_ == 0; }
70
71 44 void Clear() {
72 44 Dealloc();
73 44 Alloc(kNumInit);
74 44 }
75
76 15248 size_t size() const { return size_; }
77 460 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 1150144843 size_t GetHeadOffset() const { return head_ - buffer_; }
84 920116890 size_t GetAvailableSpace() const {
85 920116890 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 5425 void Alloc(const size_t num_elements) {
89 5425 size_t num_bytes = sizeof(Item) * num_elements;
90 5425 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 5425 capacity_ = num_elements;
92 5425 head_ = buffer_;
93 5425 }
94
95 750 void Dealloc() {
96 750 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 750 buffer_ = NULL;
98 750 head_ = NULL;
99 750 capacity_ = 0;
100 750 size_ = 0;
101 750 }
102
103 4664 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4664 times.
 4664 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4664 times.
 4664 assert(new_capacity >= size_);
106
107 4664 size_t head_offset = GetHeadOffset();
108 4664 Item *old_buffer = buffer_;
109
110 4664 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 2577764288 times.
✓ Branch 1 taken 4664 times.
 2577768952 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 36850 times.
✗ Branch 3 not taken.
 2577764288 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 4664 FreeBuffer(old_buffer, head_offset + size_);
115 4664 }
116
117 5414 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 3727901388 times.
✓ Branch 1 taken 5414 times.
 3727906802 for (size_t i = 0; i < nitems; ++i)
119 3727901388 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 5414 times.
✗ Branch 1 not taken.
 5414 if (buf)
122 5414 smunmap(buf);
123 5414 }
124
125 90 void CopyFrom(const BigQueue<Item> &other) {
126 90 size_t min_items = kNumInit;
127 90 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 230022539 times.
✓ Branch 1 taken 90 times.
 230022629 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 22539 times.
✗ Branch 4 not taken.
 230022539 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 90 size_ = other.size_;
132 90 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141