2017-04-01 09:19:00 +00:00
|
|
|
#include <Dictionaries/ComplexKeyCacheDictionary.h>
|
2017-05-04 18:14:23 +00:00
|
|
|
#include <Dictionaries/DictionaryBlockInputStream.h>
|
2017-06-22 15:57:37 +00:00
|
|
|
#include <Common/Arena.h>
|
2017-04-01 09:19:00 +00:00
|
|
|
#include <Common/BitHelpers.h>
|
|
|
|
#include <Common/randomSeed.h>
|
|
|
|
#include <Common/Stopwatch.h>
|
|
|
|
#include <Common/ProfilingScopedRWLock.h>
|
2017-04-08 01:32:05 +00:00
|
|
|
#include <Common/ProfileEvents.h>
|
|
|
|
#include <Common/CurrentMetrics.h>
|
2017-06-06 17:18:32 +00:00
|
|
|
#include <ext/range.h>
|
2017-06-22 15:57:37 +00:00
|
|
|
#include <ext/map.h>
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-08 01:32:05 +00:00
|
|
|
|
|
|
|
namespace ProfileEvents
|
|
|
|
{
|
2017-07-27 19:05:55 +00:00
|
|
|
|
2017-04-08 01:32:05 +00:00
|
|
|
extern const Event DictCacheKeysRequested;
|
|
|
|
extern const Event DictCacheKeysRequestedMiss;
|
|
|
|
extern const Event DictCacheKeysRequestedFound;
|
|
|
|
extern const Event DictCacheKeysExpired;
|
|
|
|
extern const Event DictCacheKeysNotFound;
|
|
|
|
extern const Event DictCacheKeysHit;
|
|
|
|
extern const Event DictCacheRequestTimeNs;
|
|
|
|
extern const Event DictCacheLockWriteNs;
|
|
|
|
extern const Event DictCacheLockReadNs;
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace CurrentMetrics
|
|
|
|
{
|
|
|
|
extern const Metric DictCacheRequests;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-06-07 21:07:44 +00:00
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
|
|
|
namespace ErrorCodes
|
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
extern const int TYPE_MISMATCH;
|
|
|
|
extern const int BAD_ARGUMENTS;
|
|
|
|
extern const int UNSUPPORTED_METHOD;
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-10-26 22:27:38 +00:00
|
|
|
inline UInt64 ComplexKeyCacheDictionary::getCellIdx(const StringRef key) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
const auto hash = StringRefHash{}(key);
|
|
|
|
const auto idx = hash & size_overlap_mask;
|
|
|
|
return idx;
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
ComplexKeyCacheDictionary::ComplexKeyCacheDictionary(const std::string & name, const DictionaryStructure & dict_struct,
|
2017-04-01 07:20:54 +00:00
|
|
|
DictionarySourcePtr source_ptr, const DictionaryLifetime dict_lifetime,
|
|
|
|
const size_t size)
|
|
|
|
: name{name}, dict_struct(dict_struct), source_ptr{std::move(source_ptr)}, dict_lifetime(dict_lifetime),
|
|
|
|
size{roundUpToPowerOfTwoOrZero(std::max(size, size_t(max_collision_length)))},
|
|
|
|
size_overlap_mask{this->size - 1},
|
2017-09-09 23:17:38 +00:00
|
|
|
rnd_engine(randomSeed())
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
if (!this->source_ptr->supportsSelectiveLoad())
|
|
|
|
throw Exception{
|
|
|
|
name + ": source cannot be used with ComplexKeyCacheDictionary",
|
|
|
|
ErrorCodes::UNSUPPORTED_METHOD};
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
createAttributes();
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ComplexKeyCacheDictionary::ComplexKeyCacheDictionary(const ComplexKeyCacheDictionary & other)
|
2017-04-01 07:20:54 +00:00
|
|
|
: ComplexKeyCacheDictionary{other.name, other.dict_struct, other.source_ptr->clone(), other.dict_lifetime, other.size}
|
2016-06-07 21:07:44 +00:00
|
|
|
{}
|
|
|
|
|
|
|
|
void ComplexKeyCacheDictionary::getString(
|
2017-05-25 19:52:05 +00:00
|
|
|
const std::string & attribute_name, const Columns & key_columns, const DataTypes & key_types,
|
2017-04-01 07:20:54 +00:00
|
|
|
ColumnString * out) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
dict_struct.validateKeyTypes(key_types);
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
auto & attribute = getAttribute(attribute_name);
|
|
|
|
if (!isAttributeTypeConvertibleTo(attribute.type, AttributeUnderlyingType::String))
|
|
|
|
throw Exception{
|
|
|
|
name + ": type mismatch: attribute " + attribute_name + " has type " + toString(attribute.type),
|
|
|
|
ErrorCodes::TYPE_MISMATCH};
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
const auto null_value = StringRef{std::get<String>(attribute.null_values)};
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
getItemsString(attribute, key_columns, out, [&] (const size_t) { return null_value; });
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ComplexKeyCacheDictionary::getString(
|
2017-05-25 19:52:05 +00:00
|
|
|
const std::string & attribute_name, const Columns & key_columns, const DataTypes & key_types,
|
2017-04-01 07:20:54 +00:00
|
|
|
const ColumnString * const def, ColumnString * const out) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
dict_struct.validateKeyTypes(key_types);
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
auto & attribute = getAttribute(attribute_name);
|
|
|
|
if (!isAttributeTypeConvertibleTo(attribute.type, AttributeUnderlyingType::String))
|
|
|
|
throw Exception{
|
|
|
|
name + ": type mismatch: attribute " + attribute_name + " has type " + toString(attribute.type),
|
|
|
|
ErrorCodes::TYPE_MISMATCH};
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
getItemsString(attribute, key_columns, out, [&] (const size_t row) { return def->getDataAt(row); });
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ComplexKeyCacheDictionary::getString(
|
2017-05-25 19:52:05 +00:00
|
|
|
const std::string & attribute_name, const Columns & key_columns, const DataTypes & key_types,
|
2017-04-01 07:20:54 +00:00
|
|
|
const String & def, ColumnString * const out) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
dict_struct.validateKeyTypes(key_types);
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
auto & attribute = getAttribute(attribute_name);
|
|
|
|
if (!isAttributeTypeConvertibleTo(attribute.type, AttributeUnderlyingType::String))
|
|
|
|
throw Exception{
|
|
|
|
name + ": type mismatch: attribute " + attribute_name + " has type " + toString(attribute.type),
|
|
|
|
ErrorCodes::TYPE_MISMATCH};
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
getItemsString(attribute, key_columns, out, [&] (const size_t) { return StringRef{def}; });
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
2017-02-17 20:37:03 +00:00
|
|
|
/// returns cell_idx (always valid for replacing), 'cell is valid' flag, 'cell is outdated' flag,
|
|
|
|
/// true false found and valid
|
|
|
|
/// false true not found (something outdated, maybe our cell)
|
|
|
|
/// false false not found (other id stored with valid data)
|
|
|
|
/// true true impossible
|
|
|
|
///
|
|
|
|
/// todo: split this func to two: find_for_get and find_for_set
|
|
|
|
ComplexKeyCacheDictionary::FindResult ComplexKeyCacheDictionary::findCellIdx(const StringRef & key, const CellMetadata::time_point_t now, const size_t hash) const
|
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
auto pos = hash;
|
|
|
|
auto oldest_id = pos;
|
|
|
|
auto oldest_time = CellMetadata::time_point_t::max();
|
|
|
|
const auto stop = pos + max_collision_length;
|
|
|
|
|
|
|
|
for (; pos < stop; ++pos)
|
|
|
|
{
|
|
|
|
const auto cell_idx = pos & size_overlap_mask;
|
|
|
|
const auto & cell = cells[cell_idx];
|
|
|
|
|
|
|
|
if (cell.hash != hash || cell.key != key)
|
|
|
|
{
|
|
|
|
/// maybe we already found nearest expired cell
|
|
|
|
if (oldest_time > now && oldest_time > cell.expiresAt())
|
|
|
|
{
|
|
|
|
oldest_time = cell.expiresAt();
|
|
|
|
oldest_id = cell_idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cell.expiresAt() < now)
|
|
|
|
{
|
|
|
|
return {cell_idx, false, true};
|
|
|
|
}
|
|
|
|
|
|
|
|
return {cell_idx, true, false};
|
|
|
|
}
|
|
|
|
|
|
|
|
oldest_id &= size_overlap_mask;
|
|
|
|
return {oldest_id, false, false};
|
2017-02-17 20:37:03 +00:00
|
|
|
}
|
|
|
|
|
2017-05-25 19:52:05 +00:00
|
|
|
void ComplexKeyCacheDictionary::has(const Columns & key_columns, const DataTypes & key_types, PaddedPODArray<UInt8> & out) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
dict_struct.validateKeyTypes(key_types);
|
|
|
|
|
|
|
|
/// Mapping: <key> -> { all indices `i` of `key_columns` such that `key_columns[i]` = <key> }
|
|
|
|
MapType<std::vector<size_t>> outdated_keys;
|
|
|
|
|
|
|
|
|
|
|
|
const auto rows_num = key_columns.front()->size();
|
2017-10-04 00:22:00 +00:00
|
|
|
const auto keys_size = dict_struct.key->size();
|
2017-04-01 07:20:54 +00:00
|
|
|
StringRefs keys(keys_size);
|
|
|
|
Arena temporary_keys_pool;
|
|
|
|
PODArray<StringRef> keys_array(rows_num);
|
|
|
|
|
|
|
|
size_t cache_expired = 0, cache_not_found = 0, cache_hit = 0;
|
|
|
|
{
|
|
|
|
const ProfilingScopedReadRWLock read_lock{rw_lock, ProfileEvents::DictCacheLockReadNs};
|
|
|
|
|
|
|
|
const auto now = std::chrono::system_clock::now();
|
|
|
|
/// fetch up-to-date values, decide which ones require update
|
|
|
|
for (const auto row : ext::range(0, rows_num))
|
|
|
|
{
|
2017-06-08 17:51:46 +00:00
|
|
|
const StringRef key = placeKeysInPool(row, key_columns, keys, *dict_struct.key, temporary_keys_pool);
|
2017-04-01 07:20:54 +00:00
|
|
|
keys_array[row] = key;
|
|
|
|
const auto find_result = findCellIdx(key, now);
|
|
|
|
const auto & cell_idx = find_result.cell_idx;
|
|
|
|
/** cell should be updated if either:
|
|
|
|
* 1. keys (or hash) do not match,
|
|
|
|
* 2. cell has expired,
|
|
|
|
* 3. explicit defaults were specified and cell was set default. */
|
|
|
|
if (!find_result.valid)
|
|
|
|
{
|
|
|
|
outdated_keys[key].push_back(row);
|
|
|
|
if (find_result.outdated)
|
|
|
|
++cache_expired;
|
|
|
|
else
|
|
|
|
++cache_not_found;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
++cache_hit;
|
|
|
|
const auto & cell = cells[cell_idx];
|
|
|
|
out[row] = !cell.isDefault();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ProfileEvents::increment(ProfileEvents::DictCacheKeysExpired, cache_expired);
|
|
|
|
ProfileEvents::increment(ProfileEvents::DictCacheKeysNotFound, cache_not_found);
|
|
|
|
ProfileEvents::increment(ProfileEvents::DictCacheKeysHit, cache_hit);
|
|
|
|
|
|
|
|
query_count.fetch_add(rows_num, std::memory_order_relaxed);
|
|
|
|
hit_count.fetch_add(rows_num - outdated_keys.size(), std::memory_order_release);
|
|
|
|
|
|
|
|
if (outdated_keys.empty())
|
|
|
|
return;
|
|
|
|
|
|
|
|
std::vector<size_t> required_rows(outdated_keys.size());
|
|
|
|
std::transform(std::begin(outdated_keys), std::end(outdated_keys), std::begin(required_rows),
|
|
|
|
[] (auto & pair) { return pair.second.front(); });
|
|
|
|
|
|
|
|
/// request new values
|
|
|
|
update(key_columns, keys_array, required_rows,
|
|
|
|
[&] (const StringRef key, const auto)
|
|
|
|
{
|
|
|
|
for (const auto out_idx : outdated_keys[key])
|
|
|
|
out[out_idx] = true;
|
|
|
|
},
|
|
|
|
[&] (const StringRef key, const auto)
|
|
|
|
{
|
|
|
|
for (const auto out_idx : outdated_keys[key])
|
|
|
|
out[out_idx] = false;
|
|
|
|
});
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ComplexKeyCacheDictionary::createAttributes()
|
|
|
|
{
|
2017-06-15 17:23:14 +00:00
|
|
|
const auto attributes_size = dict_struct.attributes.size();
|
|
|
|
attributes.reserve(attributes_size);
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
bytes_allocated += size * sizeof(CellMetadata);
|
2017-06-15 17:23:14 +00:00
|
|
|
bytes_allocated += attributes_size * sizeof(attributes.front());
|
2017-04-01 07:20:54 +00:00
|
|
|
|
|
|
|
for (const auto & attribute : dict_struct.attributes)
|
|
|
|
{
|
|
|
|
attribute_index_by_name.emplace(attribute.name, attributes.size());
|
|
|
|
attributes.push_back(createAttributeWithType(attribute.underlying_type, attribute.null_value));
|
|
|
|
|
|
|
|
if (attribute.hierarchical)
|
|
|
|
throw Exception{
|
|
|
|
name + ": hierarchical attributes not supported for dictionary of type " + getTypeName(),
|
|
|
|
ErrorCodes::TYPE_MISMATCH};
|
|
|
|
}
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
2016-08-07 09:09:18 +00:00
|
|
|
ComplexKeyCacheDictionary::Attribute & ComplexKeyCacheDictionary::getAttribute(const std::string & attribute_name) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
const auto it = attribute_index_by_name.find(attribute_name);
|
|
|
|
if (it == std::end(attribute_index_by_name))
|
|
|
|
throw Exception{
|
|
|
|
name + ": no such attribute '" + attribute_name + "'",
|
|
|
|
ErrorCodes::BAD_ARGUMENTS};
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
return attributes[it->second];
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
2017-05-25 19:52:05 +00:00
|
|
|
StringRef ComplexKeyCacheDictionary::allocKey(const size_t row, const Columns & key_columns, StringRefs & keys) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
if (key_size_is_fixed)
|
|
|
|
return placeKeysInFixedSizePool(row, key_columns);
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-06-08 17:51:46 +00:00
|
|
|
return placeKeysInPool(row, key_columns, keys, *dict_struct.key, *keys_pool);
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ComplexKeyCacheDictionary::freeKey(const StringRef key) const
|
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
if (key_size_is_fixed)
|
|
|
|
fixed_size_keys_pool->free(const_cast<char *>(key.data));
|
|
|
|
else
|
|
|
|
keys_pool->free(const_cast<char *>(key.data), key.size);
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
2017-05-04 18:14:23 +00:00
|
|
|
template <typename Pool>
|
2016-06-07 21:07:44 +00:00
|
|
|
StringRef ComplexKeyCacheDictionary::placeKeysInPool(
|
2017-06-08 17:51:46 +00:00
|
|
|
const size_t row, const Columns & key_columns, StringRefs & keys,
|
|
|
|
const std::vector<DictionaryAttribute> & key_attributes, Pool & pool)
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
const auto keys_size = key_columns.size();
|
|
|
|
size_t sum_keys_size{};
|
2017-05-04 18:14:23 +00:00
|
|
|
|
|
|
|
for (size_t j = 0; j < keys_size; ++j)
|
2017-04-01 07:20:54 +00:00
|
|
|
{
|
2017-06-08 17:51:46 +00:00
|
|
|
keys[j] = key_columns[j]->getDataAt(row);
|
2017-05-04 18:14:23 +00:00
|
|
|
sum_keys_size += keys[j].size;
|
2017-06-08 17:51:46 +00:00
|
|
|
if (key_attributes[j].underlying_type == AttributeUnderlyingType::String)
|
|
|
|
sum_keys_size += sizeof(size_t) + 1;
|
2017-04-01 07:20:54 +00:00
|
|
|
}
|
|
|
|
|
2017-05-04 18:14:23 +00:00
|
|
|
auto place = pool.alloc(sum_keys_size);
|
2017-04-01 07:20:54 +00:00
|
|
|
|
2017-05-04 18:14:23 +00:00
|
|
|
auto key_start = place;
|
2017-04-01 07:20:54 +00:00
|
|
|
for (size_t j = 0; j < keys_size; ++j)
|
|
|
|
{
|
2017-06-08 17:51:46 +00:00
|
|
|
if (key_attributes[j].underlying_type == AttributeUnderlyingType::String)
|
|
|
|
{
|
|
|
|
auto start = key_start;
|
|
|
|
auto key_size = keys[j].size + 1;
|
|
|
|
memcpy(key_start, &key_size, sizeof(size_t));
|
|
|
|
key_start += sizeof(size_t);
|
|
|
|
memcpy(key_start, keys[j].data, keys[j].size);
|
|
|
|
key_start += keys[j].size;
|
|
|
|
*key_start = '\0';
|
|
|
|
++key_start;
|
|
|
|
keys[j].data = start;
|
|
|
|
keys[j].size += sizeof(size_t) + 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
memcpy(key_start, keys[j].data, keys[j].size);
|
|
|
|
keys[j].data = key_start;
|
|
|
|
key_start += keys[j].size;
|
|
|
|
}
|
2017-04-01 07:20:54 +00:00
|
|
|
}
|
|
|
|
|
2017-05-04 18:14:23 +00:00
|
|
|
return { place, sum_keys_size };
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
2017-09-15 11:08:39 +00:00
|
|
|
/// Explicit instantiations.
|
|
|
|
|
|
|
|
template StringRef ComplexKeyCacheDictionary::placeKeysInPool<Arena>(
|
|
|
|
const size_t row, const Columns & key_columns, StringRefs & keys,
|
|
|
|
const std::vector<DictionaryAttribute> & key_attributes, Arena & pool);
|
|
|
|
|
|
|
|
template StringRef ComplexKeyCacheDictionary::placeKeysInPool<ArenaWithFreeLists>(
|
|
|
|
const size_t row, const Columns & key_columns, StringRefs & keys,
|
|
|
|
const std::vector<DictionaryAttribute> & key_attributes, ArenaWithFreeLists & pool);
|
|
|
|
|
|
|
|
|
2016-06-07 21:07:44 +00:00
|
|
|
StringRef ComplexKeyCacheDictionary::placeKeysInFixedSizePool(
|
2017-05-25 19:52:05 +00:00
|
|
|
const size_t row, const Columns & key_columns) const
|
2016-06-07 21:07:44 +00:00
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
const auto res = fixed_size_keys_pool->alloc();
|
|
|
|
auto place = res;
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
for (const auto & key_column : key_columns)
|
|
|
|
{
|
|
|
|
const StringRef key = key_column->getDataAt(row);
|
|
|
|
memcpy(place, key.data, key.size);
|
|
|
|
place += key.size;
|
|
|
|
}
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
return { res, key_size };
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
2016-08-07 08:12:58 +00:00
|
|
|
StringRef ComplexKeyCacheDictionary::copyIntoArena(StringRef src, Arena & arena)
|
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
char * allocated = arena.alloc(src.size);
|
|
|
|
memcpy(allocated, src.data, src.size);
|
|
|
|
return { allocated, src.size };
|
2016-08-07 08:12:58 +00:00
|
|
|
}
|
|
|
|
|
2016-06-07 21:07:44 +00:00
|
|
|
StringRef ComplexKeyCacheDictionary::copyKey(const StringRef key) const
|
|
|
|
{
|
2017-04-01 07:20:54 +00:00
|
|
|
const auto res = key_size_is_fixed ? fixed_size_keys_pool->alloc() : keys_pool->alloc(key.size);
|
|
|
|
memcpy(res, key.data, key.size);
|
2016-06-07 21:07:44 +00:00
|
|
|
|
2017-04-01 07:20:54 +00:00
|
|
|
return { res, key.size };
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|
|
|
|
|
2017-05-04 18:14:23 +00:00
|
|
|
bool ComplexKeyCacheDictionary::isEmptyCell(const UInt64 idx) const
|
|
|
|
{
|
2017-05-26 16:08:56 +00:00
|
|
|
return (cells[idx].key == StringRef{} && (idx != zero_cell_idx
|
2017-05-04 18:14:23 +00:00
|
|
|
|| cells[idx].data == ext::safe_bit_cast<CellMetadata::time_point_urep_t>(CellMetadata::time_point_t())));
|
|
|
|
}
|
|
|
|
|
2017-05-29 17:26:45 +00:00
|
|
|
BlockInputStreamPtr ComplexKeyCacheDictionary::getBlockInputStream(const Names & column_names, size_t max_block_size) const
|
2017-05-04 18:14:23 +00:00
|
|
|
{
|
|
|
|
std::vector<StringRef> keys;
|
|
|
|
{
|
|
|
|
const ProfilingScopedReadRWLock read_lock{rw_lock, ProfileEvents::DictCacheLockReadNs};
|
|
|
|
|
|
|
|
for (auto idx : ext::range(0, cells.size()))
|
2017-06-08 17:51:46 +00:00
|
|
|
if (!isEmptyCell(idx)
|
|
|
|
&& !cells[idx].isDefault())
|
2017-05-04 18:14:23 +00:00
|
|
|
keys.push_back(cells[idx].key);
|
|
|
|
}
|
|
|
|
|
|
|
|
using BlockInputStreamType = DictionaryBlockInputStream<ComplexKeyCacheDictionary, UInt64>;
|
2017-05-29 17:26:45 +00:00
|
|
|
return std::make_shared<BlockInputStreamType>(shared_from_this(), max_block_size, keys, column_names);
|
2017-05-04 18:14:23 +00:00
|
|
|
}
|
|
|
|
|
2016-06-07 21:07:44 +00:00
|
|
|
}
|