2016-02-09 23:12:00 +00:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2014-10-31 22:08:10 +00:00
|
|
|
// This source code is licensed under the BSD-style license found in the
|
|
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
//
|
|
|
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
|
|
|
2017-04-06 02:02:00 +00:00
|
|
|
#include "env/mock_env.h"
|
2014-10-31 22:08:10 +00:00
|
|
|
#include <algorithm>
|
|
|
|
#include <chrono>
|
2017-04-06 02:02:00 +00:00
|
|
|
#include "port/sys_time.h"
|
2014-10-31 22:16:31 +00:00
|
|
|
#include "util/murmurhash.h"
|
2017-04-06 02:02:00 +00:00
|
|
|
#include "util/random.h"
|
|
|
|
#include "util/rate_limiter.h"
|
2014-10-31 22:08:10 +00:00
|
|
|
|
|
|
|
namespace rocksdb {
|
|
|
|
|
|
|
|
class MemFile {
|
|
|
|
public:
|
2015-04-13 23:15:05 +00:00
|
|
|
explicit MemFile(Env* env, const std::string& fn, bool _is_lock_file = false)
|
|
|
|
: env_(env),
|
|
|
|
fn_(fn),
|
2014-11-11 21:47:22 +00:00
|
|
|
refs_(0),
|
2015-01-27 22:44:19 +00:00
|
|
|
is_lock_file_(_is_lock_file),
|
|
|
|
locked_(false),
|
2014-11-11 21:47:22 +00:00
|
|
|
size_(0),
|
|
|
|
modified_time_(Now()),
|
|
|
|
rnd_(static_cast<uint32_t>(
|
|
|
|
MurmurHash(fn.data(), static_cast<int>(fn.size()), 0))),
|
|
|
|
fsynced_bytes_(0) {}
|
2014-10-31 22:08:10 +00:00
|
|
|
|
|
|
|
void Ref() {
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
++refs_;
|
|
|
|
}
|
|
|
|
|
2015-01-27 22:44:19 +00:00
|
|
|
bool is_lock_file() const { return is_lock_file_; }
|
|
|
|
|
|
|
|
bool Lock() {
|
|
|
|
assert(is_lock_file_);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (locked_) {
|
|
|
|
return false;
|
|
|
|
} else {
|
2015-01-28 22:28:49 +00:00
|
|
|
locked_ = true;
|
2015-01-27 22:44:19 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Unlock() {
|
|
|
|
assert(is_lock_file_);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
locked_ = false;
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:08:10 +00:00
|
|
|
void Unref() {
|
|
|
|
bool do_delete = false;
|
|
|
|
{
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
--refs_;
|
|
|
|
assert(refs_ >= 0);
|
|
|
|
if (refs_ <= 0) {
|
|
|
|
do_delete = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (do_delete) {
|
|
|
|
delete this;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t Size() const {
|
|
|
|
return size_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Truncate(size_t size) {
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (size < size_) {
|
|
|
|
data_.resize(size);
|
|
|
|
size_ = size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:16:31 +00:00
|
|
|
void CorruptBuffer() {
|
|
|
|
if (fsynced_bytes_ >= size_) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
uint64_t buffered_bytes = size_ - fsynced_bytes_;
|
2014-11-11 21:47:22 +00:00
|
|
|
uint64_t start =
|
|
|
|
fsynced_bytes_ + rnd_.Uniform(static_cast<int>(buffered_bytes));
|
2014-10-31 22:16:31 +00:00
|
|
|
uint64_t end = std::min(start + 512, size_.load());
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
for (uint64_t pos = start; pos < end; ++pos) {
|
|
|
|
data_[pos] = static_cast<char>(rnd_.Uniform(256));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:08:10 +00:00
|
|
|
Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const {
|
|
|
|
MutexLock lock(&mutex_);
|
2016-05-27 19:10:26 +00:00
|
|
|
const uint64_t available = Size() - std::min(Size(), offset);
|
2014-10-31 22:08:10 +00:00
|
|
|
if (n > available) {
|
|
|
|
n = available;
|
|
|
|
}
|
|
|
|
if (n == 0) {
|
|
|
|
*result = Slice();
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
if (scratch) {
|
|
|
|
memcpy(scratch, &(data_[offset]), n);
|
|
|
|
*result = Slice(scratch, n);
|
|
|
|
} else {
|
|
|
|
*result = Slice(&(data_[offset]), n);
|
|
|
|
}
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2017-03-13 16:41:30 +00:00
|
|
|
Status Write(uint64_t offset, const Slice& data) {
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (offset + data.size() > data_.size()) {
|
|
|
|
data_.resize(offset + data.size());
|
|
|
|
}
|
|
|
|
data_.replace(offset, data.size(), data.data(), data.size());
|
|
|
|
size_ = data_.size();
|
|
|
|
modified_time_ = Now();
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:08:10 +00:00
|
|
|
Status Append(const Slice& data) {
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
data_.append(data.data(), data.size());
|
|
|
|
size_ = data_.size();
|
|
|
|
modified_time_ = Now();
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status Fsync() {
|
2014-10-31 22:16:31 +00:00
|
|
|
fsynced_bytes_ = size_.load();
|
2014-10-31 22:08:10 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t ModifiedTime() const {
|
|
|
|
return modified_time_;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
uint64_t Now() {
|
2015-04-13 23:15:05 +00:00
|
|
|
int64_t unix_time;
|
|
|
|
auto s = env_->GetCurrentTime(&unix_time);
|
|
|
|
assert(s.ok());
|
|
|
|
return static_cast<uint64_t>(unix_time);
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Private since only Unref() should be used to delete it.
|
|
|
|
~MemFile() {
|
|
|
|
assert(refs_ == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
// No copying allowed.
|
|
|
|
MemFile(const MemFile&);
|
|
|
|
void operator=(const MemFile&);
|
|
|
|
|
2015-04-13 23:15:05 +00:00
|
|
|
Env* env_;
|
2014-10-31 22:08:10 +00:00
|
|
|
const std::string fn_;
|
|
|
|
mutable port::Mutex mutex_;
|
|
|
|
int refs_;
|
2015-01-27 22:44:19 +00:00
|
|
|
bool is_lock_file_;
|
|
|
|
bool locked_;
|
2014-10-31 22:08:10 +00:00
|
|
|
|
2014-10-31 22:16:31 +00:00
|
|
|
// Data written into this file, all bytes before fsynced_bytes are
|
|
|
|
// persistent.
|
2014-10-31 22:08:10 +00:00
|
|
|
std::string data_;
|
|
|
|
std::atomic<uint64_t> size_;
|
|
|
|
std::atomic<uint64_t> modified_time_;
|
2014-10-31 22:16:31 +00:00
|
|
|
|
|
|
|
Random rnd_;
|
|
|
|
std::atomic<uint64_t> fsynced_bytes_;
|
2014-10-31 22:08:10 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
2015-02-03 06:32:11 +00:00
|
|
|
class MockSequentialFile : public SequentialFile {
|
2014-10-31 22:08:10 +00:00
|
|
|
public:
|
2015-02-03 06:32:11 +00:00
|
|
|
explicit MockSequentialFile(MemFile* file) : file_(file), pos_(0) {
|
2014-10-31 22:08:10 +00:00
|
|
|
file_->Ref();
|
|
|
|
}
|
|
|
|
|
2015-02-03 06:32:11 +00:00
|
|
|
~MockSequentialFile() {
|
2014-10-31 22:08:10 +00:00
|
|
|
file_->Unref();
|
|
|
|
}
|
|
|
|
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual Status Read(size_t n, Slice* result, char* scratch) override {
|
2014-10-31 22:08:10 +00:00
|
|
|
Status s = file_->Read(pos_, n, result, scratch);
|
|
|
|
if (s.ok()) {
|
|
|
|
pos_ += result->size();
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual Status Skip(uint64_t n) override {
|
2014-10-31 22:08:10 +00:00
|
|
|
if (pos_ > file_->Size()) {
|
|
|
|
return Status::IOError("pos_ > file_->Size()");
|
|
|
|
}
|
|
|
|
const size_t available = file_->Size() - pos_;
|
|
|
|
if (n > available) {
|
|
|
|
n = available;
|
|
|
|
}
|
|
|
|
pos_ += n;
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
MemFile* file_;
|
|
|
|
size_t pos_;
|
|
|
|
};
|
|
|
|
|
2015-02-03 06:32:11 +00:00
|
|
|
class MockRandomAccessFile : public RandomAccessFile {
|
2014-10-31 22:08:10 +00:00
|
|
|
public:
|
2015-02-03 06:32:11 +00:00
|
|
|
explicit MockRandomAccessFile(MemFile* file) : file_(file) {
|
2014-10-31 22:08:10 +00:00
|
|
|
file_->Ref();
|
|
|
|
}
|
|
|
|
|
2015-02-03 06:32:11 +00:00
|
|
|
~MockRandomAccessFile() {
|
2014-10-31 22:08:10 +00:00
|
|
|
file_->Unref();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status Read(uint64_t offset, size_t n, Slice* result,
|
2015-02-26 19:28:41 +00:00
|
|
|
char* scratch) const override {
|
2014-10-31 22:08:10 +00:00
|
|
|
return file_->Read(offset, n, result, scratch);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
MemFile* file_;
|
|
|
|
};
|
|
|
|
|
2017-03-13 16:41:30 +00:00
|
|
|
class MockRandomRWFile : public RandomRWFile {
|
|
|
|
public:
|
|
|
|
explicit MockRandomRWFile(MemFile* file) : file_(file) { file_->Ref(); }
|
|
|
|
|
|
|
|
~MockRandomRWFile() { file_->Unref(); }
|
|
|
|
|
|
|
|
virtual Status Write(uint64_t offset, const Slice& data) override {
|
|
|
|
return file_->Write(offset, data);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status Read(uint64_t offset, size_t n, Slice* result,
|
|
|
|
char* scratch) const override {
|
|
|
|
return file_->Read(offset, n, result, scratch);
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual Status Close() override { return file_->Fsync(); }
|
|
|
|
|
|
|
|
virtual Status Flush() override { return Status::OK(); }
|
|
|
|
|
|
|
|
virtual Status Sync() override { return file_->Fsync(); }
|
|
|
|
|
|
|
|
private:
|
|
|
|
MemFile* file_;
|
|
|
|
};
|
|
|
|
|
2015-02-03 06:32:11 +00:00
|
|
|
class MockWritableFile : public WritableFile {
|
2014-10-31 22:08:10 +00:00
|
|
|
public:
|
2015-02-03 06:32:11 +00:00
|
|
|
MockWritableFile(MemFile* file, RateLimiter* rate_limiter)
|
2014-10-31 22:08:10 +00:00
|
|
|
: file_(file),
|
|
|
|
rate_limiter_(rate_limiter) {
|
|
|
|
file_->Ref();
|
|
|
|
}
|
|
|
|
|
2015-02-03 06:32:11 +00:00
|
|
|
~MockWritableFile() {
|
2014-10-31 22:08:10 +00:00
|
|
|
file_->Unref();
|
|
|
|
}
|
|
|
|
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual Status Append(const Slice& data) override {
|
2014-10-31 22:08:10 +00:00
|
|
|
uint64_t bytes_written = 0;
|
|
|
|
while (bytes_written < data.size()) {
|
|
|
|
auto bytes = RequestToken(data.size() - bytes_written);
|
|
|
|
Status s = file_->Append(Slice(data.data() + bytes_written, bytes));
|
|
|
|
if (!s.ok()) {
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
bytes_written += bytes;
|
|
|
|
}
|
|
|
|
return Status::OK();
|
|
|
|
}
|
2015-09-11 16:57:02 +00:00
|
|
|
virtual Status Truncate(uint64_t size) override {
|
2017-03-13 16:41:30 +00:00
|
|
|
file_->Truncate(size);
|
2015-09-11 16:57:02 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual Status Close() override { return file_->Fsync(); }
|
2014-10-31 22:08:10 +00:00
|
|
|
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual Status Flush() override { return Status::OK(); }
|
2014-10-31 22:08:10 +00:00
|
|
|
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual Status Sync() override { return file_->Fsync(); }
|
2014-10-31 22:08:10 +00:00
|
|
|
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual uint64_t GetFileSize() override { return file_->Size(); }
|
2014-10-31 22:08:10 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
inline size_t RequestToken(size_t bytes) {
|
|
|
|
if (rate_limiter_ && io_priority_ < Env::IO_TOTAL) {
|
|
|
|
bytes = std::min(bytes,
|
|
|
|
static_cast<size_t>(rate_limiter_->GetSingleBurstBytes()));
|
|
|
|
rate_limiter_->Request(bytes, io_priority_);
|
|
|
|
}
|
|
|
|
return bytes;
|
|
|
|
}
|
|
|
|
|
|
|
|
MemFile* file_;
|
|
|
|
RateLimiter* rate_limiter_;
|
|
|
|
};
|
|
|
|
|
|
|
|
class MockEnvDirectory : public Directory {
|
|
|
|
public:
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual Status Fsync() override { return Status::OK(); }
|
2014-10-31 22:08:10 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
class MockEnvFileLock : public FileLock {
|
|
|
|
public:
|
|
|
|
explicit MockEnvFileLock(const std::string& fname)
|
|
|
|
: fname_(fname) {}
|
|
|
|
|
|
|
|
std::string FileName() const {
|
|
|
|
return fname_;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const std::string fname_;
|
|
|
|
};
|
|
|
|
|
|
|
|
class TestMemLogger : public Logger {
|
|
|
|
private:
|
|
|
|
std::unique_ptr<WritableFile> file_;
|
|
|
|
std::atomic_size_t log_size_;
|
|
|
|
static const uint64_t flush_every_seconds_ = 5;
|
|
|
|
std::atomic_uint_fast64_t last_flush_micros_;
|
|
|
|
Env* env_;
|
|
|
|
bool flush_pending_;
|
|
|
|
|
|
|
|
public:
|
|
|
|
TestMemLogger(std::unique_ptr<WritableFile> f, Env* env,
|
|
|
|
const InfoLogLevel log_level = InfoLogLevel::ERROR_LEVEL)
|
|
|
|
: Logger(log_level),
|
|
|
|
file_(std::move(f)),
|
|
|
|
log_size_(0),
|
|
|
|
last_flush_micros_(0),
|
|
|
|
env_(env),
|
|
|
|
flush_pending_(false) {}
|
|
|
|
virtual ~TestMemLogger() {
|
|
|
|
}
|
|
|
|
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual void Flush() override {
|
2014-10-31 22:08:10 +00:00
|
|
|
if (flush_pending_) {
|
|
|
|
flush_pending_ = false;
|
|
|
|
}
|
|
|
|
last_flush_micros_ = env_->NowMicros();
|
|
|
|
}
|
2015-02-01 19:08:19 +00:00
|
|
|
|
|
|
|
using Logger::Logv;
|
2015-02-26 19:28:41 +00:00
|
|
|
virtual void Logv(const char* format, va_list ap) override {
|
2014-10-31 22:08:10 +00:00
|
|
|
// We try twice: the first time with a fixed-size stack allocated buffer,
|
|
|
|
// and the second time with a much larger dynamically allocated buffer.
|
|
|
|
char buffer[500];
|
|
|
|
for (int iter = 0; iter < 2; iter++) {
|
|
|
|
char* base;
|
|
|
|
int bufsize;
|
|
|
|
if (iter == 0) {
|
|
|
|
bufsize = sizeof(buffer);
|
|
|
|
base = buffer;
|
|
|
|
} else {
|
|
|
|
bufsize = 30000;
|
|
|
|
base = new char[bufsize];
|
|
|
|
}
|
|
|
|
char* p = base;
|
|
|
|
char* limit = base + bufsize;
|
|
|
|
|
|
|
|
struct timeval now_tv;
|
|
|
|
gettimeofday(&now_tv, nullptr);
|
|
|
|
const time_t seconds = now_tv.tv_sec;
|
|
|
|
struct tm t;
|
|
|
|
localtime_r(&seconds, &t);
|
|
|
|
p += snprintf(p, limit - p,
|
|
|
|
"%04d/%02d/%02d-%02d:%02d:%02d.%06d ",
|
|
|
|
t.tm_year + 1900,
|
|
|
|
t.tm_mon + 1,
|
|
|
|
t.tm_mday,
|
|
|
|
t.tm_hour,
|
|
|
|
t.tm_min,
|
|
|
|
t.tm_sec,
|
|
|
|
static_cast<int>(now_tv.tv_usec));
|
|
|
|
|
|
|
|
// Print the message
|
|
|
|
if (p < limit) {
|
|
|
|
va_list backup_ap;
|
|
|
|
va_copy(backup_ap, ap);
|
|
|
|
p += vsnprintf(p, limit - p, format, backup_ap);
|
|
|
|
va_end(backup_ap);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Truncate to available space if necessary
|
|
|
|
if (p >= limit) {
|
|
|
|
if (iter == 0) {
|
|
|
|
continue; // Try again with larger buffer
|
|
|
|
} else {
|
|
|
|
p = limit - 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add newline if necessary
|
|
|
|
if (p == base || p[-1] != '\n') {
|
|
|
|
*p++ = '\n';
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(p <= limit);
|
|
|
|
const size_t write_size = p - base;
|
|
|
|
|
|
|
|
file_->Append(Slice(base, write_size));
|
|
|
|
flush_pending_ = true;
|
|
|
|
log_size_ += write_size;
|
|
|
|
uint64_t now_micros = static_cast<uint64_t>(now_tv.tv_sec) * 1000000 +
|
|
|
|
now_tv.tv_usec;
|
|
|
|
if (now_micros - last_flush_micros_ >= flush_every_seconds_ * 1000000) {
|
|
|
|
flush_pending_ = false;
|
|
|
|
last_flush_micros_ = now_micros;
|
|
|
|
}
|
|
|
|
if (base != buffer) {
|
|
|
|
delete[] base;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2015-02-26 19:28:41 +00:00
|
|
|
size_t GetLogFileSize() const override { return log_size_; }
|
2014-10-31 22:08:10 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
} // Anonymous namespace
|
|
|
|
|
2015-04-13 23:15:05 +00:00
|
|
|
MockEnv::MockEnv(Env* base_env) : EnvWrapper(base_env), fake_sleep_micros_(0) {}
|
2014-10-31 22:08:10 +00:00
|
|
|
|
|
|
|
MockEnv::~MockEnv() {
|
|
|
|
for (FileSystem::iterator i = file_map_.begin(); i != file_map_.end(); ++i) {
|
|
|
|
i->second->Unref();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Partial implementation of the Env interface.
|
|
|
|
Status MockEnv::NewSequentialFile(const std::string& fname,
|
|
|
|
unique_ptr<SequentialFile>* result,
|
|
|
|
const EnvOptions& soptions) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(fn) == file_map_.end()) {
|
|
|
|
*result = NULL;
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
auto* f = file_map_[fn];
|
2015-01-27 22:44:19 +00:00
|
|
|
if (f->is_lock_file()) {
|
|
|
|
return Status::InvalidArgument(fn, "Cannot open a lock file.");
|
|
|
|
}
|
2015-02-03 06:32:11 +00:00
|
|
|
result->reset(new MockSequentialFile(f));
|
2014-10-31 22:08:10 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::NewRandomAccessFile(const std::string& fname,
|
|
|
|
unique_ptr<RandomAccessFile>* result,
|
|
|
|
const EnvOptions& soptions) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(fn) == file_map_.end()) {
|
|
|
|
*result = NULL;
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
auto* f = file_map_[fn];
|
2015-01-27 22:44:19 +00:00
|
|
|
if (f->is_lock_file()) {
|
|
|
|
return Status::InvalidArgument(fn, "Cannot open a lock file.");
|
|
|
|
}
|
2015-02-03 06:32:11 +00:00
|
|
|
result->reset(new MockRandomAccessFile(f));
|
2014-10-31 22:08:10 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2017-03-13 16:41:30 +00:00
|
|
|
Status MockEnv::NewRandomRWFile(const std::string& fname,
|
|
|
|
unique_ptr<RandomRWFile>* result,
|
|
|
|
const EnvOptions& soptions) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(fn) == file_map_.end()) {
|
|
|
|
*result = NULL;
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
auto* f = file_map_[fn];
|
|
|
|
if (f->is_lock_file()) {
|
|
|
|
return Status::InvalidArgument(fn, "Cannot open a lock file.");
|
|
|
|
}
|
|
|
|
result->reset(new MockRandomRWFile(f));
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::ReuseWritableFile(const std::string& fname,
|
|
|
|
const std::string& old_fname,
|
|
|
|
unique_ptr<WritableFile>* result,
|
|
|
|
const EnvOptions& options) {
|
|
|
|
auto s = RenameFile(old_fname, fname);
|
|
|
|
if (!s.ok()) {
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
result->reset();
|
|
|
|
return NewWritableFile(fname, result, options);
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:08:10 +00:00
|
|
|
Status MockEnv::NewWritableFile(const std::string& fname,
|
2016-12-22 20:51:29 +00:00
|
|
|
unique_ptr<WritableFile>* result,
|
|
|
|
const EnvOptions& env_options) {
|
2014-10-31 22:08:10 +00:00
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(fn) != file_map_.end()) {
|
|
|
|
DeleteFileInternal(fn);
|
|
|
|
}
|
2015-04-13 23:15:05 +00:00
|
|
|
MemFile* file = new MemFile(this, fn, false);
|
2014-10-31 22:08:10 +00:00
|
|
|
file->Ref();
|
|
|
|
file_map_[fn] = file;
|
|
|
|
|
2015-02-03 06:32:11 +00:00
|
|
|
result->reset(new MockWritableFile(file, env_options.rate_limiter));
|
2014-10-31 22:08:10 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::NewDirectory(const std::string& name,
|
|
|
|
unique_ptr<Directory>* result) {
|
|
|
|
result->reset(new MockEnvDirectory());
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2015-07-21 00:20:40 +00:00
|
|
|
Status MockEnv::FileExists(const std::string& fname) {
|
2014-10-31 22:08:10 +00:00
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(fn) != file_map_.end()) {
|
|
|
|
// File exists
|
2015-07-21 00:20:40 +00:00
|
|
|
return Status::OK();
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
// Now also check if fn exists as a dir
|
|
|
|
for (const auto& iter : file_map_) {
|
|
|
|
const std::string& filename = iter.first;
|
|
|
|
if (filename.size() >= fn.size() + 1 &&
|
|
|
|
filename[fn.size()] == '/' &&
|
|
|
|
Slice(filename).starts_with(Slice(fn))) {
|
2015-07-21 00:20:40 +00:00
|
|
|
return Status::OK();
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
}
|
2015-07-21 00:20:40 +00:00
|
|
|
return Status::NotFound();
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::GetChildren(const std::string& dir,
|
|
|
|
std::vector<std::string>* result) {
|
|
|
|
auto d = NormalizePath(dir);
|
2016-12-12 20:38:43 +00:00
|
|
|
bool found_dir = false;
|
2014-10-31 22:08:10 +00:00
|
|
|
{
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
result->clear();
|
|
|
|
for (const auto& iter : file_map_) {
|
|
|
|
const std::string& filename = iter.first;
|
|
|
|
|
2016-12-12 20:38:43 +00:00
|
|
|
if (filename == d) {
|
|
|
|
found_dir = true;
|
|
|
|
} else if (filename.size() >= d.size() + 1 && filename[d.size()] == '/' &&
|
|
|
|
Slice(filename).starts_with(Slice(d))) {
|
|
|
|
found_dir = true;
|
2014-10-31 22:08:10 +00:00
|
|
|
size_t next_slash = filename.find('/', d.size() + 1);
|
|
|
|
if (next_slash != std::string::npos) {
|
|
|
|
result->push_back(filename.substr(
|
|
|
|
d.size() + 1, next_slash - d.size() - 1));
|
|
|
|
} else {
|
|
|
|
result->push_back(filename.substr(d.size() + 1));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
result->erase(std::unique(result->begin(), result->end()), result->end());
|
2016-12-12 20:38:43 +00:00
|
|
|
return found_dir ? Status::OK() : Status::NotFound();
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void MockEnv::DeleteFileInternal(const std::string& fname) {
|
|
|
|
assert(fname == NormalizePath(fname));
|
2015-01-27 22:44:19 +00:00
|
|
|
const auto& pair = file_map_.find(fname);
|
|
|
|
if (pair != file_map_.end()) {
|
|
|
|
pair->second->Unref();
|
|
|
|
file_map_.erase(fname);
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::DeleteFile(const std::string& fname) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(fn) == file_map_.end()) {
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
|
|
|
|
DeleteFileInternal(fn);
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::CreateDir(const std::string& dirname) {
|
2016-12-12 20:38:43 +00:00
|
|
|
auto dn = NormalizePath(dirname);
|
|
|
|
if (file_map_.find(dn) == file_map_.end()) {
|
|
|
|
MemFile* file = new MemFile(this, dn, false);
|
|
|
|
file->Ref();
|
|
|
|
file_map_[dn] = file;
|
|
|
|
} else {
|
|
|
|
return Status::IOError();
|
|
|
|
}
|
2014-10-31 22:08:10 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::CreateDirIfMissing(const std::string& dirname) {
|
2016-12-12 20:38:43 +00:00
|
|
|
CreateDir(dirname);
|
2014-10-31 22:08:10 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::DeleteDir(const std::string& dirname) {
|
2016-12-12 20:38:43 +00:00
|
|
|
return DeleteFile(dirname);
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::GetFileSize(const std::string& fname, uint64_t* file_size) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
auto iter = file_map_.find(fn);
|
|
|
|
if (iter == file_map_.end()) {
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
|
|
|
|
*file_size = iter->second->Size();
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::GetFileModificationTime(const std::string& fname,
|
|
|
|
uint64_t* time) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
auto iter = file_map_.find(fn);
|
|
|
|
if (iter == file_map_.end()) {
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
*time = iter->second->ModifiedTime();
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2014-11-06 19:14:28 +00:00
|
|
|
Status MockEnv::RenameFile(const std::string& src, const std::string& dest) {
|
2014-10-31 22:08:10 +00:00
|
|
|
auto s = NormalizePath(src);
|
2014-11-06 19:14:28 +00:00
|
|
|
auto t = NormalizePath(dest);
|
2014-10-31 22:08:10 +00:00
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(s) == file_map_.end()) {
|
|
|
|
return Status::IOError(s, "File not found");
|
|
|
|
}
|
|
|
|
|
|
|
|
DeleteFileInternal(t);
|
|
|
|
file_map_[t] = file_map_[s];
|
|
|
|
file_map_.erase(s);
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2014-11-14 19:38:26 +00:00
|
|
|
Status MockEnv::LinkFile(const std::string& src, const std::string& dest) {
|
|
|
|
auto s = NormalizePath(src);
|
|
|
|
auto t = NormalizePath(dest);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(s) == file_map_.end()) {
|
|
|
|
return Status::IOError(s, "File not found");
|
|
|
|
}
|
|
|
|
|
|
|
|
DeleteFileInternal(t);
|
|
|
|
file_map_[t] = file_map_[s];
|
2017-03-13 16:41:30 +00:00
|
|
|
file_map_[t]->Ref(); // Otherwise it might get deleted when noone uses s
|
2014-11-14 19:38:26 +00:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:08:10 +00:00
|
|
|
Status MockEnv::NewLogger(const std::string& fname,
|
|
|
|
shared_ptr<Logger>* result) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
auto iter = file_map_.find(fn);
|
|
|
|
MemFile* file = nullptr;
|
|
|
|
if (iter == file_map_.end()) {
|
2015-04-13 23:15:05 +00:00
|
|
|
file = new MemFile(this, fn, false);
|
2014-10-31 22:08:10 +00:00
|
|
|
file->Ref();
|
|
|
|
file_map_[fn] = file;
|
|
|
|
} else {
|
|
|
|
file = iter->second;
|
|
|
|
}
|
2015-02-03 06:32:11 +00:00
|
|
|
std::unique_ptr<WritableFile> f(new MockWritableFile(file, nullptr));
|
2014-10-31 22:08:10 +00:00
|
|
|
result->reset(new TestMemLogger(std::move(f), this));
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::LockFile(const std::string& fname, FileLock** flock) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
{
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
if (file_map_.find(fn) != file_map_.end()) {
|
2015-01-27 22:44:19 +00:00
|
|
|
if (!file_map_[fn]->is_lock_file()) {
|
|
|
|
return Status::InvalidArgument(fname, "Not a lock file.");
|
|
|
|
}
|
|
|
|
if (!file_map_[fn]->Lock()) {
|
|
|
|
return Status::IOError(fn, "Lock is already held.");
|
|
|
|
}
|
|
|
|
} else {
|
2015-04-13 23:15:05 +00:00
|
|
|
auto* file = new MemFile(this, fn, true);
|
2015-01-27 22:44:19 +00:00
|
|
|
file->Ref();
|
|
|
|
file->Lock();
|
2015-02-04 23:32:06 +00:00
|
|
|
file_map_[fn] = file;
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
*flock = new MockEnvFileLock(fn);
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::UnlockFile(FileLock* flock) {
|
|
|
|
std::string fn = dynamic_cast<MockEnvFileLock*>(flock)->FileName();
|
|
|
|
{
|
|
|
|
MutexLock lock(&mutex_);
|
2015-01-27 22:44:19 +00:00
|
|
|
if (file_map_.find(fn) != file_map_.end()) {
|
|
|
|
if (!file_map_[fn]->is_lock_file()) {
|
|
|
|
return Status::InvalidArgument(fn, "Not a lock file.");
|
|
|
|
}
|
|
|
|
file_map_[fn]->Unlock();
|
2014-10-31 22:08:10 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
delete flock;
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
Status MockEnv::GetTestDirectory(std::string* path) {
|
|
|
|
*path = "/test";
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2015-04-13 23:15:05 +00:00
|
|
|
Status MockEnv::GetCurrentTime(int64_t* unix_time) {
|
|
|
|
auto s = EnvWrapper::GetCurrentTime(unix_time);
|
|
|
|
*unix_time += fake_sleep_micros_.load() / (1000 * 1000);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t MockEnv::NowMicros() {
|
|
|
|
return EnvWrapper::NowMicros() + fake_sleep_micros_.load();
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t MockEnv::NowNanos() {
|
|
|
|
return EnvWrapper::NowNanos() + fake_sleep_micros_.load() * 1000;
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:16:31 +00:00
|
|
|
// Non-virtual functions, specific to MockEnv
|
2014-10-31 22:08:10 +00:00
|
|
|
Status MockEnv::Truncate(const std::string& fname, size_t size) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
auto iter = file_map_.find(fn);
|
|
|
|
if (iter == file_map_.end()) {
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
iter->second->Truncate(size);
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:16:31 +00:00
|
|
|
Status MockEnv::CorruptBuffer(const std::string& fname) {
|
|
|
|
auto fn = NormalizePath(fname);
|
|
|
|
MutexLock lock(&mutex_);
|
|
|
|
auto iter = file_map_.find(fn);
|
|
|
|
if (iter == file_map_.end()) {
|
|
|
|
return Status::IOError(fn, "File not found");
|
|
|
|
}
|
|
|
|
iter->second->CorruptBuffer();
|
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:08:10 +00:00
|
|
|
std::string MockEnv::NormalizePath(const std::string path) {
|
|
|
|
std::string dst;
|
|
|
|
for (auto c : path) {
|
|
|
|
if (!dst.empty() && c == '/' && dst.back() == '/') {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
dst.push_back(c);
|
|
|
|
}
|
|
|
|
return dst;
|
|
|
|
}
|
|
|
|
|
2015-04-13 23:15:05 +00:00
|
|
|
void MockEnv::FakeSleepForMicroseconds(int64_t micros) {
|
|
|
|
fake_sleep_micros_.fetch_add(micros);
|
|
|
|
}
|
|
|
|
|
2014-10-31 22:08:10 +00:00
|
|
|
} // namespace rocksdb
|