GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/file_chunk.cc
Date: 2025-10-05 02:35:40
Exec Total Coverage
Lines: 108 136 79.4%
Branches: 63 110 57.3%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5
6 #include "file_chunk.h"
7
8 #include <cassert>
9
10 #include "util/murmur.hxx"
11 #include "util/platform.h"
12
13 using namespace std; // NOLINT
14
15 ✗ static inline uint32_t hasher_uint64t(const uint64_t &value) {
16 ✗ return MurmurHash2(&value, sizeof(value), 0x07387a4f);
17 }
18
19
20 //------------------------------------------------------------------------------
21
22
23 70 unsigned FileChunkReflist::FindChunkIdx(const uint64_t off) {
24
2/4
✓ Branch 0 taken 70 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 70 times.
✗ Branch 4 not taken.
 70 assert(list && (list->size() > 0));
25 70 unsigned idx_low = 0;
26 70 unsigned idx_high = list->size() - 1;
27 70 unsigned chunk_idx = idx_high / 2;
28
2/2
✓ Branch 0 taken 119 times.
✓ Branch 1 taken 56 times.
 175 while (idx_low < idx_high) {
29
2/2
✓ Branch 2 taken 21 times.
✓ Branch 3 taken 98 times.
 119 if (static_cast<uint64_t>(list->AtPtr(chunk_idx)->offset()) > off) {
30
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 21 times.
 21 assert(idx_high > 0);
31 21 idx_high = chunk_idx - 1;
32 } else {
33 98 if ((chunk_idx == list->size() - 1)
34
5/6
✓ Branch 0 taken 98 times.
✗ Branch 1 not taken.
✓ Branch 4 taken 14 times.
✓ Branch 5 taken 84 times.
✓ Branch 6 taken 14 times.
✓ Branch 7 taken 84 times.
 98 || (static_cast<uint64_t>(list->AtPtr(chunk_idx + 1)->offset())
35 > off)) {
36 14 break;
37 }
38 84 idx_low = chunk_idx + 1;
39 }
40 105 chunk_idx = idx_low + (idx_high - idx_low) / 2;
41 }
42 70 return chunk_idx;
43 }
44
45
46 /**
47 * Returns a consistent hash over hashes of the chunks. Used by libcvmfs.
48 */
49 6 shash::Any FileChunkReflist::HashChunkList() {
50 6 const shash::Algorithms algo = list->AtPtr(0)->content_hash().algorithm;
51
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 shash::ContextPtr ctx(algo);
52 6 ctx.buffer = alloca(ctx.size);
53
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 shash::Init(ctx);
54
2/2
✓ Branch 1 taken 12 times.
✓ Branch 2 taken 6 times.
 18 for (unsigned i = 0; i < list->size(); ++i) {
55 12 shash::Update(
56
1/2
✓ Branch 3 taken 12 times.
✗ Branch 4 not taken.
 12 list->AtPtr(i)->content_hash().digest, shash::kDigestSizes[algo], ctx);
57 }
58
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 shash::Any result(algo);
59
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 shash::Final(ctx, &result);
60 12 return result;
61 }
62
63
64 //------------------------------------------------------------------------------
65
66
67 199 void ChunkTables::InitLocks() {
68 199 lock = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
69 199 const int retval = pthread_mutex_init(lock, NULL);
70
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 199 times.
 199 assert(retval == 0);
71
72
2/2
✓ Branch 0 taken 25472 times.
✓ Branch 1 taken 199 times.
 25671 for (unsigned i = 0; i < kNumHandleLocks; ++i) {
73 pthread_mutex_t *m = reinterpret_cast<pthread_mutex_t *>(
74 25472 smalloc(sizeof(pthread_mutex_t)));
75 25472 const int retval = pthread_mutex_init(m, NULL);
76
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 25472 times.
 25472 assert(retval == 0);
77
1/2
✓ Branch 1 taken 25472 times.
✗ Branch 2 not taken.
 25472 handle_locks.PushBack(m);
78 }
79 199 }
80
81
82 199 void ChunkTables::InitHashmaps() {
83 199 handle2uniqino.Init(16, 0, hasher_uint64t);
84 199 handle2fd.Init(16, 0, hasher_uint64t);
85 199 inode2chunks.Init(16, 0, hasher_uint64t);
86 199 inode2references.Init(16, 0, hasher_uint64t);
87 199 }
88
89
90
4/8
✓ Branch 2 taken 199 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 199 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 199 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 199 times.
✗ Branch 12 not taken.
 199 ChunkTables::ChunkTables() {
91 199 next_handle = 2;
92 199 version = kVersion;
93
1/2
✓ Branch 1 taken 199 times.
✗ Branch 2 not taken.
 199 InitLocks();
94
1/2
✓ Branch 1 taken 199 times.
✗ Branch 2 not taken.
 199 InitHashmaps();
95 199 }
96
97
98 199 ChunkTables::~ChunkTables() {
99 199 pthread_mutex_destroy(lock);
100 199 free(lock);
101
2/2
✓ Branch 0 taken 25472 times.
✓ Branch 1 taken 199 times.
 25671 for (unsigned i = 0; i < kNumHandleLocks; ++i) {
102 25472 pthread_mutex_destroy(handle_locks.At(i));
103 25472 free(handle_locks.At(i));
104 }
105 199 }
106
107
108 ✗ ChunkTables::ChunkTables(const ChunkTables &other) {
109 ✗ version = kVersion;
110 ✗ InitLocks();
111 ✗ InitHashmaps();
112 ✗ CopyFrom(other);
113 }
114
115
116 ✗ ChunkTables &ChunkTables::operator=(const ChunkTables &other) {
117 ✗ if (&other == this)
118 ✗ return *this;
119
120 ✗ handle2uniqino.Clear();
121 ✗ handle2fd.Clear();
122 ✗ inode2chunks.Clear();
123 ✗ inode2references.Clear();
124 ✗ CopyFrom(other);
125 ✗ return *this;
126 }
127
128
129 ✗ void ChunkTables::CopyFrom(const ChunkTables &other) {
130 ✗ assert(version == other.version);
131 ✗ next_handle = other.next_handle;
132 ✗ inode2references = other.inode2references;
133 ✗ inode2chunks = other.inode2chunks;
134 ✗ handle2fd = other.handle2fd;
135 ✗ handle2uniqino = other.handle2uniqino;
136 }
137
138
139 ✗ pthread_mutex_t *ChunkTables::Handle2Lock(const uint64_t handle) const {
140 ✗ const uint32_t hash = hasher_uint64t(handle);
141 ✗ const double bucket = static_cast<double>(hash)
142 ✗ * static_cast<double>(kNumHandleLocks)
143 / static_cast<double>((uint32_t)(-1));
144 ✗ return handle_locks.At((uint32_t)bucket % kNumHandleLocks);
145 }
146
147
148 //------------------------------------------------------------------------------
149
150
151 83 SimpleChunkTables::SimpleChunkTables() {
152 83 lock_ = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
153 83 const int retval = pthread_mutex_init(lock_, NULL);
154
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 83 times.
 83 assert(retval == 0);
155 83 }
156
157
158 81 SimpleChunkTables::~SimpleChunkTables() {
159
2/2
✓ Branch 1 taken 6 times.
✓ Branch 2 taken 81 times.
 87 for (unsigned i = 0; i < fd_table_.size(); ++i) {
160
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 delete fd_table_[i].chunk_reflist.list;
161 }
162 81 pthread_mutex_destroy(lock_);
163 81 free(lock_);
164 81 }
165
166
167 48 int SimpleChunkTables::Add(FileChunkReflist chunks) {
168
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 48 times.
 48 assert(chunks.list != NULL);
169
1/2
✓ Branch 1 taken 48 times.
✗ Branch 2 not taken.
 48 OpenChunks new_entry;
170
1/2
✓ Branch 1 taken 48 times.
✗ Branch 2 not taken.
 48 new_entry.chunk_reflist = chunks;
171
1/2
✓ Branch 1 taken 48 times.
✗ Branch 2 not taken.
 48 new_entry.chunk_fd = new ChunkFd();
172 48 unsigned i = 0;
173 48 Lock();
174
2/2
✓ Branch 1 taken 90 times.
✓ Branch 2 taken 42 times.
 132 for (; i < fd_table_.size(); ++i) {
175
2/2
✓ Branch 1 taken 6 times.
✓ Branch 2 taken 84 times.
 90 if (fd_table_[i].chunk_reflist.list == NULL) {
176
1/2
✓ Branch 2 taken 6 times.
✗ Branch 3 not taken.
 6 fd_table_[i] = new_entry;
177 6 Unlock();
178 6 return i;
179 }
180 }
181
1/2
✓ Branch 1 taken 42 times.
✗ Branch 2 not taken.
 42 fd_table_.push_back(new_entry);
182 42 Unlock();
183 42 return i;
184 48 }
185
186
187 18 SimpleChunkTables::OpenChunks SimpleChunkTables::Get(int fd) {
188 18 OpenChunks result;
189
2/2
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 12 times.
 18 if (fd < 0)
190 6 return result;
191
192 12 const unsigned idx = static_cast<unsigned>(fd);
193 12 Lock();
194
2/2
✓ Branch 1 taken 6 times.
✓ Branch 2 taken 6 times.
 12 if (idx < fd_table_.size())
195
1/2
✓ Branch 2 taken 6 times.
✗ Branch 3 not taken.
 6 result = fd_table_[idx];
196 12 Unlock();
197 12 return result;
198 }
199
200
201 54 void SimpleChunkTables::Release(int fd) {
202
2/2
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 48 times.
 54 if (fd < 0)
203 6 return;
204
205 48 Lock();
206 48 const unsigned idx = static_cast<unsigned>(fd);
207
2/2
✓ Branch 1 taken 6 times.
✓ Branch 2 taken 42 times.
 48 if (idx >= fd_table_.size()) {
208 6 Unlock();
209 6 return;
210 }
211
212
1/2
✓ Branch 1 taken 42 times.
✗ Branch 2 not taken.
 42 delete fd_table_[idx].chunk_reflist.list;
213 42 fd_table_[idx].chunk_reflist.list = NULL;
214 42 fd_table_[idx].chunk_reflist.path.Assign("", 0);
215
1/2
✓ Branch 1 taken 42 times.
✗ Branch 2 not taken.
 42 delete fd_table_[idx].chunk_fd;
216 42 fd_table_[idx].chunk_fd = NULL;
217
6/6
✓ Branch 1 taken 72 times.
✓ Branch 2 taken 6 times.
✓ Branch 4 taken 36 times.
✓ Branch 5 taken 36 times.
✓ Branch 6 taken 36 times.
✓ Branch 7 taken 42 times.
 78 while (!fd_table_.empty() && (fd_table_.back().chunk_reflist.list == NULL)) {
218 36 fd_table_.pop_back();
219 }
220 42 Unlock();
221 }
222