// Copyright (c) 2018 PaddlePaddle 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 #include #include #include #include "paddle/fluid/framework/details/op_handle_base.h" namespace paddle { namespace framework { namespace details { class OpGraphView { public: explicit OpGraphView(const std::vector &ops); std::unordered_set AllOps() const; const std::unordered_set &PendingOps(OpHandleBase *op) const; bool HasOp(OpHandleBase *op) const; // Use a visitor to visit all pending ops of op // Stop when callback returns false template bool VisitAllPendingOps(OpHandleBase *op, Callback &&callback) const; private: void Build(const std::vector &ops); void EnforceHasOp(OpHandleBase *op) const; std::unordered_map> preceding_ops_; std::unordered_map> pending_ops_; }; template bool OpGraphView::VisitAllPendingOps(OpHandleBase *op, Callback &&callback) const { EnforceHasOp(op); std::unordered_set visited; std::queue q; q.push(op); do { op = q.front(); q.pop(); for (auto &pending_op : pending_ops_.at(op)) { if (visited.count(pending_op) == 0) { visited.insert(pending_op); if (!callback(pending_op)) { return false; } } } } while (!q.empty()); return true; } } // namespace details } // namespace framework } // namespace paddle