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