CacheDictionary.cpp 26.2 KB
Newer Older
1 2
#include <DB/Columns/ColumnsNumber.h>
#include <DB/Dictionaries/CacheDictionary.h>
3
#include <DB/Common/BitHelpers.h>
A
Alexey Milovidov 已提交
4
#include <DB/Common/randomSeed.h>
5
#include <DB/Common/HashTable/Hash.h>
6 7 8 9 10
#include <DB/Common/Stopwatch.h>
#include <DB/Common/ProfilingScopedRWLock.h>
#include <ext/size.hpp>
#include <ext/range.hpp>
#include <ext/map.hpp>
11 12 13 14 15 16 17 18 19 20 21 22 23


namespace DB
{

namespace ErrorCodes
{
	extern const int TYPE_MISMATCH;
	extern const int BAD_ARGUMENTS;
	extern const int UNSUPPORTED_METHOD;
}


V
Vladimir Smirnov 已提交
24
inline UInt64 CacheDictionary::getCellIdx(const Key id) const
25 26 27 28 29 30 31 32 33 34 35 36
{
	const auto hash = intHash64(id);
	const auto idx = hash & (size - 1);
	return idx;
}


CacheDictionary::CacheDictionary(const std::string & name, const DictionaryStructure & dict_struct,
	DictionarySourcePtr source_ptr, const DictionaryLifetime dict_lifetime,
	const std::size_t size)
	: name{name}, dict_struct(dict_struct),
		source_ptr{std::move(source_ptr)}, dict_lifetime(dict_lifetime),
37
		size{roundUpToPowerOfTwoOrZero(size)},
38
		cells{this->size},
A
Alexey Milovidov 已提交
39
		rnd_engine{randomSeed()}
40 41 42 43 44 45 46 47 48 49 50 51 52 53
{
	if (!this->source_ptr->supportsSelectiveLoad())
		throw Exception{
			name + ": source cannot be used with CacheDictionary",
			ErrorCodes::UNSUPPORTED_METHOD};

	createAttributes();
}

CacheDictionary::CacheDictionary(const CacheDictionary & other)
	: CacheDictionary{other.name, other.dict_struct, other.source_ptr->clone(), other.dict_lifetime, other.size}
{}


A
Alexey Milovidov 已提交
54
void CacheDictionary::toParent(const PaddedPODArray<Key> & ids, PaddedPODArray<Key> & out) const
55 56 57 58 59 60 61 62
{
	const auto null_value = std::get<UInt64>(hierarchical_attribute->null_values);

	getItemsNumber<UInt64>(*hierarchical_attribute, ids, out, [&] (const std::size_t) { return null_value; });
}


#define DECLARE(TYPE)\
A
Alexey Milovidov 已提交
63
void CacheDictionary::get##TYPE(const std::string & attribute_name, const PaddedPODArray<Key> & ids, PaddedPODArray<TYPE> & out) const\
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86
{\
	auto & attribute = getAttribute(attribute_name);\
	if (!isAttributeTypeConvertibleTo(attribute.type, AttributeUnderlyingType::TYPE))\
		throw Exception{\
			name + ": type mismatch: attribute " + attribute_name + " has type " + toString(attribute.type),\
			ErrorCodes::TYPE_MISMATCH};\
	\
	const auto null_value = std::get<TYPE>(attribute.null_values);\
	\
	getItemsNumber<TYPE>(attribute, ids, out, [&] (const std::size_t) { return null_value; });\
}
DECLARE(UInt8)
DECLARE(UInt16)
DECLARE(UInt32)
DECLARE(UInt64)
DECLARE(Int8)
DECLARE(Int16)
DECLARE(Int32)
DECLARE(Int64)
DECLARE(Float32)
DECLARE(Float64)
#undef DECLARE

A
Alexey Milovidov 已提交
87
void CacheDictionary::getString(const std::string & attribute_name, const PaddedPODArray<Key> & ids, ColumnString * out) const
88 89 90 91 92 93 94 95 96 97 98 99 100 101
{
	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};

	const auto null_value = StringRef{std::get<String>(attribute.null_values)};

	getItemsString(attribute, ids, out, [&] (const std::size_t) { return null_value; });
}

#define DECLARE(TYPE)\
void CacheDictionary::get##TYPE(\
A
Alexey Milovidov 已提交
102
	const std::string & attribute_name, const PaddedPODArray<Key> & ids, const PaddedPODArray<TYPE> & def,\
103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125
	PaddedPODArray<TYPE> & out) const\
{\
	auto & attribute = getAttribute(attribute_name);\
	if (!isAttributeTypeConvertibleTo(attribute.type, AttributeUnderlyingType::TYPE))\
		throw Exception{\
			name + ": type mismatch: attribute " + attribute_name + " has type " + toString(attribute.type),\
			ErrorCodes::TYPE_MISMATCH};\
	\
	getItemsNumber<TYPE>(attribute, ids, out, [&] (const std::size_t row) { return def[row]; });\
}
DECLARE(UInt8)
DECLARE(UInt16)
DECLARE(UInt32)
DECLARE(UInt64)
DECLARE(Int8)
DECLARE(Int16)
DECLARE(Int32)
DECLARE(Int64)
DECLARE(Float32)
DECLARE(Float64)
#undef DECLARE

void CacheDictionary::getString(
A
Alexey Milovidov 已提交
126
	const std::string & attribute_name, const PaddedPODArray<Key> & ids, const ColumnString * const def,
127 128 129 130 131 132 133 134 135 136 137 138 139
	ColumnString * const out) const
{
	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};

	getItemsString(attribute, ids, out, [&] (const std::size_t row) { return def->getDataAt(row); });
}

#define DECLARE(TYPE)\
void CacheDictionary::get##TYPE(\
A
Alexey Milovidov 已提交
140
	const std::string & attribute_name, const PaddedPODArray<Key> & ids, const TYPE def, PaddedPODArray<TYPE> & out) const\
141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162
{\
	auto & attribute = getAttribute(attribute_name);\
	if (!isAttributeTypeConvertibleTo(attribute.type, AttributeUnderlyingType::TYPE))\
		throw Exception{\
			name + ": type mismatch: attribute " + attribute_name + " has type " + toString(attribute.type),\
			ErrorCodes::TYPE_MISMATCH};\
	\
	getItemsNumber<TYPE>(attribute, ids, out, [&] (const std::size_t) { return def; });\
}
DECLARE(UInt8)
DECLARE(UInt16)
DECLARE(UInt32)
DECLARE(UInt64)
DECLARE(Int8)
DECLARE(Int16)
DECLARE(Int32)
DECLARE(Int64)
DECLARE(Float32)
DECLARE(Float64)
#undef DECLARE

void CacheDictionary::getString(
A
Alexey Milovidov 已提交
163
	const std::string & attribute_name, const PaddedPODArray<Key> & ids, const String & def,
164 165 166 167 168 169 170 171 172 173 174 175
	ColumnString * const out) const
{
	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};

	getItemsString(attribute, ids, out, [&] (const std::size_t) { return StringRef{def}; });
}


A
Alexey Milovidov 已提交
176
void CacheDictionary::has(const PaddedPODArray<Key> & ids, PaddedPODArray<UInt8> & out) const
177 178
{
	/// Mapping: <id> -> { all indices `i` of `ids` such that `ids[i]` = <id> }
179
	std::unordered_map<Key, std::vector<std::size_t>> outdated_ids;
180

181 182
	size_t cache_expired = 0, cache_not_found = 0, cache_hit = 0;

183 184
	const auto rows = ext::size(ids);
	{
185
		const ProfilingScopedReadRWLock read_lock{rw_lock, ProfileEvents::DictCacheLockReadNs};
186 187 188 189 190 191 192 193 194 195 196 197 198

		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))
		{
			const auto id = ids[row];
			const auto cell_idx = getCellIdx(id);
			const auto & cell = cells[cell_idx];

			/** cell should be updated if either:
				*	1. ids do not match,
				*	2. cell has expired,
				*	3. explicit defaults were specified and cell was set default. */
199 200 201 202 203 204 205 206
			if (cell.id != id)
			{
				++cache_not_found;
				outdated_ids[id].push_back(row);
			}
			else if (cell.expiresAt() < now)
			{
				++cache_expired;
207
				outdated_ids[id].push_back(row);
208
			}
209
			else
210 211
			{
				++cache_hit;
212
				out[row] = !cell.isDefault();
213
			}
214 215 216
		}
	}

217 218 219 220
	ProfileEvents::increment(ProfileEvents::DictCacheKeysExpired, cache_expired);
	ProfileEvents::increment(ProfileEvents::DictCacheKeysNotFound, cache_not_found);
	ProfileEvents::increment(ProfileEvents::DictCacheKeysHit, cache_hit);

221 222 223 224 225 226
	query_count.fetch_add(rows, std::memory_order_relaxed);
	hit_count.fetch_add(rows - outdated_ids.size(), std::memory_order_release);

	if (outdated_ids.empty())
		return;

A
Alexey Milovidov 已提交
227
	std::vector<Key> required_ids(outdated_ids.size());
228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246
	std::transform(std::begin(outdated_ids), std::end(outdated_ids), std::begin(required_ids),
		[] (auto & pair) { return pair.first; });

	/// request new values
	update(required_ids, [&] (const auto id, const auto) {
		for (const auto row : outdated_ids[id])
			out[row] = true;
	}, [&] (const auto id, const auto) {
		for (const auto row : outdated_ids[id])
			out[row] = false;
	});
}


void CacheDictionary::createAttributes()
{
	const auto size = dict_struct.attributes.size();
	attributes.reserve(size);

A
Alexey Milovidov 已提交
247
	bytes_allocated += size * sizeof(CellMetadata);
248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
	bytes_allocated += size * sizeof(attributes.front());

	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)
		{
			hierarchical_attribute = &attributes.back();

			if (hierarchical_attribute->type != AttributeUnderlyingType::UInt64)
				throw Exception{
					name + ": hierarchical attribute must be UInt64.",
					ErrorCodes::TYPE_MISMATCH};
		}
	}
}

A
Alexey Milovidov 已提交
267
CacheDictionary::Attribute CacheDictionary::createAttributeWithType(const AttributeUnderlyingType type, const Field & null_value)
268
{
A
Alexey Milovidov 已提交
269
	Attribute attr{type};
270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337

	switch (type)
	{
		case AttributeUnderlyingType::UInt8:
			std::get<UInt8>(attr.null_values) = null_value.get<UInt64>();
			std::get<ContainerPtrType<UInt8>>(attr.arrays) = std::make_unique<ContainerType<UInt8>>(size);
			bytes_allocated += size * sizeof(UInt8);
			break;
		case AttributeUnderlyingType::UInt16:
			std::get<UInt16>(attr.null_values) = null_value.get<UInt64>();
			std::get<ContainerPtrType<UInt16>>(attr.arrays) = std::make_unique<ContainerType<UInt16>>(size);
			bytes_allocated += size * sizeof(UInt16);
			break;
		case AttributeUnderlyingType::UInt32:
			std::get<UInt32>(attr.null_values) = null_value.get<UInt64>();
			std::get<ContainerPtrType<UInt32>>(attr.arrays) = std::make_unique<ContainerType<UInt32>>(size);
			bytes_allocated += size * sizeof(UInt32);
			break;
		case AttributeUnderlyingType::UInt64:
			std::get<UInt64>(attr.null_values) = null_value.get<UInt64>();
			std::get<ContainerPtrType<UInt64>>(attr.arrays) = std::make_unique<ContainerType<UInt64>>(size);
			bytes_allocated += size * sizeof(UInt64);
			break;
		case AttributeUnderlyingType::Int8:
			std::get<Int8>(attr.null_values) = null_value.get<Int64>();
			std::get<ContainerPtrType<Int8>>(attr.arrays) = std::make_unique<ContainerType<Int8>>(size);
			bytes_allocated += size * sizeof(Int8);
			break;
		case AttributeUnderlyingType::Int16:
			std::get<Int16>(attr.null_values) = null_value.get<Int64>();
			std::get<ContainerPtrType<Int16>>(attr.arrays) = std::make_unique<ContainerType<Int16>>(size);
			bytes_allocated += size * sizeof(Int16);
			break;
		case AttributeUnderlyingType::Int32:
			std::get<Int32>(attr.null_values) = null_value.get<Int64>();
			std::get<ContainerPtrType<Int32>>(attr.arrays) = std::make_unique<ContainerType<Int32>>(size);
			bytes_allocated += size * sizeof(Int32);
			break;
		case AttributeUnderlyingType::Int64:
			std::get<Int64>(attr.null_values) = null_value.get<Int64>();
			std::get<ContainerPtrType<Int64>>(attr.arrays) = std::make_unique<ContainerType<Int64>>(size);
			bytes_allocated += size * sizeof(Int64);
			break;
		case AttributeUnderlyingType::Float32:
			std::get<Float32>(attr.null_values) = null_value.get<Float64>();
			std::get<ContainerPtrType<Float32>>(attr.arrays) = std::make_unique<ContainerType<Float32>>(size);
			bytes_allocated += size * sizeof(Float32);
			break;
		case AttributeUnderlyingType::Float64:
			std::get<Float64>(attr.null_values) = null_value.get<Float64>();
			std::get<ContainerPtrType<Float64>>(attr.arrays) = std::make_unique<ContainerType<Float64>>(size);
			bytes_allocated += size * sizeof(Float64);
			break;
		case AttributeUnderlyingType::String:
			std::get<String>(attr.null_values) = null_value.get<String>();
			std::get<ContainerPtrType<StringRef>>(attr.arrays) = std::make_unique<ContainerType<StringRef>>(size);
			bytes_allocated += size * sizeof(StringRef);
			if (!string_arena)
				string_arena = std::make_unique<ArenaWithFreeLists>();
			break;
	}

	return attr;
}


template <typename OutputType, typename DefaultGetter>
void CacheDictionary::getItemsNumber(
A
Alexey Milovidov 已提交
338 339
	Attribute & attribute,
	const PaddedPODArray<Key> & ids,
340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
	PaddedPODArray<OutputType> & out,
	DefaultGetter && get_default) const
{
	if (false) {}
#define DISPATCH(TYPE) \
	else if (attribute.type == AttributeUnderlyingType::TYPE) \
		getItemsNumberImpl<TYPE, OutputType>(attribute, ids, out, std::forward<DefaultGetter>(get_default));
	DISPATCH(UInt8)
	DISPATCH(UInt16)
	DISPATCH(UInt32)
	DISPATCH(UInt64)
	DISPATCH(Int8)
	DISPATCH(Int16)
	DISPATCH(Int32)
	DISPATCH(Int64)
	DISPATCH(Float32)
	DISPATCH(Float64)
#undef DISPATCH
	else
		throw Exception("Unexpected type of attribute: " + toString(attribute.type), ErrorCodes::LOGICAL_ERROR);
}

template <typename AttributeType, typename OutputType, typename DefaultGetter>
void CacheDictionary::getItemsNumberImpl(
A
Alexey Milovidov 已提交
364 365
	Attribute & attribute,
	const PaddedPODArray<Key> & ids,
366 367 368 369
	PaddedPODArray<OutputType> & out,
	DefaultGetter && get_default) const
{
	/// Mapping: <id> -> { all indices `i` of `ids` such that `ids[i]` = <id> }
370
	std::unordered_map<Key, std::vector<std::size_t>> outdated_ids;
A
Alexey Milovidov 已提交
371
	auto & attribute_array = std::get<ContainerPtrType<AttributeType>>(attribute.arrays);
372 373
	const auto rows = ext::size(ids);

374 375
	size_t cache_expired = 0, cache_not_found = 0, cache_hit = 0;

376
	{
377
		const ProfilingScopedReadRWLock read_lock{rw_lock, ProfileEvents::DictCacheLockReadNs};
378 379 380 381 382 383 384 385 386 387 388 389 390

		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))
		{
			const auto id = ids[row];
			const auto cell_idx = getCellIdx(id);
			const auto & cell = cells[cell_idx];

			/** cell should be updated if either:
				*	1. ids do not match,
				*	2. cell has expired,
				*	3. explicit defaults were specified and cell was set default. */
391 392 393
			if (cell.id != id)
			{
				++cache_not_found;
394
				outdated_ids[id].push_back(row);
395 396 397 398 399 400
			}
			else if (cell.expiresAt() < now)
			{
				++cache_expired;
				outdated_ids[id].push_back(row);
			}
401
			else
402 403
			{
				++cache_hit;
404
				out[row] = cell.isDefault() ? get_default(row) : attribute_array[cell_idx];
405
			}
406 407 408
		}
	}

409 410 411 412
	ProfileEvents::increment(ProfileEvents::DictCacheKeysExpired, cache_expired);
	ProfileEvents::increment(ProfileEvents::DictCacheKeysNotFound, cache_not_found);
	ProfileEvents::increment(ProfileEvents::DictCacheKeysHit, cache_hit);

413 414 415 416 417 418
	query_count.fetch_add(rows, std::memory_order_relaxed);
	hit_count.fetch_add(rows - outdated_ids.size(), std::memory_order_release);

	if (outdated_ids.empty())
		return;

A
Alexey Milovidov 已提交
419
	std::vector<Key> required_ids(outdated_ids.size());
420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436
	std::transform(std::begin(outdated_ids), std::end(outdated_ids), std::begin(required_ids),
		[] (auto & pair) { return pair.first; });

	/// request new values
	update(required_ids, [&] (const auto id, const auto cell_idx) {
		const auto attribute_value = attribute_array[cell_idx];

		for (const auto row : outdated_ids[id])
			out[row] = attribute_value;
	}, [&] (const auto id, const auto cell_idx) {
		for (const auto row : outdated_ids[id])
			out[row] = get_default(row);
	});
}

template <typename DefaultGetter>
void CacheDictionary::getItemsString(
A
Alexey Milovidov 已提交
437 438
	Attribute & attribute,
	const PaddedPODArray<Key> & ids,
439 440 441 442 443 444 445 446 447 448 449 450 451 452
	ColumnString * out,
	DefaultGetter && get_default) const
{
	const auto rows = ext::size(ids);

	/// save on some allocations
	out->getOffsets().reserve(rows);

	auto & attribute_array = std::get<ContainerPtrType<StringRef>>(attribute.arrays);

	auto found_outdated_values = false;

	/// perform optimistic version, fallback to pessimistic if failed
	{
453
		const ProfilingScopedReadRWLock read_lock{rw_lock, ProfileEvents::DictCacheLockReadNs};
454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488

		const auto now = std::chrono::system_clock::now();
		/// fetch up-to-date values, discard on fail
		for (const auto row : ext::range(0, rows))
		{
			const auto id = ids[row];
			const auto cell_idx = getCellIdx(id);
			const auto & cell = cells[cell_idx];

			if (cell.id != id || cell.expiresAt() < now)
			{
				found_outdated_values = true;
				break;
			}
			else
			{
				const auto string_ref = cell.isDefault() ? get_default(row) : attribute_array[cell_idx];
				out->insertData(string_ref.data, string_ref.size);
			}
		}
	}

	/// optimistic code completed successfully
	if (!found_outdated_values)
	{
		query_count.fetch_add(rows, std::memory_order_relaxed);
		hit_count.fetch_add(rows, std::memory_order_release);
		return;
	}

	/// now onto the pessimistic one, discard possible partial results from the optimistic path
	out->getChars().resize_assume_reserved(0);
	out->getOffsets().resize_assume_reserved(0);

	/// Mapping: <id> -> { all indices `i` of `ids` such that `ids[i]` = <id> }
489
	std::unordered_map<Key, std::vector<std::size_t>> outdated_ids;
490
	/// we are going to store every string separately
491
	std::unordered_map<Key, String> map;
492 493

	std::size_t total_length = 0;
494
	size_t cache_expired = 0, cache_not_found = 0, cache_hit = 0;
495
	{
496
		const ProfilingScopedReadRWLock read_lock{rw_lock, ProfileEvents::DictCacheLockReadNs};
497 498 499 500 501 502 503 504

		const auto now = std::chrono::system_clock::now();
		for (const auto row : ext::range(0, ids.size()))
		{
			const auto id = ids[row];
			const auto cell_idx = getCellIdx(id);
			const auto & cell = cells[cell_idx];

505 506 507 508 509 510 511 512
			if (cell.id != id)
			{
				++cache_not_found;
				outdated_ids[id].push_back(row);
			}
			else if (cell.expiresAt() < now)
			{
				++cache_expired;
513
				outdated_ids[id].push_back(row);
514
			}
515 516
			else
			{
517
				++cache_hit;
518 519 520 521 522 523 524 525 526
				const auto string_ref = cell.isDefault() ? get_default(row) : attribute_array[cell_idx];

				if (!cell.isDefault())
					map[id] = String{string_ref};

				total_length += string_ref.size + 1;
			}
		}
	}
527 528 529
	ProfileEvents::increment(ProfileEvents::DictCacheKeysExpired, cache_expired);
	ProfileEvents::increment(ProfileEvents::DictCacheKeysNotFound, cache_not_found);
	ProfileEvents::increment(ProfileEvents::DictCacheKeysHit, cache_hit);
530 531 532 533 534 535 536

	query_count.fetch_add(rows, std::memory_order_relaxed);
	hit_count.fetch_add(rows - outdated_ids.size(), std::memory_order_release);

	/// request new values
	if (!outdated_ids.empty())
	{
A
Alexey Milovidov 已提交
537
		std::vector<Key> required_ids(outdated_ids.size());
538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565
		std::transform(std::begin(outdated_ids), std::end(outdated_ids), std::begin(required_ids),
			[] (auto & pair) { return pair.first; });

		update(required_ids, [&] (const auto id, const auto cell_idx) {
			const auto attribute_value = attribute_array[cell_idx];

			map[id] = String{attribute_value};
			total_length += (attribute_value.size + 1) * outdated_ids[id].size();
		}, [&] (const auto id, const auto cell_idx) {
			for (const auto row : outdated_ids[id])
				total_length += get_default(row).size + 1;
		});
	}

	out->getChars().reserve(total_length);

	for (const auto row : ext::range(0, ext::size(ids)))
	{
		const auto id = ids[row];
		const auto it = map.find(id);

		const auto string_ref = it != std::end(map) ? StringRef{it->second} : get_default(row);
		out->insertData(string_ref.data, string_ref.size);
	}
}

template <typename PresentIdHandler, typename AbsentIdHandler>
void CacheDictionary::update(
A
Alexey Milovidov 已提交
566
	const std::vector<Key> & requested_ids, PresentIdHandler && on_cell_updated,
567 568
	AbsentIdHandler && on_id_not_found) const
{
569
	std::unordered_map<Key, UInt8> remaining_ids{requested_ids.size()};
570 571 572
	for (const auto id : requested_ids)
		remaining_ids.insert({ id, 0 });

V
Vladimir Smirnov 已提交
573
	std::uniform_int_distribution<UInt64> distribution{
574 575 576 577
		dict_lifetime.min_sec,
		dict_lifetime.max_sec
	};

578
	const ProfilingScopedWriteRWLock write_lock{rw_lock, ProfileEvents::DictCacheLockWriteNs};
579 580

	{
581 582 583 584
		CurrentMetrics::Increment metric_increment{CurrentMetrics::DictCacheRequests};
		Stopwatch watch;
		auto stream = source_ptr->loadIds(requested_ids);
		stream->readPrefix();
585

586 587 588 589 590 591 592
		while (const auto block = stream->read())
		{
			const auto id_column = typeid_cast<const ColumnUInt64 *>(block.safeGetByPosition(0).column.get());
			if (!id_column)
				throw Exception{
					name + ": id column has type different from UInt64.",
					ErrorCodes::TYPE_MISMATCH};
593

594
			const auto & ids = id_column->getData();
595

596 597 598 599
			/// cache column pointers
			const auto column_ptrs = ext::map<std::vector>(ext::range(0, attributes.size()), [&block] (const auto & i) {
				return block.safeGetByPosition(i + 1).column.get();
			});
600

601
			for (const auto i : ext::range(0, ids.size()))
602
			{
603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628
				const auto id = ids[i];
				const auto cell_idx = getCellIdx(id);
				auto & cell = cells[cell_idx];

				for (const auto attribute_idx : ext::range(0, attributes.size()))
				{
					const auto & attribute_column = *column_ptrs[attribute_idx];
					auto & attribute = attributes[attribute_idx];

					setAttributeValue(attribute, cell_idx, attribute_column[i]);
				}

				/// if cell id is zero and zero does not map to this cell, then the cell is unused
				if (cell.id == 0 && cell_idx != zero_cell_idx)
					element_count.fetch_add(1, std::memory_order_relaxed);

				cell.id = id;
				if (dict_lifetime.min_sec != 0 && dict_lifetime.max_sec != 0)
					cell.setExpiresAt(std::chrono::system_clock::now() + std::chrono::seconds{distribution(rnd_engine)});
				else
					cell.setExpiresAt(std::chrono::time_point<std::chrono::system_clock>::max());

				/// inform caller
				on_cell_updated(id, cell_idx);
				/// mark corresponding id as found
				remaining_ids[id] = 1;
629
			}
630
		}
631

632
		stream->readSuffix();
633

634 635
		ProfileEvents::increment(ProfileEvents::DictCacheKeysRequested, requested_ids.size());
		ProfileEvents::increment(ProfileEvents::DictCacheRequestTimeNs, watch.elapsed());
636 637
	}

638
	size_t not_found_num = 0, found_num = 0;
639 640 641 642 643

	/// Check which ids have not been found and require setting null_value
	for (const auto id_found_pair : remaining_ids)
	{
		if (id_found_pair.second)
644 645
		{
			++found_num;
646
			continue;
647 648
		}
		++not_found_num;
649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672

		const auto id = id_found_pair.first;
		const auto cell_idx = getCellIdx(id);
		auto & cell = cells[cell_idx];

		/// Set null_value for each attribute
		for (auto & attribute : attributes)
			setDefaultAttributeValue(attribute, cell_idx);

		/// Check if cell had not been occupied before and increment element counter if it hadn't
		if (cell.id == 0 && cell_idx != zero_cell_idx)
			element_count.fetch_add(1, std::memory_order_relaxed);

		cell.id = id;
		if (dict_lifetime.min_sec != 0 && dict_lifetime.max_sec != 0)
			cell.setExpiresAt(std::chrono::system_clock::now() + std::chrono::seconds{distribution(rnd_engine)});
		else
			cell.setExpiresAt(std::chrono::time_point<std::chrono::system_clock>::max());

		cell.setDefault();

		/// inform caller that the cell has not been found
		on_id_not_found(id, cell_idx);
	}
673 674 675 676

	ProfileEvents::increment(ProfileEvents::DictCacheKeysRequestedMiss, not_found_num);
	ProfileEvents::increment(ProfileEvents::DictCacheKeysRequestedFound, found_num);
	ProfileEvents::increment(ProfileEvents::DictCacheRequests);
677 678 679
}


A
Alexey Milovidov 已提交
680
void CacheDictionary::setDefaultAttributeValue(Attribute & attribute, const Key idx) const
681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711
{
	switch (attribute.type)
	{
		case AttributeUnderlyingType::UInt8: std::get<ContainerPtrType<UInt8>>(attribute.arrays)[idx] = std::get<UInt8>(attribute.null_values); break;
		case AttributeUnderlyingType::UInt16: std::get<ContainerPtrType<UInt16>>(attribute.arrays)[idx] = std::get<UInt16>(attribute.null_values); break;
		case AttributeUnderlyingType::UInt32: std::get<ContainerPtrType<UInt32>>(attribute.arrays)[idx] = std::get<UInt32>(attribute.null_values); break;
		case AttributeUnderlyingType::UInt64: std::get<ContainerPtrType<UInt64>>(attribute.arrays)[idx] = std::get<UInt64>(attribute.null_values); break;
		case AttributeUnderlyingType::Int8: std::get<ContainerPtrType<Int8>>(attribute.arrays)[idx] = std::get<Int8>(attribute.null_values); break;
		case AttributeUnderlyingType::Int16: std::get<ContainerPtrType<Int16>>(attribute.arrays)[idx] = std::get<Int16>(attribute.null_values); break;
		case AttributeUnderlyingType::Int32: std::get<ContainerPtrType<Int32>>(attribute.arrays)[idx] = std::get<Int32>(attribute.null_values); break;
		case AttributeUnderlyingType::Int64: std::get<ContainerPtrType<Int64>>(attribute.arrays)[idx] = std::get<Int64>(attribute.null_values); break;
		case AttributeUnderlyingType::Float32: std::get<ContainerPtrType<Float32>>(attribute.arrays)[idx] = std::get<Float32>(attribute.null_values); break;
		case AttributeUnderlyingType::Float64: std::get<ContainerPtrType<Float64>>(attribute.arrays)[idx] = std::get<Float64>(attribute.null_values); break;
		case AttributeUnderlyingType::String:
		{
			const auto & null_value_ref = std::get<String>(attribute.null_values);
			auto & string_ref = std::get<ContainerPtrType<StringRef>>(attribute.arrays)[idx];

			if (string_ref.data != null_value_ref.data())
			{
				if (string_ref.data)
					string_arena->free(const_cast<char *>(string_ref.data), string_ref.size);

				string_ref = StringRef{null_value_ref};
			}

			break;
		}
	}
}

A
Alexey Milovidov 已提交
712
void CacheDictionary::setAttributeValue(Attribute & attribute, const Key idx, const Field & value) const
713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750
{
	switch (attribute.type)
	{
		case AttributeUnderlyingType::UInt8: std::get<ContainerPtrType<UInt8>>(attribute.arrays)[idx] = value.get<UInt64>(); break;
		case AttributeUnderlyingType::UInt16: std::get<ContainerPtrType<UInt16>>(attribute.arrays)[idx] = value.get<UInt64>(); break;
		case AttributeUnderlyingType::UInt32: std::get<ContainerPtrType<UInt32>>(attribute.arrays)[idx] = value.get<UInt64>(); break;
		case AttributeUnderlyingType::UInt64: std::get<ContainerPtrType<UInt64>>(attribute.arrays)[idx] = value.get<UInt64>(); break;
		case AttributeUnderlyingType::Int8: std::get<ContainerPtrType<Int8>>(attribute.arrays)[idx] = value.get<Int64>(); break;
		case AttributeUnderlyingType::Int16: std::get<ContainerPtrType<Int16>>(attribute.arrays)[idx] = value.get<Int64>(); break;
		case AttributeUnderlyingType::Int32: std::get<ContainerPtrType<Int32>>(attribute.arrays)[idx] = value.get<Int64>(); break;
		case AttributeUnderlyingType::Int64: std::get<ContainerPtrType<Int64>>(attribute.arrays)[idx] = value.get<Int64>(); break;
		case AttributeUnderlyingType::Float32: std::get<ContainerPtrType<Float32>>(attribute.arrays)[idx] = value.get<Float64>(); break;
		case AttributeUnderlyingType::Float64: std::get<ContainerPtrType<Float64>>(attribute.arrays)[idx] = value.get<Float64>(); break;
		case AttributeUnderlyingType::String:
		{
			const auto & string = value.get<String>();
			auto & string_ref = std::get<ContainerPtrType<StringRef>>(attribute.arrays)[idx];
			const auto & null_value_ref = std::get<String>(attribute.null_values);

			/// free memory unless it points to a null_value
			if (string_ref.data && string_ref.data != null_value_ref.data())
				string_arena->free(const_cast<char *>(string_ref.data), string_ref.size);

			const auto size = string.size();
			if (size != 0)
			{
				auto string_ptr = string_arena->alloc(size + 1);
				std::copy(string.data(), string.data() + size + 1, string_ptr);
				string_ref = StringRef{string_ptr, size};
			}
			else
				string_ref = {};

			break;
		}
	}
}

A
Alexey Milovidov 已提交
751
CacheDictionary::Attribute & CacheDictionary::getAttribute(const std::string & attribute_name) const
752 753 754 755 756 757 758 759 760 761 762 763
{
	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
		};

	return attributes[it->second];
}

}