GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/pack.cc
Date: 2025-10-05 02:35:40
Exec Total Coverage
Lines: 283 307 92.2%
Branches: 202 332 60.8%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #include "pack.h"
6
7 #include <algorithm>
8 #include <cassert>
9 #include <cstring>
10 #include <map>
11
12 #include "util/concurrency.h"
13 #include "util/exception.h"
14 #include "util/platform.h"
15 #include "util/smalloc.h"
16 #include "util/string.h"
17
18 using namespace std; // NOLINT
19
20 namespace { // some private utility functions used by ObjectPackProducer
21
22 772 void InitializeHeader(const int version, const int num_objects,
23 const size_t pack_size, std::string *header) {
24
1/2
✓ Branch 0 taken 772 times.
✗ Branch 1 not taken.
 772 if (header) {
25
2/4
✓ Branch 2 taken 772 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 772 times.
✗ Branch 6 not taken.
 772 *header = "V" + StringifyInt(version) + "\n";
26
3/6
✓ Branch 2 taken 772 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 772 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 772 times.
✗ Branch 9 not taken.
 772 *header += "S" + StringifyInt(pack_size) + "\n";
27
3/6
✓ Branch 2 taken 772 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 772 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 772 times.
✗ Branch 9 not taken.
 772 *header += "N" + StringifyInt(num_objects) + "\n";
28 772 *header += "--\n";
29 }
30 772 }
31
32 53644 void AppendItemToHeader(ObjectPack::BucketContentType object_type,
33 const std::string &hash_str, const size_t object_size,
34 const std::string &object_name, std::string *header) {
35 // If the item type is kName, the "item_name" parameter should not be empty
36
4/6
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 53620 times.
✓ Branch 2 taken 24 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 24 times.
✗ Branch 6 not taken.
 53644 assert((object_type == ObjectPack::kCas)
37 || ((object_type == ObjectPack::kNamed) && (!object_name.empty())));
38
1/2
✓ Branch 2 taken 53644 times.
✗ Branch 3 not taken.
 53644 std::string line_prefix = "";
39
1/2
✓ Branch 2 taken 53644 times.
✗ Branch 3 not taken.
 53644 std::string line_suffix = "";
40
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 53620 times.
✗ Branch 2 not taken.
 53644 switch (object_type) {
41 24 case ObjectPack::kNamed:
42
1/2
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 24 line_prefix = "N ";
43
3/6
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
✓ Branch 5 taken 24 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 24 times.
✗ Branch 9 not taken.
 24 line_suffix = std::string(" ") + Base64Url(object_name);
44 24 break;
45 53620 case ObjectPack::kCas:
46
1/2
✓ Branch 1 taken 53620 times.
✗ Branch 2 not taken.
 53620 line_prefix = "C ";
47 53620 break;
48 ✗ default:
49 ✗ PANIC(kLogStderr, "Unknown object pack type to be added to header.");
50 }
51
1/2
✓ Branch 0 taken 53644 times.
✗ Branch 1 not taken.
 53644 if (header) {
52
4/8
✓ Branch 1 taken 53644 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 53644 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 53644 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 53644 times.
✗ Branch 11 not taken.
 107288 *header += line_prefix + hash_str + " " + StringifyInt(object_size)
53
3/6
✓ Branch 1 taken 53644 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 53644 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 53644 times.
✗ Branch 8 not taken.
 53644 + line_suffix + "\n";
54 }
55 53644 }
56
57 } // namespace
58
59 805204 ObjectPack::Bucket::Bucket()
60 805204 : content(reinterpret_cast<unsigned char *>(smalloc(kInitialSize)))
61 805204 , size(0)
62 805204 , capacity(kInitialSize)
63 805204 , content_type(kEmpty)
64 1610408 , name() { }
65
66 5116 void ObjectPack::Bucket::Add(const void *buf, const uint64_t buf_size) {
67
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5116 times.
 5116 if (buf_size == 0)
68 ✗ return;
69
70
2/2
✓ Branch 0 taken 44188 times.
✓ Branch 1 taken 5116 times.
 49304 while (size + buf_size > capacity) {
71 44188 capacity *= 2;
72 44188 content = reinterpret_cast<unsigned char *>(srealloc(content, capacity));
73 }
74 5116 memcpy(content + size, buf, buf_size);
75 5116 size += buf_size;
76 }
77
78 805204 ObjectPack::Bucket::~Bucket() { free(content); }
79
80 //------------------------------------------------------------------------------
81
82 1908 ObjectPack::ObjectPack(const uint64_t limit) : limit_(limit), size_(0) {
83 1908 InitLock();
84 1908 }
85
86 1860 ObjectPack::~ObjectPack() {
87 3720 for (std::set<BucketHandle>::const_iterator i = open_buckets_.begin(),
88 1860 iEnd = open_buckets_.end();
89
2/2
✓ Branch 1 taken 528 times.
✓ Branch 2 taken 1860 times.
 2388 i != iEnd;
90 528 ++i) {
91
1/2
✓ Branch 1 taken 528 times.
✗ Branch 2 not taken.
 528 delete *i;
92 }
93
94
2/2
✓ Branch 1 taken 804644 times.
✓ Branch 2 taken 1860 times.
 806504 for (unsigned i = 0; i < buckets_.size(); ++i)
95
1/2
✓ Branch 1 taken 804644 times.
✗ Branch 2 not taken.
 804644 delete buckets_[i];
96 1860 pthread_mutex_destroy(lock_);
97 1860 free(lock_);
98 1860 }
99
100 2916 void ObjectPack::AddToBucket(const void *buf, const uint64_t size,
101 const ObjectPack::BucketHandle handle) {
102 2916 handle->Add(buf, size);
103 2916 }
104
105 805196 ObjectPack::BucketHandle ObjectPack::NewBucket() {
106
2/4
✓ Branch 1 taken 805196 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 805196 times.
✗ Branch 5 not taken.
 805196 BucketHandle handle = new Bucket();
107
108 805196 const MutexLockGuard mutex_guard(lock_);
109
1/2
✓ Branch 1 taken 805196 times.
✗ Branch 2 not taken.
 805196 open_buckets_.insert(handle);
110 805196 return handle;
111 805196 }
112
113 /**
114 * Can only fail due to insufficient remaining space in the ObjectPack.
115 */
116 805948 bool ObjectPack::CommitBucket(const BucketContentType type,
117 const shash::Any &id,
118 const ObjectPack::BucketHandle handle,
119 const std::string &name) {
120 805948 handle->id = id;
121
122 805948 handle->content_type = type;
123
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 805948 times.
 805948 if (type == kNamed) {
124 ✗ handle->name = name;
125 }
126
127 805948 const MutexLockGuard mutex_guard(lock_);
128
2/2
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 805940 times.
 805948 if (buckets_.size() >= kMaxObjects)
129 8 return false;
130
2/2
✓ Branch 0 taken 1296 times.
✓ Branch 1 taken 804644 times.
 805940 if (size_ + handle->size > limit_)
131 1296 return false;
132
1/2
✓ Branch 1 taken 804644 times.
✗ Branch 2 not taken.
 804644 open_buckets_.erase(handle);
133
1/2
✓ Branch 1 taken 804644 times.
✗ Branch 2 not taken.
 804644 buckets_.push_back(handle);
134 804644 size_ += handle->size;
135 804644 return true;
136 805948 }
137
138 24 void ObjectPack::DiscardBucket(const BucketHandle handle) {
139 24 const MutexLockGuard mutex_guard(lock_);
140
1/2
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 24 open_buckets_.erase(handle);
141
1/2
✓ Branch 0 taken 24 times.
✗ Branch 1 not taken.
 24 delete handle;
142 24 }
143
144 1908 void ObjectPack::InitLock() {
145 1908 lock_ = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
146 1908 const int retval = pthread_mutex_init(lock_, NULL);
147
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1908 times.
 1908 assert(retval == 0);
148 1908 }
149
150 /**
151 * If a commit failed, an open Bucket can be transferred to another ObjectPack
152 * with more space.
153 */
154 1064 void ObjectPack::TransferBucket(const ObjectPack::BucketHandle handle,
155 ObjectPack *other) {
156 1064 const MutexLockGuard mutex_guard(lock_);
157
1/2
✓ Branch 1 taken 1064 times.
✗ Branch 2 not taken.
 1064 open_buckets_.erase(handle);
158
1/2
✓ Branch 1 taken 1064 times.
✗ Branch 2 not taken.
 1064 other->open_buckets_.insert(handle);
159 1064 }
160
161 302992 unsigned char *ObjectPack::BucketContent(size_t idx) const {
162
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 302992 times.
 302992 assert(idx < buckets_.size());
163 302992 return buckets_[idx]->content;
164 }
165
166 356612 uint64_t ObjectPack::BucketSize(size_t idx) const {
167
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 356612 times.
 356612 assert(idx < buckets_.size());
168 356612 return buckets_[idx]->size;
169 }
170
171 53620 const shash::Any &ObjectPack::BucketId(size_t idx) const {
172
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 53620 times.
 53620 assert(idx < buckets_.size());
173 53620 return buckets_[idx]->id;
174 }
175
176 //------------------------------------------------------------------------------
177
178 /**
179 * Hash over the header. The hash algorithm needs to be provided by hash.
180 */
181 636 void ObjectPackProducer::GetDigest(shash::Any *hash) {
182
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 636 times.
 636 assert(hash);
183 636 shash::HashString(header_, hash);
184 636 }
185
186 748 ObjectPackProducer::ObjectPackProducer(ObjectPack *pack)
187 748 : pack_(pack), big_file_(NULL), pos_(0), idx_(0), pos_in_bucket_(0) {
188 748 const unsigned N = pack->GetNoObjects();
189 // rough guess, most likely a little too much
190
1/2
✓ Branch 1 taken 748 times.
✗ Branch 2 not taken.
 748 header_.reserve(30 + N * (2 * shash::kMaxDigestSize + 5));
191
192
1/2
✓ Branch 2 taken 748 times.
✗ Branch 3 not taken.
 748 InitializeHeader(2, N, pack->size(), &header_);
193
194
2/2
✓ Branch 0 taken 53620 times.
✓ Branch 1 taken 748 times.
 54368 for (unsigned i = 0; i < N; ++i) {
195
3/6
✓ Branch 2 taken 53620 times.
✗ Branch 3 not taken.
✓ Branch 7 taken 53620 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 53620 times.
✗ Branch 11 not taken.
 53620 AppendItemToHeader(ObjectPack::kCas, pack->BucketId(i).ToString(true),
196 pack->BucketSize(i), "", &header_);
197 }
198 748 }
199
200 24 ObjectPackProducer::ObjectPackProducer(const shash::Any &id, FILE *big_file,
201 24 const std::string &file_name)
202 24 : pack_(NULL), big_file_(big_file), pos_(0), idx_(0), pos_in_bucket_(0) {
203 24 const int fd = fileno(big_file_);
204
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 24 times.
 24 assert(fd >= 0);
205 platform_stat64 info;
206 24 const int retval = platform_fstat(fd, &info);
207
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 24 times.
 24 assert(retval == 0);
208
209
1/2
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 24 InitializeHeader(2, 1, info.st_size, &header_);
210
211
2/4
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 24 times.
✗ Branch 5 not taken.
 24 AppendItemToHeader(ObjectPack::kNamed, id.ToString(true), info.st_size,
212 file_name, &header_);
213
214
1/2
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 24 rewind(big_file);
215 24 }
216
217 /**
218 * Copies as many bytes as possible into buf. If the returned number of bytes
219 * is shorter than buf_size, everything has been produced.
220 */
221 252524 unsigned ObjectPackProducer::ProduceNext(const unsigned buf_size,
222 unsigned char *buf) {
223 252524 const unsigned remaining_in_header = (pos_ < header_.size())
224 2772 ? (header_.size() - pos_)
225
2/2
✓ Branch 0 taken 2772 times.
✓ Branch 1 taken 249752 times.
 255296 : 0;
226 252524 const unsigned nbytes_header = std::min(remaining_in_header, buf_size);
227
2/2
✓ Branch 0 taken 2772 times.
✓ Branch 1 taken 249752 times.
 252524 if (nbytes_header) {
228 2772 memcpy(buf, header_.data() + pos_, nbytes_header);
229 2772 pos_ += nbytes_header;
230 }
231
232 252524 unsigned remaining_in_buf = buf_size - nbytes_header;
233
2/2
✓ Branch 0 taken 2024 times.
✓ Branch 1 taken 250500 times.
 252524 if (remaining_in_buf == 0)
234 2024 return nbytes_header;
235 250500 unsigned nbytes_payload = 0;
236
237
2/2
✓ Branch 0 taken 152 times.
✓ Branch 1 taken 250348 times.
 250500 if (big_file_) {
238
1/2
✓ Branch 1 taken 152 times.
✗ Branch 2 not taken.
 152 const size_t nbytes = fread(buf + nbytes_header, 1, remaining_in_buf,
239 big_file_);
240 152 nbytes_payload = nbytes;
241 152 pos_ += nbytes_payload;
242
2/2
✓ Branch 1 taken 250104 times.
✓ Branch 2 taken 244 times.
 250348 } else if (idx_ < pack_->GetNoObjects()) {
243 // Copy a few buckets more
244
6/6
✓ Branch 0 taken 303708 times.
✓ Branch 1 taken 249388 times.
✓ Branch 3 taken 302992 times.
✓ Branch 4 taken 716 times.
✓ Branch 5 taken 302992 times.
✓ Branch 6 taken 250104 times.
 553096 while ((remaining_in_buf) > 0 && (idx_ < pack_->GetNoObjects())) {
245 302992 const unsigned remaining_in_bucket = pack_->BucketSize(idx_)
246 302992 - pos_in_bucket_;
247 302992 const unsigned nbytes = std::min(remaining_in_buf, remaining_in_bucket);
248 605984 memcpy(buf + nbytes_header + nbytes_payload,
249 302992 pack_->BucketContent(idx_) + pos_in_bucket_, nbytes);
250
251 302992 pos_in_bucket_ += nbytes;
252 302992 nbytes_payload += nbytes;
253 302992 remaining_in_buf -= nbytes;
254
2/2
✓ Branch 0 taken 53620 times.
✓ Branch 1 taken 249372 times.
 302992 if (nbytes == remaining_in_bucket) {
255 53620 pos_in_bucket_ = 0;
256 53620 idx_++;
257 }
258 }
259 }
260
261 250500 return nbytes_header + nbytes_payload;
262 }
263
264 //------------------------------------------------------------------------------
265
266 644 ObjectPackConsumer::ObjectPackConsumer(const shash::Any &expected_digest,
267 644 const unsigned expected_header_size)
268 644 : expected_digest_(expected_digest)
269 644 , expected_header_size_(expected_header_size)
270 644 , pos_(0)
271 644 , idx_(0)
272 644 , pos_in_object_(0)
273 644 , pos_in_accu_(0)
274 644 , state_(ObjectPackBuild::kStateContinue)
275 644 , size_(0) {
276 // Upper limit of 100B per entry
277
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 644 times.
 644 if (expected_header_size > (100 * ObjectPack::kMaxObjects)) {
278 ✗ state_ = ObjectPackBuild::kStateHeaderTooBig;
279 ✗ return;
280 }
281
282
1/2
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
 644 raw_header_.reserve(expected_header_size);
283 }
284
285 /**
286 * At the end of the function, pos_ will have progressed by buf_size (unless
287 * the buffer contains trailing garbage bytes.
288 */
289 251628 ObjectPackBuild::State ObjectPackConsumer::ConsumeNext(
290 const unsigned buf_size, const unsigned char *buf) {
291
2/2
✓ Branch 0 taken 536 times.
✓ Branch 1 taken 251092 times.
 251628 if (buf_size == 0)
292 536 return state_;
293
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 251092 times.
 251092 if (state_ == ObjectPackBuild::kStateDone) {
294 ✗ state_ = ObjectPackBuild::kStateTrailingBytes;
295 ✗ return state_;
296 }
297
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 251092 times.
 251092 if (state_ != ObjectPackBuild::kStateContinue)
298 ✗ return state_;
299
300
2/2
✓ Branch 0 taken 2012 times.
✓ Branch 1 taken 249080 times.
 251092 const unsigned remaining_in_header = (pos_ < expected_header_size_)
301 2012 ? (expected_header_size_ - pos_)
302 : 0;
303 251092 const unsigned nbytes_header = std::min(remaining_in_header, buf_size);
304
2/2
✓ Branch 0 taken 2012 times.
✓ Branch 1 taken 249080 times.
 251092 if (nbytes_header) {
305
2/4
✓ Branch 2 taken 2012 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 2012 times.
✗ Branch 6 not taken.
 2012 raw_header_ += string(reinterpret_cast<const char *>(buf), nbytes_header);
306 2012 pos_ += nbytes_header;
307 }
308
309
2/2
✓ Branch 0 taken 1368 times.
✓ Branch 1 taken 249724 times.
 251092 if (pos_ < expected_header_size_)
310 1368 return ObjectPackBuild::kStateContinue;
311
312 // This condition can only be true once through the lifetime of the
313 // Consumer.
314
3/4
✓ Branch 0 taken 644 times.
✓ Branch 1 taken 249080 times.
✓ Branch 2 taken 644 times.
✗ Branch 3 not taken.
 249724 if (nbytes_header && (pos_ == expected_header_size_)) {
315
1/2
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
 644 shash::Any digest(expected_digest_.algorithm);
316
1/2
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
 644 shash::HashString(raw_header_, &digest);
317
2/4
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 644 times.
 644 if (digest != expected_digest_) {
318 ✗ state_ = ObjectPackBuild::kStateCorrupt;
319 16 return state_;
320 } else {
321
1/2
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
 644 const bool retval = ParseHeader();
322
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 644 times.
 644 if (!retval) {
323 ✗ state_ = ObjectPackBuild::kStateBadFormat;
324 ✗ return state_;
325 }
326 // We don't need the raw string anymore
327 644 raw_header_.clear();
328 }
329
330 // Empty pack?
331
6/6
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 620 times.
✓ Branch 3 taken 16 times.
✓ Branch 4 taken 8 times.
✓ Branch 5 taken 16 times.
✓ Branch 6 taken 628 times.
 644 if ((buf_size == nbytes_header) && (index_.size() == 0)) {
332 16 state_ = ObjectPackBuild::kStateDone;
333 16 return state_;
334 }
335 }
336
337 249708 const unsigned remaining_in_buf = buf_size - nbytes_header;
338 249708 const unsigned char *payload = buf + nbytes_header;
339
1/2
✓ Branch 1 taken 249708 times.
✗ Branch 2 not taken.
 249708 return ConsumePayload(remaining_in_buf, payload);
340 }
341
342 /**
343 * Informs listeners for small complete objects. For large objects, buffers
344 * the
345 * input into reasonably sized chunks. buf can contain both a chunk of data
346 * that needs to be added to the consumer's accumulator and a bunch of
347 * complete small objects. We use the accumulator only if necessary to avoid
348 * unnecessary memory copies.
349 */
350 249708 ObjectPackBuild::State ObjectPackConsumer::ConsumePayload(
351 const unsigned buf_size, const unsigned char *buf) {
352 249708 uint64_t pos_in_buf = 0;
353 588608 while ((idx_ < index_.size())
354
8/8
✓ Branch 0 taken 587980 times.
✓ Branch 1 taken 628 times.
✓ Branch 2 taken 249088 times.
✓ Branch 3 taken 338892 times.
✓ Branch 5 taken 8 times.
✓ Branch 6 taken 249080 times.
✓ Branch 7 taken 338900 times.
✓ Branch 8 taken 249708 times.
 588608 && ((pos_in_buf < buf_size) || (index_[idx_].size == 0))) {
355 // Fill the accumulator or process next small object
356 uint64_t nbytes; // How many bytes are consumed in this iteration
357 338900 const uint64_t remaining_in_buf = buf_size - pos_in_buf;
358 338900 const uint64_t remaining_in_object = index_[idx_].size - pos_in_object_;
359 338900 const bool is_small_rest = remaining_in_buf < kAccuSize;
360
361 // We use the accumulator if there is already something in or if we have a
362 // small piece of data of a larger object.
363 338900 nbytes = std::min(remaining_in_object, remaining_in_buf);
364
2/2
✓ Branch 0 taken 258404 times.
✓ Branch 1 taken 80496 times.
 338900 if ((pos_in_accu_ > 0)
365
4/4
✓ Branch 0 taken 205808 times.
✓ Branch 1 taken 52596 times.
✓ Branch 2 taken 37240 times.
✓ Branch 3 taken 168568 times.
 258404 || ((remaining_in_buf < remaining_in_object) && is_small_rest)) {
366 117736 const uint64_t remaining_in_accu = kAccuSize - pos_in_accu_;
367 117736 nbytes = std::min(remaining_in_accu, nbytes);
368 117736 memcpy(accumulator_ + pos_in_accu_, buf + pos_in_buf, nbytes);
369 117736 pos_in_accu_ += nbytes;
370
4/4
✓ Branch 0 taken 81400 times.
✓ Branch 1 taken 36336 times.
✓ Branch 2 taken 904 times.
✓ Branch 3 taken 80496 times.
 117736 if ((pos_in_accu_ == kAccuSize) || (nbytes == remaining_in_object)) {
371
1/2
✓ Branch 1 taken 37240 times.
✗ Branch 2 not taken.
 37240 NotifyListeners(ObjectPackBuild::Event(
372
1/2
✓ Branch 3 taken 37240 times.
✗ Branch 4 not taken.
 37240 index_[idx_].id, index_[idx_].size, pos_in_accu_, accumulator_,
373 37240 index_[idx_].entry_type, index_[idx_].entry_name));
374 37240 pos_in_accu_ = 0;
375 }
376 117736 } else { // directly trigger listeners using buf
377
1/2
✓ Branch 1 taken 221164 times.
✗ Branch 2 not taken.
 221164 NotifyListeners(ObjectPackBuild::Event(
378
1/2
✓ Branch 3 taken 221164 times.
✗ Branch 4 not taken.
 221164 index_[idx_].id, index_[idx_].size, nbytes, buf + pos_in_buf,
379 221164 index_[idx_].entry_type, index_[idx_].entry_name));
380 }
381
382 338900 pos_in_buf += nbytes;
383 338900 pos_in_object_ += nbytes;
384
2/2
✓ Branch 0 taken 53508 times.
✓ Branch 1 taken 285392 times.
 338900 if (nbytes == remaining_in_object) {
385 53508 idx_++;
386 53508 pos_in_object_ = 0;
387 }
388 }
389
390 249708 pos_ += buf_size;
391
392
2/2
✓ Branch 1 taken 628 times.
✓ Branch 2 taken 249080 times.
 249708 if (idx_ == index_.size())
393
1/2
✓ Branch 0 taken 628 times.
✗ Branch 1 not taken.
 628 state_ = (pos_in_buf == buf_size) ? ObjectPackBuild::kStateDone
394 : ObjectPackBuild::kStateTrailingBytes;
395 else
396 249080 state_ = ObjectPackBuild::kStateContinue;
397 249708 return state_;
398 }
399
400 644 bool ObjectPackConsumer::ParseHeader() {
401 644 map<char, string> header;
402 const unsigned char *data = reinterpret_cast<const unsigned char *>(
403 644 raw_header_.data());
404
1/2
✓ Branch 2 taken 644 times.
✗ Branch 3 not taken.
 644 ParseKeyvalMem(data, raw_header_.size(), &header);
405
2/5
✓ Branch 2 taken 644 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 644 times.
 644 if (header.find('V') == header.end())
406 ✗ return false;
407
3/7
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 644 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 644 times.
 644 if (header['V'] != "2")
408 ✗ return false;
409
2/4
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 644 times.
✗ Branch 5 not taken.
 644 size_ = String2Uint64(header['S']);
410
2/4
✓ Branch 1 taken 644 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 644 times.
✗ Branch 5 not taken.
 644 const unsigned nobjects = String2Uint64(header['N']);
411
412
2/2
✓ Branch 0 taken 16 times.
✓ Branch 1 taken 628 times.
 644 if (nobjects == 0)
413 16 return true;
414
415 // Build the object index
416 628 const size_t separator_idx = raw_header_.find("--\n");
417
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 628 times.
 628 if (separator_idx == string::npos)
418 ✗ return false;
419 628 unsigned index_idx = separator_idx + 3;
420
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 628 times.
 628 if (index_idx >= raw_header_.size())
421 ✗ return false;
422
423 628 uint64_t sum_size = 0;
424 do {
425 53508 const unsigned remaining_in_header = raw_header_.size() - index_idx;
426 107016 const string line = GetLineMem(raw_header_.data() + index_idx,
427
1/2
✓ Branch 2 taken 53508 times.
✗ Branch 3 not taken.
 53508 remaining_in_header);
428
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 53508 times.
 53508 if (line == "")
429 ✗ break;
430
431
1/2
✓ Branch 1 taken 53508 times.
✗ Branch 2 not taken.
 53508 IndexEntry entry;
432
2/4
✓ Branch 1 taken 53508 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 53508 times.
 53508 if (!ParseItem(line, &entry, &sum_size)) {
433 ✗ break;
434 }
435
436
1/2
✓ Branch 1 taken 53508 times.
✗ Branch 2 not taken.
 53508 index_.push_back(entry);
437 53508 index_idx += line.size() + 1;
438
4/6
✓ Branch 1 taken 53508 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 53508 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 52880 times.
✓ Branch 8 taken 628 times.
 107016 } while (index_idx < raw_header_.size());
439
440
2/4
✓ Branch 1 taken 628 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 628 times.
✗ Branch 4 not taken.
 628 return (nobjects == index_.size()) && (size_ == sum_size);
441 644 }
442
443 53508 bool ObjectPackConsumer::ParseItem(const std::string &line,
444 ObjectPackConsumer::IndexEntry *entry,
445 uint64_t *sum_size) {
446
2/4
✓ Branch 0 taken 53508 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 53508 times.
 53508 if (!entry || !sum_size) {
447 ✗ return false;
448 }
449
450
2/2
✓ Branch 1 taken 53500 times.
✓ Branch 2 taken 8 times.
 53508 if (line[0] == 'C') { // CAS blob
451 53500 const ObjectPack::BucketContentType entry_type = ObjectPack::kCas;
452
453 // We could use SplitString but we can have many lines so we do something
454 // more efficient here
455 53500 const size_t separator = line.find(' ', 2);
456
3/6
✓ Branch 0 taken 53500 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 53500 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 53500 times.
 53500 if ((separator == string::npos) || (separator == (line.size() - 1))) {
457 ✗ return false;
458 }
459
460
2/4
✓ Branch 1 taken 53500 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 53500 times.
✗ Branch 5 not taken.
 53500 const uint64_t size = String2Uint64(line.substr(separator + 1));
461 53500 *sum_size += size;
462
463 // Warning do not construct a HexPtr with an rvalue!
464 // The constructor takes the address of its argument.
465
1/2
✓ Branch 1 taken 53500 times.
✗ Branch 2 not taken.
 53500 const std::string hash_string = line.substr(2, separator - 2);
466 53500 const shash::HexPtr hex_ptr(hash_string);
467
468
1/2
✓ Branch 1 taken 53500 times.
✗ Branch 2 not taken.
 53500 entry->id = shash::MkFromSuffixedHexPtr(hex_ptr);
469 53500 entry->size = size;
470 53500 entry->entry_type = entry_type;
471
1/2
✓ Branch 1 taken 53500 times.
✗ Branch 2 not taken.
 53500 entry->entry_name = "";
472
1/2
✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
 53508 } else if (line[0] == 'N') { // Named file
473 8 const ObjectPack::BucketContentType entry_type = ObjectPack::kNamed;
474
475 // First separator, before the size field
476 8 const size_t separator1 = line.find(' ', 2);
477
3/6
✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 8 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 8 times.
 8 if ((separator1 == string::npos) || (separator1 == (line.size() - 1))) {
478 ✗ return false;
479 }
480
481 // Second separator, before the name field
482 8 const size_t separator2 = line.find(' ', separator1 + 1);
483
1/2
✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
 8 if ((separator1 == 0) || (separator1 == string::npos)
484
3/6
✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 8 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 8 times.
 16 || (separator1 == (line.size() - 1))) {
485 ✗ return false;
486 }
487
488
1/2
✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
 8 const uint64_t size = String2Uint64(
489
1/2
✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
 16 line.substr(separator1 + 1, separator2 - separator1 - 1));
490
491 8 std::string name;
492
3/7
✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 8 times.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✓ Branch 8 taken 8 times.
 8 if (!Debase64(line.substr(separator2 + 1), &name)) {
493 ✗ return false;
494 }
495
496 8 *sum_size += size;
497
498 // Warning do not construct a HexPtr with an rvalue!
499 // The constructor takes the address of its argument.
500
1/2
✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
 8 const std::string hash_string = line.substr(2, separator1 - 2);
501 8 const shash::HexPtr hex_ptr(hash_string);
502
503
1/2
✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
 8 entry->id = shash::MkFromSuffixedHexPtr(hex_ptr);
504 8 entry->size = size;
505 8 entry->entry_type = entry_type;
506
1/2
✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
 8 entry->entry_name = name;
507
1/2
✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
 8 } else { // Error
508 ✗ return false;
509 }
510
511 53508 return true;
512 }
513