2018-12-31 20:04:05 +01:00
|
|
|
//
|
2021-01-01 13:57:46 +01:00
|
|
|
// Copyright Aliaksei Levin (levlam@telegram.org), Arseny Smirnov (arseny30@gmail.com) 2014-2021
|
2018-12-31 20:04:05 +01:00
|
|
|
//
|
|
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
//
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "td/actor/PromiseFuture.h"
|
|
|
|
|
|
|
|
#include "td/db/binlog/Binlog.h"
|
|
|
|
#include "td/db/binlog/BinlogEvent.h"
|
2019-10-22 19:01:15 +02:00
|
|
|
#include "td/db/DbKey.h"
|
2018-12-31 20:04:05 +01:00
|
|
|
#include "td/db/KeyValueSyncInterface.h"
|
|
|
|
|
|
|
|
#include "td/utils/buffer.h"
|
|
|
|
#include "td/utils/common.h"
|
|
|
|
#include "td/utils/logging.h"
|
|
|
|
#include "td/utils/misc.h"
|
|
|
|
#include "td/utils/port/RwMutex.h"
|
|
|
|
#include "td/utils/Slice.h"
|
|
|
|
#include "td/utils/Status.h"
|
2019-02-12 17:48:52 +01:00
|
|
|
#include "td/utils/StorerBase.h"
|
2018-12-31 20:04:05 +01:00
|
|
|
#include "td/utils/tl_parsers.h"
|
|
|
|
#include "td/utils/tl_storers.h"
|
|
|
|
|
|
|
|
#include <map>
|
|
|
|
#include <memory>
|
|
|
|
#include <unordered_map>
|
|
|
|
#include <utility>
|
|
|
|
|
|
|
|
namespace td {
|
2018-07-22 00:03:21 +02:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
template <class BinlogT>
|
|
|
|
class BinlogKeyValue : public KeyValueSyncInterface {
|
|
|
|
public:
|
2020-06-16 04:10:16 +02:00
|
|
|
static constexpr int32 MAGIC = 0x2a280000;
|
2018-12-31 20:04:05 +01:00
|
|
|
|
|
|
|
struct Event : public Storer {
|
|
|
|
Event() = default;
|
|
|
|
Event(Slice key, Slice value) : key(key), value(value) {
|
|
|
|
}
|
|
|
|
Slice key;
|
|
|
|
Slice value;
|
|
|
|
template <class StorerT>
|
|
|
|
void store(StorerT &&storer) const {
|
|
|
|
storer.store_string(key);
|
|
|
|
storer.store_string(value);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class ParserT>
|
|
|
|
void parse(ParserT &&parser) {
|
|
|
|
key = parser.template fetch_string<Slice>();
|
|
|
|
value = parser.template fetch_string<Slice>();
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t size() const override {
|
|
|
|
TlStorerCalcLength storer;
|
|
|
|
store(storer);
|
|
|
|
return storer.get_length();
|
|
|
|
}
|
2018-06-25 01:58:43 +02:00
|
|
|
size_t store(uint8 *ptr) const override {
|
2018-12-31 20:04:05 +01:00
|
|
|
TlStorerUnsafe storer(ptr);
|
|
|
|
store(storer);
|
2018-06-25 01:58:43 +02:00
|
|
|
return static_cast<size_t>(storer.get_buf() - ptr);
|
2018-12-31 20:04:05 +01:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
int32 get_magic() const {
|
|
|
|
return magic_;
|
|
|
|
}
|
|
|
|
|
|
|
|
Status init(string name, DbKey db_key = DbKey::empty(), int scheduler_id = -1,
|
|
|
|
int32 override_magic = 0) TD_WARN_UNUSED_RESULT {
|
|
|
|
close();
|
|
|
|
if (override_magic) {
|
|
|
|
magic_ = override_magic;
|
|
|
|
}
|
|
|
|
|
2018-09-27 03:19:03 +02:00
|
|
|
binlog_ = std::make_shared<BinlogT>();
|
2019-09-28 04:14:21 +02:00
|
|
|
TRY_STATUS(binlog_->init(
|
|
|
|
name,
|
|
|
|
[&](const BinlogEvent &binlog_event) {
|
|
|
|
Event event;
|
|
|
|
event.parse(TlParser(binlog_event.data_));
|
|
|
|
map_.emplace(event.key.str(), std::make_pair(event.value.str(), binlog_event.id_));
|
|
|
|
},
|
|
|
|
std::move(db_key), DbKey::empty(), scheduler_id));
|
2018-12-31 20:04:05 +01:00
|
|
|
return Status::OK();
|
|
|
|
}
|
|
|
|
|
|
|
|
void external_init_begin(int32 override_magic = 0) {
|
|
|
|
close();
|
|
|
|
if (override_magic) {
|
|
|
|
magic_ = override_magic;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class OtherBinlogT>
|
|
|
|
void external_init_handle(BinlogKeyValue<OtherBinlogT> &&other) {
|
|
|
|
map_ = std::move(other.map_);
|
|
|
|
}
|
|
|
|
|
|
|
|
void external_init_handle(const BinlogEvent &binlog_event) {
|
|
|
|
Event event;
|
|
|
|
event.parse(TlParser(binlog_event.data_));
|
2018-07-10 02:38:17 +02:00
|
|
|
map_.emplace(event.key.str(), std::make_pair(event.value.str(), binlog_event.id_));
|
2018-12-31 20:04:05 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void external_init_finish(std::shared_ptr<BinlogT> binlog) {
|
|
|
|
binlog_ = std::move(binlog);
|
|
|
|
}
|
|
|
|
|
|
|
|
void close() {
|
|
|
|
*this = BinlogKeyValue();
|
|
|
|
}
|
2020-07-14 19:54:38 +02:00
|
|
|
void close(Promise<> promise) override {
|
2020-07-14 18:10:26 +02:00
|
|
|
binlog_->close(std::move(promise));
|
|
|
|
}
|
2018-12-31 20:04:05 +01:00
|
|
|
|
|
|
|
SeqNo set(string key, string value) override {
|
|
|
|
auto lock = rw_mutex_.lock_write().move_as_ok();
|
|
|
|
uint64 old_id = 0;
|
|
|
|
auto it_ok = map_.insert({key, {value, 0}});
|
|
|
|
if (!it_ok.second) {
|
|
|
|
if (it_ok.first->second.first == value) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
old_id = it_ok.first->second.second;
|
|
|
|
it_ok.first->second.first = value;
|
|
|
|
}
|
|
|
|
bool rewrite = false;
|
|
|
|
uint64 id;
|
|
|
|
auto seq_no = binlog_->next_id();
|
|
|
|
if (old_id != 0) {
|
|
|
|
rewrite = true;
|
|
|
|
id = old_id;
|
|
|
|
} else {
|
|
|
|
id = seq_no;
|
|
|
|
it_ok.first->second.second = id;
|
|
|
|
}
|
|
|
|
|
|
|
|
lock.reset();
|
|
|
|
add_event(seq_no,
|
|
|
|
BinlogEvent::create_raw(id, magic_, rewrite ? BinlogEvent::Flags::Rewrite : 0, Event{key, value}));
|
|
|
|
return seq_no;
|
|
|
|
}
|
|
|
|
|
|
|
|
SeqNo erase(const string &key) override {
|
|
|
|
auto lock = rw_mutex_.lock_write().move_as_ok();
|
|
|
|
auto it = map_.find(key);
|
|
|
|
if (it == map_.end()) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
uint64 id = it->second.second;
|
|
|
|
map_.erase(it);
|
|
|
|
// LOG(ERROR) << "ADD EVENT";
|
|
|
|
auto seq_no = binlog_->next_id();
|
|
|
|
lock.reset();
|
|
|
|
add_event(seq_no, BinlogEvent::create_raw(id, BinlogEvent::ServiceTypes::Empty, BinlogEvent::Flags::Rewrite,
|
|
|
|
EmptyStorer()));
|
|
|
|
return seq_no;
|
|
|
|
}
|
|
|
|
|
|
|
|
void add_event(uint64 seq_no, BufferSlice &&event) {
|
2018-06-28 19:00:11 +02:00
|
|
|
binlog_->add_raw_event(BinlogDebugInfo{__FILE__, __LINE__}, seq_no, std::move(event));
|
2018-12-31 20:04:05 +01:00
|
|
|
}
|
|
|
|
|
2018-03-08 16:01:45 +01:00
|
|
|
bool isset(const string &key) override {
|
|
|
|
auto lock = rw_mutex_.lock_read().move_as_ok();
|
|
|
|
return map_.count(key) > 0;
|
|
|
|
}
|
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
string get(const string &key) override {
|
|
|
|
auto lock = rw_mutex_.lock_read().move_as_ok();
|
|
|
|
auto it = map_.find(key);
|
|
|
|
if (it == map_.end()) {
|
|
|
|
return string();
|
|
|
|
}
|
|
|
|
return it->second.first;
|
|
|
|
}
|
|
|
|
|
2019-01-07 00:44:29 +01:00
|
|
|
void force_sync(Promise<> &&promise) override {
|
2018-12-31 20:04:05 +01:00
|
|
|
binlog_->force_sync(std::move(promise));
|
|
|
|
}
|
2019-01-06 22:06:52 +01:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
void lazy_sync(Promise<> &&promise) {
|
|
|
|
binlog_->lazy_sync(std::move(promise));
|
|
|
|
}
|
|
|
|
|
2019-01-06 23:58:09 +01:00
|
|
|
std::unordered_map<string, string> prefix_get(Slice prefix) override {
|
2018-12-31 20:04:05 +01:00
|
|
|
// TODO: optimize with std::map?
|
|
|
|
auto lock = rw_mutex_.lock_write().move_as_ok();
|
|
|
|
std::unordered_map<string, string> res;
|
|
|
|
for (const auto &kv : map_) {
|
|
|
|
if (begins_with(kv.first, prefix)) {
|
2020-04-23 19:27:46 +02:00
|
|
|
res[kv.first.substr(prefix.size())] = kv.second.first;
|
2018-12-31 20:04:05 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2019-01-06 23:58:09 +01:00
|
|
|
std::unordered_map<string, string> get_all() override {
|
2018-12-31 20:04:05 +01:00
|
|
|
auto lock = rw_mutex_.lock_write().move_as_ok();
|
|
|
|
std::unordered_map<string, string> res;
|
|
|
|
for (const auto &kv : map_) {
|
|
|
|
res[kv.first] = kv.second.first;
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2019-01-07 00:44:29 +01:00
|
|
|
void erase_by_prefix(Slice prefix) override {
|
2018-12-31 20:04:05 +01:00
|
|
|
auto lock = rw_mutex_.lock_write().move_as_ok();
|
|
|
|
std::vector<uint64> ids;
|
|
|
|
for (auto it = map_.begin(); it != map_.end();) {
|
|
|
|
if (begins_with(it->first, prefix)) {
|
|
|
|
ids.push_back(it->second.second);
|
|
|
|
it = map_.erase(it);
|
|
|
|
} else {
|
|
|
|
++it;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
auto seq_no = binlog_->next_id(narrow_cast<int32>(ids.size()));
|
|
|
|
lock.reset();
|
|
|
|
for (auto id : ids) {
|
|
|
|
add_event(seq_no, BinlogEvent::create_raw(id, BinlogEvent::ServiceTypes::Empty, BinlogEvent::Flags::Rewrite,
|
|
|
|
EmptyStorer()));
|
|
|
|
seq_no++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
template <class T>
|
|
|
|
friend class BinlogKeyValue;
|
|
|
|
|
|
|
|
static Status destroy(Slice name) {
|
|
|
|
return Binlog::destroy(name);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::unordered_map<string, std::pair<string, uint64>> map_;
|
|
|
|
std::shared_ptr<BinlogT> binlog_;
|
|
|
|
RwMutex rw_mutex_;
|
2020-06-16 04:10:16 +02:00
|
|
|
int32 magic_ = MAGIC;
|
2018-12-31 20:04:05 +01:00
|
|
|
};
|
2018-07-22 00:03:21 +02:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
template <>
|
|
|
|
inline void BinlogKeyValue<Binlog>::add_event(uint64 seq_no, BufferSlice &&event) {
|
2018-06-28 19:00:11 +02:00
|
|
|
binlog_->add_raw_event(std::move(event), BinlogDebugInfo{__FILE__, __LINE__});
|
2018-12-31 20:04:05 +01:00
|
|
|
}
|
2018-07-22 00:03:21 +02:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
template <>
|
|
|
|
inline void BinlogKeyValue<Binlog>::force_sync(Promise<> &&promise) {
|
|
|
|
binlog_->sync();
|
|
|
|
promise.set_value(Unit());
|
|
|
|
}
|
2018-07-22 00:03:21 +02:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
template <>
|
|
|
|
inline void BinlogKeyValue<Binlog>::lazy_sync(Promise<> &&promise) {
|
|
|
|
force_sync(std::move(promise));
|
|
|
|
}
|
2018-07-22 00:03:21 +02:00
|
|
|
|
2018-12-31 20:04:05 +01:00
|
|
|
} // namespace td
|