thevar1able/ClickHouse
1
0
Fork 0
mirror of https://github.com/ClickHouse/ClickHouse.git synced 2024-09-19 16:20:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

move code

Browse Source
This commit is contained in:
Mikhail Artemenko 2024-09-06 08:34:59 +00:00
parent aa2721f7e4
commit 231a7c97cc
1 changed files with 14 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
src/Coordination/KeeperStorage.cpp
View File

@ -1654,6 +1654,13 @@ private:
uint32_t nodes_observed = 1; /// root node uint32_t nodes_observed = 1; /// root node
std::unordered_map<uint32_t, std::vector<typename Storage::Delta>> by_level_deltas; std::unordered_map<uint32_t, std::vector<typename Storage::Delta>> by_level_deltas;
struct Step
{
String path;
std::variant<SNode, const SNode *> node;
uint32_t level;
};
public: public:
ToDeleteTreeCollector(Storage & storage_, int64_t zxid_, uint32_t limit_) ToDeleteTreeCollector(Storage & storage_, int64_t zxid_, uint32_t limit_)
: storage(storage_) : storage(storage_)
@ -1665,11 +1672,12 @@ private:
bool collect(StringRef root_path, const SNode & root_node) bool collect(StringRef root_path, const SNode & root_node)
{ {
std::deque<Step> steps; std::deque<Step> steps;
steps.push_back(Step{root_path.toString(), &root_node, 0});
if (observeNode(root_node)) if (checkLimits(root_node))
return true; return true;
steps.push_back(Step{root_path.toString(), &root_node, 0});
while (!steps.empty()) while (!steps.empty())
{ {
Step step = std::move(steps.front()); Step step = std::move(steps.front());
@ -1708,13 +1716,6 @@ private:
} }
private: private:
struct Step
{
String path;
std::variant<SNode, const SNode *> node;
uint32_t level;
};
bool visitRocksDBNode(std::deque<Step> & steps, StringRef root_path, uint32_t level) bool visitRocksDBNode(std::deque<Step> & steps, StringRef root_path, uint32_t level)
{ {
if constexpr (Storage::use_rocksdb) if constexpr (Storage::use_rocksdb)
@ -1724,7 +1725,7 @@ private:
for (auto && [child_name, node] : children) for (auto && [child_name, node] : children)
{ {
if (observeNode(node)) if (checkLimits(node))
return true; return true;
auto child_path = (root_fs_path / child_name).generic_string(); auto child_path = (root_fs_path / child_name).generic_string();
@ -1754,7 +1755,7 @@ private:
auto child_it = storage.container.find(child_path); auto child_it = storage.container.find(child_path);
chassert(child_it != storage.container.end()); chassert(child_it != storage.container.end());
if (observeNode(child_it->value)) if (checkLimits(child_it->value))
return true; return true;
steps.push_back(Step{std::move(child_path), child_it->value, level + 1}); steps.push_back(Step{std::move(child_path), child_it->value, level + 1});
@ -1777,7 +1778,7 @@ private:
const String & path = it->first; const String & path = it->first;
const SNode & node = *it->second.node; const SNode & node = *it->second.node;
if (observeNode(node)) if (checkLimits(node))
return true; return true;
steps.push_back(Step{path, &node, level + 1}); steps.push_back(Step{path, &node, level + 1});
@ -1806,7 +1807,7 @@ private:
by_level_deltas[level].emplace_back(root_path.toString(), zxid, typename Storage::RemoveNodeDelta{root_node.version, root_node.ephemeralOwner()}); by_level_deltas[level].emplace_back(root_path.toString(), zxid, typename Storage::RemoveNodeDelta{root_node.version, root_node.ephemeralOwner()});
} }
bool observeNode(const SNode & node) bool checkLimits(const SNode & node)
{ {
nodes_observed += node.numChildren(); nodes_observed += node.numChildren();
return nodes_observed > limit; return nodes_observed > limit;