mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-16 11:22:12 +00:00
546 lines
22 KiB
C++
546 lines
22 KiB
C++
#include <Storages/MergeTree/MergeTreeDataPartWriterWide.h>
|
|
#include <Interpreters/Context.h>
|
|
#include <Compression/CompressionFactory.h>
|
|
#include <Compression/CompressedReadBufferFromFile.h>
|
|
|
|
namespace DB
|
|
{
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int LOGICAL_ERROR;
|
|
}
|
|
|
|
namespace
|
|
{
|
|
constexpr auto DATA_FILE_EXTENSION = ".bin";
|
|
}
|
|
|
|
namespace
|
|
{
|
|
|
|
Granules getGranulesToWrite(const MergeTreeIndexGranularity & index_granularity, size_t block_rows, size_t current_mark, size_t rows_written_in_last_mark)
|
|
{
|
|
if (current_mark >= index_granularity.getMarksCount())
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "Request to get granules from mark {} but index granularity size is {}", current_mark, index_granularity.getMarksCount());
|
|
|
|
Granules result;
|
|
size_t current_row = 0;
|
|
if (rows_written_in_last_mark > 0)
|
|
{
|
|
size_t rows_left_in_last_mark = index_granularity.getMarkRows(current_mark) - rows_written_in_last_mark;
|
|
size_t rest_rows = block_rows - current_row;
|
|
if (rest_rows < rows_left_in_last_mark)
|
|
result.emplace_back(Granule{current_row, rows_left_in_last_mark, rest_rows, current_mark, false, false});
|
|
else
|
|
result.emplace_back(Granule{current_row, rows_left_in_last_mark, rows_left_in_last_mark, current_mark, false, true});
|
|
current_row += rows_left_in_last_mark;
|
|
current_mark++;
|
|
}
|
|
|
|
while (current_row < block_rows)
|
|
{
|
|
size_t expected_rows = index_granularity.getMarkRows(current_mark);
|
|
size_t rest_rows = block_rows - current_row;
|
|
if (rest_rows < expected_rows)
|
|
result.emplace_back(Granule{current_row, expected_rows, rest_rows, current_mark, true, false});
|
|
else
|
|
result.emplace_back(Granule{current_row, expected_rows, expected_rows, current_mark, true, true});
|
|
|
|
current_row += expected_rows;
|
|
current_mark++;
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
}
|
|
|
|
MergeTreeDataPartWriterWide::MergeTreeDataPartWriterWide(
|
|
const MergeTreeData::DataPartPtr & data_part_,
|
|
const NamesAndTypesList & columns_list_,
|
|
const StorageMetadataPtr & metadata_snapshot_,
|
|
const std::vector<MergeTreeIndexPtr> & indices_to_recalc_,
|
|
const String & marks_file_extension_,
|
|
const CompressionCodecPtr & default_codec_,
|
|
const MergeTreeWriterSettings & settings_,
|
|
const MergeTreeIndexGranularity & index_granularity_)
|
|
: MergeTreeDataPartWriterOnDisk(data_part_, columns_list_, metadata_snapshot_,
|
|
indices_to_recalc_, marks_file_extension_,
|
|
default_codec_, settings_, index_granularity_)
|
|
{
|
|
const auto & columns = metadata_snapshot->getColumns();
|
|
for (const auto & it : columns_list)
|
|
addStreams(it.name, *it.type, columns.getCodecDescOrDefault(it.name, default_codec), settings.estimated_size);
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::addStreams(
|
|
const String & name,
|
|
const IDataType & type,
|
|
const ASTPtr & effective_codec_desc,
|
|
size_t estimated_size)
|
|
{
|
|
IDataType::StreamCallback callback = [&] (const IDataType::SubstreamPath & substream_path, const IDataType & substream_type)
|
|
{
|
|
String stream_name = IDataType::getFileNameForStream(name, substream_path);
|
|
/// Shared offsets for Nested type.
|
|
if (column_streams.count(stream_name))
|
|
return;
|
|
|
|
CompressionCodecPtr compression_codec;
|
|
/// If we can use special codec then just get it
|
|
if (IDataType::isSpecialCompressionAllowed(substream_path))
|
|
compression_codec = CompressionCodecFactory::instance().get(effective_codec_desc, &substream_type, default_codec);
|
|
else /// otherwise return only generic codecs and don't use info about the data_type
|
|
compression_codec = CompressionCodecFactory::instance().get(effective_codec_desc, nullptr, default_codec, true);
|
|
|
|
column_streams[stream_name] = std::make_unique<Stream>(
|
|
stream_name,
|
|
data_part->volume->getDisk(),
|
|
part_path + stream_name, DATA_FILE_EXTENSION,
|
|
part_path + stream_name, marks_file_extension,
|
|
compression_codec,
|
|
settings.max_compress_block_size,
|
|
estimated_size,
|
|
settings.aio_threshold);
|
|
};
|
|
|
|
IDataType::SubstreamPath stream_path;
|
|
type.enumerateStreams(callback, stream_path);
|
|
}
|
|
|
|
|
|
IDataType::OutputStreamGetter MergeTreeDataPartWriterWide::createStreamGetter(
|
|
const String & name, WrittenOffsetColumns & offset_columns) const
|
|
{
|
|
return [&, this] (const IDataType::SubstreamPath & substream_path) -> WriteBuffer *
|
|
{
|
|
bool is_offsets = !substream_path.empty() && substream_path.back().type == IDataType::Substream::ArraySizes;
|
|
|
|
String stream_name = IDataType::getFileNameForStream(name, substream_path);
|
|
|
|
/// Don't write offsets more than one time for Nested type.
|
|
if (is_offsets && offset_columns.count(stream_name))
|
|
return nullptr;
|
|
|
|
return &column_streams.at(stream_name)->compressed;
|
|
};
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::write(const Block & block, const IColumn::Permutation * permutation)
|
|
{
|
|
/// Fill index granularity for this block
|
|
/// if it's unknown (in case of insert data or horizontal merge,
|
|
/// but not in case of vertical merge)
|
|
if (compute_granularity)
|
|
{
|
|
size_t index_granularity_for_block = computeIndexGranularity(block);
|
|
fillIndexGranularity(index_granularity_for_block, block.rows());
|
|
}
|
|
|
|
auto * log = &Poco::Logger::get(storage.getLogName());
|
|
auto granules_to_write = getGranulesToWrite(index_granularity, block.rows(), getCurrentMark(), getRowsWrittenInLastMark());
|
|
LOG_DEBUG(log, "Block rows {}, granules to write {}", block.rows(), granules_to_write.size());
|
|
|
|
auto offset_columns = written_offset_columns ? *written_offset_columns : WrittenOffsetColumns{};
|
|
Block primary_key_block;
|
|
if (settings.rewrite_primary_key)
|
|
primary_key_block = getBlockAndPermute(block, metadata_snapshot->getPrimaryKeyColumns(), permutation);
|
|
|
|
Block skip_indexes_block = getBlockAndPermute(block, getSkipIndicesColumns(), permutation);
|
|
|
|
auto it = columns_list.begin();
|
|
for (size_t i = 0; i < columns_list.size(); ++i, ++it)
|
|
{
|
|
const ColumnWithTypeAndName & column = block.getByName(it->name);
|
|
|
|
if (permutation)
|
|
{
|
|
if (primary_key_block.has(it->name))
|
|
{
|
|
const auto & primary_column = *primary_key_block.getByName(it->name).column;
|
|
writeColumn(column.name, *column.type, primary_column, offset_columns, granules_to_write);
|
|
}
|
|
else if (skip_indexes_block.has(it->name))
|
|
{
|
|
const auto & index_column = *skip_indexes_block.getByName(it->name).column;
|
|
writeColumn(column.name, *column.type, index_column, offset_columns, granules_to_write);
|
|
}
|
|
else
|
|
{
|
|
/// We rearrange the columns that are not included in the primary key here; Then the result is released - to save RAM.
|
|
ColumnPtr permuted_column = column.column->permute(*permutation, 0);
|
|
writeColumn(column.name, *column.type, *permuted_column, offset_columns, granules_to_write);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
writeColumn(column.name, *column.type, *column.column, offset_columns, granules_to_write);
|
|
}
|
|
}
|
|
|
|
if (settings.rewrite_primary_key)
|
|
calculateAndSerializePrimaryIndex(primary_key_block, granules_to_write);
|
|
|
|
calculateAndSerializeSkipIndices(skip_indexes_block, granules_to_write);
|
|
|
|
auto last_granule = granules_to_write.back();
|
|
if (!last_granule.is_completed)
|
|
{
|
|
size_t next_mark = getCurrentMark() + granules_to_write.size() - 1;
|
|
setCurrentMark(next_mark);
|
|
if (granules_to_write.size() == 1)
|
|
setRowsWrittenInLastMark(getRowsWrittenInLastMark() + last_granule.actual_rows_count);
|
|
else
|
|
setRowsWrittenInLastMark(last_granule.actual_rows_count);
|
|
}
|
|
else
|
|
{
|
|
setCurrentMark(getCurrentMark() + granules_to_write.size());
|
|
setRowsWrittenInLastMark(0);
|
|
}
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::writeSingleMark(
|
|
const String & name,
|
|
const IDataType & type,
|
|
WrittenOffsetColumns & offset_columns,
|
|
size_t number_of_rows,
|
|
DB::IDataType::SubstreamPath & path)
|
|
{
|
|
StreamsWithMarks marks = getCurrentMarksForColumn(name, type, offset_columns, path);
|
|
for (const auto & mark : marks)
|
|
flushMarkToFile(mark, number_of_rows);
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::flushMarkToFile(const StreamNameAndMark & stream_with_mark, size_t rows_in_mark)
|
|
{
|
|
Stream & stream = *column_streams[stream_with_mark.stream_name];
|
|
writeIntBinary(stream_with_mark.mark.offset_in_compressed_file, stream.marks);
|
|
writeIntBinary(stream_with_mark.mark.offset_in_decompressed_block, stream.marks);
|
|
if (settings.can_use_adaptive_granularity)
|
|
writeIntBinary(rows_in_mark, stream.marks);
|
|
}
|
|
|
|
StreamsWithMarks MergeTreeDataPartWriterWide::getCurrentMarksForColumn(
|
|
const String & name,
|
|
const IDataType & type,
|
|
WrittenOffsetColumns & offset_columns,
|
|
DB::IDataType::SubstreamPath & path)
|
|
{
|
|
StreamsWithMarks result;
|
|
type.enumerateStreams([&] (const IDataType::SubstreamPath & substream_path, const IDataType & /* substream_type */)
|
|
{
|
|
bool is_offsets = !substream_path.empty() && substream_path.back().type == IDataType::Substream::ArraySizes;
|
|
|
|
String stream_name = IDataType::getFileNameForStream(name, substream_path);
|
|
|
|
/// Don't write offsets more than one time for Nested type.
|
|
if (is_offsets && offset_columns.count(stream_name))
|
|
return;
|
|
|
|
Stream & stream = *column_streams[stream_name];
|
|
|
|
/// There could already be enough data to compress into the new block.
|
|
if (stream.compressed.offset() >= settings.min_compress_block_size)
|
|
stream.compressed.next();
|
|
|
|
StreamNameAndMark stream_with_mark;
|
|
stream_with_mark.stream_name = stream_name;
|
|
stream_with_mark.mark.offset_in_compressed_file = stream.plain_hashing.count();
|
|
stream_with_mark.mark.offset_in_decompressed_block = stream.compressed.offset();
|
|
|
|
result.push_back(stream_with_mark);
|
|
}, path);
|
|
|
|
return result;
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::writeSingleGranule(
|
|
const String & name,
|
|
const IDataType & type,
|
|
const IColumn & column,
|
|
WrittenOffsetColumns & offset_columns,
|
|
IDataType::SerializeBinaryBulkStatePtr & serialization_state,
|
|
IDataType::SerializeBinaryBulkSettings & serialize_settings,
|
|
size_t from_row,
|
|
size_t number_of_rows,
|
|
bool write_marks)
|
|
{
|
|
if (write_marks)
|
|
writeSingleMark(name, type, offset_columns, number_of_rows, serialize_settings.path);
|
|
|
|
type.serializeBinaryBulkWithMultipleStreams(column, from_row, number_of_rows, serialize_settings, serialization_state);
|
|
|
|
/// So that instead of the marks pointing to the end of the compressed block, there were marks pointing to the beginning of the next one.
|
|
type.enumerateStreams([&] (const IDataType::SubstreamPath & substream_path, const IDataType & /* substream_type */)
|
|
{
|
|
bool is_offsets = !substream_path.empty() && substream_path.back().type == IDataType::Substream::ArraySizes;
|
|
|
|
String stream_name = IDataType::getFileNameForStream(name, substream_path);
|
|
|
|
/// Don't write offsets more than one time for Nested type.
|
|
if (is_offsets && offset_columns.count(stream_name))
|
|
return;
|
|
|
|
column_streams[stream_name]->compressed.nextIfAtEnd();
|
|
}, serialize_settings.path);
|
|
}
|
|
|
|
/// Column must not be empty. (column.size() !== 0)
|
|
void MergeTreeDataPartWriterWide::writeColumn(
|
|
const String & name,
|
|
const IDataType & type,
|
|
const IColumn & column,
|
|
WrittenOffsetColumns & offset_columns,
|
|
const Granules & granules)
|
|
{
|
|
auto [it, inserted] = serialization_states.emplace(name, nullptr);
|
|
if (inserted)
|
|
{
|
|
IDataType::SerializeBinaryBulkSettings serialize_settings;
|
|
serialize_settings.getter = createStreamGetter(name, offset_columns);
|
|
type.serializeBinaryBulkStatePrefix(serialize_settings, it->second);
|
|
}
|
|
|
|
const auto & global_settings = storage.global_context.getSettingsRef();
|
|
IDataType::SerializeBinaryBulkSettings serialize_settings;
|
|
serialize_settings.getter = createStreamGetter(name, offset_columns);
|
|
serialize_settings.low_cardinality_max_dictionary_size = global_settings.low_cardinality_max_dictionary_size;
|
|
serialize_settings.low_cardinality_use_single_dictionary_for_part = global_settings.low_cardinality_use_single_dictionary_for_part != 0;
|
|
|
|
for (const auto & granule : granules)
|
|
{
|
|
if (granule.rows_count > 0)
|
|
data_written = true;
|
|
|
|
writeSingleGranule(
|
|
name,
|
|
type,
|
|
column,
|
|
offset_columns,
|
|
it->second,
|
|
serialize_settings,
|
|
granule.start,
|
|
granule.rows_count,
|
|
granule.mark_on_start
|
|
);
|
|
}
|
|
|
|
type.enumerateStreams([&] (const IDataType::SubstreamPath & substream_path, const IDataType & /* substream_type */)
|
|
{
|
|
bool is_offsets = !substream_path.empty() && substream_path.back().type == IDataType::Substream::ArraySizes;
|
|
if (is_offsets)
|
|
{
|
|
String stream_name = IDataType::getFileNameForStream(name, substream_path);
|
|
offset_columns.insert(stream_name);
|
|
}
|
|
}, serialize_settings.path);
|
|
}
|
|
|
|
|
|
void MergeTreeDataPartWriterWide::validateColumnOfFixedSize(const String & name, const IDataType & type)
|
|
{
|
|
if (!type.isValueRepresentedByNumber() || type.haveSubtypes())
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "Cannot validate column of non fixed type {}", type.getName());
|
|
|
|
auto disk = data_part->volume->getDisk();
|
|
String mrk_path = fullPath(disk, part_path + name + marks_file_extension);
|
|
String bin_path = fullPath(disk, part_path + name + DATA_FILE_EXTENSION);
|
|
DB::ReadBufferFromFile mrk_in(mrk_path);
|
|
DB::CompressedReadBufferFromFile bin_in(bin_path, 0, 0, 0);
|
|
bool must_be_last = false;
|
|
auto * log = &Poco::Logger::get(storage.getLogName());
|
|
UInt64 offset_in_compressed_file = 0;
|
|
UInt64 offset_in_decompressed_block = 0;
|
|
UInt64 index_granularity_rows = 0;
|
|
size_t total_rows = 0;
|
|
|
|
size_t mark_num;
|
|
size_t marks_file_size = disk->getFileSize(part_path + name + marks_file_extension);
|
|
LOG_DEBUG(log, "Marks file size {} bytes marks count {}", marks_file_size, index_granularity.getMarksCount());
|
|
|
|
size_t compressed_bin_position = 0;
|
|
size_t uncompressed_bin_position = 0;
|
|
for (mark_num = 0; !mrk_in.eof(); ++mark_num)
|
|
{
|
|
if (mark_num > index_granularity.getMarksCount())
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "Incorrect number of marks in memory {}, on disk (at least) {}", index_granularity.getMarksCount(), mark_num + 1);
|
|
|
|
DB::readBinary(offset_in_compressed_file, mrk_in);
|
|
DB::readBinary(offset_in_decompressed_block, mrk_in);
|
|
if (settings.can_use_adaptive_granularity)
|
|
DB::readBinary(index_granularity_rows, mrk_in);
|
|
else
|
|
index_granularity_rows = storage.getSettings()->index_granularity;
|
|
|
|
auto [new_bin_compressed, new_bin_uncompressed] = bin_in.getCurrentPosition();
|
|
if (uncompressed_bin_position >= new_bin_uncompressed)
|
|
compressed_bin_position = new_bin_compressed;
|
|
uncompressed_bin_position = new_bin_uncompressed;
|
|
|
|
LOG_TRACE(log, "Position in bin [{}, {}]", compressed_bin_position, uncompressed_bin_position);
|
|
LOG_TRACE(log, "Validating column {} mark [{}, {}] with rows {}, must be last {}", name, offset_in_compressed_file, offset_in_decompressed_block, index_granularity_rows, must_be_last);
|
|
|
|
if (must_be_last)
|
|
{
|
|
if (index_granularity_rows != 0)
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "We ran out of binary data but still have non empty mark #{} with rows number {}", mark_num, index_granularity_rows);
|
|
|
|
if (!mrk_in.eof())
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "Mark #{} must be last, but we still have some to read", mark_num);
|
|
|
|
break;
|
|
}
|
|
|
|
if (index_granularity_rows == 0)
|
|
{
|
|
auto column = type.createColumn();
|
|
|
|
type.deserializeBinaryBulk(*column, bin_in, 1000000000, 0.0);
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR,
|
|
"Still have {} rows in bin stream, last mark #{} index granularity size {}, last rows {}", column->size(), mark_num, index_granularity.getMarksCount(), index_granularity_rows);
|
|
}
|
|
|
|
if (index_granularity_rows != index_granularity.getMarkRows(mark_num))
|
|
throw Exception(
|
|
ErrorCodes::LOGICAL_ERROR, "Incorrect mark rows for mark #{} (compressed offset {}, decompressed offset {}), in-memory {}, on disk {}",
|
|
mark_num, offset_in_compressed_file, offset_in_decompressed_block, index_granularity.getMarkRows(mark_num), index_granularity_rows);
|
|
|
|
auto column = type.createColumn();
|
|
|
|
type.deserializeBinaryBulk(*column, bin_in, index_granularity_rows, 0.0);
|
|
|
|
total_rows += column->size();
|
|
LOG_TRACE(log, "Read rows {} for mark #{}, expected {}, total {}", column->size(), mark_num, index_granularity_rows, total_rows);
|
|
|
|
if (bin_in.eof())
|
|
{
|
|
LOG_TRACE(log, "Bin EOF");
|
|
must_be_last = true;
|
|
}
|
|
else if (column->size() != index_granularity_rows)
|
|
{
|
|
throw Exception(
|
|
ErrorCodes::LOGICAL_ERROR, "Incorrect mark rows for mark #{} (compressed offset {}, decompressed offset {}), actually in bin file {}, in mrk file {}",
|
|
mark_num, offset_in_compressed_file, offset_in_decompressed_block, column->size(), index_granularity.getMarkRows(mark_num));
|
|
}
|
|
}
|
|
|
|
if (!mrk_in.eof())
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR,
|
|
"Still have something in marks stream, last mark #{} index granularity size {}, last rows {}", mark_num, index_granularity.getMarksCount(), index_granularity_rows);
|
|
if (!bin_in.eof())
|
|
{
|
|
auto column = type.createColumn();
|
|
|
|
type.deserializeBinaryBulk(*column, bin_in, 1000000000, 0.0);
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR,
|
|
"Still have {} rows in bin stream, last mark #{} index granularity size {}, last rows {}", column->size(), mark_num, index_granularity.getMarksCount(), index_granularity_rows);
|
|
}
|
|
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::finishDataSerialization(IMergeTreeDataPart::Checksums & checksums, bool sync)
|
|
{
|
|
const auto & global_settings = storage.global_context.getSettingsRef();
|
|
IDataType::SerializeBinaryBulkSettings serialize_settings;
|
|
serialize_settings.low_cardinality_max_dictionary_size = global_settings.low_cardinality_max_dictionary_size;
|
|
serialize_settings.low_cardinality_use_single_dictionary_for_part = global_settings.low_cardinality_use_single_dictionary_for_part != 0;
|
|
WrittenOffsetColumns offset_columns;
|
|
|
|
bool write_final_mark = (with_final_mark && data_written);
|
|
|
|
{
|
|
auto it = columns_list.begin();
|
|
for (size_t i = 0; i < columns_list.size(); ++i, ++it)
|
|
{
|
|
if (!serialization_states.empty())
|
|
{
|
|
serialize_settings.getter = createStreamGetter(it->name, written_offset_columns ? *written_offset_columns : offset_columns);
|
|
it->type->serializeBinaryBulkStateSuffix(serialize_settings, serialization_states[it->name]);
|
|
}
|
|
|
|
if (write_final_mark)
|
|
writeFinalMark(it->name, it->type, offset_columns, serialize_settings.path);
|
|
}
|
|
}
|
|
for (auto & stream : column_streams)
|
|
{
|
|
stream.second->finalize();
|
|
stream.second->addToChecksums(checksums);
|
|
if (sync)
|
|
stream.second->sync();
|
|
}
|
|
|
|
column_streams.clear();
|
|
serialization_states.clear();
|
|
|
|
#ifndef NDEBUG
|
|
for (const auto & column : columns_list)
|
|
{
|
|
if (column.type->isValueRepresentedByNumber() && !column.type->haveSubtypes())
|
|
validateColumnOfFixedSize(column.name, *column.type);
|
|
}
|
|
#endif
|
|
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::finish(IMergeTreeDataPart::Checksums & checksums, bool sync)
|
|
{
|
|
finishDataSerialization(checksums, sync);
|
|
if (settings.rewrite_primary_key)
|
|
finishPrimaryIndexSerialization(checksums, sync);
|
|
|
|
finishSkipIndicesSerialization(checksums, sync);
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::writeFinalMark(
|
|
const std::string & column_name,
|
|
const DataTypePtr column_type,
|
|
WrittenOffsetColumns & offset_columns,
|
|
DB::IDataType::SubstreamPath & path)
|
|
{
|
|
writeSingleMark(column_name, *column_type, offset_columns, 0, path);
|
|
/// Memoize information about offsets
|
|
column_type->enumerateStreams([&] (const IDataType::SubstreamPath & substream_path, const IDataType & /* substream_type */)
|
|
{
|
|
bool is_offsets = !substream_path.empty() && substream_path.back().type == IDataType::Substream::ArraySizes;
|
|
if (is_offsets)
|
|
{
|
|
String stream_name = IDataType::getFileNameForStream(column_name, substream_path);
|
|
offset_columns.insert(stream_name);
|
|
}
|
|
}, path);
|
|
}
|
|
|
|
static void fillIndexGranularityImpl(
|
|
MergeTreeIndexGranularity & index_granularity,
|
|
size_t rows_in_last_granule,
|
|
size_t index_granularity_for_block,
|
|
size_t rows_in_block)
|
|
{
|
|
|
|
size_t start = 0;
|
|
if (rows_in_last_granule != 0)
|
|
start = index_granularity.getLastMarkRows() - rows_in_last_granule;
|
|
|
|
for (size_t current_row = start; current_row < rows_in_block; current_row += index_granularity_for_block)
|
|
index_granularity.appendMark(index_granularity_for_block);
|
|
}
|
|
|
|
void MergeTreeDataPartWriterWide::fillIndexGranularity(size_t index_granularity_for_block, size_t rows_in_block)
|
|
{
|
|
if (getCurrentMark() < index_granularity.getMarksCount() && getCurrentMark() != index_granularity.getMarksCount() - 1)
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "Trying to add marks, while current mark {}, but total marks {}", getCurrentMark(), index_granularity.getMarksCount());
|
|
|
|
fillIndexGranularityImpl(
|
|
index_granularity,
|
|
getRowsWrittenInLastMark(),
|
|
index_granularity_for_block,
|
|
rows_in_block);
|
|
}
|
|
|
|
}
|