GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/file_chunk.cc
Date: 2025-11-02 02:35:35
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 330 unsigned FileChunkReflist::FindChunkIdx(const uint64_t off) {
24
2/4
✓ Branch 0 taken 330 times.
✗ Branch 1 not taken.
✓ Branch 3 taken 330 times.
✗ Branch 4 not taken.
 330 assert(list && (list->size() > 0));
25 330 unsigned idx_low = 0;
26 330 unsigned idx_high = list->size() - 1;
27 330 unsigned chunk_idx = idx_high / 2;
28
2/2
✓ Branch 0 taken 561 times.
✓ Branch 1 taken 264 times.
 825 while (idx_low < idx_high) {
29
2/2
✓ Branch 2 taken 99 times.
✓ Branch 3 taken 462 times.
 561 if (static_cast<uint64_t>(list->AtPtr(chunk_idx)->offset()) > off) {
30
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 99 times.
 99 assert(idx_high > 0);
31 99 idx_high = chunk_idx - 1;
32 } else {
33 462 if ((chunk_idx == list->size() - 1)
34
5/6
✓ Branch 0 taken 462 times.
✗ Branch 1 not taken.
✓ Branch 4 taken 66 times.
✓ Branch 5 taken 396 times.
✓ Branch 6 taken 66 times.
✓ Branch 7 taken 396 times.
 462 || (static_cast<uint64_t>(list->AtPtr(chunk_idx + 1)->offset())
35 > off)) {
36 66 break;
37 }
38 396 idx_low = chunk_idx + 1;
39 }
40 495 chunk_idx = idx_low + (idx_high - idx_low) / 2;
41 }
42 330 return chunk_idx;
43 }
44
45
46 /**
47 * Returns a consistent hash over hashes of the chunks. Used by libcvmfs.
48 */
49 34 shash::Any FileChunkReflist::HashChunkList() {
50 34 const shash::Algorithms algo = list->AtPtr(0)->content_hash().algorithm;
51
1/2
✓ Branch 1 taken 34 times.
✗ Branch 2 not taken.
 34 shash::ContextPtr ctx(algo);
52 34 ctx.buffer = alloca(ctx.size);
53
1/2
✓ Branch 1 taken 34 times.
✗ Branch 2 not taken.
 34 shash::Init(ctx);
54
2/2
✓ Branch 1 taken 68 times.
✓ Branch 2 taken 34 times.
 102 for (unsigned i = 0; i < list->size(); ++i) {
55 68 shash::Update(
56
1/2
✓ Branch 3 taken 68 times.
✗ Branch 4 not taken.
 68 list->AtPtr(i)->content_hash().digest, shash::kDigestSizes[algo], ctx);
57 }
58
1/2
✓ Branch 1 taken 34 times.
✗ Branch 2 not taken.
 34 shash::Any result(algo);
59
1/2
✓ Branch 1 taken 34 times.
✗ Branch 2 not taken.
 34 shash::Final(ctx, &result);
60 68 return result;
61 }
62
63
64 //------------------------------------------------------------------------------
65
66
67 506 void ChunkTables::InitLocks() {
68 506 lock = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
69 506 const int retval = pthread_mutex_init(lock, NULL);
70
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 506 times.
 506 assert(retval == 0);
71
72
2/2
✓ Branch 0 taken 64768 times.
✓ Branch 1 taken 506 times.
 65274 for (unsigned i = 0; i < kNumHandleLocks; ++i) {
73 pthread_mutex_t *m = reinterpret_cast<pthread_mutex_t *>(
74 64768 smalloc(sizeof(pthread_mutex_t)));
75 64768 const int retval = pthread_mutex_init(m, NULL);
76
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 64768 times.
 64768 assert(retval == 0);
77
1/2
✓ Branch 1 taken 64768 times.
✗ Branch 2 not taken.
 64768 handle_locks.PushBack(m);
78 }
79 506 }
80
81
82 506 void ChunkTables::InitHashmaps() {
83 506 handle2uniqino.Init(16, 0, hasher_uint64t);
84 506 handle2fd.Init(16, 0, hasher_uint64t);
85 506 inode2chunks.Init(16, 0, hasher_uint64t);
86 506 inode2references.Init(16, 0, hasher_uint64t);
87 506 }
88
89
90
4/8
✓ Branch 2 taken 506 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 506 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 506 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 506 times.
✗ Branch 12 not taken.
 506 ChunkTables::ChunkTables() {
91 506 next_handle = 2;
92 506 version = kVersion;
93
1/2
✓ Branch 1 taken 506 times.
✗ Branch 2 not taken.
 506 InitLocks();
94
1/2
✓ Branch 1 taken 506 times.
✗ Branch 2 not taken.
 506 InitHashmaps();
95 506 }
96
97
98 506 ChunkTables::~ChunkTables() {
99 506 pthread_mutex_destroy(lock);
100 506 free(lock);
101
2/2
✓ Branch 0 taken 64768 times.
✓ Branch 1 taken 506 times.
 65274 for (unsigned i = 0; i < kNumHandleLocks; ++i) {
102 64768 pthread_mutex_destroy(handle_locks.At(i));
103 64768 free(handle_locks.At(i));
104 }
105 506 }
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 318 SimpleChunkTables::SimpleChunkTables() {
152 318 lock_ = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
153 318 const int retval = pthread_mutex_init(lock_, NULL);
154
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 318 times.
 318 assert(retval == 0);
155 318 }
156
157
158 316 SimpleChunkTables::~SimpleChunkTables() {
159
2/2
✓ Branch 1 taken 32 times.
✓ Branch 2 taken 316 times.
 348 for (unsigned i = 0; i < fd_table_.size(); ++i) {
160
1/2
✓ Branch 1 taken 32 times.
✗ Branch 2 not taken.
 32 delete fd_table_[i].chunk_reflist.list;
161 }
162 316 pthread_mutex_destroy(lock_);
163 316 free(lock_);
164 316 }
165
166
167 256 int SimpleChunkTables::Add(FileChunkReflist chunks) {
168
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 256 times.
 256 assert(chunks.list != NULL);
169
1/2
✓ Branch 1 taken 256 times.
✗ Branch 2 not taken.
 256 OpenChunks new_entry;
170
1/2
✓ Branch 1 taken 256 times.
✗ Branch 2 not taken.
 256 new_entry.chunk_reflist = chunks;
171
1/2
✓ Branch 1 taken 256 times.
✗ Branch 2 not taken.
 256 new_entry.chunk_fd = new ChunkFd();
172 256 unsigned i = 0;
173 256 Lock();
174
2/2
✓ Branch 1 taken 480 times.
✓ Branch 2 taken 224 times.
 704 for (; i < fd_table_.size(); ++i) {
175
2/2
✓ Branch 1 taken 32 times.
✓ Branch 2 taken 448 times.
 480 if (fd_table_[i].chunk_reflist.list == NULL) {
176
1/2
✓ Branch 2 taken 32 times.
✗ Branch 3 not taken.
 32 fd_table_[i] = new_entry;
177 32 Unlock();
178 32 return i;
179 }
180 }
181
1/2
✓ Branch 1 taken 224 times.
✗ Branch 2 not taken.
 224 fd_table_.push_back(new_entry);
182 224 Unlock();
183 224 return i;
184 256 }
185
186
187 96 SimpleChunkTables::OpenChunks SimpleChunkTables::Get(int fd) {
188 96 OpenChunks result;
189
2/2
✓ Branch 0 taken 32 times.
✓ Branch 1 taken 64 times.
 96 if (fd < 0)
190 32 return result;
191
192 64 const unsigned idx = static_cast<unsigned>(fd);
193 64 Lock();
194
2/2
✓ Branch 1 taken 32 times.
✓ Branch 2 taken 32 times.
 64 if (idx < fd_table_.size())
195
1/2
✓ Branch 2 taken 32 times.
✗ Branch 3 not taken.
 32 result = fd_table_[idx];
196 64 Unlock();
197 64 return result;
198 }
199
200
201 288 void SimpleChunkTables::Release(int fd) {
202
2/2
✓ Branch 0 taken 32 times.
✓ Branch 1 taken 256 times.
 288 if (fd < 0)
203 32 return;
204
205 256 Lock();
206 256 const unsigned idx = static_cast<unsigned>(fd);
207
2/2
✓ Branch 1 taken 32 times.
✓ Branch 2 taken 224 times.
 256 if (idx >= fd_table_.size()) {
208 32 Unlock();
209 32 return;
210 }
211
212
1/2
✓ Branch 1 taken 224 times.
✗ Branch 2 not taken.
 224 delete fd_table_[idx].chunk_reflist.list;
213 224 fd_table_[idx].chunk_reflist.list = NULL;
214 224 fd_table_[idx].chunk_reflist.path.Assign("", 0);
215
1/2
✓ Branch 1 taken 224 times.
✗ Branch 2 not taken.
 224 delete fd_table_[idx].chunk_fd;
216 224 fd_table_[idx].chunk_fd = NULL;
217
6/6
✓ Branch 1 taken 384 times.
✓ Branch 2 taken 32 times.
✓ Branch 4 taken 192 times.
✓ Branch 5 taken 192 times.
✓ Branch 6 taken 192 times.
✓ Branch 7 taken 224 times.
 416 while (!fd_table_.empty() && (fd_table_.back().chunk_reflist.list == NULL)) {
218 192 fd_table_.pop_back();
219 }
220 224 Unlock();
221 }
222