GCC Code Coverage Report

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