forked from PaddlePaddle/Paddle
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
move graph walkers to paddle/common (PaddlePaddle#63645)
* move graph walkers to paddle/common and fix reference * fix style * give up useless walker move * give up useless walker move and delete file
- Loading branch information
1 parent
f1a411e
commit 18f526e
Showing
6 changed files
with
249 additions
and
175 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,70 @@ | ||
| // Copyright (c) 2023 CINN Authors. All Rights Reserved. | ||
| // | ||
| // Licensed under the Apache License, Version 2.0 (the "License"); | ||
| // you may not use this file except in compliance with the License. | ||
| // You may obtain a copy of the License at | ||
| // | ||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
| // | ||
| // Unless required by applicable law or agreed to in writing, software | ||
| // distributed under the License is distributed on an "AS IS" BASIS, | ||
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| #pragma once | ||
|
|
||
| #include <array> | ||
| #include <functional> | ||
| #include <queue> | ||
| #include <unordered_set> | ||
|
|
||
| namespace common { | ||
|
|
||
| // breadth-first search visitor | ||
| template <typename NodeType> | ||
| class BfsWalker final { | ||
| public: | ||
| BfsWalker(const BfsWalker&) = delete; | ||
| BfsWalker(BfsWalker&&) = delete; | ||
|
|
||
| using NodeHandlerType = std::function<void(NodeType)>; | ||
| using NodesVisitorType = | ||
| std::function<void(NodeType, const NodeHandlerType&)>; | ||
|
|
||
| BfsWalker(const NodesVisitorType& VisitNextNodes) | ||
| : VisitNextNodes_(VisitNextNodes) {} | ||
|
|
||
| void operator()(NodeType node, const NodeHandlerType& NodeHandler) const { | ||
| std::array<NodeType, 1> nodes{node}; | ||
| (*this)(nodes.begin(), nodes.end(), NodeHandler); | ||
| } | ||
|
|
||
| template <typename NodeIt> | ||
| void operator()(NodeIt begin, | ||
| NodeIt end, | ||
| const NodeHandlerType& NodeHandler) const { | ||
| std::queue<NodeType> node_queue; | ||
| std::unordered_set<NodeType> queued_nodes; | ||
| const auto& TryEnqueueNode = [&](NodeType node) { | ||
| if (queued_nodes.count(node) == 0) { | ||
| node_queue.push(node); | ||
| queued_nodes.insert(node); | ||
| } | ||
| }; | ||
| for (NodeIt iter = begin; iter != end; ++iter) { | ||
| TryEnqueueNode(*iter); | ||
| } | ||
| while (!node_queue.empty()) { | ||
| NodeType node = node_queue.front(); | ||
| node_queue.pop(); | ||
| NodeHandler(node); | ||
| VisitNextNodes_(node, TryEnqueueNode); | ||
| } | ||
| } | ||
|
|
||
| private: | ||
| NodesVisitorType VisitNextNodes_; | ||
| }; | ||
|
|
||
| } // namespace common |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,93 @@ | ||
| // Copyright (c) 2023 CINN Authors. All Rights Reserved. | ||
| // | ||
| // Licensed under the Apache License, Version 2.0 (the "License"); | ||
| // you may not use this file except in compliance with the License. | ||
| // You may obtain a copy of the License at | ||
| // | ||
| // http://www.apache.org/licenses/LICENSE-2.0 | ||
| // | ||
| // Unless required by applicable law or agreed to in writing, software | ||
| // distributed under the License is distributed on an "AS IS" BASIS, | ||
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| // See the License for the specific language governing permissions and | ||
| // limitations under the License. | ||
|
|
||
| #pragma once | ||
|
|
||
| #include <array> | ||
| #include <functional> | ||
| #include <iostream> | ||
| #include <queue> | ||
| #include <stack> | ||
| #include <unordered_set> | ||
|
|
||
| namespace common { | ||
|
|
||
| // depth-first search visitor | ||
| template <typename NodeType> | ||
| class DfsWalker final { | ||
| public: | ||
| DfsWalker(const DfsWalker&) = delete; | ||
| DfsWalker(DfsWalker&&) = delete; | ||
|
|
||
| using NodeHandlerType = std::function<void(NodeType)>; | ||
| using NodesVisitorType = | ||
| std::function<void(NodeType, const NodeHandlerType&)>; | ||
|
|
||
| DfsWalker(const NodesVisitorType& VisitNextNodes) | ||
| : VisitNextNodes_(VisitNextNodes) {} | ||
|
|
||
| void operator()(NodeType node, const NodeHandlerType& NodeHandler) const { | ||
| std::array<NodeType, 1> nodes{node}; | ||
| (*this)(nodes.begin(), nodes.end(), NodeHandler, [&](NodeType) {}); | ||
| } | ||
|
|
||
| template <typename NodeIt> | ||
| void operator()(NodeIt begin, | ||
| NodeIt end, | ||
| const NodeHandlerType& NodeHandler) const { | ||
| (*this)(begin, end, NodeHandler, [&](NodeType) {}); | ||
| } | ||
|
|
||
| // https://en.wikipedia.org/wiki/Depth-first_search | ||
| template <typename NodeIt> | ||
| void operator()(NodeIt begin, | ||
| NodeIt end, | ||
| const NodeHandlerType& NodeHandlerOnPush, | ||
| const NodeHandlerType& NodeHandlerOnPop) const { | ||
| std::unordered_set<NodeType> discovered; | ||
| struct Neighbours { | ||
| NodeType producer; | ||
| std::queue<NodeType> consumers; | ||
| }; | ||
| std::stack<Neighbours> stack; | ||
| const auto& TryPush = [&](NodeType node) { | ||
| if (discovered.count(node) == 0) { | ||
| discovered.insert(node); | ||
| NodeHandlerOnPush(node); | ||
| stack.push(Neighbours{.producer = node}); | ||
| VisitNextNodes_(node, [&](NodeType next_node) { | ||
| stack.top().consumers.push(next_node); | ||
| }); | ||
| } | ||
| }; | ||
| for (NodeIt node_iter = begin; node_iter != end; ++node_iter) { | ||
| TryPush(*node_iter); | ||
| while (!stack.empty()) { | ||
| auto* neighbours = &stack.top(); | ||
| if (neighbours->consumers.empty()) { | ||
| NodeHandlerOnPop(neighbours->producer); | ||
| stack.pop(); | ||
| } else { | ||
| TryPush(neighbours->consumers.front()); | ||
| neighbours->consumers.pop(); | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| private: | ||
| NodesVisitorType VisitNextNodes_; | ||
| }; | ||
|
|
||
| } // namespace common |
Oops, something went wrong.