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