GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/bigvector.h
Date: 2026-08-09 02:40:25
Exec Total Coverage
Lines: 105 106 99.1%
Branches: 30 44 68.2%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 *
4 * Dynamic array, allocate with mmap for large arrays.
5 */
6
7 #ifndef CVMFS_BIGVECTOR_H_
8 #define CVMFS_BIGVECTOR_H_
9
10 #include <cassert>
11 #include <cstdlib>
12
13 #include "util/smalloc.h"
14
15 template<class Item>
16 class BigVector {
17 public:
18 7942 BigVector() {
19 7942 buffer_ = Alloc(kNumInit);
20 7942 size_ = 0;
21 7942 shared_buffer_ = false;
22 7942 }
23
24 9864836 explicit BigVector(const size_t num_items) {
25
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 9864836 times.
 9864836 assert(num_items > 0);
26 9864836 buffer_ = Alloc(num_items);
27 9864836 size_ = 0;
28 9864836 shared_buffer_ = false;
29 9864836 }
30
31 19504627 BigVector(const BigVector<Item> &other) { CopyFrom(other); }
32
33 94 BigVector<Item> &operator=(const BigVector<Item> &other) {
34
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 94 times.
 94 if (&other == this)
35 ✗ return *this;
36
37
1/2
✓ Branch 0 taken 94 times.
✗ Branch 1 not taken.
 94 if (!shared_buffer_)
38 94 Dealloc();
39 94 CopyFrom(other);
40 94 return *this;
41 }
42
43 58667467 ~BigVector() {
44
1/2
✓ Branch 0 taken 29334714 times.
✗ Branch 1 not taken.
 58667467 if (!shared_buffer_)
45 58669167 Dealloc();
46 58715595 }
47
48 480576020 Item At(const size_t index) const {
49
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 480444235 times.
 480576020 assert(index < size_);
50 480576020 return buffer_[index];
51 }
52
53 320067526 const Item *AtPtr(const size_t index) const {
54
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 320033763 times.
 320067526 assert(index < size_);
55 320067526 return &buffer_[index];
56 }
57
58 640366435 void PushBack(const Item &item) {
59
2/2
✓ Branch 0 taken 6450 times.
✓ Branch 1 taken 640315645 times.
 640366435 if (size_ == capacity_)
60 6714 DoubleCapacity();
61
1/2
✓ Branch 2 taken 116 times.
✗ Branch 3 not taken.
 640366435 new (buffer_ + size_) Item(item);
62 640366435 size_++;
63 640366435 }
64
65 60179 void Replace(size_t index, const Item &item) {
66
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 60179 times.
 60179 assert(index < size_);
67 60179 buffer_[index] = item;
68 60179 }
69
70 37 bool IsEmpty() const { return size_ == 0; }
71
72 179 void Clear() {
73 179 Dealloc();
74 179 buffer_ = Alloc(kNumInit);
75 179 }
76
77 16 void ShareBuffer(Item **duplicate, bool *large_alloc) {
78 16 *duplicate = buffer_;
79 16 *large_alloc = large_alloc_;
80 16 shared_buffer_ = true;
81 16 }
82
83 6714 void DoubleCapacity() {
84 6714 Item *old_buffer = buffer_;
85 6714 const bool old_large_alloc = large_alloc_;
86
87
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6450 times.
 6714 assert(capacity_ > 0);
88 6714 buffer_ = Alloc(capacity_ * 2);
89
2/2
✓ Branch 0 taken 1074052435 times.
✓ Branch 1 taken 6450 times.
 1074103501 for (size_t i = 0; i < size_; ++i)
90
0/2
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 1074096787 new (buffer_ + i) Item(old_buffer[i]);
91
92 6714 FreeBuffer(old_buffer, size_, old_large_alloc);
93 6714 }
94
95 44211 void ShrinkIfOversized() {
96
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 44211 times.
 44211 assert(!shared_buffer_);
97
98
2/2
✓ Branch 0 taken 927 times.
✓ Branch 1 taken 43284 times.
 44211 if (size_ <= kNumInit)
99 927 return;
100
2/2
✓ Branch 0 taken 43092 times.
✓ Branch 1 taken 192 times.
 43284 if (static_cast<float>(size_) >= (0.25 * static_cast<float>(capacity_)))
101 43092 return;
102
103 192 bool const old_large_alloc = large_alloc_;
104 192 Item *new_buffer = Alloc(0.5 * static_cast<float>(capacity_));
105
2/2
✓ Branch 0 taken 22544 times.
✓ Branch 1 taken 192 times.
 22736 for (size_t i = 0; i < size_; ++i)
106 22544 new (new_buffer + i) Item(buffer_[i]);
107 192 FreeBuffer(buffer_, size_, old_large_alloc);
108 192 buffer_ = new_buffer;
109 }
110
111 // Careful! Only for externally modified buffer.
112 44211 void SetSize(const size_t new_size) {
113
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 44211 times.
 44211 assert(new_size <= capacity_);
114 44211 size_ = new_size;
115 44211 }
116
117 39414621 size_t size() const { return size_; }
118 256 size_t capacity() const { return capacity_; }
119
120 private:
121 static const size_t kNumInit = 16;
122 static const size_t kMmapThreshold = 128 * 1024;
123
124 29376455 Item *Alloc(const size_t num_elements) {
125 Item *result;
126 29376455 const size_t num_bytes = sizeof(Item) * num_elements;
127
2/2
✓ Branch 0 taken 732 times.
✓ Branch 1 taken 29374468 times.
 29376455 if (num_bytes >= kMmapThreshold) {
128 776 result = static_cast<Item *>(smmap(num_bytes));
129 776 large_alloc_ = true;
130 } else {
131 29375679 result = static_cast<Item *>(smalloc(num_bytes));
132 29377122 large_alloc_ = false;
133 }
134 29377898 capacity_ = num_elements;
135 29377898 return result;
136 }
137
138 58667558 void Dealloc() {
139 58667558 FreeBuffer(buffer_, size_, large_alloc_);
140 58716518 buffer_ = NULL;
141 58716518 capacity_ = 0;
142 58716518 size_ = 0;
143 58716518 }
144
145 29343768 void FreeBuffer(Item *buf, const size_t size, const bool large) {
146
2/2
✓ Branch 0 taken 1554368808 times.
✓ Branch 1 taken 29340143 times.
 1583920352 for (size_t i = 0; i < size; ++i)
147 1554576584 buf[i].~Item();
148
149
1/2
✓ Branch 0 taken 29341587 times.
✗ Branch 1 not taken.
 29343768 if (buf) {
150
2/2
✓ Branch 0 taken 684 times.
✓ Branch 1 taken 29340903 times.
 29345212 if (large) {
151 728 smunmap(buf);
152 } else {
153 29344484 free(buf);
154 }
155 }
156 29343768 }
157
158 19504682 void CopyFrom(const BigVector<Item> &other) {
159 19504682 buffer_ = Alloc(other.capacity_);
160
2/2
✓ Branch 0 taken 320032097 times.
✓ Branch 1 taken 19505189 times.
 339537286 for (size_t i = 0; i < other.size_; ++i) {
161 320032097 new (buffer_ + i) Item(*other.AtPtr(i));
162 }
163 19505189 size_ = other.size_;
164 19505189 shared_buffer_ = false;
165 19505189 }
166
167 Item *buffer_;
168 size_t size_;
169 size_t capacity_;
170 bool large_alloc_;
171 bool shared_buffer_;
172 };
173
174 #endif // CVMFS_BIGVECTOR_H_
175