lmdbal/src/cache.h

127 lines
5.3 KiB
C
Raw Normal View History

/*
* LMDB Abstraction Layer.
* Copyright (C) 2023 Yury Gubich <blue@macaw.me>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
2022-09-20 17:16:48 +00:00
2023-03-21 11:05:54 +00:00
#ifndef LMDBAL_CACHE_H
#define LMDBAL_CACHE_H
2022-09-20 17:16:48 +00:00
#include <map>
#include <set>
2023-04-03 18:48:13 +00:00
#include <tuple>
2022-09-20 17:16:48 +00:00
2023-03-20 15:37:13 +00:00
#include "storage.h"
2023-03-21 11:05:54 +00:00
namespace LMDBAL {
2023-03-20 15:37:13 +00:00
2022-09-20 17:16:48 +00:00
template <class K, class V>
2023-03-20 15:37:13 +00:00
class Cache : public Storage<K, V> {
2023-03-21 11:05:54 +00:00
friend class Base;
2023-04-12 15:36:33 +00:00
enum class Mode { /**<it's a cache state when we:*/
nothing, /**< - know nothing about records in database on disk*/
size, /**< - know just an amount of records*/
full /**< - shure that our cache is equal to the database on disk*/
2022-09-20 17:16:48 +00:00
};
2023-04-03 18:48:13 +00:00
2023-04-12 15:36:33 +00:00
enum class Operation { /**<Operation type, used in pcrocessing cache modification after writable transaction is commited*/
2023-04-03 18:48:13 +00:00
add,
remove,
change,
force,
drop,
replace,
addMany
};
typedef std::pair<Operation, void*> Entry;
typedef std::list<Entry> Queue;
typedef std::map<TransactionID, Queue> TransactionCache;
2022-09-20 17:16:48 +00:00
protected:
2023-08-17 14:45:11 +00:00
Cache(Base* parent, const std::string& name, Duplicates duplicates = uniqueKey);
2022-09-20 17:16:48 +00:00
~Cache() override;
2023-04-03 18:48:13 +00:00
virtual void transactionStarted(TransactionID txn, bool readOnly) const override;
virtual void transactionCommited(TransactionID txn) override;
virtual void transactionAborted(TransactionID txn) const override;
virtual void discoveredRecord(const K& key, const V& value) const override;
virtual void discoveredRecord(const K& key, const V& value, TransactionID txn) const override;
private:
void handleMode() const;
2023-04-03 18:48:13 +00:00
void handleTransactionEntry(const Entry& entry);
void destroyTransactionEntry(const Entry& entry) const;
void handleAddRecord(const K& key, const V& value);
void handleRemoveRecord(const K& key);
void handleChangeRecord(const K& key, const V& value);
void handleForceRecord(const K& key, const V& value, bool added);
void handleReplaceAll(std::map<K, V>* data);
void handleAddRecords(const std::map<K, V>& data, bool overwrite, SizeType newSize);
void handleDrop();
void appendToCache(const K& key, const V& value) const;
2023-04-03 18:48:13 +00:00
2022-09-20 17:16:48 +00:00
public:
2023-04-03 18:48:13 +00:00
using Storage<K, V>::drop;
virtual int drop(TransactionID transaction) override;
2022-09-20 17:16:48 +00:00
virtual void addRecord(const K& key, const V& value) override;
virtual void addRecord(const K& key, const V& value, TransactionID txn) override;
2022-12-13 22:57:49 +00:00
virtual bool forceRecord(const K& key, const V& value) override;
virtual bool forceRecord(const K& key, const V& value, TransactionID txn) override;
2022-09-20 17:16:48 +00:00
virtual void changeRecord(const K& key, const V& value) override;
virtual void changeRecord(const K& key, const V& value, TransactionID txn) override;
2022-09-20 17:16:48 +00:00
virtual void removeRecord(const K& key) override;
virtual void removeRecord(const K& key, TransactionID txn) override;
virtual bool checkRecord(const K& key) const override;
virtual bool checkRecord(const K& key, TransactionID txn) const override;
virtual void getRecord(const K& key, V& out) const override;
virtual void getRecord(const K& key, V& out, TransactionID txn) const override;
2022-09-20 17:16:48 +00:00
virtual V getRecord(const K& key) const override;
virtual V getRecord(const K& key, TransactionID txn) const override;
2023-04-03 18:48:13 +00:00
virtual SizeType count() const override;
virtual SizeType count(TransactionID txn) const override;
virtual std::map<K, V> readAll() const override;
virtual std::map<K, V> readAll(TransactionID txn) const override;
virtual void readAll(std::map<K, V>& out) const override;
virtual void readAll(std::map<K, V>& out, TransactionID txn) const override;
virtual void replaceAll(const std::map<K, V>& data) override;
virtual void replaceAll(const std::map<K, V>& data, TransactionID txn) override;
2023-04-03 18:48:13 +00:00
virtual SizeType addRecords(const std::map<K, V>& data, bool overwrite = false) override;
virtual SizeType addRecords(const std::map<K, V>& data, TransactionID txn, bool overwrite = false) override;
2022-09-20 17:16:48 +00:00
protected:
2023-04-12 15:36:33 +00:00
/**
* \brief Cache mode
*
* Sometimes we have a complete information about the content of the database,
* and we don't even need to call lmdb to fetch or check for data.
2023-04-12 15:36:33 +00:00
* This member actually shows what is the current state, more about them you can read in Enum descriptions
*/
mutable Mode mode;
2023-04-12 15:36:33 +00:00
std::map<K, V>* cache; /**<\brief Cached data*/
std::set<K>* abscent; /**<\brief Set of keys that are definitely not in the cache*/
mutable SizeType sizeDifference; /**<\brief Difference of size between cached data and amount of records in the lmdb storage*/
2023-04-12 15:36:33 +00:00
TransactionCache* transactionCache; /**<\brief All changes made under under uncommited transactions*/
2022-09-20 17:16:48 +00:00
};
2023-03-20 15:37:13 +00:00
}
2022-09-20 17:16:48 +00:00
#include "cache.hpp"
2023-03-21 11:05:54 +00:00
#endif // LMDBAL_CACHE_H