GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/pack.cc
Date: 2026-03-15 02:35:27
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 262 void InitializeHeader(const int version, const int num_objects,
23 const size_t pack_size, std::string *header) {
24
1/2
✓ Branch 0 taken 262 times.
✗ Branch 1 not taken.
 262 if (header) {
25
2/4
✓ Branch 2 taken 262 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 262 times.
✗ Branch 6 not taken.
 262 *header = "V" + StringifyInt(version) + "\n";
26
3/6
✓ Branch 2 taken 262 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 262 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 262 times.
✗ Branch 9 not taken.
 262 *header += "S" + StringifyInt(pack_size) + "\n";
27
3/6
✓ Branch 2 taken 262 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 262 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 262 times.
✗ Branch 9 not taken.
 262 *header += "N" + StringifyInt(num_objects) + "\n";
28 262 *header += "--\n";
29 }
30 262 }
31
32 12736 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 6 times.
✓ Branch 1 taken 12730 times.
✓ Branch 2 taken 6 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 6 times.
✗ Branch 6 not taken.
 12736 assert((object_type == ObjectPack::kCas)
37 || ((object_type == ObjectPack::kNamed) && (!object_name.empty())));
38
1/2
✓ Branch 2 taken 12736 times.
✗ Branch 3 not taken.
 12736 std::string line_prefix = "";
39
1/2
✓ Branch 2 taken 12736 times.
✗ Branch 3 not taken.
 12736 std::string line_suffix = "";
40
2/3
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 12730 times.
✗ Branch 2 not taken.
 12736 switch (object_type) {
41 6 case ObjectPack::kNamed:
42
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 line_prefix = "N ";
43
3/6
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
✓ Branch 5 taken 6 times.
✗ Branch 6 not taken.
✓ Branch 8 taken 6 times.
✗ Branch 9 not taken.
 6 line_suffix = std::string(" ") + Base64Url(object_name);
44 6 break;
45 12730 case ObjectPack::kCas:
46
1/2
✓ Branch 1 taken 12730 times.
✗ Branch 2 not taken.
 12730 line_prefix = "C ";
47 12730 break;
48 ✗ default:
49 ✗ PANIC(kLogStderr, "Unknown object pack type to be added to header.");
50 }
51
1/2
✓ Branch 0 taken 12736 times.
✗ Branch 1 not taken.
 12736 if (header) {
52
4/8
✓ Branch 1 taken 12736 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 12736 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 12736 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 12736 times.
✗ Branch 11 not taken.
 25472 *header += line_prefix + hash_str + " " + StringifyInt(object_size)
53
3/6
✓ Branch 1 taken 12736 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 12736 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 12736 times.
✗ Branch 8 not taken.
 12736 + line_suffix + "\n";
54 }
55 12736 }
56
57 } // namespace
58
59 201097 ObjectPack::Bucket::Bucket()
60 201097 : content(reinterpret_cast<unsigned char *>(smalloc(kInitialSize)))
61 201097 , size(0)
62 201097 , capacity(kInitialSize)
63 201097 , content_type(kEmpty)
64 402194 , name() { }
65
66 1075 void ObjectPack::Bucket::Add(const void *buf, const uint64_t buf_size) {
67
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1075 times.
 1075 if (buf_size == 0)
68 ✗ return;
69
70
2/2
✓ Branch 0 taken 9901 times.
✓ Branch 1 taken 1075 times.
 10976 while (size + buf_size > capacity) {
71 9901 capacity *= 2;
72 9901 content = reinterpret_cast<unsigned char *>(srealloc(content, capacity));
73 }
74 1075 memcpy(content + size, buf, buf_size);
75 1075 size += buf_size;
76 }
77
78 201097 ObjectPack::Bucket::~Bucket() { free(content); }
79
80 //------------------------------------------------------------------------------
81
82 391 ObjectPack::ObjectPack(const uint64_t limit) : limit_(limit), size_(0) {
83 391 InitLock();
84 391 }
85
86 384 ObjectPack::~ObjectPack() {
87 768 for (std::set<BucketHandle>::const_iterator i = open_buckets_.begin(),
88 384 iEnd = open_buckets_.end();
89
2/2
✓ Branch 1 taken 132 times.
✓ Branch 2 taken 384 times.
 516 i != iEnd;
90 132 ++i) {
91
1/2
✓ Branch 1 taken 132 times.
✗ Branch 2 not taken.
 132 delete *i;
92 }
93
94
2/2
✓ Branch 1 taken 200957 times.
✓ Branch 2 taken 384 times.
 201341 for (unsigned i = 0; i < buckets_.size(); ++i)
95
1/2
✓ Branch 1 taken 200957 times.
✗ Branch 2 not taken.
 200957 delete buckets_[i];
96 384 pthread_mutex_destroy(lock_);
97 384 free(lock_);
98 384 }
99
100 543 void ObjectPack::AddToBucket(const void *buf, const uint64_t size,
101 const ObjectPack::BucketHandle handle) {
102 543 handle->Add(buf, size);
103 543 }
104
105 201095 ObjectPack::BucketHandle ObjectPack::NewBucket() {
106
2/4
✓ Branch 1 taken 201095 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 201095 times.
✗ Branch 5 not taken.
 201095 BucketHandle handle = new Bucket();
107
108 201095 const MutexLockGuard mutex_guard(lock_);
109
1/2
✓ Branch 1 taken 201095 times.
✗ Branch 2 not taken.
 201095 open_buckets_.insert(handle);
110 201095 return handle;
111 201095 }
112
113 /**
114 * Can only fail due to insufficient remaining space in the ObjectPack.
115 */
116 201203 bool ObjectPack::CommitBucket(const BucketContentType type,
117 const shash::Any &id,
118 const ObjectPack::BucketHandle handle,
119 const std::string &name) {
120 201203 handle->id = id;
121
122 201203 handle->content_type = type;
123
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 201203 times.
 201203 if (type == kNamed) {
124 ✗ handle->name = name;
125 }
126
127 201203 const MutexLockGuard mutex_guard(lock_);
128
2/2
✓ Branch 1 taken 2 times.
✓ Branch 2 taken 201201 times.
 201203 if (buckets_.size() >= kMaxObjects)
129 2 return false;
130
2/2
✓ Branch 0 taken 244 times.
✓ Branch 1 taken 200957 times.
 201201 if (size_ + handle->size > limit_)
131 244 return false;
132
1/2
✓ Branch 1 taken 200957 times.
✗ Branch 2 not taken.
 200957 open_buckets_.erase(handle);
133
1/2
✓ Branch 1 taken 200957 times.
✗ Branch 2 not taken.
 200957 buckets_.push_back(handle);
134 200957 size_ += handle->size;
135 200957 return true;
136 201203 }
137
138 6 void ObjectPack::DiscardBucket(const BucketHandle handle) {
139 6 const MutexLockGuard mutex_guard(lock_);
140
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 open_buckets_.erase(handle);
141
1/2
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
 6 delete handle;
142 6 }
143
144 391 void ObjectPack::InitLock() {
145 391 lock_ = reinterpret_cast<pthread_mutex_t *>(smalloc(sizeof(pthread_mutex_t)));
146 391 const int retval = pthread_mutex_init(lock_, NULL);
147
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 391 times.
 391 assert(retval == 0);
148 391 }
149
150 /**
151 * If a commit failed, an open Bucket can be transferred to another ObjectPack
152 * with more space.
153 */
154 156 void ObjectPack::TransferBucket(const ObjectPack::BucketHandle handle,
155 ObjectPack *other) {
156 156 const MutexLockGuard mutex_guard(lock_);
157
1/2
✓ Branch 1 taken 156 times.
✗ Branch 2 not taken.
 156 open_buckets_.erase(handle);
158
1/2
✓ Branch 1 taken 156 times.
✗ Branch 2 not taken.
 156 other->open_buckets_.insert(handle);
159 156 }
160
161 74995 unsigned char *ObjectPack::BucketContent(size_t idx) const {
162
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 74995 times.
 74995 assert(idx < buckets_.size());
163 74995 return buckets_[idx]->content;
164 }
165
166 87725 uint64_t ObjectPack::BucketSize(size_t idx) const {
167
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 87725 times.
 87725 assert(idx < buckets_.size());
168 87725 return buckets_[idx]->size;
169 }
170
171 12730 const shash::Any &ObjectPack::BucketId(size_t idx) const {
172
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 12730 times.
 12730 assert(idx < buckets_.size());
173 12730 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 238 void ObjectPackProducer::GetDigest(shash::Any *hash) {
182
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 238 times.
 238 assert(hash);
183 238 shash::HashString(header_, hash);
184 238 }
185
186 256 ObjectPackProducer::ObjectPackProducer(ObjectPack *pack)
187 256 : pack_(pack), big_file_(NULL), pos_(0), idx_(0), pos_in_bucket_(0) {
188 256 const unsigned N = pack->GetNoObjects();
189 // rough guess, most likely a little too much
190
1/2
✓ Branch 1 taken 256 times.
✗ Branch 2 not taken.
 256 header_.reserve(30 + N * (2 * shash::kMaxDigestSize + 5));
191
192
1/2
✓ Branch 2 taken 256 times.
✗ Branch 3 not taken.
 256 InitializeHeader(2, N, pack->size(), &header_);
193
194
2/2
✓ Branch 0 taken 12730 times.
✓ Branch 1 taken 256 times.
 12986 for (unsigned i = 0; i < N; ++i) {
195
3/6
✓ Branch 2 taken 12730 times.
✗ Branch 3 not taken.
✓ Branch 7 taken 12730 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 12730 times.
✗ Branch 11 not taken.
 12730 AppendItemToHeader(ObjectPack::kCas, pack->BucketId(i).ToString(true),
196 pack->BucketSize(i), "", &header_);
197 }
198 256 }
199
200 6 ObjectPackProducer::ObjectPackProducer(const shash::Any &id, FILE *big_file,
201 6 const std::string &file_name)
202 6 : pack_(NULL), big_file_(big_file), pos_(0), idx_(0), pos_in_bucket_(0) {
203 6 const int fd = fileno(big_file_);
204
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6 times.
 6 assert(fd >= 0);
205 platform_stat64 info;
206 6 const int retval = platform_fstat(fd, &info);
207
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6 times.
 6 assert(retval == 0);
208
209
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 InitializeHeader(2, 1, info.st_size, &header_);
210
211
2/4
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 6 times.
✗ Branch 5 not taken.
 6 AppendItemToHeader(ObjectPack::kNamed, id.ToString(true), info.st_size,
212 file_name, &header_);
213
214
1/2
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
 6 rewind(big_file);
215 6 }
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 63188 unsigned ObjectPackProducer::ProduceNext(const unsigned buf_size,
222 unsigned char *buf) {
223 63188 const unsigned remaining_in_header = (pos_ < header_.size())
224 764 ? (header_.size() - pos_)
225
2/2
✓ Branch 0 taken 764 times.
✓ Branch 1 taken 62424 times.
 63952 : 0;
226 63188 const unsigned nbytes_header = std::min(remaining_in_header, buf_size);
227
2/2
✓ Branch 0 taken 764 times.
✓ Branch 1 taken 62424 times.
 63188 if (nbytes_header) {
228 764 memcpy(buf, header_.data() + pos_, nbytes_header);
229 764 pos_ += nbytes_header;
230 }
231
232 63188 unsigned remaining_in_buf = buf_size - nbytes_header;
233
2/2
✓ Branch 0 taken 508 times.
✓ Branch 1 taken 62680 times.
 63188 if (remaining_in_buf == 0)
234 508 return nbytes_header;
235 62680 unsigned nbytes_payload = 0;
236
237
2/2
✓ Branch 0 taken 38 times.
✓ Branch 1 taken 62642 times.
 62680 if (big_file_) {
238
1/2
✓ Branch 1 taken 38 times.
✗ Branch 2 not taken.
 38 const size_t nbytes = fread(buf + nbytes_header, 1, remaining_in_buf,
239 big_file_);
240 38 nbytes_payload = nbytes;
241 38 pos_ += nbytes_payload;
242
2/2
✓ Branch 1 taken 62517 times.
✓ Branch 2 taken 125 times.
 62642 } else if (idx_ < pack_->GetNoObjects()) {
243 // Copy a few buckets more
244
6/6
✓ Branch 0 taken 75243 times.
✓ Branch 1 taken 62269 times.
✓ Branch 3 taken 74995 times.
✓ Branch 4 taken 248 times.
✓ Branch 5 taken 74995 times.
✓ Branch 6 taken 62517 times.
 137512 while ((remaining_in_buf) > 0 && (idx_ < pack_->GetNoObjects())) {
245 74995 const unsigned remaining_in_bucket = pack_->BucketSize(idx_)
246 74995 - pos_in_bucket_;
247 74995 const unsigned nbytes = std::min(remaining_in_buf, remaining_in_bucket);
248 149990 memcpy(buf + nbytes_header + nbytes_payload,
249 74995 pack_->BucketContent(idx_) + pos_in_bucket_, nbytes);
250
251 74995 pos_in_bucket_ += nbytes;
252 74995 nbytes_payload += nbytes;
253 74995 remaining_in_buf -= nbytes;
254
2/2
✓ Branch 0 taken 12730 times.
✓ Branch 1 taken 62265 times.
 74995 if (nbytes == remaining_in_bucket) {
255 12730 pos_in_bucket_ = 0;
256 12730 idx_++;
257 }
258 }
259 }
260
261 62680 return nbytes_header + nbytes_payload;
262 }
263
264 //------------------------------------------------------------------------------
265
266 240 ObjectPackConsumer::ObjectPackConsumer(const shash::Any &expected_digest,
267 240 const unsigned expected_header_size)
268 240 : expected_digest_(expected_digest)
269 240 , expected_header_size_(expected_header_size)
270 240 , pos_(0)
271 240 , idx_(0)
272 240 , pos_in_object_(0)
273 240 , pos_in_accu_(0)
274 240 , state_(ObjectPackBuild::kStateContinue)
275 240 , size_(0) {
276 // Upper limit of 100B per entry
277
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 240 times.
 240 if (expected_header_size > (100 * ObjectPack::kMaxObjects)) {
278 ✗ state_ = ObjectPackBuild::kStateHeaderTooBig;
279 ✗ return;
280 }
281
282
1/2
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
 240 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 62856 ObjectPackBuild::State ObjectPackConsumer::ConsumeNext(
290 const unsigned buf_size, const unsigned char *buf) {
291
2/2
✓ Branch 0 taken 134 times.
✓ Branch 1 taken 62722 times.
 62856 if (buf_size == 0)
292 134 return state_;
293
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 62722 times.
 62722 if (state_ == ObjectPackBuild::kStateDone) {
294 ✗ state_ = ObjectPackBuild::kStateTrailingBytes;
295 ✗ return state_;
296 }
297
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 62722 times.
 62722 if (state_ != ObjectPackBuild::kStateContinue)
298 ✗ return state_;
299
300
2/2
✓ Branch 0 taken 584 times.
✓ Branch 1 taken 62138 times.
 62722 const unsigned remaining_in_header = (pos_ < expected_header_size_)
301 584 ? (expected_header_size_ - pos_)
302 : 0;
303 62722 const unsigned nbytes_header = std::min(remaining_in_header, buf_size);
304
2/2
✓ Branch 0 taken 584 times.
✓ Branch 1 taken 62138 times.
 62722 if (nbytes_header) {
305
2/4
✓ Branch 2 taken 584 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 584 times.
✗ Branch 6 not taken.
 584 raw_header_ += string(reinterpret_cast<const char *>(buf), nbytes_header);
306 584 pos_ += nbytes_header;
307 }
308
309
2/2
✓ Branch 0 taken 344 times.
✓ Branch 1 taken 62378 times.
 62722 if (pos_ < expected_header_size_)
310 344 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 240 times.
✓ Branch 1 taken 62138 times.
✓ Branch 2 taken 240 times.
✗ Branch 3 not taken.
 62378 if (nbytes_header && (pos_ == expected_header_size_)) {
315
1/2
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
 240 shash::Any digest(expected_digest_.algorithm);
316
1/2
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
 240 shash::HashString(raw_header_, &digest);
317
2/4
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 240 times.
 240 if (digest != expected_digest_) {
318 ✗ state_ = ObjectPackBuild::kStateCorrupt;
319 4 return state_;
320 } else {
321
1/2
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
 240 const bool retval = ParseHeader();
322
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 240 times.
 240 if (!retval) {
323 ✗ state_ = ObjectPackBuild::kStateBadFormat;
324 ✗ return state_;
325 }
326 // We don't need the raw string anymore
327 240 raw_header_.clear();
328 }
329
330 // Empty pack?
331
6/6
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 234 times.
✓ Branch 3 taken 4 times.
✓ Branch 4 taken 2 times.
✓ Branch 5 taken 4 times.
✓ Branch 6 taken 236 times.
 240 if ((buf_size == nbytes_header) && (index_.size() == 0)) {
332 4 state_ = ObjectPackBuild::kStateDone;
333 4 return state_;
334 }
335 }
336
337 62374 const unsigned remaining_in_buf = buf_size - nbytes_header;
338 62374 const unsigned char *payload = buf + nbytes_header;
339
1/2
✓ Branch 1 taken 62374 times.
✗ Branch 2 not taken.
 62374 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 62374 ObjectPackBuild::State ObjectPackConsumer::ConsumePayload(
351 const unsigned buf_size, const unsigned char *buf) {
352 62374 uint64_t pos_in_buf = 0;
353 146232 while ((idx_ < index_.size())
354
8/8
✓ Branch 0 taken 145996 times.
✓ Branch 1 taken 236 times.
✓ Branch 2 taken 62140 times.
✓ Branch 3 taken 83856 times.
✓ Branch 5 taken 2 times.
✓ Branch 6 taken 62138 times.
✓ Branch 7 taken 83858 times.
✓ Branch 8 taken 62374 times.
 146232 && ((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 83858 const uint64_t remaining_in_buf = buf_size - pos_in_buf;
358 83858 const uint64_t remaining_in_object = index_[idx_].size - pos_in_object_;
359 83858 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 83858 nbytes = std::min(remaining_in_object, remaining_in_buf);
364
2/2
✓ Branch 0 taken 63794 times.
✓ Branch 1 taken 20064 times.
 83858 if ((pos_in_accu_ > 0)
365
4/4
✓ Branch 0 taken 51388 times.
✓ Branch 1 taken 12406 times.
✓ Branch 2 taken 9318 times.
✓ Branch 3 taken 42070 times.
 63794 || ((remaining_in_buf < remaining_in_object) && is_small_rest)) {
366 29382 const uint64_t remaining_in_accu = kAccuSize - pos_in_accu_;
367 29382 nbytes = std::min(remaining_in_accu, nbytes);
368 29382 memcpy(accumulator_ + pos_in_accu_, buf + pos_in_buf, nbytes);
369 29382 pos_in_accu_ += nbytes;
370
4/4
✓ Branch 0 taken 20368 times.
✓ Branch 1 taken 9014 times.
✓ Branch 2 taken 304 times.
✓ Branch 3 taken 20064 times.
 29382 if ((pos_in_accu_ == kAccuSize) || (nbytes == remaining_in_object)) {
371
1/2
✓ Branch 1 taken 9318 times.
✗ Branch 2 not taken.
 9318 NotifyListeners(ObjectPackBuild::Event(
372
1/2
✓ Branch 3 taken 9318 times.
✗ Branch 4 not taken.
 9318 index_[idx_].id, index_[idx_].size, pos_in_accu_, accumulator_,
373 9318 index_[idx_].entry_type, index_[idx_].entry_name));
374 9318 pos_in_accu_ = 0;
375 }
376 29382 } else { // directly trigger listeners using buf
377
1/2
✓ Branch 1 taken 54476 times.
✗ Branch 2 not taken.
 54476 NotifyListeners(ObjectPackBuild::Event(
378
1/2
✓ Branch 3 taken 54476 times.
✗ Branch 4 not taken.
 54476 index_[idx_].id, index_[idx_].size, nbytes, buf + pos_in_buf,
379 54476 index_[idx_].entry_type, index_[idx_].entry_name));
380 }
381
382 83858 pos_in_buf += nbytes;
383 83858 pos_in_object_ += nbytes;
384
2/2
✓ Branch 0 taken 12712 times.
✓ Branch 1 taken 71146 times.
 83858 if (nbytes == remaining_in_object) {
385 12712 idx_++;
386 12712 pos_in_object_ = 0;
387 }
388 }
389
390 62374 pos_ += buf_size;
391
392
2/2
✓ Branch 1 taken 236 times.
✓ Branch 2 taken 62138 times.
 62374 if (idx_ == index_.size())
393
1/2
✓ Branch 0 taken 236 times.
✗ Branch 1 not taken.
 236 state_ = (pos_in_buf == buf_size) ? ObjectPackBuild::kStateDone
394 : ObjectPackBuild::kStateTrailingBytes;
395 else
396 62138 state_ = ObjectPackBuild::kStateContinue;
397 62374 return state_;
398 }
399
400 240 bool ObjectPackConsumer::ParseHeader() {
401 240 map<char, string> header;
402 const unsigned char *data = reinterpret_cast<const unsigned char *>(
403 240 raw_header_.data());
404
1/2
✓ Branch 2 taken 240 times.
✗ Branch 3 not taken.
 240 ParseKeyvalMem(data, raw_header_.size(), &header);
405
2/5
✓ Branch 2 taken 240 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 240 times.
 240 if (header.find('V') == header.end())
406 ✗ return false;
407
3/7
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 240 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 240 times.
 240 if (header['V'] != "2")
408 ✗ return false;
409
2/4
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 240 times.
✗ Branch 5 not taken.
 240 size_ = String2Uint64(header['S']);
410
2/4
✓ Branch 1 taken 240 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 240 times.
✗ Branch 5 not taken.
 240 const unsigned nobjects = String2Uint64(header['N']);
411
412
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 236 times.
 240 if (nobjects == 0)
413 4 return true;
414
415 // Build the object index
416 236 const size_t separator_idx = raw_header_.find("--\n");
417
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 236 times.
 236 if (separator_idx == string::npos)
418 ✗ return false;
419 236 unsigned index_idx = separator_idx + 3;
420
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 236 times.
 236 if (index_idx >= raw_header_.size())
421 ✗ return false;
422
423 236 uint64_t sum_size = 0;
424 do {
425 12712 const unsigned remaining_in_header = raw_header_.size() - index_idx;
426 25424 const string line = GetLineMem(raw_header_.data() + index_idx,
427
1/2
✓ Branch 2 taken 12712 times.
✗ Branch 3 not taken.
 12712 remaining_in_header);
428
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 12712 times.
 12712 if (line == "")
429 ✗ break;
430
431
1/2
✓ Branch 1 taken 12712 times.
✗ Branch 2 not taken.
 12712 IndexEntry entry;
432
2/4
✓ Branch 1 taken 12712 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 12712 times.
 12712 if (!ParseItem(line, &entry, &sum_size)) {
433 ✗ break;
434 }
435
436
1/2
✓ Branch 1 taken 12712 times.
✗ Branch 2 not taken.
 12712 index_.push_back(entry);
437 12712 index_idx += line.size() + 1;
438
4/6
✓ Branch 1 taken 12712 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 12712 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 12476 times.
✓ Branch 8 taken 236 times.
 25424 } while (index_idx < raw_header_.size());
439
440
2/4
✓ Branch 1 taken 236 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 236 times.
✗ Branch 4 not taken.
 236 return (nobjects == index_.size()) && (size_ == sum_size);
441 240 }
442
443 12712 bool ObjectPackConsumer::ParseItem(const std::string &line,
444 ObjectPackConsumer::IndexEntry *entry,
445 uint64_t *sum_size) {
446
2/4
✓ Branch 0 taken 12712 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 12712 times.
 12712 if (!entry || !sum_size) {
447 ✗ return false;
448 }
449
450
2/2
✓ Branch 1 taken 12710 times.
✓ Branch 2 taken 2 times.
 12712 if (line[0] == 'C') { // CAS blob
451 12710 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 12710 const size_t separator = line.find(' ', 2);
456
3/6
✓ Branch 0 taken 12710 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 12710 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 12710 times.
 12710 if ((separator == string::npos) || (separator == (line.size() - 1))) {
457 ✗ return false;
458 }
459
460
2/4
✓ Branch 1 taken 12710 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 12710 times.
✗ Branch 5 not taken.
 12710 const uint64_t size = String2Uint64(line.substr(separator + 1));
461 12710 *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 12710 times.
✗ Branch 2 not taken.
 12710 const std::string hash_string = line.substr(2, separator - 2);
466 12710 const shash::HexPtr hex_ptr(hash_string);
467
468
1/2
✓ Branch 1 taken 12710 times.
✗ Branch 2 not taken.
 12710 entry->id = shash::MkFromSuffixedHexPtr(hex_ptr);
469 12710 entry->size = size;
470 12710 entry->entry_type = entry_type;
471
1/2
✓ Branch 1 taken 12710 times.
✗ Branch 2 not taken.
 12710 entry->entry_name = "";
472
1/2
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
 12712 } else if (line[0] == 'N') { // Named file
473 2 const ObjectPack::BucketContentType entry_type = ObjectPack::kNamed;
474
475 // First separator, before the size field
476 2 const size_t separator1 = line.find(' ', 2);
477
3/6
✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 2 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 2 times.
 2 if ((separator1 == string::npos) || (separator1 == (line.size() - 1))) {
478 ✗ return false;
479 }
480
481 // Second separator, before the name field
482 2 const size_t separator2 = line.find(' ', separator1 + 1);
483
1/2
✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.
 2 if ((separator1 == 0) || (separator1 == string::npos)
484
3/6
✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 2 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 2 times.
 4 || (separator1 == (line.size() - 1))) {
485 ✗ return false;
486 }
487
488
1/2
✓ Branch 1 taken 2 times.
✗ Branch 2 not taken.
 2 const uint64_t size = String2Uint64(
489
1/2
✓ Branch 1 taken 2 times.
✗ Branch 2 not taken.
 4 line.substr(separator1 + 1, separator2 - separator1 - 1));
490
491 2 std::string name;
492
3/7
✓ Branch 1 taken 2 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 2 times.
✗ Branch 5 not taken.
✗ Branch 7 not taken.
✓ Branch 8 taken 2 times.
 2 if (!Debase64(line.substr(separator2 + 1), &name)) {
493 ✗ return false;
494 }
495
496 2 *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 2 times.
✗ Branch 2 not taken.
 2 const std::string hash_string = line.substr(2, separator1 - 2);
501 2 const shash::HexPtr hex_ptr(hash_string);
502
503
1/2
✓ Branch 1 taken 2 times.
✗ Branch 2 not taken.
 2 entry->id = shash::MkFromSuffixedHexPtr(hex_ptr);
504 2 entry->size = size;
505 2 entry->entry_type = entry_type;
506
1/2
✓ Branch 1 taken 2 times.
✗ Branch 2 not taken.
 2 entry->entry_name = name;
507
1/2
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
 2 } else { // Error
508 ✗ return false;
509 }
510
511 12712 return true;
512 }
513