[ceph.git] / ceph / src / kv / LevelDBStore.h

// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
#ifndef LEVEL_DB_STORE_H
#define LEVEL_DB_STORE_H

#include "include/types.h"
#include "include/buffer_fwd.h"
#include "KeyValueDB.h"
#include <set>
#include <map>
#include <string>
#include "include/memory.h"
#include <boost/scoped_ptr.hpp>
#include "leveldb/db.h"
#include "leveldb/env.h"
#include "leveldb/write_batch.h"
#include "leveldb/slice.h"
#include "leveldb/cache.h"
#ifdef HAVE_LEVELDB_FILTER_POLICY
#include "leveldb/filter_policy.h"
#endif

#include <errno.h>
#include "common/errno.h"
#include "common/dout.h"
#include "include/assert.h"
#include "common/Formatter.h"
#include "common/Cond.h"

#include "common/ceph_context.h"

// reinclude our assert to clobber the system one
# include "include/assert.h"

class PerfCounters;

enum {
  l_leveldb_first = 34300,
  l_leveldb_gets,
  l_leveldb_txns,
  l_leveldb_get_latency,
  l_leveldb_submit_latency,
  l_leveldb_submit_sync_latency,
  l_leveldb_compact,
  l_leveldb_compact_range,
  l_leveldb_compact_queue_merge,
  l_leveldb_compact_queue_len,
  l_leveldb_last,
};

extern leveldb::Logger *create_leveldb_ceph_logger();

class CephLevelDBLogger;

/**
 * Uses LevelDB to implement the KeyValueDB interface
 */
class LevelDBStore : public KeyValueDB {
  CephContext *cct;
  PerfCounters *logger;
  CephLevelDBLogger *ceph_logger;
  string path;
  boost::scoped_ptr<leveldb::Cache> db_cache;
#ifdef HAVE_LEVELDB_FILTER_POLICY
  boost::scoped_ptr<const leveldb::FilterPolicy> filterpolicy;
#endif
  boost::scoped_ptr<leveldb::DB> db;

  int do_open(ostream &out, bool create_if_missing);

  // manage async compactions
  Mutex compact_queue_lock;
  Cond compact_queue_cond;
  list< pair<string,string> > compact_queue;
  bool compact_queue_stop;
  class CompactThread : public Thread {
    LevelDBStore *db;
  public:
    explicit CompactThread(LevelDBStore *d) : db(d) {}
    void *entry() override {
      db->compact_thread_entry();
      return NULL;
    }
    friend class LevelDBStore;
  } compact_thread;

  void compact_thread_entry();

  void compact_range(const string& start, const string& end) {
    leveldb::Slice cstart(start);
    leveldb::Slice cend(end);
    db->CompactRange(&cstart, &cend);
  }
  void compact_range_async(const string& start, const string& end);

public:
  /// compact the underlying leveldb store
  void compact() override;

  /// compact db for all keys with a given prefix
  void compact_prefix(const string& prefix) override {
    compact_range(prefix, past_prefix(prefix));
  }
  void compact_prefix_async(const string& prefix) override {
    compact_range_async(prefix, past_prefix(prefix));
  }
  void compact_range(const string& prefix,
		     const string& start, const string& end) override {
    compact_range(combine_strings(prefix, start), combine_strings(prefix, end));
  }
  void compact_range_async(const string& prefix,
			   const string& start, const string& end) override {
    compact_range_async(combine_strings(prefix, start),
			combine_strings(prefix, end));
  }


  /**
   * options_t: Holds options which are minimally interpreted
   * on initialization and then passed through to LevelDB.
   * We transform a couple of these into actual LevelDB
   * structures, but the rest are simply passed through unchanged. See
   * leveldb/options.h for more precise details on each.
   *
   * Set them after constructing the LevelDBStore, but before calling
   * open() or create_and_open().
   */
  struct options_t {
    uint64_t write_buffer_size; /// in-memory write buffer size
    int max_open_files; /// maximum number of files LevelDB can open at once
    uint64_t cache_size; /// size of extra decompressed cache to use
    uint64_t block_size; /// user data per block
    int bloom_size; /// number of bits per entry to put in a bloom filter
    bool compression_enabled; /// whether to use libsnappy compression or not

    // don't change these ones. No, seriously
    int block_restart_interval;
    bool error_if_exists;
    bool paranoid_checks;

    string log_file;

    options_t() :
      write_buffer_size(0), //< 0 means default
      max_open_files(0), //< 0 means default
      cache_size(0), //< 0 means no cache (default)
      block_size(0), //< 0 means default
      bloom_size(0), //< 0 means no bloom filter (default)
      compression_enabled(true), //< set to false for no compression
      block_restart_interval(0), //< 0 means default
      error_if_exists(false), //< set to true if you want to check nonexistence
      paranoid_checks(false) //< set to true if you want paranoid checks
    {}
  } options;

  LevelDBStore(CephContext *c, const string &path) :
    cct(c),
    logger(NULL),
    ceph_logger(NULL),
    path(path),
    db_cache(NULL),
#ifdef HAVE_LEVELDB_FILTER_POLICY
    filterpolicy(NULL),
#endif
    compact_queue_lock("LevelDBStore::compact_thread_lock"),
    compact_queue_stop(false),
    compact_thread(this),
    options()
  {}

  ~LevelDBStore() override;

  static int _test_init(const string& dir);
  int init(string option_str="") override;

  /// Opens underlying db
  int open(ostream &out) override {
    return do_open(out, false);
  }
  /// Creates underlying db if missing and opens it
  int create_and_open(ostream &out) override {
    return do_open(out, true);
  }

  void close() override;

  class LevelDBTransactionImpl : public KeyValueDB::TransactionImpl {
  public:
    leveldb::WriteBatch bat;
    LevelDBStore *db;
    explicit LevelDBTransactionImpl(LevelDBStore *db) : db(db) {}
    void set(
      const string &prefix,
      const string &k,
      const bufferlist &bl) override;
    using KeyValueDB::TransactionImpl::set;
    void rmkey(
      const string &prefix,
      const string &k) override;
    void rmkeys_by_prefix(
      const string &prefix
      ) override;
    virtual void rm_range_keys(
        const string &prefix,
        const string &start,
        const string &end) override;

    using KeyValueDB::TransactionImpl::rmkey;
  };

  KeyValueDB::Transaction get_transaction() override {
    return std::make_shared<LevelDBTransactionImpl>(this);
  }

  int submit_transaction(KeyValueDB::Transaction t) override;
  int submit_transaction_sync(KeyValueDB::Transaction t) override;
  int get(
    const string &prefix,
    const std::set<string> &key,
    std::map<string, bufferlist> *out
    ) override;

  int get(const string &prefix, 
    const string &key,   
    bufferlist *value) override;

  using KeyValueDB::get;

  class LevelDBWholeSpaceIteratorImpl :
    public KeyValueDB::WholeSpaceIteratorImpl {
  protected:
    boost::scoped_ptr<leveldb::Iterator> dbiter;
  public:
    explicit LevelDBWholeSpaceIteratorImpl(leveldb::Iterator *iter) :
      dbiter(iter) { }
    ~LevelDBWholeSpaceIteratorImpl() override { }

    int seek_to_first() override {
      dbiter->SeekToFirst();
      return dbiter->status().ok() ? 0 : -1;
    }
    int seek_to_first(const string &prefix) override {
      leveldb::Slice slice_prefix(prefix);
      dbiter->Seek(slice_prefix);
      return dbiter->status().ok() ? 0 : -1;
    }
    int seek_to_last() override {
      dbiter->SeekToLast();
      return dbiter->status().ok() ? 0 : -1;
    }
    int seek_to_last(const string &prefix) override {
      string limit = past_prefix(prefix);
      leveldb::Slice slice_limit(limit);
      dbiter->Seek(slice_limit);

      if (!dbiter->Valid()) {
        dbiter->SeekToLast();
      } else {
        dbiter->Prev();
      }
      return dbiter->status().ok() ? 0 : -1;
    }
    int upper_bound(const string &prefix, const string &after) override {
      lower_bound(prefix, after);
      if (valid()) {
	pair<string,string> key = raw_key();
	if (key.first == prefix && key.second == after)
	  next();
      }
      return dbiter->status().ok() ? 0 : -1;
    }
    int lower_bound(const string &prefix, const string &to) override {
      string bound = combine_strings(prefix, to);
      leveldb::Slice slice_bound(bound);
      dbiter->Seek(slice_bound);
      return dbiter->status().ok() ? 0 : -1;
    }
    bool valid() override {
      return dbiter->Valid();
    }
    int next() override {
      if (valid())
	dbiter->Next();
      return dbiter->status().ok() ? 0 : -1;
    }
    int prev() override {
      if (valid())
	dbiter->Prev();
      return dbiter->status().ok() ? 0 : -1;
    }
    string key() override {
      string out_key;
      split_key(dbiter->key(), 0, &out_key);
      return out_key;
    }
    pair<string,string> raw_key() override {
      string prefix, key;
      split_key(dbiter->key(), &prefix, &key);
      return make_pair(prefix, key);
    }
    bool raw_key_is_prefixed(const string &prefix) override {
      leveldb::Slice key = dbiter->key();
      if ((key.size() > prefix.length()) && (key[prefix.length()] == '\0')) {
        return memcmp(key.data(), prefix.c_str(), prefix.length()) == 0;
      } else {
        return false;
      }
    }
    bufferlist value() override {
      return to_bufferlist(dbiter->value());
    }

    bufferptr value_as_ptr() override {
      leveldb::Slice data = dbiter->value();
      return bufferptr(data.data(), data.size());
    }

    int status() override {
      return dbiter->status().ok() ? 0 : -1;
    }
  };

  /// Utility
  static string combine_strings(const string &prefix, const string &value);
  static int split_key(leveldb::Slice in, string *prefix, string *key);
  static bufferlist to_bufferlist(leveldb::Slice in);
  static string past_prefix(const string &prefix) {
    string limit = prefix;
    limit.push_back(1);
    return limit;
  }

  uint64_t get_estimated_size(map<string,uint64_t> &extra) override {
    DIR *store_dir = opendir(path.c_str());
    if (!store_dir) {
      lderr(cct) << __func__ << " something happened opening the store: "
                 << cpp_strerror(errno) << dendl;
      return 0;
    }

    uint64_t total_size = 0;
    uint64_t sst_size = 0;
    uint64_t log_size = 0;
    uint64_t misc_size = 0;

    struct dirent *entry = NULL;
    while ((entry = readdir(store_dir)) != NULL) {
      string n(entry->d_name);

      if (n == "." || n == "..")
        continue;

      string fpath = path + '/' + n;
      struct stat s;
      int err = stat(fpath.c_str(), &s);
      if (err < 0)
	err = -errno;
      // we may race against leveldb while reading files; this should only
      // happen when those files are being updated, data is being shuffled
      // and files get removed, in which case there's not much of a problem
      // as we'll get to them next time around.
      if (err == -ENOENT) {
	continue;
      }
      if (err < 0) {
        lderr(cct) << __func__ << " error obtaining stats for " << fpath
                   << ": " << cpp_strerror(err) << dendl;
        goto err;
      }

      size_t pos = n.find_last_of('.');
      if (pos == string::npos) {
        misc_size += s.st_size;
        continue;
      }

      string ext = n.substr(pos+1);
      if (ext == "sst") {
        sst_size += s.st_size;
      } else if (ext == "log") {
        log_size += s.st_size;
      } else {
        misc_size += s.st_size;
      }
    }

    total_size = sst_size + log_size + misc_size;

    extra["sst"] = sst_size;
    extra["log"] = log_size;
    extra["misc"] = misc_size;
    extra["total"] = total_size;

err:
    closedir(store_dir);
    return total_size;
  }


protected:
  WholeSpaceIterator _get_iterator() override {
    return std::make_shared<LevelDBWholeSpaceIteratorImpl>(
	db->NewIterator(leveldb::ReadOptions()));
  }

};

#endif
Commit	Line	Data
7c673cae FG	1	// -- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t --
	2	// vim: ts=8 sw=2 smarttab
	3	#ifndef LEVEL_DB_STORE_H
	4	#define LEVEL_DB_STORE_H
	5
	6	#include "include/types.h"
	7	#include "include/buffer_fwd.h"
	8	#include "KeyValueDB.h"
	9	#include <set>
	10	#include <map>
	11	#include <string>
	12	#include "include/memory.h"
	13	#include <boost/scoped_ptr.hpp>
	14	#include "leveldb/db.h"
	15	#include "leveldb/env.h"
	16	#include "leveldb/write_batch.h"
	17	#include "leveldb/slice.h"
	18	#include "leveldb/cache.h"
	19	#ifdef HAVE_LEVELDB_FILTER_POLICY
	20	#include "leveldb/filter_policy.h"
	21	#endif
	22
	23	#include <errno.h>
	24	#include "common/errno.h"
	25	#include "common/dout.h"
	26	#include "include/assert.h"
	27	#include "common/Formatter.h"
	28	#include "common/Cond.h"
	29
	30	#include "common/ceph_context.h"
	31
31f18b77 FG	32	// reinclude our assert to clobber the system one
	33	# include "include/assert.h"
	34
7c673cae FG	35	class PerfCounters;
	36
	37	enum {
	38	l_leveldb_first = 34300,
	39	l_leveldb_gets,
	40	l_leveldb_txns,
	41	l_leveldb_get_latency,
	42	l_leveldb_submit_latency,
	43	l_leveldb_submit_sync_latency,
	44	l_leveldb_compact,
	45	l_leveldb_compact_range,
	46	l_leveldb_compact_queue_merge,
	47	l_leveldb_compact_queue_len,
	48	l_leveldb_last,
	49	};
	50
	51	extern leveldb::Logger *create_leveldb_ceph_logger();
	52
	53	class CephLevelDBLogger;
	54
	55	/**
	56	* Uses LevelDB to implement the KeyValueDB interface
	57	*/
	58	class LevelDBStore : public KeyValueDB {
	59	CephContext *cct;
	60	PerfCounters *logger;
	61	CephLevelDBLogger *ceph_logger;
	62	string path;
	63	boost::scoped_ptr<leveldb::Cache> db_cache;
	64	#ifdef HAVE_LEVELDB_FILTER_POLICY
	65	boost::scoped_ptr<const leveldb::FilterPolicy> filterpolicy;
	66	#endif
	67	boost::scoped_ptr<leveldb::DB> db;
	68
	69	int do_open(ostream &out, bool create_if_missing);
	70
	71	// manage async compactions
	72	Mutex compact_queue_lock;
	73	Cond compact_queue_cond;
	74	list< pair<string,string> > compact_queue;
	75	bool compact_queue_stop;
	76	class CompactThread : public Thread {
	77	LevelDBStore *db;
	78	public:
	79	explicit CompactThread(LevelDBStore *d) : db(d) {}
	80	void *entry() override {
	81	db->compact_thread_entry();
	82	return NULL;
	83	}
	84	friend class LevelDBStore;
	85	} compact_thread;
	86
	87	void compact_thread_entry();
	88
	89	void compact_range(const string& start, const string& end) {
	90	leveldb::Slice cstart(start);
	91	leveldb::Slice cend(end);
	92	db->CompactRange(&cstart, &cend);
	93	}
	94	void compact_range_async(const string& start, const string& end);
	95
	96	public:
	97	/// compact the underlying leveldb store
	98	void compact() override;
99
100	/// compact db for all keys with a given prefix
101	void compact_prefix(const string& prefix) override {
102	compact_range(prefix, past_prefix(prefix));
103	}
104	void compact_prefix_async(const string& prefix) override {
105	compact_range_async(prefix, past_prefix(prefix));
106	}
107	void compact_range(const string& prefix,
108	const string& start, const string& end) override {
109	compact_range(combine_strings(prefix, start), combine_strings(prefix, end));
110	}
111	void compact_range_async(const string& prefix,
112	const string& start, const string& end) override {
113	compact_range_async(combine_strings(prefix, start),
114	combine_strings(prefix, end));
115	}
116
117
118	/**
119	* options_t: Holds options which are minimally interpreted
120	* on initialization and then passed through to LevelDB.
121	* We transform a couple of these into actual LevelDB
122	* structures, but the rest are simply passed through unchanged. See
123	* leveldb/options.h for more precise details on each.
124	*
125	* Set them after constructing the LevelDBStore, but before calling
126	* open() or create_and_open().
127	*/
128	struct options_t {
129	uint64_t write_buffer_size; /// in-memory write buffer size
130	int max_open_files; /// maximum number of files LevelDB can open at once
131	uint64_t cache_size; /// size of extra decompressed cache to use
132	uint64_t block_size; /// user data per block
133	int bloom_size; /// number of bits per entry to put in a bloom filter
134	bool compression_enabled; /// whether to use libsnappy compression or not
135
136	// don't change these ones. No, seriously
137	int block_restart_interval;
138	bool error_if_exists;
139	bool paranoid_checks;
140
141	string log_file;
142
143	options_t() :
144	write_buffer_size(0), //< 0 means default
145	max_open_files(0), //< 0 means default
146	cache_size(0), //< 0 means no cache (default)
147	block_size(0), //< 0 means default
148	bloom_size(0), //< 0 means no bloom filter (default)
149	compression_enabled(true), //< set to false for no compression
150	block_restart_interval(0), //< 0 means default
151	error_if_exists(false), //< set to true if you want to check nonexistence
152	paranoid_checks(false) //< set to true if you want paranoid checks
153	{}
154	} options;
155
156	LevelDBStore(CephContext *c, const string &path) :
157	cct(c),
158	logger(NULL),
159	ceph_logger(NULL),
160	path(path),
161	db_cache(NULL),
162	#ifdef HAVE_LEVELDB_FILTER_POLICY
163	filterpolicy(NULL),
164	#endif
165	compact_queue_lock("LevelDBStore::compact_thread_lock"),
166	compact_queue_stop(false),
167	compact_thread(this),
168	options()
169	{}
170
171	~LevelDBStore() override;
172
173	static int _test_init(const string& dir);
174	int init(string option_str="") override;
175
176	/// Opens underlying db
177	int open(ostream &out) override {
178	return do_open(out, false);
179	}
180	/// Creates underlying db if missing and opens it
181	int create_and_open(ostream &out) override {
182	return do_open(out, true);
183	}
184
185	void close() override;
186
187	class LevelDBTransactionImpl : public KeyValueDB::TransactionImpl {
188	public:
189	leveldb::WriteBatch bat;
190	LevelDBStore *db;
191	explicit LevelDBTransactionImpl(LevelDBStore *db) : db(db) {}
192	void set(
193	const string &prefix,
194	const string &k,
195	const bufferlist &bl) override;
196	using KeyValueDB::TransactionImpl::set;
197	void rmkey(
198	const string &prefix,
199	const string &k) override;
200	void rmkeys_by_prefix(
201	const string &prefix
202	) override;
203	virtual void rm_range_keys(
204	const string &prefix,
205	const string &start,
206	const string &end) override;
207
208	using KeyValueDB::TransactionImpl::rmkey;
209	};
210
211	KeyValueDB::Transaction get_transaction() override {
212	return std::make_shared<LevelDBTransactionImpl>(this);
213	}
214
215	int submit_transaction(KeyValueDB::Transaction t) override;
216	int submit_transaction_sync(KeyValueDB::Transaction t) override;
217	int get(
218	const string &prefix,
219	const std::set<string> &key,
220	std::map<string, bufferlist> *out
221	) override;
222
223	int get(const string &prefix,
224	const string &key,
225	bufferlist *value) override;
226
227	using KeyValueDB::get;
228
229	class LevelDBWholeSpaceIteratorImpl :
230	public KeyValueDB::WholeSpaceIteratorImpl {
231	protected:
232	boost::scoped_ptr<leveldb::Iterator> dbiter;
233	public:
234	explicit LevelDBWholeSpaceIteratorImpl(leveldb::Iterator *iter) :
235	dbiter(iter) { }
236	~LevelDBWholeSpaceIteratorImpl() override { }
237
238	int seek_to_first() override {
239	dbiter->SeekToFirst();
240	return dbiter->status().ok() ? 0 : -1;
241	}
242	int seek_to_first(const string &prefix) override {
243	leveldb::Slice slice_prefix(prefix);
244	dbiter->Seek(slice_prefix);
245	return dbiter->status().ok() ? 0 : -1;
246	}
247	int seek_to_last() override {
248	dbiter->SeekToLast();
249	return dbiter->status().ok() ? 0 : -1;
250	}
251	int seek_to_last(const string &prefix) override {
252	string limit = past_prefix(prefix);
253	leveldb::Slice slice_limit(limit);
254	dbiter->Seek(slice_limit);
255
256	if (!dbiter->Valid()) {
257	dbiter->SeekToLast();
258	} else {
259	dbiter->Prev();
260	}
261	return dbiter->status().ok() ? 0 : -1;
262	}
263	int upper_bound(const string &prefix, const string &after) override {
264	lower_bound(prefix, after);
265	if (valid()) {
266	pair<string,string> key = raw_key();
267	if (key.first == prefix && key.second == after)
268	next();
269	}
270	return dbiter->status().ok() ? 0 : -1;
271	}
272	int lower_bound(const string &prefix, const string &to) override {
273	string bound = combine_strings(prefix, to);
274	leveldb::Slice slice_bound(bound);
275	dbiter->Seek(slice_bound);
276	return dbiter->status().ok() ? 0 : -1;
277	}
278	bool valid() override {
279	return dbiter->Valid();
280	}
281	int next() override {
282	if (valid())
283	dbiter->Next();
284	return dbiter->status().ok() ? 0 : -1;
285	}
286	int prev() override {
287	if (valid())
288	dbiter->Prev();
289	return dbiter->status().ok() ? 0 : -1;
290	}
291	string key() override {
292	string out_key;
293	split_key(dbiter->key(), 0, &out_key);
294	return out_key;
295	}
296	pair<string,string> raw_key() override {
297	string prefix, key;
298	split_key(dbiter->key(), &prefix, &key);
299	return make_pair(prefix, key);
300	}
301	bool raw_key_is_prefixed(const string &prefix) override {
302	leveldb::Slice key = dbiter->key();
303	if ((key.size() > prefix.length()) && (key[prefix.length()] == '\0')) {
304	return memcmp(key.data(), prefix.c_str(), prefix.length()) == 0;
305	} else {
306	return false;
307	}
308	}
309	bufferlist value() override {
310	return to_bufferlist(dbiter->value());
311	}
312
313	bufferptr value_as_ptr() override {
314	leveldb::Slice data = dbiter->value();
315	return bufferptr(data.data(), data.size());
316	}
317
318	int status() override {
319	return dbiter->status().ok() ? 0 : -1;
320	}
321	};
322
323	/// Utility
324	static string combine_strings(const string &prefix, const string &value);
325	static int split_key(leveldb::Slice in, string prefix, string key);
326	static bufferlist to_bufferlist(leveldb::Slice in);
327	static string past_prefix(const string &prefix) {
328	string limit = prefix;
329	limit.push_back(1);
330	return limit;
331	}
332
333	uint64_t get_estimated_size(map<string,uint64_t> &extra) override {
334	DIR *store_dir = opendir(path.c_str());
335	if (!store_dir) {
336	lderr(cct) << __func__ << " something happened opening the store: "
337	<< cpp_strerror(errno) << dendl;
338	return 0;
339	}
340
341	uint64_t total_size = 0;
342	uint64_t sst_size = 0;
343	uint64_t log_size = 0;
344	uint64_t misc_size = 0;
345
346	struct dirent *entry = NULL;
347	while ((entry = readdir(store_dir)) != NULL) {
348	string n(entry->d_name);
349
350	if (n == "." \|\| n == "..")
351	continue;
352
353	string fpath = path + '/' + n;
354	struct stat s;
355	int err = stat(fpath.c_str(), &s);
356	if (err < 0)
357	err = -errno;
358	// we may race against leveldb while reading files; this should only
359	// happen when those files are being updated, data is being shuffled
360	// and files get removed, in which case there's not much of a problem
361	// as we'll get to them next time around.
362	if (err == -ENOENT) {
363	continue;
364	}
365	if (err < 0) {
366	lderr(cct) << __func__ << " error obtaining stats for " << fpath
367	<< ": " << cpp_strerror(err) << dendl;
368	goto err;
369	}
370
371	size_t pos = n.find_last_of('.');
372	if (pos == string::npos) {
373	misc_size += s.st_size;
374	continue;
375	}
376
377	string ext = n.substr(pos+1);
378	if (ext == "sst") {
379	sst_size += s.st_size;
380	} else if (ext == "log") {
381	log_size += s.st_size;
382	} else {
383	misc_size += s.st_size;
384	}
385	}
386
387	total_size = sst_size + log_size + misc_size;
388
389	extra["sst"] = sst_size;
390	extra["log"] = log_size;
391	extra["misc"] = misc_size;
392	extra["total"] = total_size;
393
394	err:
395	closedir(store_dir);
396	return total_size;
397	}
398
399
400	protected:
401	WholeSpaceIterator _get_iterator() override {
402	return std::make_shared<LevelDBWholeSpaceIteratorImpl>(
403	db->NewIterator(leveldb::ReadOptions()));
404	}
405
406	};
407
408	#endif