mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-11 17:02:25 +00:00
711 lines
26 KiB
C++
711 lines
26 KiB
C++
#pragma once
|
|
|
|
#include <chrono>
|
|
#include <variant>
|
|
|
|
#include <pcg_random.hpp>
|
|
|
|
#include <Common/randomSeed.h>
|
|
#include <Common/Arena.h>
|
|
#include <Common/ArenaWithFreeLists.h>
|
|
#include <Common/HashTable/LRUHashMap.h>
|
|
#include <Dictionaries/DictionaryStructure.h>
|
|
#include <Dictionaries/ICacheDictionaryStorage.h>
|
|
#include <Dictionaries/DictionaryHelpers.h>
|
|
|
|
namespace DB
|
|
{
|
|
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int NOT_IMPLEMENTED;
|
|
}
|
|
|
|
struct CacheDictionaryStorageConfiguration
|
|
{
|
|
/// Max size of storage in cells
|
|
const size_t max_size_in_cells;
|
|
/// Needed to perform check if cell is expired or not found. Default value is dictionary max lifetime.
|
|
const size_t strict_max_lifetime_seconds;
|
|
/// Lifetime of dictionary. Cell deadline is random value between lifetime min and max seconds.
|
|
const DictionaryLifetime lifetime;
|
|
};
|
|
|
|
/** ICacheDictionaryStorage implementation that keeps key in hash table with fixed collision length.
|
|
* Value in hash table point to index in attributes arrays.
|
|
*/
|
|
template <DictionaryKeyType dictionary_key_type>
|
|
class CacheDictionaryStorage final : public ICacheDictionaryStorage
|
|
{
|
|
|
|
static constexpr size_t max_collision_length = 10;
|
|
|
|
public:
|
|
using KeyType = std::conditional_t<dictionary_key_type == DictionaryKeyType::simple, UInt64, StringRef>;
|
|
static_assert(dictionary_key_type != DictionaryKeyType::range, "Range key type is not supported by CacheDictionaryStorage");
|
|
|
|
explicit CacheDictionaryStorage(
|
|
const DictionaryStructure & dictionary_structure,
|
|
CacheDictionaryStorageConfiguration & configuration_)
|
|
: configuration(configuration_)
|
|
, rnd_engine(randomSeed())
|
|
{
|
|
size_t cells_size = roundUpToPowerOfTwoOrZero(std::max(configuration.max_size_in_cells, max_collision_length));
|
|
|
|
cells.resize_fill(cells_size);
|
|
size_overlap_mask = cells_size - 1;
|
|
|
|
setup(dictionary_structure);
|
|
}
|
|
|
|
bool returnsFetchedColumnsInOrderOfRequestedKeys() const override { return true; }
|
|
|
|
String getName() const override
|
|
{
|
|
if (dictionary_key_type == DictionaryKeyType::simple)
|
|
return "Cache";
|
|
else
|
|
return "ComplexKeyCache";
|
|
}
|
|
|
|
bool supportsSimpleKeys() const override { return dictionary_key_type == DictionaryKeyType::simple; }
|
|
|
|
SimpleKeysStorageFetchResult fetchColumnsForKeys(
|
|
const PaddedPODArray<UInt64> & keys,
|
|
const DictionaryStorageFetchRequest & fetch_request) override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::simple)
|
|
return fetchColumnsForKeysImpl<SimpleKeysStorageFetchResult>(keys, fetch_request);
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method fetchColumnsForKeys is not supported for complex key storage");
|
|
}
|
|
|
|
void insertColumnsForKeys(const PaddedPODArray<UInt64> & keys, Columns columns) override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::simple)
|
|
insertColumnsForKeysImpl(keys, columns);
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method insertColumnsForKeys is not supported for complex key storage");
|
|
}
|
|
|
|
void insertDefaultKeys(const PaddedPODArray<UInt64> & keys) override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::simple)
|
|
insertDefaultKeysImpl(keys);
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method insertDefaultKeysImpl is not supported for complex key storage");
|
|
}
|
|
|
|
PaddedPODArray<UInt64> getCachedSimpleKeys() const override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::simple)
|
|
return getCachedKeysImpl();
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method getCachedSimpleKeys is not supported for complex key storage");
|
|
}
|
|
|
|
bool supportsComplexKeys() const override { return dictionary_key_type == DictionaryKeyType::complex; }
|
|
|
|
ComplexKeysStorageFetchResult fetchColumnsForKeys(
|
|
const PaddedPODArray<StringRef> & keys,
|
|
const DictionaryStorageFetchRequest & column_fetch_requests) override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::complex)
|
|
return fetchColumnsForKeysImpl<ComplexKeysStorageFetchResult>(keys, column_fetch_requests);
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method fetchColumnsForKeys is not supported for simple key storage");
|
|
}
|
|
|
|
void insertColumnsForKeys(const PaddedPODArray<StringRef> & keys, Columns columns) override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::complex)
|
|
insertColumnsForKeysImpl(keys, columns);
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method insertColumnsForKeys is not supported for simple key storage");
|
|
}
|
|
|
|
void insertDefaultKeys(const PaddedPODArray<StringRef> & keys) override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::complex)
|
|
insertDefaultKeysImpl(keys);
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method insertDefaultKeysImpl is not supported for simple key storage");
|
|
}
|
|
|
|
PaddedPODArray<StringRef> getCachedComplexKeys() const override
|
|
{
|
|
if constexpr (dictionary_key_type == DictionaryKeyType::complex)
|
|
return getCachedKeysImpl();
|
|
else
|
|
throw Exception(ErrorCodes::NOT_IMPLEMENTED, "Method getCachedComplexKeys is not supported for simple key storage");
|
|
}
|
|
|
|
size_t getSize() const override { return size; }
|
|
|
|
double getLoadFactor() const override { return static_cast<double>(size) / configuration.max_size_in_cells; }
|
|
|
|
size_t getBytesAllocated() const override
|
|
{
|
|
size_t attributes_size_in_bytes = 0;
|
|
size_t attributes_size = attributes.size();
|
|
|
|
for (size_t attribute_index = 0; attribute_index < attributes_size; ++attribute_index)
|
|
{
|
|
getAttributeContainer(attribute_index, [&](const auto & container)
|
|
{
|
|
attributes_size_in_bytes += container.capacity() * sizeof(container[0]);
|
|
});
|
|
}
|
|
|
|
return arena.size() + sizeof(Cell) * configuration.max_size_in_cells + attributes_size_in_bytes;
|
|
}
|
|
|
|
private:
|
|
|
|
struct FetchedKey
|
|
{
|
|
FetchedKey(size_t element_index_, bool is_default_)
|
|
: element_index(element_index_)
|
|
, is_default(is_default_)
|
|
{}
|
|
|
|
size_t element_index;
|
|
bool is_default;
|
|
};
|
|
|
|
template <typename KeysStorageFetchResult>
|
|
KeysStorageFetchResult fetchColumnsForKeysImpl(
|
|
const PaddedPODArray<KeyType> & keys,
|
|
const DictionaryStorageFetchRequest & fetch_request)
|
|
{
|
|
KeysStorageFetchResult result;
|
|
|
|
result.fetched_columns = fetch_request.makeAttributesResultColumns();
|
|
result.key_index_to_state.resize_fill(keys.size());
|
|
|
|
const time_t now = std::chrono::system_clock::to_time_t(std::chrono::system_clock::now());
|
|
|
|
size_t fetched_columns_index = 0;
|
|
size_t keys_size = keys.size();
|
|
|
|
PaddedPODArray<FetchedKey> fetched_keys;
|
|
fetched_keys.resize_fill(keys_size);
|
|
|
|
for (size_t key_index = 0; key_index < keys_size; ++key_index)
|
|
{
|
|
auto key = keys[key_index];
|
|
auto [key_state, cell_index] = getKeyStateAndCellIndex(key, now);
|
|
|
|
if (unlikely(key_state == KeyState::not_found))
|
|
{
|
|
result.key_index_to_state[key_index] = {KeyState::not_found};
|
|
++result.not_found_keys_size;
|
|
continue;
|
|
}
|
|
|
|
auto & cell = cells[cell_index];
|
|
|
|
result.expired_keys_size += static_cast<size_t>(key_state == KeyState::expired);
|
|
|
|
result.key_index_to_state[key_index] = {key_state, fetched_columns_index};
|
|
fetched_keys[fetched_columns_index] = FetchedKey(cell.element_index, cell.is_default);
|
|
|
|
++fetched_columns_index;
|
|
|
|
result.key_index_to_state[key_index].setDefaultValue(cell.is_default);
|
|
result.default_keys_size += cell.is_default;
|
|
}
|
|
|
|
result.found_keys_size = keys_size - (result.expired_keys_size + result.not_found_keys_size);
|
|
|
|
for (size_t attribute_index = 0; attribute_index < fetch_request.attributesSize(); ++attribute_index)
|
|
{
|
|
if (!fetch_request.shouldFillResultColumnWithIndex(attribute_index))
|
|
continue;
|
|
|
|
auto & attribute = attributes[attribute_index];
|
|
const auto & default_value_provider = fetch_request.defaultValueProviderAtIndex(attribute_index);
|
|
|
|
size_t fetched_keys_size = fetched_keys.size();
|
|
auto & fetched_column = *result.fetched_columns[attribute_index];
|
|
fetched_column.reserve(fetched_keys_size);
|
|
|
|
if (unlikely(attribute.is_complex_type))
|
|
{
|
|
auto & container = std::get<std::vector<Field>>(attribute.attribute_container);
|
|
|
|
for (size_t fetched_key_index = 0; fetched_key_index < fetched_columns_index; ++fetched_key_index)
|
|
{
|
|
auto fetched_key = fetched_keys[fetched_key_index];
|
|
|
|
if (unlikely(fetched_key.is_default))
|
|
fetched_column.insert(default_value_provider.getDefaultValue(fetched_key_index));
|
|
else
|
|
fetched_column.insert(container[fetched_key.element_index]);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
auto type_call = [&](const auto & dictionary_attribute_type)
|
|
{
|
|
using Type = std::decay_t<decltype(dictionary_attribute_type)>;
|
|
using AttributeType = typename Type::AttributeType;
|
|
using ValueType = DictionaryValueType<AttributeType>;
|
|
using ColumnType =
|
|
std::conditional_t<std::is_same_v<AttributeType, String>, ColumnString,
|
|
std::conditional_t<IsDecimalNumber<AttributeType>, ColumnDecimal<ValueType>,
|
|
ColumnVector<AttributeType>>>;
|
|
|
|
auto & container = std::get<PaddedPODArray<ValueType>>(attribute.attribute_container);
|
|
ColumnType & column_typed = static_cast<ColumnType &>(fetched_column);
|
|
|
|
if constexpr (std::is_same_v<ColumnType, ColumnString>)
|
|
{
|
|
for (size_t fetched_key_index = 0; fetched_key_index < fetched_columns_index; ++fetched_key_index)
|
|
{
|
|
auto fetched_key = fetched_keys[fetched_key_index];
|
|
|
|
if (unlikely(fetched_key.is_default))
|
|
column_typed.insert(default_value_provider.getDefaultValue(fetched_key_index));
|
|
else
|
|
{
|
|
auto item = container[fetched_key.element_index];
|
|
column_typed.insertData(item.data, item.size);
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
auto & data = column_typed.getData();
|
|
|
|
for (size_t fetched_key_index = 0; fetched_key_index < fetched_columns_index; ++fetched_key_index)
|
|
{
|
|
auto fetched_key = fetched_keys[fetched_key_index];
|
|
|
|
if (unlikely(fetched_key.is_default))
|
|
column_typed.insert(default_value_provider.getDefaultValue(fetched_key_index));
|
|
else
|
|
{
|
|
auto item = container[fetched_key.element_index];
|
|
data.push_back(item);
|
|
}
|
|
}
|
|
}
|
|
};
|
|
|
|
callOnDictionaryAttributeType(attribute.type, type_call);
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
void insertColumnsForKeysImpl(const PaddedPODArray<KeyType> & keys, Columns columns)
|
|
{
|
|
const auto now = std::chrono::system_clock::now();
|
|
|
|
Field column_value;
|
|
|
|
for (size_t key_index = 0; key_index < keys.size(); ++key_index)
|
|
{
|
|
auto key = keys[key_index];
|
|
|
|
size_t cell_index = getCellIndexForInsert(key);
|
|
auto & cell = cells[cell_index];
|
|
|
|
bool cell_was_default = cell.is_default;
|
|
cell.is_default = false;
|
|
|
|
bool was_inserted = cell.deadline == 0;
|
|
|
|
if (was_inserted)
|
|
{
|
|
if constexpr (std::is_same_v<KeyType, StringRef>)
|
|
cell.key = copyStringInArena(key);
|
|
else
|
|
cell.key = key;
|
|
|
|
for (size_t attribute_index = 0; attribute_index < columns.size(); ++attribute_index)
|
|
{
|
|
auto & column = columns[attribute_index];
|
|
|
|
getAttributeContainer(attribute_index, [&](auto & container)
|
|
{
|
|
container.emplace_back();
|
|
cell.element_index = container.size() - 1;
|
|
|
|
using ElementType = std::decay_t<decltype(container[0])>;
|
|
|
|
column->get(key_index, column_value);
|
|
|
|
if constexpr (std::is_same_v<ElementType, Field>)
|
|
container.back() = column_value;
|
|
else if constexpr (std::is_same_v<ElementType, StringRef>)
|
|
{
|
|
const String & string_value = column_value.get<String>();
|
|
StringRef string_value_ref = StringRef {string_value.data(), string_value.size()};
|
|
StringRef inserted_value = copyStringInArena(string_value_ref);
|
|
container.back() = inserted_value;
|
|
}
|
|
else
|
|
container.back() = column_value.get<NearestFieldType<ElementType>>();
|
|
});
|
|
}
|
|
|
|
++size;
|
|
}
|
|
else
|
|
{
|
|
if (cell.key != key)
|
|
{
|
|
if constexpr (std::is_same_v<KeyType, StringRef>)
|
|
{
|
|
char * data = const_cast<char *>(cell.key.data);
|
|
arena.free(data, cell.key.size);
|
|
cell.key = copyStringInArena(key);
|
|
}
|
|
else
|
|
cell.key = key;
|
|
}
|
|
|
|
/// Put values into existing index
|
|
size_t index_to_use = cell.element_index;
|
|
|
|
for (size_t attribute_index = 0; attribute_index < columns.size(); ++attribute_index)
|
|
{
|
|
auto & column = columns[attribute_index];
|
|
|
|
getAttributeContainer(attribute_index, [&](auto & container)
|
|
{
|
|
using ElementType = std::decay_t<decltype(container[0])>;
|
|
|
|
column->get(key_index, column_value);
|
|
|
|
if constexpr (std::is_same_v<ElementType, Field>)
|
|
container[index_to_use] = column_value;
|
|
else if constexpr (std::is_same_v<ElementType, StringRef>)
|
|
{
|
|
const String & string_value = column_value.get<String>();
|
|
StringRef string_ref_value = StringRef {string_value.data(), string_value.size()};
|
|
StringRef inserted_value = copyStringInArena(string_ref_value);
|
|
|
|
if (!cell_was_default)
|
|
{
|
|
StringRef previous_value = container[index_to_use];
|
|
arena.free(const_cast<char *>(previous_value.data), previous_value.size);
|
|
}
|
|
|
|
container[index_to_use] = inserted_value;
|
|
}
|
|
else
|
|
container[index_to_use] = column_value.get<NearestFieldType<ElementType>>();
|
|
});
|
|
}
|
|
}
|
|
|
|
setCellDeadline(cell, now);
|
|
}
|
|
}
|
|
|
|
void insertDefaultKeysImpl(const PaddedPODArray<KeyType> & keys)
|
|
{
|
|
const auto now = std::chrono::system_clock::now();
|
|
|
|
size_t keys_size = keys.size();
|
|
|
|
for (size_t key_index = 0; key_index < keys_size; ++key_index)
|
|
{
|
|
auto key = keys[key_index];
|
|
|
|
size_t cell_index = getCellIndexForInsert(key);
|
|
auto & cell = cells[cell_index];
|
|
|
|
bool was_inserted = cell.deadline == 0;
|
|
bool cell_was_default = cell.is_default;
|
|
|
|
cell.is_default = true;
|
|
|
|
if (was_inserted)
|
|
{
|
|
if constexpr (std::is_same_v<KeyType, StringRef>)
|
|
cell.key = copyStringInArena(key);
|
|
else
|
|
cell.key = key;
|
|
|
|
for (size_t attribute_index = 0; attribute_index < attributes.size(); ++attribute_index)
|
|
{
|
|
getAttributeContainer(attribute_index, [&](auto & container)
|
|
{
|
|
container.emplace_back();
|
|
cell.element_index = container.size() - 1;
|
|
});
|
|
}
|
|
|
|
++size;
|
|
}
|
|
else
|
|
{
|
|
for (size_t attribute_index = 0; attribute_index < attributes.size(); ++attribute_index)
|
|
{
|
|
getAttributeContainer(attribute_index, [&](const auto & container)
|
|
{
|
|
using ElementType = std::decay_t<decltype(container[0])>;
|
|
|
|
if constexpr (std::is_same_v<ElementType, StringRef>)
|
|
{
|
|
if (!cell_was_default)
|
|
{
|
|
StringRef previous_value = container[cell.element_index];
|
|
arena.free(const_cast<char *>(previous_value.data), previous_value.size);
|
|
}
|
|
}
|
|
});
|
|
}
|
|
|
|
if (cell.key != key)
|
|
{
|
|
if constexpr (std::is_same_v<KeyType, StringRef>)
|
|
{
|
|
char * data = const_cast<char *>(cell.key.data);
|
|
arena.free(data, cell.key.size);
|
|
cell.key = copyStringInArena(key);
|
|
}
|
|
else
|
|
cell.key = key;
|
|
}
|
|
}
|
|
|
|
setCellDeadline(cell, now);
|
|
}
|
|
}
|
|
|
|
PaddedPODArray<KeyType> getCachedKeysImpl() const
|
|
{
|
|
PaddedPODArray<KeyType> result;
|
|
result.reserve(size);
|
|
|
|
for (auto & cell : cells)
|
|
{
|
|
if (cell.deadline == 0)
|
|
continue;
|
|
|
|
if (cell.is_default)
|
|
continue;
|
|
|
|
result.emplace_back(cell.key);
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
template <typename GetContainerFunc>
|
|
void getAttributeContainer(size_t attribute_index, GetContainerFunc && func)
|
|
{
|
|
auto & attribute = attributes[attribute_index];
|
|
auto & attribute_type = attribute.type;
|
|
|
|
if (unlikely(attribute.is_complex_type))
|
|
{
|
|
auto & container = std::get<std::vector<Field>>(attribute.attribute_container);
|
|
std::forward<GetContainerFunc>(func)(container);
|
|
}
|
|
else
|
|
{
|
|
auto type_call = [&](const auto & dictionary_attribute_type)
|
|
{
|
|
using Type = std::decay_t<decltype(dictionary_attribute_type)>;
|
|
using AttributeType = typename Type::AttributeType;
|
|
using ValueType = DictionaryValueType<AttributeType>;
|
|
|
|
auto & container = std::get<PaddedPODArray<ValueType>>(attribute.attribute_container);
|
|
std::forward<GetContainerFunc>(func)(container);
|
|
};
|
|
|
|
callOnDictionaryAttributeType(attribute_type, type_call);
|
|
}
|
|
}
|
|
|
|
template <typename GetContainerFunc>
|
|
void getAttributeContainer(size_t attribute_index, GetContainerFunc && func) const
|
|
{
|
|
return const_cast<std::decay_t<decltype(*this)> *>(this)->template getAttributeContainer(attribute_index, std::forward<GetContainerFunc>(func));
|
|
}
|
|
|
|
StringRef copyStringInArena(StringRef value_to_copy)
|
|
{
|
|
size_t value_to_copy_size = value_to_copy.size;
|
|
char * place_for_key = arena.alloc(value_to_copy_size);
|
|
memcpy(reinterpret_cast<void *>(place_for_key), reinterpret_cast<const void *>(value_to_copy.data), value_to_copy_size);
|
|
StringRef updated_value{place_for_key, value_to_copy_size};
|
|
|
|
return updated_value;
|
|
}
|
|
|
|
void setup(const DictionaryStructure & dictionary_structure)
|
|
{
|
|
/// For each dictionary attribute create storage attribute
|
|
/// For simple attributes create PODArray, for complex vector of Fields
|
|
|
|
attributes.reserve(dictionary_structure.attributes.size());
|
|
|
|
for (const auto & dictionary_attribute : dictionary_structure.attributes)
|
|
{
|
|
auto attribute_type = dictionary_attribute.underlying_type;
|
|
|
|
auto type_call = [&](const auto & dictionary_attribute_type)
|
|
{
|
|
using Type = std::decay_t<decltype(dictionary_attribute_type)>;
|
|
using AttributeType = typename Type::AttributeType;
|
|
using ValueType = DictionaryValueType<AttributeType>;
|
|
|
|
attributes.emplace_back();
|
|
auto & last_attribute = attributes.back();
|
|
last_attribute.type = attribute_type;
|
|
last_attribute.is_complex_type = dictionary_attribute.is_nullable || dictionary_attribute.is_array;
|
|
|
|
if (dictionary_attribute.is_nullable)
|
|
last_attribute.attribute_container = std::vector<Field>();
|
|
else
|
|
last_attribute.attribute_container = PaddedPODArray<ValueType>();
|
|
};
|
|
|
|
callOnDictionaryAttributeType(attribute_type, type_call);
|
|
}
|
|
}
|
|
|
|
using TimePoint = std::chrono::system_clock::time_point;
|
|
|
|
struct Cell
|
|
{
|
|
KeyType key;
|
|
size_t element_index;
|
|
bool is_default;
|
|
time_t deadline;
|
|
};
|
|
|
|
struct Attribute
|
|
{
|
|
AttributeUnderlyingType type;
|
|
bool is_complex_type;
|
|
|
|
std::variant<
|
|
PaddedPODArray<UInt8>,
|
|
PaddedPODArray<UInt16>,
|
|
PaddedPODArray<UInt32>,
|
|
PaddedPODArray<UInt64>,
|
|
PaddedPODArray<UInt128>,
|
|
PaddedPODArray<Int8>,
|
|
PaddedPODArray<Int16>,
|
|
PaddedPODArray<Int32>,
|
|
PaddedPODArray<Int64>,
|
|
PaddedPODArray<Decimal32>,
|
|
PaddedPODArray<Decimal64>,
|
|
PaddedPODArray<Decimal128>,
|
|
PaddedPODArray<Float32>,
|
|
PaddedPODArray<Float64>,
|
|
PaddedPODArray<StringRef>,
|
|
std::vector<Field>> attribute_container;
|
|
};
|
|
|
|
CacheDictionaryStorageConfiguration configuration;
|
|
|
|
pcg64 rnd_engine;
|
|
|
|
size_t size_overlap_mask = 0;
|
|
|
|
size_t size = 0;
|
|
|
|
PaddedPODArray<Cell> cells;
|
|
|
|
ArenaWithFreeLists arena;
|
|
|
|
std::vector<Attribute> attributes;
|
|
|
|
inline void setCellDeadline(Cell & cell, TimePoint now)
|
|
{
|
|
if (configuration.lifetime.min_sec == 0 && configuration.lifetime.max_sec == 0)
|
|
{
|
|
/// This maybe not obvious, but when we define is this cell is expired or expired permanently, we add strict_max_lifetime_seconds
|
|
/// to the expiration time. And it overflows pretty well.
|
|
auto deadline = std::chrono::time_point<std::chrono::system_clock>::max() - 2 * std::chrono::seconds(configuration.strict_max_lifetime_seconds);
|
|
cell.deadline = std::chrono::system_clock::to_time_t(deadline);
|
|
return;
|
|
}
|
|
|
|
size_t min_sec_lifetime = configuration.lifetime.min_sec;
|
|
size_t max_sec_lifetime = configuration.lifetime.max_sec;
|
|
|
|
std::uniform_int_distribution<UInt64> distribution{min_sec_lifetime, max_sec_lifetime};
|
|
|
|
auto deadline = now + std::chrono::seconds(distribution(rnd_engine));
|
|
cell.deadline = std::chrono::system_clock::to_time_t(deadline);
|
|
}
|
|
|
|
inline size_t getCellIndex(const KeyType key) const
|
|
{
|
|
const size_t hash = DefaultHash<KeyType>()(key);
|
|
const size_t index = hash & size_overlap_mask;
|
|
return index;
|
|
}
|
|
|
|
using KeyStateAndCellIndex = std::pair<KeyState::State, size_t>;
|
|
|
|
inline KeyStateAndCellIndex getKeyStateAndCellIndex(const KeyType key, const time_t now) const
|
|
{
|
|
size_t place_value = getCellIndex(key);
|
|
const size_t place_value_end = place_value + max_collision_length;
|
|
|
|
time_t max_lifetime_seconds = static_cast<time_t>(configuration.strict_max_lifetime_seconds);
|
|
|
|
for (; place_value < place_value_end; ++place_value)
|
|
{
|
|
const auto cell_place_value = place_value & size_overlap_mask;
|
|
const auto & cell = cells[cell_place_value];
|
|
|
|
if (cell.key != key)
|
|
continue;
|
|
|
|
if (unlikely(now > cell.deadline + max_lifetime_seconds))
|
|
return std::make_pair(KeyState::not_found, cell_place_value);
|
|
|
|
if (unlikely(now > cell.deadline))
|
|
return std::make_pair(KeyState::expired, cell_place_value);
|
|
|
|
return std::make_pair(KeyState::found, cell_place_value);
|
|
}
|
|
|
|
return std::make_pair(KeyState::not_found, place_value & size_overlap_mask);
|
|
}
|
|
|
|
inline size_t getCellIndexForInsert(const KeyType & key) const
|
|
{
|
|
size_t place_value = getCellIndex(key);
|
|
const size_t place_value_end = place_value + max_collision_length;
|
|
size_t oldest_place_value = place_value;
|
|
|
|
time_t oldest_time = std::numeric_limits<time_t>::max();
|
|
|
|
for (; place_value < place_value_end; ++place_value)
|
|
{
|
|
const size_t cell_place_value = place_value & size_overlap_mask;
|
|
const Cell cell = cells[cell_place_value];
|
|
|
|
if (cell.deadline == 0)
|
|
return cell_place_value;
|
|
|
|
if (cell.key == key)
|
|
return cell_place_value;
|
|
|
|
if (cell.deadline < oldest_time)
|
|
{
|
|
oldest_time = cell.deadline;
|
|
oldest_place_value = cell_place_value;
|
|
}
|
|
}
|
|
|
|
return oldest_place_value;
|
|
}
|
|
};
|
|
|
|
}
|