mirror of
https://github.com/facebook/sapling.git
synced 2024-10-08 07:49:11 +03:00
aa5e6c7295
Summary: Update the copyright & license headers in C++ files to reflect the relicensing to GPLv2 Reviewed By: wez Differential Revision: D15487078 fbshipit-source-id: 19f24c933a64ecad0d3a692d0f8d2a38b4194b1d
113 lines
3.4 KiB
C++
113 lines
3.4 KiB
C++
/*
|
|
* Copyright (c) Facebook, Inc. and its affiliates.
|
|
*
|
|
* This software may be used and distributed according to the terms of the
|
|
* GNU General Public License version 2.
|
|
*/
|
|
#include "FakeObjectStore.h"
|
|
|
|
#include <folly/String.h>
|
|
#include <folly/futures/Future.h>
|
|
|
|
using folly::Future;
|
|
using folly::makeFuture;
|
|
using std::make_shared;
|
|
using std::make_unique;
|
|
using std::shared_ptr;
|
|
using std::unique_ptr;
|
|
using std::unordered_map;
|
|
|
|
namespace facebook {
|
|
namespace eden {
|
|
|
|
FakeObjectStore::FakeObjectStore() {}
|
|
|
|
FakeObjectStore::~FakeObjectStore() {}
|
|
|
|
void FakeObjectStore::addTree(Tree&& tree) {
|
|
auto treeHash = tree.getHash();
|
|
trees_.emplace(std::move(treeHash), std::move(tree));
|
|
}
|
|
|
|
void FakeObjectStore::addBlob(Blob&& blob) {
|
|
// Compute the blob metadata
|
|
auto sha1 = Hash::sha1(blob.getContents());
|
|
auto metadata =
|
|
BlobMetadata{sha1, blob.getContents().computeChainDataLength()};
|
|
|
|
auto blobHash = blob.getHash();
|
|
blobs_.emplace(blobHash, std::move(blob));
|
|
blobMetadata_.emplace(std::move(blobHash), metadata);
|
|
}
|
|
|
|
void FakeObjectStore::setTreeForCommit(const Hash& commitID, Tree&& tree) {
|
|
auto ret = commits_.emplace(commitID, std::move(tree));
|
|
if (!ret.second) {
|
|
// Warn the caller that a Tree has already been specified for this commit,
|
|
// which is likely a logical error. If this turns out to be something that
|
|
// we want to do in a test, then we can change this behavior.
|
|
throw std::runtime_error(folly::to<std::string>(
|
|
"tree already added for commit with id ", commitID));
|
|
}
|
|
}
|
|
|
|
Future<std::shared_ptr<const Tree>> FakeObjectStore::getTree(
|
|
const Hash& id) const {
|
|
++accessCounts_[id];
|
|
auto iter = trees_.find(id);
|
|
if (iter == trees_.end()) {
|
|
return makeFuture<shared_ptr<const Tree>>(
|
|
std::domain_error("tree " + id.toString() + " not found"));
|
|
}
|
|
return makeFuture(make_shared<Tree>(iter->second));
|
|
}
|
|
|
|
Future<std::shared_ptr<const Blob>> FakeObjectStore::getBlob(
|
|
const Hash& id) const {
|
|
++accessCounts_[id];
|
|
auto iter = blobs_.find(id);
|
|
if (iter == blobs_.end()) {
|
|
return makeFuture<shared_ptr<const Blob>>(
|
|
std::domain_error("blob " + id.toString() + " not found"));
|
|
}
|
|
return makeFuture(make_shared<Blob>(iter->second));
|
|
}
|
|
|
|
Future<shared_ptr<const Tree>> FakeObjectStore::getTreeForCommit(
|
|
const Hash& commitID) const {
|
|
++accessCounts_[commitID];
|
|
auto iter = commits_.find(commitID);
|
|
if (iter == commits_.end()) {
|
|
return makeFuture<shared_ptr<const Tree>>(std::domain_error(
|
|
"tree data for commit " + commitID.toString() + " not found"));
|
|
}
|
|
return makeFuture(make_shared<Tree>(iter->second));
|
|
}
|
|
|
|
Future<BlobMetadata> FakeObjectStore::getBlobMetadata(const Hash& id) const {
|
|
// Might be nice in the future to differentiate between blob and metadata
|
|
// accesses, since the latter can be cheaper.
|
|
++accessCounts_[id];
|
|
auto iter = blobMetadata_.find(id);
|
|
if (iter == blobMetadata_.end()) {
|
|
return makeFuture<BlobMetadata>(
|
|
std::domain_error("metadata for blob " + id.toString() + " not found"));
|
|
}
|
|
return makeFuture(iter->second);
|
|
}
|
|
|
|
folly::Future<folly::Unit> FakeObjectStore::prefetchBlobs(
|
|
const std::vector<Hash>&) const {
|
|
return folly::unit;
|
|
}
|
|
|
|
size_t FakeObjectStore::getAccessCount(const Hash& hash) const {
|
|
if (auto* item = folly::get_ptr(accessCounts_, hash)) {
|
|
return *item;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
} // namespace eden
|
|
} // namespace facebook
|