mirror of
https://github.com/lux-tel/libsession-util.git
synced 2026-10-30 20:25:11 +00:00
Session clients required the list of hashes from a merge() to perform various operations based on the messages that were accepted. This updates `merge()` to return a vector of accepted hashes. For the C API, this returns a config_string_list* pointer that needs to be freed, but contains all the good hashes (the same way current_hashes() works).
1070 lines
45 KiB
C++
1070 lines
45 KiB
C++
#pragma once
|
|
|
|
#include <cassert>
|
|
#include <memory>
|
|
#include <session/config.hpp>
|
|
#include <type_traits>
|
|
#include <unordered_set>
|
|
#include <variant>
|
|
#include <vector>
|
|
|
|
#include "base.h"
|
|
#include "namespaces.hpp"
|
|
|
|
namespace session::config {
|
|
|
|
template <typename T, typename... U>
|
|
static constexpr bool is_one_of = (std::is_same_v<T, U> || ...);
|
|
|
|
/// True for a dict_value direct subtype, but not scalar sub-subtypes.
|
|
template <typename T>
|
|
static constexpr bool is_dict_subtype = is_one_of<T, config::scalar, config::set, config::dict>;
|
|
|
|
/// True for a dict_value or any of the types containable within a dict value
|
|
template <typename T>
|
|
static constexpr bool is_dict_value =
|
|
is_dict_subtype<T> || is_one_of<T, dict_value, int64_t, std::string>;
|
|
|
|
// Levels for the logging callback
|
|
enum class LogLevel { debug = 0, info, warning, error };
|
|
|
|
/// Our current config state
|
|
enum class ConfigState : int {
|
|
/// Clean means the config is confirmed stored on the server and we haven't changed anything.
|
|
Clean = 0,
|
|
|
|
/// Dirty means we have local changes, and the changes haven't been serialized yet for sending
|
|
/// to the server.
|
|
Dirty = 1,
|
|
|
|
/// Waiting is halfway in-between clean and dirty: the caller has serialized the data, but
|
|
/// hasn't yet reported back that the data has been stored, *and* we haven't made any changes
|
|
/// since the data was serialize.
|
|
Waiting = 2,
|
|
};
|
|
|
|
/// Base config type for client-side configs containing common functionality needed by all config
|
|
/// sub-types.
|
|
class ConfigBase {
|
|
private:
|
|
// The object (either base config message or MutableConfigMessage) that stores the current
|
|
// config message. Subclasses do not directly access this: instead they call `dirty()` if they
|
|
// intend to make changes, or the `set_config_field` wrapper.
|
|
std::unique_ptr<ConfigMessage> _config;
|
|
|
|
// Tracks our current state
|
|
ConfigState _state = ConfigState::Clean;
|
|
|
|
static constexpr size_t KEY_SIZE = 32;
|
|
|
|
// Contains the base key(s) we use to encrypt/decrypt messages. If non-empty, the .front()
|
|
// element will be used when encrypting a new message to push. When decrypting, we attempt each
|
|
// of them, starting with .front(), until decryption succeeds.
|
|
using Key = std::array<unsigned char, KEY_SIZE>;
|
|
Key* _keys = nullptr;
|
|
size_t _keys_size = 0;
|
|
size_t _keys_capacity = 0;
|
|
|
|
// Contains the current active message hash, as fed into us in `confirm_pushed()`. Empty if we
|
|
// don't know it yet. When we dirty the config this value gets moved into `old_hashes_` to be
|
|
// removed by the next push.
|
|
std::string _curr_hash;
|
|
|
|
// Contains obsolete known message hashes that are obsoleted by the most recent merge or push;
|
|
// these are returned (and cleared) when `push` is called.
|
|
std::unordered_set<std::string> _old_hashes;
|
|
|
|
protected:
|
|
// Constructs a base config by loading the data from a dump as produced by `dump()`. If the
|
|
// dump is nullopt then an empty base config is constructed with no config settings and seqno
|
|
// set to 0.
|
|
explicit ConfigBase(std::optional<ustring_view> dump = std::nullopt);
|
|
|
|
// Tracks whether we need to dump again; most mutating methods should set this to true (unless
|
|
// calling set_state, which sets to to true implicitly).
|
|
bool _needs_dump = false;
|
|
|
|
// Sets the current state; this also sets _needs_dump to true. If transitioning to a dirty
|
|
// state and we know our current message hash, that hash gets added to `old_hashes_` to be
|
|
// deleted at the next push.
|
|
void set_state(ConfigState s);
|
|
|
|
// Invokes the `logger` callback if set, does nothing if there is no logger.
|
|
void log(LogLevel lvl, std::string msg) {
|
|
if (logger)
|
|
logger(lvl, std::move(msg));
|
|
}
|
|
|
|
// Returns a reference to the current MutableConfigMessage. If the current message is not
|
|
// already dirty (i.e. Clean or Waiting) then calling this increments the seqno counter.
|
|
MutableConfigMessage& dirty();
|
|
|
|
public:
|
|
// class for proxying subfield access; this class should never be stored but only used
|
|
// ephemerally (most of its methods are rvalue-qualified). This lets constructs such as
|
|
// foo["abc"]["def"]["ghi"] = 12;
|
|
// work, auto-vivifying (or trampling, if not a dict) subdicts to reach the target. It also
|
|
// allows non-vivifying value retrieval via .string(), .integer(), etc. methods.
|
|
class DictFieldProxy {
|
|
private:
|
|
ConfigBase& _conf;
|
|
std::vector<std::string> _inter_keys;
|
|
std::string _last_key;
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::get_clean_pair
|
|
///
|
|
/// See if we can find the key without needing to create anything, so that we can attempt to
|
|
/// access values without mutating anything (which allows, among other things, for assigning
|
|
/// of the existing value to not dirty anything). Returns nullptrs if the value or
|
|
/// something along its path would need to be created, or has the wrong type; otherwise a
|
|
/// const pointer to the key and the value. The templated type, if provided, can be one of
|
|
/// the types a dict_value can hold to also check that the returned value has a particular
|
|
/// type; if omitted you get back the dict_value pointer itself. If the field exists but is
|
|
/// not the requested `T` type, you get back the key string pointer with a nullptr value.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `const std::string*` -- Key
|
|
/// - `const T*` -- Value
|
|
template <typename T = dict_value, typename = std::enable_if_t<is_dict_value<T>>>
|
|
std::pair<const std::string*, const T*> get_clean_pair() const {
|
|
const config::dict* data = &_conf._config->data();
|
|
// All but the last need to be dicts:
|
|
for (const auto& key : _inter_keys) {
|
|
auto it = data->find(key);
|
|
data = it != data->end() ? std::get_if<config::dict>(&it->second) : nullptr;
|
|
if (!data)
|
|
return {nullptr, nullptr};
|
|
}
|
|
|
|
const std::string* key;
|
|
const dict_value* val;
|
|
// The last can be any value type:
|
|
if (auto it = data->find(_last_key); it != data->end()) {
|
|
key = &it->first;
|
|
val = &it->second;
|
|
} else
|
|
return {nullptr, nullptr};
|
|
|
|
if constexpr (std::is_same_v<T, dict_value>)
|
|
return {key, val};
|
|
else if constexpr (is_dict_subtype<T>) {
|
|
return {key, std::get_if<T>(val)};
|
|
} else { // int64 or std::string, i.e. the config::scalar sub-types.
|
|
if (auto* scalar = std::get_if<config::scalar>(val))
|
|
return {key, std::get_if<T>(scalar)};
|
|
return {key, nullptr};
|
|
}
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::get_clean
|
|
///
|
|
/// Same as above `get_clean_pair()` but just gives back the value, not the key
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `const T*` -- Value
|
|
template <typename T = dict_value, typename = std::enable_if_t<is_dict_value<T>>>
|
|
const T* get_clean() const {
|
|
return get_clean_pair<T>().second;
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::get_dirty
|
|
///
|
|
/// Returns a lvalue reference to the value, stomping its way through the dict as it goes to
|
|
/// create subdicts as needed to reach the target value. If given a template type then we
|
|
/// also cast the final dict_value variant into the given type (and replace if with a
|
|
/// default-constructed value if it has the wrong type) then return a reference to that.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `T&` -- Value
|
|
template <typename T = dict_value, typename = std::enable_if_t<is_dict_value<T>>>
|
|
T& get_dirty() {
|
|
config::dict* data = &_conf.dirty().data();
|
|
for (const auto& key : _inter_keys) {
|
|
auto& val = (*data)[key];
|
|
data = std::get_if<config::dict>(&val);
|
|
if (!data)
|
|
data = &val.emplace<config::dict>();
|
|
}
|
|
auto& val = (*data)[_last_key];
|
|
|
|
if constexpr (std::is_same_v<T, dict_value>)
|
|
return val;
|
|
else if constexpr (is_dict_subtype<T>) {
|
|
if (auto* v = std::get_if<T>(&val))
|
|
return *v;
|
|
return val.emplace<T>();
|
|
} else { // int64 or std::string, i.e. the config::scalar sub-types.
|
|
if (auto* scalar = std::get_if<config::scalar>(&val)) {
|
|
if (auto* v = std::get_if<T>(scalar))
|
|
return *v;
|
|
return scalar->emplace<T>();
|
|
}
|
|
return val.emplace<scalar>().emplace<T>();
|
|
}
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::assign_if_changed
|
|
///
|
|
/// Takes a value and assigns it to the dict only if that value is different.
|
|
/// Will avoid dirtying the config if the assignement isnt changing anything
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- This will be assigned to the dict if it has changed
|
|
template <typename T>
|
|
void assign_if_changed(T value) {
|
|
if constexpr (is_one_of<T, config::set, config::dict>) {
|
|
// If we're assigning an empty set or dict then that's really the same as deleting
|
|
// the element, since empty sets/dicts get pruned. If we *don't* do this, then
|
|
// assigning an empty value will dirty even though, ultimately, we aren't changing
|
|
// anything.
|
|
if (value.empty()) {
|
|
erase();
|
|
return;
|
|
}
|
|
}
|
|
// Try to avoiding dirtying the config if this assignment isn't changing anything
|
|
if (!_conf.is_dirty())
|
|
if (auto current = get_clean<T>(); current && *current == value)
|
|
return;
|
|
|
|
get_dirty<T>() = std::move(value);
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::insert_if_missing
|
|
///
|
|
/// Takes a value and assigns it to the dict if it does not exist
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- This will be assigned to the dict if it is missing
|
|
void insert_if_missing(config::scalar&& value) {
|
|
if (!_conf.is_dirty())
|
|
if (auto current = get_clean<config::set>(); current && current->count(value))
|
|
return;
|
|
|
|
get_dirty<config::set>().insert(std::move(value));
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::set_erase_impl
|
|
///
|
|
/// Erases from the dict
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- This will be deleted from the dict
|
|
void set_erase_impl(const config::scalar& value) {
|
|
if (!_conf.is_dirty())
|
|
if (auto current = get_clean<config::set>(); current && !current->count(value))
|
|
return;
|
|
|
|
config::dict* data = &_conf.dirty().data();
|
|
|
|
for (const auto& key : _inter_keys) {
|
|
auto it = data->find(key);
|
|
data = it != data->end() ? std::get_if<config::dict>(&it->second) : nullptr;
|
|
if (!data)
|
|
return;
|
|
}
|
|
|
|
auto it = data->find(_last_key);
|
|
if (it == data->end())
|
|
return;
|
|
auto& val = it->second;
|
|
if (auto* current = std::get_if<config::set>(&val))
|
|
current->erase(value);
|
|
else
|
|
val.emplace<config::set>();
|
|
}
|
|
|
|
public:
|
|
DictFieldProxy(ConfigBase& b, std::string key) : _conf{b}, _last_key{std::move(key)} {}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator[]&
|
|
///
|
|
/// Descends into a dict, returning a copied proxy object for the path to the requested
|
|
/// field. Nothing is created by doing this unless you actually assign to a value.
|
|
///
|
|
/// Inputs:
|
|
/// - `subkey` -- searches through the dict this requested field
|
|
///
|
|
/// Outputs:
|
|
/// - `DictFieldProxy` -- Returns a copied proxy object
|
|
DictFieldProxy operator[](std::string subkey) const& {
|
|
DictFieldProxy subfield{_conf, std::move(subkey)};
|
|
subfield._inter_keys.reserve(_inter_keys.size() + 1);
|
|
subfield._inter_keys.insert(
|
|
subfield._inter_keys.end(), _inter_keys.begin(), _inter_keys.end());
|
|
subfield._inter_keys.push_back(_last_key);
|
|
return subfield;
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator[]&&
|
|
///
|
|
/// Same as above `operator[]&`, but when called on an rvalue reference we just mutate the
|
|
/// current proxy to the new dict path.
|
|
///
|
|
/// Inputs:
|
|
/// - `subkey` -- searches through the dict this requested field
|
|
///
|
|
/// Outputs:
|
|
/// - `DictFieldProxy&&` -- Mutate the current proxy to the new dict path
|
|
DictFieldProxy&& operator[](std::string subkey) && {
|
|
_inter_keys.push_back(std::move(_last_key));
|
|
_last_key = std::move(subkey);
|
|
return std::move(*this);
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::key
|
|
///
|
|
/// Returns a pointer to the (deepest level) key for this dict pair *if* a pair exists at
|
|
/// the given location, nullptr otherwise. This allows a caller to get a reference to the
|
|
/// actual key, rather than an ephemeral copy of the current key value.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `std::string*` -- Returns a pointer to the key if the pair exists
|
|
const std::string* key() const { return get_clean_pair().first; }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::string
|
|
///
|
|
/// Returns a const pointer to the string if one exists at the given location, nullptr
|
|
/// otherwise.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `std::string*` -- Returns a pointer to the string if one exists
|
|
const std::string* string() const { return get_clean<std::string>(); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::uview
|
|
///
|
|
/// Returns the value as a ustring_view, if it exists and is a string; nullopt otherwise.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `std::optional<ustring_view>` -- Returns a value as a view if it exists
|
|
std::optional<ustring_view> uview() const {
|
|
if (auto* s = get_clean<std::string>())
|
|
return ustring_view{reinterpret_cast<const unsigned char*>(s->data()), s->size()};
|
|
return std::nullopt;
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::string_view_or
|
|
///
|
|
/// returns the value as a string_view or a fallback if the value doesn't exist (or isn't a
|
|
/// string). The returned view is directly into the value (or fallback) and so mustn't be
|
|
/// used beyond the validity of either.
|
|
///
|
|
/// Inputs:
|
|
/// - `fallback` -- this value will be returned if it the requested value doesn't exist
|
|
///
|
|
/// Outputs:
|
|
/// - `std::string_view` -- Returned string view
|
|
std::string_view string_view_or(std::string_view fallback) const {
|
|
if (auto* s = string())
|
|
return {*s};
|
|
return fallback;
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::string_or
|
|
///
|
|
/// Returns a copy of the value as a string, if it exists and is a string; returns
|
|
/// `fallback` otherwise.
|
|
///
|
|
/// Inputs:
|
|
/// - `fallback` -- this value will be returned if it the requested value doesn't exist
|
|
///
|
|
/// Outputs:
|
|
/// - `std::string` -- Returned string
|
|
std::string string_or(std::string fallback) const {
|
|
if (auto* s = string())
|
|
return *s;
|
|
return fallback;
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::integer
|
|
///
|
|
/// Returns a const pointer to the integer if one exists at the given location, nullptr
|
|
/// otherwise.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `int64_t*` -- Pointer to the integer if one exists
|
|
const int64_t* integer() const { return get_clean<int64_t>(); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::integer_or
|
|
///
|
|
/// Returns the value as an integer or a fallback if the value doesn't exist (or isn't an
|
|
/// integer).
|
|
///
|
|
/// Inputs:
|
|
/// - `fallback` -- this value will be returned if it the requested value doesn't exist
|
|
///
|
|
/// Outputs:
|
|
/// - `int64_t` -- Returned Integer
|
|
int64_t integer_or(int64_t fallback) const {
|
|
if (auto* i = integer())
|
|
return *i;
|
|
return fallback;
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::set
|
|
///
|
|
/// Returns a const pointer to the set if one exists at the given location, nullptr
|
|
/// otherwise.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `config::set*` -- Returned pointer to the set if one exists
|
|
const config::set* set() const { return get_clean<config::set>(); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::dict
|
|
///
|
|
/// Returns a const pointer to the dict if one exists at the given location, nullptr
|
|
/// otherwise. (You typically don't need to use this but can rather just use [] to descend
|
|
/// into the dict).
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `config::dict*` -- Returned pointer to the dict if one exists
|
|
const config::dict* dict() const { return get_clean<config::dict>(); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator=(std::string&&)
|
|
///
|
|
/// Replaces the current value with the given string. This also auto-vivifies any
|
|
/// intermediate dicts needed to reach the given key, including replacing non-dict values if
|
|
/// they currently exist along the path.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- replaces current value with given string
|
|
void operator=(std::string&& value) { assign_if_changed(std::move(value)); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator=(std::string_view)
|
|
///
|
|
/// Replaces the current value with the given string_view. This also auto-vivifies any
|
|
/// intermediate dicts needed to reach the given key, including replacing non-dict values if
|
|
/// they currently exist along the path (this makes a copy).
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- replaces current value with given string view
|
|
void operator=(std::string_view value) { *this = std::string{value}; }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator=(ustring_view)
|
|
///
|
|
/// Replaces the current value with the given ustring_view. This also auto-vivifies any
|
|
/// intermediate dicts needed to reach the given key, including replacing non-dict values if
|
|
/// they currently exist along the path (this makes a copy).
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- replaces current value with given ustring_view
|
|
///
|
|
/// Same as above, but takes a ustring_view
|
|
void operator=(ustring_view value) {
|
|
*this = std::string{reinterpret_cast<const char*>(value.data()), value.size()};
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator=(int64_t)
|
|
///
|
|
/// Replaces the current value with the given integer. This also auto-vivifies any
|
|
/// intermediate dicts needed to reach the given key, including replacing non-dict values if
|
|
/// they currently exist along the path.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- replaces current value with given integer
|
|
void operator=(int64_t value) { assign_if_changed(value); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator=(config::set)
|
|
///
|
|
/// Replaces the current value with the given set. This also auto-vivifies any
|
|
/// intermediate dicts needed to reach the given key, including replacing non-dict values if
|
|
/// they currently exist along the path.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- replaces current value with given set
|
|
void operator=(config::set value) { assign_if_changed(std::move(value)); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::operator=(config::set)
|
|
///
|
|
/// Replaces the current value with the given dict. This often isn't needed because of how
|
|
/// other assignment operations work This also auto-vivifies any intermediate dicts needed
|
|
/// to reach the given key, including replacing non-dict values if they currently exist
|
|
/// along the path.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- replaces current value with given dict
|
|
void operator=(config::dict value) { assign_if_changed(std::move(value)); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::exists
|
|
///
|
|
/// Returns true if there is a value at the current key. If a template type T is given, it
|
|
/// only returns true if that value also is a `T`.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- True if there is a value at the current key
|
|
template <typename T = dict_value, typename = std::enable_if_t<is_dict_value<T>>>
|
|
bool exists() const {
|
|
return get_clean<T>() != nullptr;
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::exists
|
|
///
|
|
/// Alias for `exists<T>()`
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- True if there is a value at the current key
|
|
template <typename T>
|
|
bool is() const {
|
|
return exists<T>();
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::erase
|
|
///
|
|
/// Removes the value at the current location, regardless of what it currently is. This
|
|
/// does nothing if the current location does not have a value.
|
|
///
|
|
/// Inputs: None
|
|
void erase() {
|
|
if (!_conf.is_dirty() && !get_clean())
|
|
return;
|
|
|
|
config::dict* data = &_conf.dirty().data();
|
|
for (const auto& key : _inter_keys) {
|
|
auto it = data->find(key);
|
|
data = it != data->end() ? std::get_if<config::dict>(&it->second) : nullptr;
|
|
if (!data)
|
|
return;
|
|
}
|
|
data->erase(_last_key);
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::set_insert(std::string)
|
|
///
|
|
/// Adds a value to the set at the current location. If the current value is not a set or
|
|
/// does not exist then dicts will be created to reach it and a new set will be created.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- The value to be set
|
|
void set_insert(std::string_view value) {
|
|
insert_if_missing(config::scalar{std::string{value}});
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::set_insert(int64_t)
|
|
///
|
|
/// Adds a value to the set at the current location. If the current value is not a set or
|
|
/// does not exist then dicts will be created to reach it and a new set will be created.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- The value to be set
|
|
void set_insert(int64_t value) { insert_if_missing(config::scalar{value}); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::set_erase(std::string_view)
|
|
///
|
|
/// Removes a value from the set at the current location. If the current value does not
|
|
/// exist then nothing happens. If it does exist, but is not a set, it will be replaced
|
|
/// with an empty set. Otherwise the given value will be removed from the set, if present.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- The value to be set
|
|
void set_erase(std::string_view value) {
|
|
set_erase_impl(config::scalar{std::string{value}});
|
|
}
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::set_erase(int64_t)
|
|
///
|
|
/// Removes a value from the set at the current location. If the current value does not
|
|
/// exist then nothing happens. If it does exist, but is not a set, it will be replaced
|
|
/// with an empty set. Otherwise the given value will be removed from the set, if present.
|
|
///
|
|
/// Inputs:
|
|
/// - `value` -- The value to be set
|
|
void set_erase(int64_t value) { set_erase_impl(scalar{value}); }
|
|
|
|
/// API: base/ConfigBase::DictFieldProxy::emplace
|
|
///
|
|
/// Emplaces a value at the current location. As with assignment, this creates dicts as
|
|
/// needed along the keys to reach the target. The existing value (if present) is destroyed
|
|
/// to make room for the new one.
|
|
///
|
|
/// Inputs:
|
|
/// - `args` -- Value to be emplaced at current location
|
|
///
|
|
/// Outputs:
|
|
/// - `T&` -- Returns a reference to the templated type
|
|
template <
|
|
typename T,
|
|
typename... Args,
|
|
typename = std::enable_if_t<
|
|
is_one_of<T, config::set, config::dict, int64_t, std::string>>>
|
|
T& emplace(Args&&... args) {
|
|
if constexpr (is_one_of<T, int64_t, std::string>)
|
|
return get_dirty<scalar>().emplace<T>(std::forward<Args>(args)...);
|
|
|
|
return get_dirty().emplace<T>(std::forward<Args>(args)...);
|
|
}
|
|
};
|
|
|
|
/// Wrapper for the ConfigBase's root `data` field to provide data access. Only provides a []
|
|
/// that gets you into a DictFieldProxy.
|
|
class DictFieldRoot {
|
|
ConfigBase& _conf;
|
|
DictFieldRoot(DictFieldRoot&&) = delete;
|
|
DictFieldRoot(const DictFieldRoot&) = delete;
|
|
DictFieldRoot& operator=(DictFieldRoot&&) = delete;
|
|
DictFieldRoot& operator=(const DictFieldRoot&) = delete;
|
|
|
|
public:
|
|
DictFieldRoot(ConfigBase& b) : _conf{b} {}
|
|
|
|
/// API: base/ConfigBase::DictFieldRoot::operator[]
|
|
///
|
|
/// Access a dict element. This returns a proxy object for accessing the value, but does
|
|
/// *not* auto-vivify the path (unless/until you assign to it).
|
|
///
|
|
/// Inputs:
|
|
/// - `key` -- Access a dict element with this key
|
|
///
|
|
/// Outputs:
|
|
/// - `DictFieldProxy` -- Returns a proxy object for accessing the value
|
|
DictFieldProxy operator[](std::string key) const& {
|
|
return DictFieldProxy{_conf, std::move(key)};
|
|
}
|
|
};
|
|
|
|
protected:
|
|
/// API: base/ConfigBase::extra_data
|
|
///
|
|
/// Called when dumping to obtain any extra data that a subclass needs to store to reconstitute
|
|
/// the object. The base implementation does nothing. The counterpart to this,
|
|
/// `load_extra_data()`, is called when loading from a dump that has extra data; a subclass
|
|
/// should either override both (if it needs to serialize extra data) or neither (if it needs no
|
|
/// extra data). Internally this extra data (if non-empty) is stored in the "+" key of the
|
|
/// dump.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `oxenc::bt_dict` -- Returns a btdict of the data
|
|
virtual oxenc::bt_dict extra_data() const { return {}; }
|
|
|
|
/// API: base/ConfigBase::load_extra_data
|
|
///
|
|
/// Called when constructing from a dump that has extra data. The base implementation does
|
|
/// nothing.
|
|
///
|
|
/// Inputs:
|
|
/// - `extra` -- bt_dict containing a previous dump of data
|
|
virtual void load_extra_data(oxenc::bt_dict extra) {}
|
|
|
|
/// API: base/ConfigBase::load_key
|
|
///
|
|
/// Called to load an ed25519 key for encryption; this is meant for use by single-ownership
|
|
/// config types, like UserProfile, but not shared config types (closed groups).
|
|
///
|
|
/// Takes a binary string which is either the 32-byte seed, or 64-byte libsodium secret (which
|
|
/// is just the seed and pubkey concatenated together), and then calls `key(...)` with the seed.
|
|
/// Throws std::invalid_argument if given something that doesn't match the required input.
|
|
///
|
|
/// Inputs:
|
|
/// - `ed25519_secret_key` -- key is loaded for encryption
|
|
void load_key(ustring_view ed25519_secretkey);
|
|
|
|
public:
|
|
virtual ~ConfigBase();
|
|
|
|
// Proxy class providing read and write access to the contained config data.
|
|
const DictFieldRoot data{*this};
|
|
|
|
// If set then we log things by calling this callback
|
|
std::function<void(LogLevel lvl, std::string msg)> logger;
|
|
|
|
/// API: base/ConfigBase::storage_namespace
|
|
///
|
|
/// Accesses the storage namespace where this config type is to be stored/loaded from. See
|
|
/// namespaces.hpp for the underlying integer values.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `Namespace` -- Returns the namespace where config type is stored/loaded
|
|
virtual Namespace storage_namespace() const = 0;
|
|
|
|
/// API: base/ConfigBase::encryption_domain
|
|
///
|
|
/// Subclasses must override this to return a constant string that is unique per config type;
|
|
/// this value is used for domain separation in encryption. The string length must be between 1
|
|
/// and 24 characters; use the class name (e.g. "UserProfile") unless you have something better
|
|
/// to use. This is rarely needed externally; it is public merely for testing purposes.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `Namespace` -- Returns the namespace where config type is stored/loaded
|
|
virtual const char* encryption_domain() const = 0;
|
|
|
|
/// API: base/ConfigBase::compression_level
|
|
///
|
|
/// The zstd compression level to use for this type. Subclasses can override this if they have
|
|
/// some particular special compression level, or to disable compression entirely (by returning
|
|
/// std::nullopt). The default is zstd level 1.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `std::optional<int>` -- Returns the compression level
|
|
virtual std::optional<int> compression_level() const { return 1; }
|
|
|
|
/// API: base/ConfigBase::config_lags
|
|
///
|
|
/// How many config lags should be used for this object; default to 5. Implementing subclasses
|
|
/// can override to return a different constant if desired. More lags require more "diff"
|
|
/// storage in the config messages, but also allow for a higher tolerance of simultaneous
|
|
/// message conflicts.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `int` -- Returns how many config lags
|
|
virtual int config_lags() const { return 5; }
|
|
|
|
/// API: base/ConfigBase::merge
|
|
///
|
|
/// This takes all of the messages pulled down from the server and does whatever is necessary to
|
|
/// merge (or replace) the current values.
|
|
///
|
|
/// Values are pairs of the message hash (as provided by the server) and the raw message body.
|
|
///
|
|
/// After this call the caller should check `needs_push()` to see if the data on hand was
|
|
/// updated and needs to be pushed to the server again (for example, because the data contained
|
|
/// conflicts that required another update to resolve).
|
|
///
|
|
/// Returns the number of the given config messages that were successfully parsed.
|
|
///
|
|
/// Will throw on serious error (i.e. if neither the current nor any of the given configs are
|
|
/// parseable). This should not happen (the current config, at least, should always be
|
|
/// re-parseable).
|
|
///
|
|
/// Declaration:
|
|
/// ```cpp
|
|
/// std::vector<std::string> merge(
|
|
/// const std::vector<std::pair<std::string, ustring_view>>& configs);
|
|
/// std::vector<std::string> merge(
|
|
/// const std::vector<std::pair<std::string, ustring>>& configs);
|
|
/// ```
|
|
///
|
|
/// Inputs:
|
|
/// - `configs` -- vector of pairs containing the message hash and the raw message body
|
|
///
|
|
/// Outputs:
|
|
/// - vector of successfully parsed hashes. Note that this does not mean the hash was recent or
|
|
/// that it changed the config, merely that the returned hash was properly parsed and
|
|
/// processed as a config message, even if it was too old to be useful (or was already known
|
|
/// to be included). The hashes will be in the same order as in the input vector.
|
|
virtual std::vector<std::string> merge(
|
|
const std::vector<std::pair<std::string, ustring_view>>& configs);
|
|
|
|
// Same as merge (above )but takes the values as ustring's as sometimes that is more convenient.
|
|
std::vector<std::string> merge(const std::vector<std::pair<std::string, ustring>>& configs);
|
|
|
|
/// API: base/ConfigBase::is_dirty
|
|
///
|
|
/// Returns true if we are currently dirty (i.e. have made changes that haven't been serialized
|
|
/// yet).
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- Returns true if changes havent been serialized
|
|
bool is_dirty() const { return _state == ConfigState::Dirty; }
|
|
|
|
/// API: base/ConfigBase::is_clean
|
|
///
|
|
/// Returns true if we are curently clean (i.e. our current config is stored on the server and
|
|
/// unmodified).
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- Returns true if changes have been serialized
|
|
bool is_clean() const { return _state == ConfigState::Clean; }
|
|
|
|
/// API: base/ConfigBase::current_hashes
|
|
///
|
|
/// The current config hash(es); this can be empty if the current hash is unknown or the current
|
|
/// state is not clean (i.e. a push is needed or pending).
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `std::vector<std::string>` -- Returns current config hashes
|
|
std::vector<std::string> current_hashes() const;
|
|
|
|
/// API: base/ConfigBase::needs_push
|
|
///
|
|
/// Returns true if this object contains updated data that has not yet been confirmed stored on
|
|
/// the server. This will be true whenever `is_clean()` is false: that is, if we are currently
|
|
/// "dirty" (i.e. have changes that haven't been pushed) or are still awaiting confirmation of
|
|
/// storage of the most recent serialized push data.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- Returns true if the object needs pushing
|
|
virtual bool needs_push() const;
|
|
|
|
/// API: base/ConfigBase::push
|
|
///
|
|
/// Returns a tuple of three elements:
|
|
/// - the seqno value of the data
|
|
/// - the data message to push to the server
|
|
/// - a list of known message hashes that are obsoleted by this push.
|
|
///
|
|
/// Additionally, if the internal state is currently dirty (i.e. there are unpushed changes),
|
|
/// the internal state will be marked as awaiting-confirmation. Any further data changes made
|
|
/// after this call will re-dirty the data (incrementing seqno and requiring another push).
|
|
///
|
|
/// The client is expected to send a sequence request to the server that stores the message and
|
|
/// deletes the hashes (if any). It is strongly recommended to use a sequence rather than a
|
|
/// batch so that the deletions won't happen if the store fails for some reason.
|
|
///
|
|
/// Upon successful completion of the store+deletion requests the client should call
|
|
/// `confirm_pushed` with the seqno value to confirm that the message has been stored.
|
|
///
|
|
/// Subclasses that need to perform pre-push tasks (such as pruning stale data) can override
|
|
/// this to prune and then call the base method to perform the actual push generation.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `std::tuple<seqno_t, ustring, std::vector<std::string>>` - Returns a tuple containing
|
|
/// - `seqno_t` -- sequence number
|
|
/// - `ustring` -- data message to push to the server
|
|
/// - `std::vector<std::string>` -- list of known message hashes
|
|
virtual std::tuple<seqno_t, ustring, std::vector<std::string>> push();
|
|
|
|
/// API: base/ConfigBase::confirm_pushed
|
|
///
|
|
/// Should be called after the push is confirmed stored on the storage server swarm to let the
|
|
/// object know the config message has been stored and, ideally, that the obsolete messages
|
|
/// returned by `push()` are deleted. Once this is called `needs_push` will start returning
|
|
/// false until something changes. Takes the seqno that was pushed so that the object can
|
|
/// ensure that the latest version was pushed (i.e. in case there have been other changes since
|
|
/// the `push()` call that returned this seqno).
|
|
///
|
|
/// Ideally the caller should have both stored the returned message and deleted the given
|
|
/// messages. The deletion step isn't critical (it is just cleanup) and callers should call
|
|
/// this as long as the store succeeded even if there were errors in the deletions.
|
|
///
|
|
/// It is safe to call this multiple times with the same seqno value, and with out-of-order
|
|
/// seqnos (e.g. calling with seqno 122 after having called with 123; the duplicates and earlier
|
|
/// ones will just be ignored).
|
|
///
|
|
/// Inputs:
|
|
/// - `seqno` -- sequence number that was pushed
|
|
/// - `msg_hash` -- message hash that was pushed
|
|
virtual void confirm_pushed(seqno_t seqno, std::string msg_hash);
|
|
|
|
/// API: base/ConfigBase::dump
|
|
///
|
|
/// Returns a dump of the current state for storage in the database; this value would get passed
|
|
/// into the constructor to reconstitute the object (including the push/not pushed status). This
|
|
/// method is *not* virtual: if subclasses need to store extra data they should set it in the
|
|
/// `subclass_data` field.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `ustring` -- Returns binary data of the state dump
|
|
ustring dump();
|
|
|
|
/// API: base/ConfigBase::needs_dump
|
|
///
|
|
/// Returns true if something has changed since the last call to `dump()` that requires calling
|
|
/// and saving the `dump()` data again.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- Returns true if something has changed since last call to dump
|
|
virtual bool needs_dump() const { return _needs_dump; }
|
|
|
|
/// API: base/ConfigBase::add_key
|
|
///
|
|
/// Encryption key methods. For classes that have a single, static key (such as user profile
|
|
/// storage types) these methods typically don't need to be used: the subclass calls them
|
|
/// automatically.
|
|
///
|
|
/// Adds an encryption/decryption key, without removing existing keys. They key must be exactly
|
|
/// 32 bytes long. The newly added key becomes the highest priority key (unless the
|
|
/// `high_priority` argument is set to false' see below): it will be used for encryption of
|
|
/// config pushes after the call, and will be tried first when decrypting, followed by keys
|
|
/// present (if any) before this call. If the given key is already present in the key list then
|
|
/// this call moves it to the front of the list (if not already at the front).
|
|
///
|
|
/// If the `high_priority` argument is specified and false, then the key is added to the *end*
|
|
/// of the key list instead of the beginning: that is, it will not replace the current
|
|
/// highest-priority key used for encryption, but will still be usable for decryption of new
|
|
/// incoming messages (after trying keys present before the call). If the key already exists
|
|
/// then nothing happens with `high_priority=false` (in particular, it is *not* repositioned, in
|
|
/// contrast to high_priority=true behaviour).
|
|
///
|
|
/// Will throw a std::invalid_argument if the key is not 32 bytes.
|
|
///
|
|
/// Inputs:
|
|
/// - `ustring_view key` -- 32 byte binary key
|
|
/// - `high_priority` -- Whether to add to front or back of key list. If true then key is added
|
|
/// to beginning and replace highest-priority key for encryption
|
|
void add_key(ustring_view key, bool high_priority = true);
|
|
|
|
/// API: base/ConfigBase::clear_keys
|
|
///
|
|
/// Clears all stored encryption/decryption keys. This is typically immediately followed with
|
|
/// one or more `add_key` call to replace existing keys. Returns the number of keys removed.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `int` -- Returns number of keys removed
|
|
int clear_keys();
|
|
|
|
/// API: base/ConfigBase::remove_key
|
|
///
|
|
/// Removes the given encryption/decryption key, if present. Returns true if it was found and
|
|
/// removed, false if it was not in the key list.
|
|
///
|
|
/// The optional second argument removes the key only from position `from` or higher. It is
|
|
/// mainly for internal use and is usually omitted.
|
|
///
|
|
/// Inputs:
|
|
/// - `key` -- the key to remove from the key list
|
|
/// - `from` -- optional agrument to specify which position to remove from, usually omitted
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- Returns true if found and removed
|
|
bool remove_key(ustring_view key, size_t from = 0);
|
|
|
|
/// API: base/ConfigBase::get_keys
|
|
///
|
|
/// Returns a vector of encryption keys, in priority order (i.e. element 0 is the encryption
|
|
/// key, and the first decryption key).
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `std::vector<ustring_view>` -- Returns vector of encryption keys
|
|
std::vector<ustring_view> get_keys() const;
|
|
|
|
/// API: base/ConfigBase::key_count
|
|
///
|
|
/// Returns the number of encryption keys.
|
|
///
|
|
/// Inputs: None
|
|
///
|
|
/// Outputs:
|
|
/// - `int` -- Returns number of encryption keys
|
|
int key_count() const;
|
|
|
|
/// API: base/ConfigBase::has_key
|
|
///
|
|
/// Returns true if the given key is already in the keys list.
|
|
///
|
|
/// Inputs:
|
|
/// - `key` -- will search if this key exists in the key list
|
|
///
|
|
/// Outputs:
|
|
/// - `bool` -- Returns true if it does exist
|
|
bool has_key(ustring_view key) const;
|
|
|
|
/// API: base/ConfigBase::key
|
|
///
|
|
/// Accesses the key at position i (0 if omitted). There must be at least one key, and i must
|
|
/// be less than key_count(). The key at position 0 is used for encryption; for decryption all
|
|
/// keys are tried in order, starting from position 0.
|
|
///
|
|
/// Inputs:
|
|
/// - `i` -- keys position in key list
|
|
///
|
|
/// Outputs:
|
|
/// - `ustring_view` -- binary data of the key
|
|
ustring_view key(size_t i = 0) const {
|
|
assert(i < _keys_size);
|
|
return {_keys[i].data(), _keys[i].size()};
|
|
}
|
|
};
|
|
|
|
// The C++ struct we hold opaquely inside the C internals struct. This is designed so that any
|
|
// internals<T> has the same layout so that it doesn't matter whether we unbox to an
|
|
// internals<ConfigBase> or internals<SubType>.
|
|
template <
|
|
typename ConfigT = ConfigBase,
|
|
std::enable_if_t<std::is_base_of_v<ConfigBase, ConfigT>, int> = 0>
|
|
struct internals final {
|
|
std::unique_ptr<ConfigBase> config;
|
|
std::string error;
|
|
|
|
/// Dereferencing falls through to the ConfigBase object
|
|
ConfigT* operator->() {
|
|
if constexpr (std::is_same_v<ConfigT, ConfigBase>)
|
|
return config.get();
|
|
else {
|
|
auto* c = dynamic_cast<ConfigT*>(config.get());
|
|
assert(c);
|
|
return c;
|
|
}
|
|
}
|
|
const ConfigT* operator->() const {
|
|
if constexpr (std::is_same_v<ConfigT, ConfigBase>)
|
|
return config.get();
|
|
else {
|
|
auto* c = dynamic_cast<ConfigT*>(config.get());
|
|
assert(c);
|
|
return c;
|
|
}
|
|
}
|
|
ConfigT& operator*() { return *operator->(); }
|
|
const ConfigT& operator*() const { return *operator->(); }
|
|
};
|
|
|
|
template <typename T = ConfigBase, std::enable_if_t<std::is_base_of_v<ConfigBase, T>, int> = 0>
|
|
inline internals<T>& unbox(config_object* conf) {
|
|
return *static_cast<internals<T>*>(conf->internals);
|
|
}
|
|
template <typename T = ConfigBase, std::enable_if_t<std::is_base_of_v<ConfigBase, T>, int> = 0>
|
|
inline const internals<T>& unbox(const config_object* conf) {
|
|
return *static_cast<const internals<T>*>(conf->internals);
|
|
}
|
|
|
|
// Sets an error message in the internals.error string and updates the last_error pointer in the
|
|
// outer (C) config_object struct to point at it.
|
|
void set_error(config_object* conf, std::string e);
|
|
|
|
// Same as above, but gets the error string out of an exception and passed through a return value.
|
|
// Intended to simplify catch-and-return-error such as:
|
|
// try {
|
|
// whatever();
|
|
// } catch (const std::exception& e) {
|
|
// return set_error(conf, LIB_SESSION_ERR_OHNOES, e);
|
|
// }
|
|
inline int set_error(config_object* conf, int errcode, const std::exception& e) {
|
|
set_error(conf, e.what());
|
|
return errcode;
|
|
}
|
|
|
|
// Copies a value contained in a string into a new malloced char buffer, returning the buffer and
|
|
// size via the two pointer arguments.
|
|
void copy_out(ustring_view data, unsigned char** out, size_t* outlen);
|
|
|
|
} // namespace session::config
|