GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigqueue.h
Date: 2026-01-18 02:35:49
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 798 BigQueue() {
22 798 Alloc(kNumInit);
23 798 size_ = 0;
24 798 }
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 7 BigQueue(const BigQueue<Item> &other) { CopyFrom(other); }
33
34 112 BigQueue<Item> &operator=(const BigQueue<Item> &other) {
35
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 112 times.
 112 if (&other == this)
36 ✗ return *this;
37
38 112 Dealloc();
39 112 CopyFrom(other);
40 112 return *this;
41 }
42
43 798 ~BigQueue() { Dealloc(); }
44
45 140085714 void PushBack(const Item &item) {
46
2/2
✓ Branch 1 taken 686 times.
✓ Branch 2 taken 140085028 times.
 140085714 if (GetAvailableSpace() == 0) {
47 686 Migrate(1.9 * static_cast<float>(capacity_));
48
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 686 times.
 686 assert(GetAvailableSpace() > 0);
49 }
50
1/2
✓ Branch 2 taken 71714 times.
✗ Branch 3 not taken.
 140085714 new (head_ + size_) Item(item);
51 140085714 size_++;
52 140085714 }
53
54 140010527 void PopFront() {
55
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 140010527 times.
 140010527 assert(!IsEmpty());
56 140010527 head_++;
57 140010527 size_--;
58
4/4
✓ Branch 0 taken 140009135 times.
✓ Branch 1 taken 1392 times.
✓ Branch 2 taken 357 times.
✓ Branch 3 taken 140008778 times.
 140010527 if ((size_ > kCompactThreshold) && (size_ < (capacity_ / 2)))
59 357 Migrate(static_cast<int>(static_cast<float>(capacity_ * 0.6)));
60 140010527 }
61
62 140082576 bool Peek(Item **item) {
63
2/2
✓ Branch 1 taken 170 times.
✓ Branch 2 taken 140082406 times.
 140082576 if (IsEmpty())
64 170 return false;
65 140082406 *item = head_;
66 140082406 return true;
67 }
68
69 280093103 bool IsEmpty() const { return size_ == 0; }
70
71 112 void Clear() {
72 112 Dealloc();
73 112 Alloc(kNumInit);
74 112 }
75
76 45149 size_t size() const { return size_; }
77 70 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 175160152 size_t GetHeadOffset() const { return head_ - buffer_; }
84 140086400 size_t GetAvailableSpace() const {
85 140086400 return capacity_ - (size_ + GetHeadOffset());
86 }
87
88 2072 void Alloc(const size_t num_elements) {
89 2072 size_t num_bytes = sizeof(Item) * num_elements;
90 2072 buffer_ = static_cast<Item *>(smmap(num_bytes));
91 2072 capacity_ = num_elements;
92 2072 head_ = buffer_;
93 2072 }
94
95 1022 void Dealloc() {
96 1022 FreeBuffer(buffer_, GetHeadOffset() + size_);
97 1022 buffer_ = NULL;
98 1022 head_ = NULL;
99 1022 capacity_ = 0;
100 1022 size_ = 0;
101 1022 }
102
103 1043 void Migrate(size_t new_capacity) {
104
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1043 times.
 1043 assert(new_capacity > 0);
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1043 times.
 1043 assert(new_capacity >= size_);
106
107 1043 size_t head_offset = GetHeadOffset();
108 1043 Item *old_buffer = buffer_;
109
110 1043 Alloc(new_capacity);
111
2/2
✓ Branch 0 taken 392380121 times.
✓ Branch 1 taken 1043 times.
 392381164 for (size_t i = 0; i < size_; ++i)
112
1/2
✓ Branch 2 taken 117250 times.
✗ Branch 3 not taken.
 392380121 new (buffer_ + i) Item(old_buffer[head_offset + i]);
113
114 1043 FreeBuffer(old_buffer, head_offset + size_);
115 1043 }
116
117 2065 void FreeBuffer(Item *buf, const size_t nitems) {
118
2/2
✓ Branch 0 taken 567537515 times.
✓ Branch 1 taken 2065 times.
 567539580 for (size_t i = 0; i < nitems; ++i)
119 567537515 buf[i].~Item();
120
121
1/2
✓ Branch 0 taken 2065 times.
✗ Branch 1 not taken.
 2065 if (buf)
122 2065 smunmap(buf);
123 2065 }
124
125 119 void CopyFrom(const BigQueue<Item> &other) {
126 119 size_t min_items = kNumInit;
127 119 Alloc(std::max(other.size_, min_items));
128
2/2
✓ Branch 0 taken 35071687 times.
✓ Branch 1 taken 119 times.
 35071806 for (size_t i = 0; i < other.size_; ++i) {
129
1/2
✓ Branch 3 taken 71687 times.
✗ Branch 4 not taken.
 35071687 new (buffer_ + i) Item(*(other.buffer_ + other.GetHeadOffset() + i));
130 }
131 119 size_ = other.size_;
132 119 }
133
134 Item *buffer_;
135 Item *head_;
136 size_t size_;
137 size_t capacity_;
138 };
139
140 #endif // CVMFS_BIGQUEUE_H_
141