GCC Code Coverage Report

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