2011-03-18 22:37:00 +00:00
|
|
|
// 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.
|
|
|
|
|
|
|
|
#include "db/table_cache.h"
|
|
|
|
|
|
|
|
#include "db/filename.h"
|
2013-02-25 21:58:34 +00:00
|
|
|
|
2013-08-23 15:38:13 +00:00
|
|
|
#include "rocksdb/statistics.h"
|
2013-04-22 22:20:20 +00:00
|
|
|
#include "table/table.h"
|
2011-03-18 22:37:00 +00:00
|
|
|
#include "util/coding.h"
|
2013-06-07 17:02:28 +00:00
|
|
|
#include "util/stop_watch.h"
|
2011-03-18 22:37:00 +00:00
|
|
|
|
2013-10-04 04:49:15 +00:00
|
|
|
namespace rocksdb {
|
2011-03-18 22:37:00 +00:00
|
|
|
|
|
|
|
static void DeleteEntry(const Slice& key, void* value) {
|
2013-04-05 18:26:46 +00:00
|
|
|
Table* table = reinterpret_cast<Table*>(value);
|
|
|
|
delete table;
|
2011-03-18 22:37:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void UnrefEntry(void* arg1, void* arg2) {
|
|
|
|
Cache* cache = reinterpret_cast<Cache*>(arg1);
|
|
|
|
Cache::Handle* h = reinterpret_cast<Cache::Handle*>(arg2);
|
|
|
|
cache->Release(h);
|
|
|
|
}
|
|
|
|
|
|
|
|
TableCache::TableCache(const std::string& dbname,
|
|
|
|
const Options* options,
|
2013-06-07 22:35:17 +00:00
|
|
|
const EnvOptions& storage_options,
|
2011-03-18 22:37:00 +00:00
|
|
|
int entries)
|
|
|
|
: env_(options->env),
|
|
|
|
dbname_(dbname),
|
|
|
|
options_(options),
|
2013-03-15 00:00:04 +00:00
|
|
|
storage_options_(storage_options),
|
2013-10-10 00:04:40 +00:00
|
|
|
cache_(
|
|
|
|
NewLRUCache(entries, options->table_cache_numshardbits,
|
|
|
|
options->table_cache_remove_scan_count_limit)) {
|
|
|
|
}
|
2011-03-18 22:37:00 +00:00
|
|
|
|
|
|
|
TableCache::~TableCache() {
|
|
|
|
}
|
|
|
|
|
2013-03-15 00:00:04 +00:00
|
|
|
Status TableCache::FindTable(const EnvOptions& toptions,
|
|
|
|
uint64_t file_number, uint64_t file_size,
|
2013-07-12 23:56:52 +00:00
|
|
|
Cache::Handle** handle, bool* table_io,
|
|
|
|
const bool no_io) {
|
2012-04-17 15:36:46 +00:00
|
|
|
Status s;
|
2011-03-18 22:37:00 +00:00
|
|
|
char buf[sizeof(file_number)];
|
|
|
|
EncodeFixed64(buf, file_number);
|
|
|
|
Slice key(buf, sizeof(buf));
|
2012-04-17 15:36:46 +00:00
|
|
|
*handle = cache_->Lookup(key);
|
2013-02-25 21:58:34 +00:00
|
|
|
if (*handle == nullptr) {
|
2013-07-12 23:56:52 +00:00
|
|
|
if (no_io) { // Dont do IO and return a not-found status
|
2013-08-25 05:48:51 +00:00
|
|
|
return Status::Incomplete("Table not found in table_cache, no_io is set");
|
2013-07-12 23:56:52 +00:00
|
|
|
}
|
|
|
|
if (table_io != nullptr) {
|
|
|
|
*table_io = true; // we had to do IO from storage
|
2012-09-27 08:05:38 +00:00
|
|
|
}
|
2011-03-18 22:37:00 +00:00
|
|
|
std::string fname = TableFileName(dbname_, file_number);
|
2013-01-20 10:07:13 +00:00
|
|
|
unique_ptr<RandomAccessFile> file;
|
|
|
|
unique_ptr<Table> table;
|
2013-03-15 00:00:04 +00:00
|
|
|
s = env_->NewRandomAccessFile(fname, &file, toptions);
|
2013-02-25 21:58:34 +00:00
|
|
|
RecordTick(options_->statistics, NO_FILE_OPENS);
|
2011-03-18 22:37:00 +00:00
|
|
|
if (s.ok()) {
|
2013-05-17 22:53:01 +00:00
|
|
|
if (options_->advise_random_on_open) {
|
|
|
|
file->Hint(RandomAccessFile::RANDOM);
|
|
|
|
}
|
2013-06-07 17:02:28 +00:00
|
|
|
StopWatch sw(env_, options_->statistics, TABLE_OPEN_IO_MICROS);
|
2013-03-15 00:00:04 +00:00
|
|
|
s = Table::Open(*options_, toptions, std::move(file), file_size, &table);
|
2011-03-18 22:37:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!s.ok()) {
|
2013-02-25 21:58:34 +00:00
|
|
|
assert(table == nullptr);
|
|
|
|
RecordTick(options_->statistics, NO_FILE_ERRORS);
|
2011-03-18 22:37:00 +00:00
|
|
|
// We do not cache error results so that if the error is transient,
|
|
|
|
// or somebody repairs the file, we recover automatically.
|
2012-04-17 15:36:46 +00:00
|
|
|
} else {
|
2013-03-04 21:33:16 +00:00
|
|
|
assert(file.get() == nullptr);
|
2013-04-05 18:26:46 +00:00
|
|
|
*handle = cache_->Insert(key, table.release(), 1, &DeleteEntry);
|
2011-03-18 22:37:00 +00:00
|
|
|
}
|
2012-04-17 15:36:46 +00:00
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
2011-03-18 22:37:00 +00:00
|
|
|
|
2012-04-17 15:36:46 +00:00
|
|
|
Iterator* TableCache::NewIterator(const ReadOptions& options,
|
2013-03-15 00:00:04 +00:00
|
|
|
const EnvOptions& toptions,
|
2012-04-17 15:36:46 +00:00
|
|
|
uint64_t file_number,
|
|
|
|
uint64_t file_size,
|
2013-05-17 22:53:01 +00:00
|
|
|
Table** tableptr,
|
|
|
|
bool for_compaction) {
|
2013-02-25 21:58:34 +00:00
|
|
|
if (tableptr != nullptr) {
|
|
|
|
*tableptr = nullptr;
|
2012-04-17 15:36:46 +00:00
|
|
|
}
|
|
|
|
|
2013-02-25 21:58:34 +00:00
|
|
|
Cache::Handle* handle = nullptr;
|
2013-08-25 05:48:51 +00:00
|
|
|
Status s = FindTable(toptions, file_number, file_size, &handle,
|
|
|
|
nullptr, options.read_tier == kBlockCacheTier);
|
2012-04-17 15:36:46 +00:00
|
|
|
if (!s.ok()) {
|
|
|
|
return NewErrorIterator(s);
|
2011-03-18 22:37:00 +00:00
|
|
|
}
|
|
|
|
|
2013-01-20 10:07:13 +00:00
|
|
|
Table* table =
|
2013-04-05 18:26:46 +00:00
|
|
|
reinterpret_cast<Table*>(cache_->Value(handle));
|
2011-03-18 22:37:00 +00:00
|
|
|
Iterator* result = table->NewIterator(options);
|
2013-01-20 10:07:13 +00:00
|
|
|
result->RegisterCleanup(&UnrefEntry, cache_.get(), handle);
|
2013-02-25 21:58:34 +00:00
|
|
|
if (tableptr != nullptr) {
|
2011-03-18 22:37:00 +00:00
|
|
|
*tableptr = table;
|
|
|
|
}
|
2013-05-17 22:53:01 +00:00
|
|
|
|
|
|
|
if (for_compaction) {
|
2013-06-14 00:25:09 +00:00
|
|
|
table->SetupForCompaction();
|
2013-05-17 22:53:01 +00:00
|
|
|
}
|
|
|
|
|
2011-03-18 22:37:00 +00:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2012-04-17 15:36:46 +00:00
|
|
|
Status TableCache::Get(const ReadOptions& options,
|
|
|
|
uint64_t file_number,
|
|
|
|
uint64_t file_size,
|
|
|
|
const Slice& k,
|
|
|
|
void* arg,
|
2013-03-21 22:59:47 +00:00
|
|
|
bool (*saver)(void*, const Slice&, const Slice&, bool),
|
2013-07-12 23:56:52 +00:00
|
|
|
bool* table_io,
|
2013-08-25 05:48:51 +00:00
|
|
|
void (*mark_key_may_exist)(void*)) {
|
2013-02-25 21:58:34 +00:00
|
|
|
Cache::Handle* handle = nullptr;
|
2013-03-15 00:00:04 +00:00
|
|
|
Status s = FindTable(storage_options_, file_number, file_size,
|
2013-08-25 05:48:51 +00:00
|
|
|
&handle, table_io,
|
|
|
|
options.read_tier == kBlockCacheTier);
|
2012-04-17 15:36:46 +00:00
|
|
|
if (s.ok()) {
|
2013-01-20 10:07:13 +00:00
|
|
|
Table* t =
|
2013-04-05 18:26:46 +00:00
|
|
|
reinterpret_cast<Table*>(cache_->Value(handle));
|
2013-08-25 05:48:51 +00:00
|
|
|
s = t->InternalGet(options, k, arg, saver, mark_key_may_exist);
|
2012-04-17 15:36:46 +00:00
|
|
|
cache_->Release(handle);
|
2013-08-25 05:48:51 +00:00
|
|
|
} else if (options.read_tier && s.IsIncomplete()) {
|
2013-07-12 23:56:52 +00:00
|
|
|
// Couldnt find Table in cache but treat as kFound if no_io set
|
|
|
|
(*mark_key_may_exist)(arg);
|
|
|
|
return Status::OK();
|
2012-04-17 15:36:46 +00:00
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
2013-08-23 21:49:57 +00:00
|
|
|
bool TableCache::PrefixMayMatch(const ReadOptions& options,
|
|
|
|
uint64_t file_number,
|
|
|
|
uint64_t file_size,
|
|
|
|
const Slice& internal_prefix,
|
|
|
|
bool* table_io) {
|
|
|
|
Cache::Handle* handle = nullptr;
|
|
|
|
Status s = FindTable(storage_options_, file_number,
|
|
|
|
file_size, &handle, table_io);
|
|
|
|
bool may_match = true;
|
|
|
|
if (s.ok()) {
|
|
|
|
Table* t =
|
|
|
|
reinterpret_cast<Table*>(cache_->Value(handle));
|
|
|
|
may_match = t->PrefixMayMatch(internal_prefix);
|
|
|
|
cache_->Release(handle);
|
|
|
|
}
|
|
|
|
return may_match;
|
|
|
|
}
|
|
|
|
|
2011-03-18 22:37:00 +00:00
|
|
|
void TableCache::Evict(uint64_t file_number) {
|
|
|
|
char buf[sizeof(file_number)];
|
|
|
|
EncodeFixed64(buf, file_number);
|
|
|
|
cache_->Erase(Slice(buf, sizeof(buf)));
|
|
|
|
}
|
|
|
|
|
2013-10-04 04:49:15 +00:00
|
|
|
} // namespace rocksdb
|