mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-18 13:42:02 +00:00
58 lines
1.9 KiB
C++
58 lines
1.9 KiB
C++
#pragma once
|
|
|
|
#include <zkutil/Common.h>
|
|
#include <string>
|
|
#include <functional>
|
|
|
|
namespace zkutil
|
|
{
|
|
|
|
/// Implementation of a distributed single barrier for ZooKeeper.
|
|
/// Consider a barrier with N slots. A node that wants to enter this barrier
|
|
/// creates a uniquely identified token and puts it in a free slot, then waits
|
|
/// until all of the N slots have been taken.
|
|
/// This implementation allows entering a barrier more than once. This is done
|
|
/// by prefixing tokens with a tag which is an integer number representing the
|
|
/// number of times this barrier has already been crossed. When a node attempts
|
|
/// to puts its token into a slot, first it looks for lingering obsolete tokens,
|
|
/// then, if found, deletes them. If a node has put its token into the last free
|
|
/// slot, it increments the tag value.
|
|
class SingleBarrier final
|
|
{
|
|
public:
|
|
using CancellationHook = std::function<void()>;
|
|
|
|
public:
|
|
SingleBarrier(GetZooKeeper get_zookeeper_, const std::string & path_, size_t counter_);
|
|
|
|
SingleBarrier(const SingleBarrier &) = delete;
|
|
SingleBarrier & operator=(const SingleBarrier &) = delete;
|
|
|
|
SingleBarrier(SingleBarrier &&) = default;
|
|
SingleBarrier & operator=(SingleBarrier &&) = default;
|
|
|
|
/// Register a function that cancels barrier operations if requested.
|
|
void setCancellationHook(CancellationHook cancellation_hook_);
|
|
|
|
void enter(uint64_t timeout = 0);
|
|
|
|
private:
|
|
/// Cancel any ongoing operation if requested. Additionally perform cleanup.
|
|
void abortIfRequested();
|
|
|
|
private:
|
|
/// Helper that acquires an alive ZooKeeper session.
|
|
GetZooKeeper get_zookeeper;
|
|
EventPtr event = std::make_shared<Poco::Event>();
|
|
/// Function that cancels barrier operations if requested.
|
|
CancellationHook cancellation_hook;
|
|
/// Path to the barrier storage.
|
|
std::string path;
|
|
/// Token created by the node attempting to enter the barrier.
|
|
std::string token;
|
|
/// Number of available slots.
|
|
size_t counter;
|
|
};
|
|
|
|
}
|