2019-04-04 13:01:48 +00:00
# include <Storages/MergeTree/ReplicatedMergeTreeTableMetadata.h>
# include <Storages/MergeTree/MergeTreePartInfo.h>
# include <Common/ZooKeeper/ZooKeeper.h>
2019-07-19 00:39:22 +00:00
# include <boost/algorithm/string.hpp>
2019-04-04 13:01:48 +00:00
# include <boost/program_options.hpp>
# include <IO/ReadHelpers.h>
# include <unordered_map>
# include <cmath>
2019-07-19 00:39:22 +00:00
std : : vector < std : : string > getAllShards ( zkutil : : ZooKeeper & zk , const std : : string & root )
{
return zk . getChildren ( root ) ;
}
std : : vector < std : : string > removeNotExistingShards ( zkutil : : ZooKeeper & zk , const std : : string & root , const std : : vector < std : : string > & shards )
{
auto existing_shards = getAllShards ( zk , root ) ;
std : : vector < std : : string > filtered_shards ;
filtered_shards . reserve ( shards . size ( ) ) ;
for ( const auto & shard : shards )
if ( std : : find ( existing_shards . begin ( ) , existing_shards . end ( ) , shard ) = = existing_shards . end ( ) )
std : : cerr < < " Shard " < < shard < < " not found. " < < std : : endl ;
else
filtered_shards . emplace_back ( shard ) ;
return filtered_shards ;
}
std : : vector < std : : string > getAllTables ( zkutil : : ZooKeeper & zk , const std : : string & root , const std : : string & shard )
{
return zk . getChildren ( root + " / " + shard ) ;
}
std : : vector < std : : string > removeNotExistingTables ( zkutil : : ZooKeeper & zk , const std : : string & root , const std : : string & shard , const std : : vector < std : : string > & tables )
{
auto existing_tables = getAllTables ( zk , root , shard ) ;
std : : vector < std : : string > filtered_tables ;
filtered_tables . reserve ( tables . size ( ) ) ;
for ( const auto & table : tables )
if ( std : : find ( existing_tables . begin ( ) , existing_tables . end ( ) , table ) = = existing_tables . end ( ) )
std : : cerr < < " \t Table " < < table < < " not found on shard " < < shard < < " . " < < std : : endl ;
else
filtered_tables . emplace_back ( table ) ;
return filtered_tables ;
}
2019-07-19 09:19:47 +00:00
Int64 getMaxBlockNumberForPartition ( zkutil : : ZooKeeper & zk ,
2019-04-04 13:01:48 +00:00
const std : : string & replica_path ,
const std : : string & partition_name ,
const DB : : MergeTreeDataFormatVersion & format_version )
{
auto replicas_path = replica_path + " /replicas " ;
auto replica_hosts = zk . getChildren ( replicas_path ) ;
2019-07-19 09:19:47 +00:00
Int64 max_block_num = 0 ;
2019-04-04 13:01:48 +00:00
for ( const auto & replica_host : replica_hosts )
{
auto parts = zk . getChildren ( replicas_path + " / " + replica_host + " /parts " ) ;
for ( const auto & part : parts )
{
2019-04-04 13:03:20 +00:00
try
{
2019-04-04 13:01:48 +00:00
auto info = DB : : MergeTreePartInfo : : fromPartName ( part , format_version ) ;
if ( info . partition_id = = partition_name )
2019-07-19 09:19:47 +00:00
max_block_num = std : : max < Int64 > ( info . max_block , max_block_num ) ;
2019-04-04 13:01:48 +00:00
}
catch ( const DB : : Exception & ex )
{
2019-07-19 00:39:22 +00:00
std : : cerr < < ex . displayText ( ) < < " , Part " < < part < < " skipped. " < < std : : endl ;
2019-04-04 13:01:48 +00:00
}
}
}
return max_block_num ;
}
2019-07-19 00:39:22 +00:00
2019-07-19 09:19:47 +00:00
Int64 getCurrentBlockNumberForPartition ( zkutil : : ZooKeeper & zk , const std : : string & part_path )
2019-07-19 00:39:22 +00:00
{
Coordination : : Stat stat ;
zk . get ( part_path , & stat ) ;
/// References:
/// https://stackoverflow.com/a/10347910
/// https://bowenli86.github.io/2016/07/07/distributed%20system/zookeeper/How-does-ZooKeeper-s-persistent-sequential-id-work/
return ( stat . cversion + stat . numChildren ) / 2 ;
}
2019-07-19 09:19:47 +00:00
std : : unordered_map < std : : string , Int64 > getPartitionsNeedAdjustingBlockNumbers (
2019-07-19 00:39:22 +00:00
zkutil : : ZooKeeper & zk , const std : : string & root , const std : : vector < std : : string > & shards , const std : : vector < std : : string > & tables )
2019-04-04 13:01:48 +00:00
{
2019-07-19 09:19:47 +00:00
std : : unordered_map < std : : string , Int64 > result ;
2019-07-19 00:39:22 +00:00
std : : vector < std : : string > use_shards = shards . empty ( ) ? getAllShards ( zk , root ) : removeNotExistingShards ( zk , root , shards ) ;
for ( const auto & shard : use_shards )
2019-04-04 13:01:48 +00:00
{
2019-07-19 00:39:22 +00:00
std : : cout < < " Shard: " < < shard < < std : : endl ;
std : : vector < std : : string > use_tables = tables . empty ( ) ? getAllTables ( zk , root , shard ) : removeNotExistingTables ( zk , root , shard , tables ) ;
2020-05-18 01:19:50 +00:00
for ( const auto & table : use_tables )
2019-04-04 13:01:48 +00:00
{
2019-07-19 00:39:22 +00:00
std : : cout < < " \t Table: " < < table < < std : : endl ;
std : : string table_path = root + " / " + shard + " / " + table ;
2019-04-04 13:01:48 +00:00
std : : string blocks_path = table_path + " /block_numbers " ;
2019-07-19 00:39:22 +00:00
std : : vector < std : : string > partitions ;
DB : : MergeTreeDataFormatVersion format_version ;
try
{
format_version = DB : : ReplicatedMergeTreeTableMetadata : : parse ( zk . get ( table_path + " /metadata " ) ) . data_format_version ;
partitions = zk . getChildren ( blocks_path ) ;
}
catch ( const DB : : Exception & ex )
{
std : : cerr < < ex . displayText ( ) < < " , table " < < table < < " skipped. " < < std : : endl ;
continue ;
}
2020-05-18 01:19:50 +00:00
for ( const auto & partition : partitions )
2019-04-04 13:01:48 +00:00
{
2019-07-19 00:39:22 +00:00
try
2019-04-04 13:01:48 +00:00
{
std : : string part_path = blocks_path + " / " + partition ;
2019-07-19 09:19:47 +00:00
Int64 partition_max_block = getMaxBlockNumberForPartition ( zk , table_path , partition , format_version ) ;
Int64 current_block_number = getCurrentBlockNumberForPartition ( zk , part_path ) ;
if ( current_block_number < partition_max_block + 1 )
2019-07-19 00:39:22 +00:00
{
std : : cout < < " \t \t Partition: " < < partition < < " : current block_number: " < < current_block_number
< < " , max block number: " < < partition_max_block < < " . Adjusting is required. " < < std : : endl ;
result . emplace ( part_path , partition_max_block ) ;
}
}
catch ( const DB : : Exception & ex )
{
std : : cerr < < ex . displayText ( ) < < " , partition " < < partition < < " skipped. " < < std : : endl ;
2019-04-04 13:01:48 +00:00
}
}
}
}
return result ;
}
2019-07-19 09:19:47 +00:00
void setCurrentBlockNumber ( zkutil : : ZooKeeper & zk , const std : : string & path , Int64 new_current_block_number )
2019-04-04 13:01:48 +00:00
{
2019-07-19 09:19:47 +00:00
Int64 current_block_number = getCurrentBlockNumberForPartition ( zk , path ) ;
2019-04-04 13:01:48 +00:00
2019-07-19 09:19:47 +00:00
auto create_ephemeral_nodes = [ & ] ( size_t count )
2019-04-04 13:01:48 +00:00
{
2019-07-19 09:19:47 +00:00
std : : string block_prefix = path + " /block- " ;
Coordination : : Requests requests ;
requests . reserve ( count ) ;
for ( size_t i = 0 ; i ! = count ; + + i )
requests . emplace_back ( zkutil : : makeCreateRequest ( block_prefix , " " , zkutil : : CreateMode : : EphemeralSequential ) ) ;
auto responses = zk . multi ( requests ) ;
std : : vector < std : : string > paths_created ;
paths_created . reserve ( responses . size ( ) ) ;
for ( const auto & response : responses )
2019-04-04 13:01:48 +00:00
{
2019-07-19 09:19:47 +00:00
const auto * create_response = dynamic_cast < Coordination : : CreateResponse * > ( response . get ( ) ) ;
if ( ! create_response )
{
std : : cerr < < " \t Could not create ephemeral node " < < block_prefix < < std : : endl ;
return false ;
}
paths_created . emplace_back ( create_response - > path_created ) ;
2019-04-04 13:01:48 +00:00
}
2019-07-19 00:39:22 +00:00
2019-07-19 09:19:47 +00:00
std : : sort ( paths_created . begin ( ) , paths_created . end ( ) ) ;
for ( const auto & path_created : paths_created )
{
Int64 number = DB : : parse < Int64 > ( path_created . c_str ( ) + block_prefix . size ( ) , path_created . size ( ) - block_prefix . size ( ) ) ;
if ( number ! = current_block_number )
{
char suffix [ 11 ] = " " ;
2019-09-20 17:34:59 +00:00
sprintf ( suffix , " %010lld " , current_block_number ) ;
2019-07-19 09:19:47 +00:00
std : : string expected_path = block_prefix + suffix ;
std : : cerr < < " \t " < < path_created < < " : Ephemeral node has been created with an unexpected path (expected something like "
< < expected_path < < " ). " < < std : : endl ;
return false ;
}
std : : cout < < " \t " < < path_created < < std : : endl ;
+ + current_block_number ;
}
return true ;
} ;
if ( current_block_number > = new_current_block_number )
return ;
std : : cout < < " Creating ephemeral sequential nodes: " < < std : : endl ;
create_ephemeral_nodes ( 1 ) ; /// Firstly try to create just a single node.
/// Create other nodes in batches of 50 nodes.
2020-05-18 08:08:55 +00:00
while ( current_block_number + 50 < = new_current_block_number ) // NOLINT: clang-tidy thinks that the loop is infinite
2019-07-19 09:19:47 +00:00
create_ephemeral_nodes ( 50 ) ;
create_ephemeral_nodes ( new_current_block_number - current_block_number ) ;
2019-04-04 13:01:48 +00:00
}
2019-07-19 00:39:22 +00:00
2019-04-04 13:01:48 +00:00
int main ( int argc , char * * argv )
try
{
2019-07-19 00:39:22 +00:00
/// Parse the command line.
namespace po = boost : : program_options ;
po : : options_description desc ( " Allowed options " ) ;
2019-04-04 13:01:48 +00:00
desc . add_options ( )
2019-07-19 00:39:22 +00:00
( " help,h " , " show help " )
2022-04-15 22:24:58 +00:00
( " zookeeper,z " , po : : value < std : : string > ( ) , " Addresses of ZooKeeper instances, comma-separated. Example: example01e.clickhouse.com:2181 " )
2019-07-19 00:39:22 +00:00
( " path,p " , po : : value < std : : string > ( ) , " [optional] Path of replica queue to insert node (without trailing slash). By default it's /clickhouse/tables " )
( " shard,s " , po : : value < std : : string > ( ) , " [optional] Shards to process, comma-separated. If not specified then the utility will process all the shards. " )
( " table,t " , po : : value < std : : string > ( ) , " [optional] Tables to process, comma-separated. If not specified then the utility will process all the tables. " )
( " dry-run " , " [optional] Specify if you want this utility just to analyze block numbers without any changes. " ) ;
2019-04-04 13:01:48 +00:00
2019-07-19 00:39:22 +00:00
po : : variables_map options ;
po : : store ( po : : parse_command_line ( argc , argv , desc ) , options ) ;
2019-04-04 13:01:48 +00:00
2019-07-19 00:39:22 +00:00
auto show_usage = [ & ]
2019-04-04 13:01:48 +00:00
{
2019-07-19 00:39:22 +00:00
std : : cout < < " Usage: " < < std : : endl ;
std : : cout < < " " < < argv [ 0 ] < < " [options] " < < std : : endl ;
2019-04-04 13:01:48 +00:00
std : : cout < < desc < < std : : endl ;
2019-07-19 00:39:22 +00:00
} ;
if ( options . count ( " help " ) | | ( argc = = 1 ) )
{
std : : cout < < " This utility adjusts the /block_numbers zookeeper nodes to the correct block number in partition. " < < std : : endl ;
std : : cout < < " It might be useful when incorrect block numbers stored in zookeeper don't allow you to insert data into a table or drop/detach a partition. " < < std : : endl ;
show_usage ( ) ;
return 0 ;
}
if ( ! options . count ( " zookeeper " ) )
{
std : : cerr < < " Option --zookeeper should be set. " < < std : : endl ;
show_usage ( ) ;
2019-04-04 13:01:48 +00:00
return 1 ;
}
2019-07-19 00:39:22 +00:00
std : : string root = options . count ( " path " ) ? options . at ( " path " ) . as < std : : string > ( ) : " /clickhouse/tables " ;
std : : vector < std : : string > shards , tables ;
if ( options . count ( " shard " ) )
boost : : split ( shards , options . at ( " shard " ) . as < std : : string > ( ) , boost : : algorithm : : is_any_of ( " , " ) ) ;
if ( options . count ( " table " ) )
boost : : split ( tables , options . at ( " table " ) . as < std : : string > ( ) , boost : : algorithm : : is_any_of ( " , " ) ) ;
2019-04-04 13:01:48 +00:00
2019-07-19 00:39:22 +00:00
/// Check if the adjusting of the block numbers is required.
std : : cout < < " Checking if adjusting of the block numbers is required: " < < std : : endl ;
zkutil : : ZooKeeper zookeeper ( options . at ( " zookeeper " ) . as < std : : string > ( ) ) ;
auto part_paths_with_max_block_numbers = getPartitionsNeedAdjustingBlockNumbers ( zookeeper , root , shards , tables ) ;
2019-04-04 13:01:48 +00:00
2019-07-19 00:39:22 +00:00
if ( part_paths_with_max_block_numbers . empty ( ) )
2019-04-04 13:01:48 +00:00
{
2019-07-19 00:39:22 +00:00
std : : cout < < " No adjusting required. " < < std : : endl ;
return 0 ;
2019-04-04 13:01:48 +00:00
}
2019-07-19 00:39:22 +00:00
2019-07-19 09:19:47 +00:00
std : : cout < < " Required adjusting of " < < part_paths_with_max_block_numbers . size ( ) < < " block numbers. " < < std : : endl ;
2019-07-19 00:39:22 +00:00
/// Adjust the block numbers.
if ( options . count ( " dry-run " ) )
2019-07-19 09:19:47 +00:00
{
std : : cout < < " This is a dry-run, exiting. " < < std : : endl ;
2019-07-19 00:39:22 +00:00
return 0 ;
2019-07-19 09:19:47 +00:00
}
2019-07-19 00:39:22 +00:00
std : : cout < < std : : endl < < " Adjusting the block numbers: " < < std : : endl ;
for ( const auto & [ part_path , max_block_number ] : part_paths_with_max_block_numbers )
setCurrentBlockNumber ( zookeeper , part_path , max_block_number + 1 ) ;
2019-04-04 13:01:48 +00:00
return 0 ;
}
2020-05-09 22:59:34 +00:00
catch ( . . . )
2019-04-04 13:01:48 +00:00
{
std : : cerr < < DB : : getCurrentExceptionMessage ( true ) < < ' \n ' ;
throw ;
}