GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-03-22 02:40:38
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 823 BigQueue() {
22 823 Alloc(kNumInit);
23 823 size_ = 0;
24 823 }
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 133 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 133 times.
 133 if (&other == this)
36 ✗ return *this;
37
38 133 Dealloc();
39 133 CopyFrom(other);
40 133 return *this;
41 }
42
43 850 ~BigQueue() { Dealloc(); }
44
45 920169900 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 2588 times.
✓ Branch 2 taken 920167312 times.
 920169900 if (GetAvailableSpace() == 0) {
47 2588 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 2588 times.
 2588 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 77900 times.
✗ Branch 3 not taken.
 920169900 new (head_ + size_) Item(item);
51 920169900 size_++;
52 920169900 }
53
54 920069057 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 920069057 times.
 920069057 assert(!IsEmpty());
56 920069057 head_++;
57 920069057 size_--;
58
4/4
✓ Branch 0 taken 920060030 times.
✓ Branch 1 taken 9027 times.
✓ Branch 2 taken 2346 times.
✓ Branch 3 taken 920057684 times.
 920069057 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 2346 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 920069057 }
61
62 920147551 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 385 times.
✓ Branch 2 taken 920147166 times.
 920147551 if (IsEmpty())
64 385 return false;
65 920147166 *item = head_;
66 920147166 return true;
67 }
68
69 1840216608 bool IsEmpty() const { return size_ == 0; }
70
71 133 void Clear() {
72 133 Dealloc();
73 133 Alloc(kNumInit);
74 133 }
75
76 49964 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 1150256381 size_t GetHeadOffset() const { return head_ - buffer_; }
84 920172488 size_t GetAvailableSpace() const {
85 920172488 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 6069 void Alloc(const size_t num_elements) {
89 6069 size_t num_bytes = sizeof(Item) * num_elements;
90 6069 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 6069 capacity_ = num_elements;
92 6069 head_ = buffer_;
93 6069 }
94
95 1116 void Dealloc() {
96 1116 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1116 buffer_ = NULL;
98 1116 head_ = NULL;
99 1116 capacity_ = 0;
100 1116 size_ = 0;
101 1116 }
102
103 4934 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4934 times.
 4934 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4934 times.
 4934 assert(new_capacity >= size_);
106
107 4934 size_t head_offset = GetHeadOffset();
108 4934 Item *old_buffer = buffer_;
109
110 4934 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 2577854738 times.
✓ Branch 1 taken 4934 times.
 2577859672 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 127300 times.
✗ Branch 3 not taken.
 2577854738 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 4934 FreeBuffer(old_buffer, head_offset + size_);
115 4934 }
116
117 6050 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 3728102462 times.
✓ Branch 1 taken 6050 times.
 3728108512 for (size_t i = 0; i < nitems; ++i)
119 3728102462 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 6050 times.
✗ Branch 1 not taken.
 6050 if (buf)
122 6050 smunmap(buf);
123 6050 }
124
125 179 void CopyFrom(const BigQueue<Item> &other) {
126 179 size_t min_items = kNumInit;
127 179 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 230077843 times.
✓ Branch 1 taken 179 times.
 230078022 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 77843 times.
✗ Branch 4 not taken.
 230077843 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 179 size_ = other.size_;
132 179 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141