mirror of
https://github.com/Atmosphere-NX/Atmosphere-libs.git
synced 2025-06-21 19:12:42 +02:00
311 lines
12 KiB
C++
311 lines
12 KiB
C++
/*
|
|
* Copyright (c) Atmosphère-NX
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
* under the terms and conditions of the GNU General Public License,
|
|
* version 2, as published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope 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/>.
|
|
*/
|
|
#include <stratosphere.hpp>
|
|
|
|
namespace ams::kvdb {
|
|
|
|
/* Cache implementation. */
|
|
void *FileKeyValueStore::Cache::Allocate(size_t size) {
|
|
if (this->backing_buffer_size - this->backing_buffer_free_offset < size) {
|
|
return nullptr;
|
|
}
|
|
ON_SCOPE_EXIT { this->backing_buffer_free_offset += size; };
|
|
return this->backing_buffer + this->backing_buffer_free_offset;
|
|
}
|
|
|
|
Result FileKeyValueStore::Cache::Initialize(void *buffer, size_t buffer_size, size_t capacity) {
|
|
this->backing_buffer = static_cast<u8 *>(buffer);
|
|
this->backing_buffer_size = buffer_size;
|
|
this->backing_buffer_free_offset = 0;
|
|
this->entries = nullptr;
|
|
this->count = 0;
|
|
this->capacity = capacity;
|
|
|
|
/* If we have memory to work with, ensure it's at least enough for the cache entries. */
|
|
if (this->backing_buffer != nullptr) {
|
|
this->entries = static_cast<decltype(this->entries)>(this->Allocate(sizeof(*this->entries) * this->capacity));
|
|
R_UNLESS(this->entries != nullptr, kvdb::ResultBufferInsufficient());
|
|
}
|
|
|
|
return ResultSuccess();
|
|
}
|
|
|
|
void FileKeyValueStore::Cache::Invalidate() {
|
|
if (!this->HasEntries()) {
|
|
return;
|
|
}
|
|
|
|
/* Reset the allocation pool. */
|
|
this->backing_buffer_free_offset = 0;
|
|
this->count = 0;
|
|
this->entries = static_cast<decltype(this->entries)>(this->Allocate(sizeof(*this->entries) * this->capacity));
|
|
AMS_ABORT_UNLESS(this->entries != nullptr);
|
|
}
|
|
|
|
util::optional<size_t> FileKeyValueStore::Cache::TryGet(void *out_value, size_t max_out_size, const void *key, size_t key_size) {
|
|
if (!this->HasEntries()) {
|
|
return util::nullopt;
|
|
}
|
|
|
|
/* Try to find the entry. */
|
|
for (size_t i = 0; i < this->count; i++) {
|
|
const auto &entry = this->entries[i];
|
|
if (entry.key_size == key_size && std::memcmp(entry.key, key, key_size) == 0) {
|
|
/* If we don't have enough space, fail to read from cache. */
|
|
if (max_out_size < entry.value_size) {
|
|
return util::nullopt;
|
|
}
|
|
|
|
std::memcpy(out_value, entry.value, entry.value_size);
|
|
return entry.value_size;
|
|
}
|
|
}
|
|
|
|
return util::nullopt;
|
|
}
|
|
|
|
util::optional<size_t> FileKeyValueStore::Cache::TryGetSize(const void *key, size_t key_size) {
|
|
if (!this->HasEntries()) {
|
|
return util::nullopt;
|
|
}
|
|
|
|
/* Try to find the entry. */
|
|
for (size_t i = 0; i < this->count; i++) {
|
|
const auto &entry = this->entries[i];
|
|
if (entry.key_size == key_size && std::memcmp(entry.key, key, key_size) == 0) {
|
|
return entry.value_size;
|
|
}
|
|
}
|
|
|
|
return util::nullopt;
|
|
}
|
|
|
|
void FileKeyValueStore::Cache::Set(const void *key, size_t key_size, const void *value, size_t value_size) {
|
|
if (!this->HasEntries()) {
|
|
return;
|
|
}
|
|
|
|
/* Ensure key size is small enough. */
|
|
AMS_ABORT_UNLESS(key_size <= MaxKeySize);
|
|
|
|
/* If we're at capacity, invalidate the cache. */
|
|
if (this->count == this->capacity) {
|
|
this->Invalidate();
|
|
}
|
|
|
|
/* Allocate memory for the value. */
|
|
void *value_buf = this->Allocate(value_size);
|
|
if (value_buf == nullptr) {
|
|
/* We didn't have enough memory for the value. Invalidating might get us enough memory. */
|
|
this->Invalidate();
|
|
value_buf = this->Allocate(value_size);
|
|
if (value_buf == nullptr) {
|
|
/* If we still don't have enough memory, just fail to put the value in the cache. */
|
|
return;
|
|
}
|
|
}
|
|
|
|
auto &entry = this->entries[this->count++];
|
|
std::memcpy(entry.key, key, key_size);
|
|
entry.key_size = key_size;
|
|
entry.value = value_buf;
|
|
std::memcpy(entry.value, value, value_size);
|
|
entry.value_size = value_size;
|
|
}
|
|
|
|
bool FileKeyValueStore::Cache::Contains(const void *key, size_t key_size) {
|
|
return this->TryGetSize(key, key_size).has_value();
|
|
}
|
|
|
|
/* Store functionality. */
|
|
FileKeyValueStore::Path FileKeyValueStore::GetPath(const void *_key, size_t key_size) {
|
|
/* Format is "<dir>/<hex formatted key>.val" */
|
|
FileKeyValueStore::Path key_path(this->dir_path.Get());
|
|
key_path.Append('/');
|
|
|
|
/* Append hex formatted key. */
|
|
const u8 *key = static_cast<const u8 *>(_key);
|
|
for (size_t i = 0; i < key_size; i++) {
|
|
key_path.AppendFormat("%02x", key[i]);
|
|
}
|
|
|
|
/* Append extension. */
|
|
key_path.Append(FileExtension);
|
|
|
|
return key_path;
|
|
}
|
|
|
|
Result FileKeyValueStore::GetKey(size_t *out_size, void *_out_key, size_t max_out_size, const FileKeyValueStore::FileName &file_name) {
|
|
/* Validate that the filename can be converted to a key. */
|
|
/* TODO: Nintendo does not validate that the key is valid hex. Should we do this? */
|
|
const size_t file_name_len = file_name.GetLength();
|
|
const size_t key_name_len = file_name_len - FileExtensionLength;
|
|
R_UNLESS(file_name_len >= FileExtensionLength + 2, kvdb::ResultInvalidKeyValue());
|
|
R_UNLESS(file_name.EndsWith(FileExtension), kvdb::ResultInvalidKeyValue());
|
|
R_UNLESS(util::IsAligned(key_name_len, 2), kvdb::ResultInvalidKeyValue());
|
|
|
|
/* Validate that we have space for the converted key. */
|
|
const size_t key_size = key_name_len / 2;
|
|
R_UNLESS(key_size <= max_out_size, kvdb::ResultBufferInsufficient());
|
|
|
|
/* Convert the hex key back. */
|
|
u8 *out_key = static_cast<u8 *>(_out_key);
|
|
for (size_t i = 0; i < key_size; i++) {
|
|
char substr[2 * sizeof(u8) + 1];
|
|
file_name.GetSubstring(substr, sizeof(substr), 2 * i, sizeof(substr) - 1);
|
|
out_key[i] = static_cast<u8>(std::strtoul(substr, nullptr, 0x10));
|
|
}
|
|
|
|
*out_size = key_size;
|
|
return ResultSuccess();
|
|
}
|
|
|
|
Result FileKeyValueStore::Initialize(const char *dir) {
|
|
return this->InitializeWithCache(dir, nullptr, 0, 0);
|
|
}
|
|
|
|
Result FileKeyValueStore::InitializeWithCache(const char *dir, void *cache_buffer, size_t cache_buffer_size, size_t cache_capacity) {
|
|
/* Ensure that the passed path is a directory. */
|
|
fs::DirectoryEntryType entry_type;
|
|
R_TRY(fs::GetEntryType(std::addressof(entry_type), dir));
|
|
R_UNLESS(entry_type == fs::DirectoryEntryType_Directory, fs::ResultPathNotFound());
|
|
|
|
/* Set path. */
|
|
this->dir_path.Set(dir);
|
|
|
|
/* Initialize our cache. */
|
|
R_TRY(this->cache.Initialize(cache_buffer, cache_buffer_size, cache_capacity));
|
|
return ResultSuccess();
|
|
}
|
|
|
|
Result FileKeyValueStore::Get(size_t *out_size, void *out_value, size_t max_out_size, const void *key, size_t key_size) {
|
|
std::scoped_lock lk(this->lock);
|
|
|
|
/* Ensure key size is small enough. */
|
|
R_UNLESS(key_size <= MaxKeySize, kvdb::ResultOutOfKeyResource());
|
|
|
|
/* Try to get from cache. */
|
|
{
|
|
auto size = this->cache.TryGet(out_value, max_out_size, key, key_size);
|
|
if (size) {
|
|
*out_size = *size;
|
|
return ResultSuccess();
|
|
}
|
|
}
|
|
|
|
/* Open the value file. */
|
|
fs::FileHandle file;
|
|
R_TRY_CATCH(fs::OpenFile(std::addressof(file), this->GetPath(key, key_size), fs::OpenMode_Read)) {
|
|
R_CONVERT(fs::ResultPathNotFound, kvdb::ResultKeyNotFound());
|
|
} R_END_TRY_CATCH;
|
|
ON_SCOPE_EXIT { fs::CloseFile(file); };
|
|
|
|
/* Get the value size. */
|
|
s64 file_size;
|
|
R_TRY(fs::GetFileSize(std::addressof(file_size), file));
|
|
|
|
/* Ensure there's enough space for the value. */
|
|
R_UNLESS(file_size <= static_cast<s64>(max_out_size), kvdb::ResultBufferInsufficient());
|
|
|
|
/* Read the value. */
|
|
const size_t value_size = static_cast<size_t>(file_size);
|
|
R_TRY(fs::ReadFile(file, 0, out_value, value_size));
|
|
*out_size = value_size;
|
|
|
|
/* Cache the newly read value. */
|
|
this->cache.Set(key, key_size, out_value, value_size);
|
|
return ResultSuccess();
|
|
}
|
|
|
|
Result FileKeyValueStore::GetSize(size_t *out_size, const void *key, size_t key_size) {
|
|
std::scoped_lock lk(this->lock);
|
|
|
|
/* Ensure key size is small enough. */
|
|
R_UNLESS(key_size <= MaxKeySize, kvdb::ResultOutOfKeyResource());
|
|
|
|
/* Try to get from cache. */
|
|
{
|
|
auto size = this->cache.TryGetSize(key, key_size);
|
|
if (size) {
|
|
*out_size = *size;
|
|
return ResultSuccess();
|
|
}
|
|
}
|
|
|
|
/* Open the value file. */
|
|
fs::FileHandle file;
|
|
R_TRY_CATCH(fs::OpenFile(std::addressof(file), this->GetPath(key, key_size), fs::OpenMode_Read)) {
|
|
R_CONVERT(fs::ResultPathNotFound, kvdb::ResultKeyNotFound());
|
|
} R_END_TRY_CATCH;
|
|
ON_SCOPE_EXIT { fs::CloseFile(file); };
|
|
|
|
/* Get the value size. */
|
|
s64 file_size;
|
|
R_TRY(fs::GetFileSize(std::addressof(file_size), file));
|
|
|
|
*out_size = static_cast<size_t>(file_size);
|
|
return ResultSuccess();
|
|
}
|
|
|
|
Result FileKeyValueStore::Set(const void *key, size_t key_size, const void *value, size_t value_size) {
|
|
std::scoped_lock lk(this->lock);
|
|
|
|
/* Ensure key size is small enough. */
|
|
R_UNLESS(key_size <= MaxKeySize, kvdb::ResultOutOfKeyResource());
|
|
|
|
/* When the cache contains the key being set, Nintendo invalidates the cache. */
|
|
if (this->cache.Contains(key, key_size)) {
|
|
this->cache.Invalidate();
|
|
}
|
|
|
|
/* Delete the file, if it exists. Don't check result, since it's okay if it's already deleted. */
|
|
auto key_path = this->GetPath(key, key_size);
|
|
fs::DeleteFile(key_path);
|
|
|
|
/* Create the new value file. */
|
|
R_TRY(fs::CreateFile(key_path, value_size));
|
|
|
|
/* Open the value file. */
|
|
fs::FileHandle file;
|
|
R_TRY(fs::OpenFile(std::addressof(file), key_path, fs::OpenMode_Write));
|
|
ON_SCOPE_EXIT { fs::CloseFile(file); };
|
|
|
|
/* Write the value file and flush. */
|
|
R_TRY(fs::WriteFile(file, 0, value, value_size, fs::WriteOption::Flush));
|
|
|
|
return ResultSuccess();
|
|
}
|
|
|
|
Result FileKeyValueStore::Remove(const void *key, size_t key_size) {
|
|
std::scoped_lock lk(this->lock);
|
|
|
|
/* Ensure key size is small enough. */
|
|
R_UNLESS(key_size <= MaxKeySize, kvdb::ResultOutOfKeyResource());
|
|
|
|
/* When the cache contains the key being set, Nintendo invalidates the cache. */
|
|
if (this->cache.Contains(key, key_size)) {
|
|
this->cache.Invalidate();
|
|
}
|
|
|
|
/* Remove the file. */
|
|
R_TRY_CATCH(fs::DeleteFile(this->GetPath(key, key_size))) {
|
|
R_CONVERT(fs::ResultPathNotFound, kvdb::ResultKeyNotFound())
|
|
} R_END_TRY_CATCH;
|
|
|
|
return ResultSuccess();
|
|
}
|
|
|
|
} |