2011-03-18 23:37:00 +01: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.
|
|
|
|
|
|
|
|
#ifndef STORAGE_LEVELDB_DB_DB_IMPL_H_
|
|
|
|
#define STORAGE_LEVELDB_DB_DB_IMPL_H_
|
|
|
|
|
2012-03-09 01:23:21 +01:00
|
|
|
#include <deque>
|
2011-03-18 23:37:00 +01:00
|
|
|
#include <set>
|
|
|
|
#include "db/dbformat.h"
|
|
|
|
#include "db/log_writer.h"
|
|
|
|
#include "db/snapshot.h"
|
2011-03-30 20:35:40 +02:00
|
|
|
#include "leveldb/db.h"
|
|
|
|
#include "leveldb/env.h"
|
2011-03-18 23:37:00 +01:00
|
|
|
#include "port/port.h"
|
2012-08-15 00:20:36 +02:00
|
|
|
#include "util/stats_logger.h"
|
|
|
|
|
|
|
|
#ifdef USE_SCRIBE
|
|
|
|
#include "scribe/scribe_logger.h"
|
|
|
|
#endif
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
namespace leveldb {
|
|
|
|
|
|
|
|
class MemTable;
|
|
|
|
class TableCache;
|
|
|
|
class Version;
|
|
|
|
class VersionEdit;
|
|
|
|
class VersionSet;
|
|
|
|
|
|
|
|
class DBImpl : public DB {
|
|
|
|
public:
|
|
|
|
DBImpl(const Options& options, const std::string& dbname);
|
|
|
|
virtual ~DBImpl();
|
|
|
|
|
|
|
|
// Implementations of the DB interface
|
|
|
|
virtual Status Put(const WriteOptions&, const Slice& key, const Slice& value);
|
|
|
|
virtual Status Delete(const WriteOptions&, const Slice& key);
|
|
|
|
virtual Status Write(const WriteOptions& options, WriteBatch* updates);
|
|
|
|
virtual Status Get(const ReadOptions& options,
|
|
|
|
const Slice& key,
|
|
|
|
std::string* value);
|
|
|
|
virtual Iterator* NewIterator(const ReadOptions&);
|
|
|
|
virtual const Snapshot* GetSnapshot();
|
|
|
|
virtual void ReleaseSnapshot(const Snapshot* snapshot);
|
2011-04-12 21:38:58 +02:00
|
|
|
virtual bool GetProperty(const Slice& property, std::string* value);
|
2011-03-18 23:37:00 +01:00
|
|
|
virtual void GetApproximateSizes(const Range* range, int n, uint64_t* sizes);
|
2011-10-06 01:30:28 +02:00
|
|
|
virtual void CompactRange(const Slice* begin, const Slice* end);
|
2012-06-23 04:30:03 +02:00
|
|
|
virtual int NumberLevels();
|
|
|
|
virtual int MaxMemCompactionLevel();
|
|
|
|
virtual int Level0StopWriteTrigger();
|
2012-07-06 20:42:09 +02:00
|
|
|
virtual Status Flush(const FlushOptions& options);
|
2012-09-15 02:11:35 +02:00
|
|
|
virtual Status DisableFileDeletions();
|
|
|
|
virtual Status EnableFileDeletions();
|
2012-09-24 23:01:01 +02:00
|
|
|
virtual Status GetLiveFiles(std::vector<std::string>&,
|
|
|
|
uint64_t* manifest_file_size);
|
2011-03-18 23:37:00 +01:00
|
|
|
|
|
|
|
// Extra methods (for testing) that are not in the public DB interface
|
|
|
|
|
2011-10-06 01:30:28 +02:00
|
|
|
// Compact any files in the named level that overlap [*begin,*end]
|
|
|
|
void TEST_CompactRange(int level, const Slice* begin, const Slice* end);
|
2011-03-18 23:37:00 +01:00
|
|
|
|
|
|
|
// Force current memtable contents to be compacted.
|
|
|
|
Status TEST_CompactMemTable();
|
|
|
|
|
2012-06-23 04:30:03 +02:00
|
|
|
// Wait for memtable compaction
|
|
|
|
Status TEST_WaitForCompactMemTable();
|
|
|
|
|
|
|
|
// Wait for any compaction
|
|
|
|
Status TEST_WaitForCompact();
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
// Return an internal iterator over the current state of the database.
|
|
|
|
// The keys of this iterator are internal keys (see format.h).
|
|
|
|
// The returned iterator should be deleted when no longer needed.
|
|
|
|
Iterator* TEST_NewInternalIterator();
|
|
|
|
|
2011-03-22 19:32:49 +01:00
|
|
|
// Return the maximum overlapping data (in bytes) at next level for any
|
|
|
|
// file at a level >= 1.
|
2011-03-23 00:24:02 +01:00
|
|
|
int64_t TEST_MaxNextLevelOverlappingBytes();
|
2011-03-22 19:32:49 +01:00
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
private:
|
|
|
|
friend class DB;
|
2012-03-09 01:23:21 +01:00
|
|
|
struct CompactionState;
|
|
|
|
struct Writer;
|
2012-10-21 10:49:48 +02:00
|
|
|
struct DeletionState;
|
2011-03-18 23:37:00 +01:00
|
|
|
|
|
|
|
Iterator* NewInternalIterator(const ReadOptions&,
|
|
|
|
SequenceNumber* latest_snapshot);
|
|
|
|
|
|
|
|
Status NewDB();
|
|
|
|
|
|
|
|
// Recover the descriptor from persistent storage. May do a significant
|
|
|
|
// amount of work to recover recently logged updates. Any changes to
|
|
|
|
// be made to the descriptor are added to *edit.
|
|
|
|
Status Recover(VersionEdit* edit);
|
|
|
|
|
|
|
|
void MaybeIgnoreError(Status* s) const;
|
|
|
|
|
|
|
|
// Delete any unneeded files and stale in-memory entries.
|
|
|
|
void DeleteObsoleteFiles();
|
|
|
|
|
|
|
|
// Compact the in-memory write buffer to disk. Switches to a new
|
|
|
|
// log-file/memtable and writes a new descriptor iff successful.
|
|
|
|
Status CompactMemTable();
|
|
|
|
|
|
|
|
Status RecoverLogFile(uint64_t log_number,
|
|
|
|
VersionEdit* edit,
|
|
|
|
SequenceNumber* max_sequence);
|
|
|
|
|
2011-06-22 04:36:45 +02:00
|
|
|
Status WriteLevel0Table(MemTable* mem, VersionEdit* edit, Version* base);
|
2011-03-18 23:37:00 +01:00
|
|
|
|
2011-04-12 21:38:58 +02:00
|
|
|
Status MakeRoomForWrite(bool force /* compact even if there is room? */);
|
2012-03-09 01:23:21 +01:00
|
|
|
WriteBatch* BuildBatchGroup(Writer** last_writer);
|
2011-03-18 23:37:00 +01:00
|
|
|
|
2012-07-06 20:42:09 +02:00
|
|
|
// Force current memtable contents to be flushed.
|
|
|
|
Status FlushMemTable(const FlushOptions& options);
|
|
|
|
|
|
|
|
// Wait for memtable compaction
|
|
|
|
Status WaitForCompactMemTable();
|
|
|
|
|
2012-08-15 00:20:36 +02:00
|
|
|
void MaybeScheduleLogDBDeployStats();
|
2012-08-27 09:50:26 +02:00
|
|
|
static void BGLogDBDeployStats(void* db);
|
|
|
|
void LogDBDeployStats();
|
2012-08-15 00:20:36 +02:00
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
void MaybeScheduleCompaction();
|
|
|
|
static void BGWork(void* db);
|
|
|
|
void BackgroundCall();
|
2012-10-21 10:49:48 +02:00
|
|
|
Status BackgroundCompaction(DeletionState& deletion_state);
|
2011-03-18 23:37:00 +01:00
|
|
|
void CleanupCompaction(CompactionState* compact);
|
|
|
|
Status DoCompactionWork(CompactionState* compact);
|
|
|
|
|
|
|
|
Status OpenCompactionOutputFile(CompactionState* compact);
|
|
|
|
Status FinishCompactionOutputFile(CompactionState* compact, Iterator* input);
|
|
|
|
Status InstallCompactionResults(CompactionState* compact);
|
|
|
|
|
2012-10-21 10:49:48 +02:00
|
|
|
// Returns the list of live files in 'live' and the list
|
|
|
|
// of all files in the filesystem in 'allfiles'.
|
|
|
|
void FindObsoleteFiles(DeletionState& deletion_state);
|
|
|
|
|
|
|
|
// Diffs the files listed in filenames and those that do not
|
|
|
|
// belong to live files are posibly removed. If the removed file
|
|
|
|
// is a sst file, then it returns the file number in files_to_evict.
|
|
|
|
void PurgeObsoleteFiles(DeletionState& deletion_state);
|
|
|
|
|
|
|
|
// Removes the file listed in files_to_evict from the table_cache
|
|
|
|
void EvictObsoleteFiles(DeletionState& deletion_state);
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
// Constant after construction
|
|
|
|
Env* const env_;
|
|
|
|
const InternalKeyComparator internal_comparator_;
|
2012-04-17 17:36:46 +02:00
|
|
|
const InternalFilterPolicy internal_filter_policy_;
|
2011-03-18 23:37:00 +01:00
|
|
|
const Options options_; // options_.comparator == &internal_comparator_
|
|
|
|
bool owns_info_log_;
|
2011-04-12 21:38:58 +02:00
|
|
|
bool owns_cache_;
|
2011-03-18 23:37:00 +01:00
|
|
|
const std::string dbname_;
|
|
|
|
|
|
|
|
// table_cache_ provides its own synchronization
|
|
|
|
TableCache* table_cache_;
|
|
|
|
|
|
|
|
// Lock over the persistent DB state. Non-NULL iff successfully acquired.
|
|
|
|
FileLock* db_lock_;
|
|
|
|
|
|
|
|
// State below is protected by mutex_
|
|
|
|
port::Mutex mutex_;
|
|
|
|
port::AtomicPointer shutting_down_;
|
2011-06-07 16:40:26 +02:00
|
|
|
port::CondVar bg_cv_; // Signalled when background work finishes
|
2011-03-18 23:37:00 +01:00
|
|
|
MemTable* mem_;
|
2011-04-12 21:38:58 +02:00
|
|
|
MemTable* imm_; // Memtable being compacted
|
|
|
|
port::AtomicPointer has_imm_; // So bg thread can detect non-NULL imm_
|
2011-03-18 23:37:00 +01:00
|
|
|
WritableFile* logfile_;
|
2011-06-22 04:36:45 +02:00
|
|
|
uint64_t logfile_number_;
|
2011-03-18 23:37:00 +01:00
|
|
|
log::Writer* log_;
|
2012-03-09 01:23:21 +01:00
|
|
|
|
2012-08-15 00:20:36 +02:00
|
|
|
std::string host_name_;
|
|
|
|
|
2012-03-09 01:23:21 +01:00
|
|
|
// Queue of writers.
|
|
|
|
std::deque<Writer*> writers_;
|
|
|
|
WriteBatch* tmp_batch_;
|
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
SnapshotList snapshots_;
|
|
|
|
|
|
|
|
// Set of table files to protect from deletion because they are
|
|
|
|
// part of ongoing compactions.
|
|
|
|
std::set<uint64_t> pending_outputs_;
|
|
|
|
|
|
|
|
// Has a background compaction been scheduled or is running?
|
|
|
|
bool bg_compaction_scheduled_;
|
|
|
|
|
2012-08-27 09:50:26 +02:00
|
|
|
// Has a background stats log thread scheduled?
|
|
|
|
bool bg_logstats_scheduled_;
|
|
|
|
|
2011-06-07 16:40:26 +02:00
|
|
|
// Information for a manual compaction
|
|
|
|
struct ManualCompaction {
|
|
|
|
int level;
|
2011-10-06 01:30:28 +02:00
|
|
|
bool done;
|
|
|
|
const InternalKey* begin; // NULL means beginning of key range
|
|
|
|
const InternalKey* end; // NULL means end of key range
|
|
|
|
InternalKey tmp_storage; // Used to keep track of compaction progress
|
2011-06-07 16:40:26 +02:00
|
|
|
};
|
|
|
|
ManualCompaction* manual_compaction_;
|
2011-03-18 23:37:00 +01:00
|
|
|
|
|
|
|
VersionSet* versions_;
|
|
|
|
|
|
|
|
// Have we encountered a background error in paranoid mode?
|
|
|
|
Status bg_error_;
|
|
|
|
|
2012-08-15 00:20:36 +02:00
|
|
|
StatsLogger* logger_;
|
|
|
|
|
2012-08-22 02:02:21 +02:00
|
|
|
int64_t volatile last_log_ts;
|
2012-08-15 00:20:36 +02:00
|
|
|
|
2012-09-15 02:11:35 +02:00
|
|
|
// shall we disable deletion of obsolete files
|
|
|
|
bool disable_delete_obsolete_files_;
|
|
|
|
|
2012-10-16 17:53:46 +02:00
|
|
|
// last time when DeleteObsoleteFiles was invoked
|
|
|
|
uint64_t delete_obsolete_files_last_run_;
|
|
|
|
|
2011-04-12 21:38:58 +02:00
|
|
|
// Per level compaction stats. stats_[level] stores the stats for
|
|
|
|
// compactions that produced data for the specified "level".
|
|
|
|
struct CompactionStats {
|
|
|
|
int64_t micros;
|
|
|
|
int64_t bytes_read;
|
|
|
|
int64_t bytes_written;
|
|
|
|
|
|
|
|
CompactionStats() : micros(0), bytes_read(0), bytes_written(0) { }
|
|
|
|
|
|
|
|
void Add(const CompactionStats& c) {
|
|
|
|
this->micros += c.micros;
|
|
|
|
this->bytes_read += c.bytes_read;
|
|
|
|
this->bytes_written += c.bytes_written;
|
|
|
|
}
|
|
|
|
};
|
2012-06-23 04:30:03 +02:00
|
|
|
CompactionStats* stats_;
|
2011-04-12 21:38:58 +02:00
|
|
|
|
2012-08-18 01:06:05 +02:00
|
|
|
static const int KEEP_LOG_FILE_NUM = 1000;
|
2012-09-06 02:44:13 +02:00
|
|
|
std::string db_absolute_path_;
|
2012-08-18 01:06:05 +02:00
|
|
|
|
2011-03-18 23:37:00 +01:00
|
|
|
// No copying allowed
|
|
|
|
DBImpl(const DBImpl&);
|
|
|
|
void operator=(const DBImpl&);
|
|
|
|
|
|
|
|
const Comparator* user_comparator() const {
|
|
|
|
return internal_comparator_.user_comparator();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Sanitize db options. The caller should delete result.info_log if
|
|
|
|
// it is not equal to src.info_log.
|
|
|
|
extern Options SanitizeOptions(const std::string& db,
|
|
|
|
const InternalKeyComparator* icmp,
|
2012-04-17 17:36:46 +02:00
|
|
|
const InternalFilterPolicy* ipolicy,
|
2011-03-18 23:37:00 +01:00
|
|
|
const Options& src);
|
|
|
|
|
2011-10-31 18:22:06 +01:00
|
|
|
} // namespace leveldb
|
2011-03-18 23:37:00 +01:00
|
|
|
|
|
|
|
#endif // STORAGE_LEVELDB_DB_DB_IMPL_H_
|