mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-13 01:41:59 +00:00
150 lines
6.0 KiB
C++
150 lines
6.0 KiB
C++
#include <Storages/System/StorageSystemMutations.h>
|
|
#include <DataTypes/DataTypeString.h>
|
|
#include <DataTypes/DataTypesNumber.h>
|
|
#include <DataTypes/DataTypeDateTime.h>
|
|
#include <DataTypes/DataTypeArray.h>
|
|
#include <DataStreams/OneBlockInputStream.h>
|
|
#include <Storages/MergeTree/MergeTreeData.h>
|
|
#include <Storages/MergeTree/MergeTreeMutationStatus.h>
|
|
#include <Storages/VirtualColumnUtils.h>
|
|
#include <Access/ContextAccess.h>
|
|
#include <Databases/IDatabase.h>
|
|
#include <Interpreters/Context.h>
|
|
|
|
|
|
namespace DB
|
|
{
|
|
|
|
|
|
NamesAndTypesList StorageSystemMutations::getNamesAndTypes()
|
|
{
|
|
return {
|
|
{ "database", std::make_shared<DataTypeString>() },
|
|
{ "table", std::make_shared<DataTypeString>() },
|
|
{ "mutation_id", std::make_shared<DataTypeString>() },
|
|
{ "command", std::make_shared<DataTypeString>() },
|
|
{ "create_time", std::make_shared<DataTypeDateTime>() },
|
|
{ "block_numbers.partition_id", std::make_shared<DataTypeArray>(std::make_shared<DataTypeString>()) },
|
|
{ "block_numbers.number", std::make_shared<DataTypeArray>(std::make_shared<DataTypeInt64>()) },
|
|
{ "parts_to_do_names", std::make_shared<DataTypeArray>(std::make_shared<DataTypeString>()) },
|
|
{ "parts_to_do", std::make_shared<DataTypeInt64>() },
|
|
{ "is_done", std::make_shared<DataTypeUInt8>() },
|
|
{ "latest_failed_part", std::make_shared<DataTypeString>() },
|
|
{ "latest_fail_time", std::make_shared<DataTypeDateTime>() },
|
|
{ "latest_fail_reason", std::make_shared<DataTypeString>() },
|
|
};
|
|
}
|
|
|
|
|
|
void StorageSystemMutations::fillData(MutableColumns & res_columns, const Context & context, const SelectQueryInfo & query_info) const
|
|
{
|
|
const auto access = context.getAccess();
|
|
const bool check_access_for_databases = !access->isGranted(AccessType::SHOW_TABLES);
|
|
|
|
/// Collect a set of *MergeTree tables.
|
|
std::map<String, std::map<String, StoragePtr>> merge_tree_tables;
|
|
for (const auto & db : DatabaseCatalog::instance().getDatabases())
|
|
{
|
|
/// Lazy database can not contain MergeTree tables
|
|
if (db.second->getEngineName() == "Lazy")
|
|
continue;
|
|
|
|
const bool check_access_for_tables = check_access_for_databases && !access->isGranted(AccessType::SHOW_TABLES, db.first);
|
|
|
|
for (auto iterator = db.second->getTablesIterator(context); iterator->isValid(); iterator->next())
|
|
{
|
|
const auto & table = iterator->table();
|
|
if (!table)
|
|
continue;
|
|
|
|
if (!dynamic_cast<const MergeTreeData *>(table.get()))
|
|
continue;
|
|
|
|
if (check_access_for_tables && !access->isGranted(AccessType::SHOW_TABLES, db.first, iterator->name()))
|
|
continue;
|
|
|
|
merge_tree_tables[db.first][iterator->name()] = table;
|
|
}
|
|
}
|
|
|
|
MutableColumnPtr col_database_mut = ColumnString::create();
|
|
MutableColumnPtr col_table_mut = ColumnString::create();
|
|
|
|
for (auto & db : merge_tree_tables)
|
|
{
|
|
for (auto & table : db.second)
|
|
{
|
|
col_database_mut->insert(db.first);
|
|
col_table_mut->insert(table.first);
|
|
}
|
|
}
|
|
|
|
ColumnPtr col_database = std::move(col_database_mut);
|
|
ColumnPtr col_table = std::move(col_table_mut);
|
|
|
|
/// Determine what tables are needed by the conditions in the query.
|
|
{
|
|
Block filtered_block
|
|
{
|
|
{ col_database, std::make_shared<DataTypeString>(), "database" },
|
|
{ col_table, std::make_shared<DataTypeString>(), "table" },
|
|
};
|
|
|
|
VirtualColumnUtils::filterBlockWithQuery(query_info.query, filtered_block, context);
|
|
|
|
if (!filtered_block.rows())
|
|
return;
|
|
|
|
col_database = filtered_block.getByName("database").column;
|
|
col_table = filtered_block.getByName("table").column;
|
|
}
|
|
|
|
for (size_t i_storage = 0; i_storage < col_database->size(); ++i_storage)
|
|
{
|
|
auto database = (*col_database)[i_storage].safeGet<String>();
|
|
auto table = (*col_table)[i_storage].safeGet<String>();
|
|
|
|
std::vector<MergeTreeMutationStatus> statuses;
|
|
{
|
|
const IStorage * storage = merge_tree_tables[database][table].get();
|
|
if (const auto * merge_tree = dynamic_cast<const MergeTreeData *>(storage))
|
|
statuses = merge_tree->getMutationsStatus();
|
|
}
|
|
|
|
for (const MergeTreeMutationStatus & status : statuses)
|
|
{
|
|
Array block_partition_ids;
|
|
block_partition_ids.reserve(status.block_numbers.size());
|
|
Array block_numbers;
|
|
block_numbers.reserve(status.block_numbers.size());
|
|
for (const auto & pair : status.block_numbers)
|
|
{
|
|
block_partition_ids.emplace_back(pair.first);
|
|
block_numbers.emplace_back(pair.second);
|
|
}
|
|
Array parts_to_do_names;
|
|
parts_to_do_names.reserve(status.parts_to_do_names.size());
|
|
for (const String & part_name : status.parts_to_do_names)
|
|
parts_to_do_names.emplace_back(part_name);
|
|
|
|
size_t col_num = 0;
|
|
res_columns[col_num++]->insert(database);
|
|
res_columns[col_num++]->insert(table);
|
|
|
|
res_columns[col_num++]->insert(status.id);
|
|
res_columns[col_num++]->insert(status.command);
|
|
res_columns[col_num++]->insert(UInt64(status.create_time));
|
|
res_columns[col_num++]->insert(block_partition_ids);
|
|
res_columns[col_num++]->insert(block_numbers);
|
|
res_columns[col_num++]->insert(parts_to_do_names);
|
|
res_columns[col_num++]->insert(parts_to_do_names.size());
|
|
res_columns[col_num++]->insert(status.is_done);
|
|
res_columns[col_num++]->insert(status.latest_failed_part);
|
|
res_columns[col_num++]->insert(UInt64(status.latest_fail_time));
|
|
res_columns[col_num++]->insert(status.latest_fail_reason);
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|