mirror of
https://github.com/facebook/sapling.git
synced 2024-10-05 06:18:07 +03:00
f19537e70e
Reviewed By: xavierd Differential Revision: D49860603 fbshipit-source-id: 7dc8d663b65e89d859ef692265873ee7b472fba5
89 lines
2.5 KiB
C++
89 lines
2.5 KiB
C++
/*
|
|
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
*
|
|
* This software may be used and distributed according to the terms of the
|
|
* GNU General Public License version 2.
|
|
*/
|
|
|
|
#include "eden/fs/model/Tree.h"
|
|
#include <folly/io/IOBuf.h>
|
|
|
|
namespace facebook::eden {
|
|
|
|
using namespace folly;
|
|
using namespace folly::io;
|
|
|
|
size_t Tree::getSizeBytes() const {
|
|
// TODO: we should consider using a standard memory framework across
|
|
// eden for this type of thing. D17174143 is one such idea.
|
|
size_t internal_size = sizeof(*this);
|
|
|
|
size_t indirect_size =
|
|
folly::goodMallocSize(sizeof(TreeEntry) * entries_.capacity());
|
|
|
|
for (auto& entry : entries_) {
|
|
indirect_size += estimateIndirectMemoryUsage(entry.first.value());
|
|
}
|
|
return internal_size + indirect_size;
|
|
}
|
|
|
|
IOBuf Tree::serialize() const {
|
|
size_t serialized_size = sizeof(uint32_t) + sizeof(uint32_t);
|
|
for (auto& entry : entries_) {
|
|
serialized_size += entry.second.serializedSize(entry.first);
|
|
}
|
|
IOBuf buf(IOBuf::CREATE, serialized_size);
|
|
Appender appender(&buf, 0);
|
|
|
|
XCHECK_LE(entries_.size(), std::numeric_limits<uint32_t>::max());
|
|
uint32_t numberOfEntries = static_cast<uint32_t>(entries_.size());
|
|
|
|
appender.write<uint32_t>(V1_VERSION);
|
|
appender.write<uint32_t>(numberOfEntries);
|
|
for (auto& entry : entries_) {
|
|
entry.second.serialize(entry.first, appender);
|
|
}
|
|
return buf;
|
|
}
|
|
|
|
TreePtr Tree::tryDeserialize(ObjectId hash, folly::StringPiece data) {
|
|
if (data.size() < sizeof(uint32_t)) {
|
|
XLOG(ERR) << "Can not read tree version, bytes remaining " << data.size();
|
|
return nullptr;
|
|
}
|
|
uint32_t version;
|
|
memcpy(&version, data.data(), sizeof(uint32_t));
|
|
data.advance(sizeof(uint32_t));
|
|
if (version != V1_VERSION) {
|
|
return nullptr;
|
|
}
|
|
|
|
if (data.size() < sizeof(uint32_t)) {
|
|
XLOG(ERR) << "Can not read tree size, bytes remaining " << data.size();
|
|
return nullptr;
|
|
}
|
|
uint32_t num_entries;
|
|
memcpy(&num_entries, data.data(), sizeof(uint32_t));
|
|
data.advance(sizeof(uint32_t));
|
|
|
|
Tree::container entries{kPathMapDefaultCaseSensitive};
|
|
entries.reserve(num_entries);
|
|
for (size_t i = 0; i < num_entries; i++) {
|
|
auto entry = TreeEntry::deserialize(data);
|
|
if (!entry) {
|
|
return nullptr;
|
|
}
|
|
entries.emplace(entry->first, std::move(entry->second));
|
|
}
|
|
|
|
if (!data.empty()) {
|
|
XLOG(ERR) << "Corrupted tree data, extra bytes remaining " << data.size();
|
|
return nullptr;
|
|
}
|
|
|
|
return std::make_shared<TreePtr::element_type>(
|
|
std::move(entries), std::move(hash));
|
|
}
|
|
|
|
} // namespace facebook::eden
|