GCC Code Coverage Report

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