/* 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/op_desc.h" #include "paddle/fluid/framework/var_desc.h" #include "paddle/fluid/platform/macros.h" namespace paddle { namespace framework { namespace ir { // Node should only created by Graph::CreateXXXNode(). // 1. Every Node should be part of a graph. No dangling Node exists. // 2. Node only contains members necessary for building graph structure. // It doesn't contain other unrelated members, such as device, etc. // // Sometimes, for specific usages, Node needs to have additional members, // such as device_placement, version in order to be executed. It is suggested // to use composition pattern. // // class RunnableOp { // RunnableOp(ir::Node* n) : n_(n) { n_.WrappedBy(this); } // // int any_thing_; // } // // RunnableOp is owned by the ir::Node that composes it. In other words. // ir::Node will be responsible for deleting RunnableOp, say, when ir::Node // is deleted from the graph. class Node { public: virtual ~Node() { if (!wrapper_.empty()) { VLOG(4) << "ir::Node deleting a wrapper node " << Name(); wrapper_deleter_(); } } enum class Type { kOperation, kVariable }; static constexpr char kControlDepVarName[] = "__control_var"; Type NodeType() const { return type_; } std::string Name() const { return name_; } VarDesc* Var() { PADDLE_ENFORCE(IsVar()); return var_desc_.get(); } OpDesc* Op() const { PADDLE_ENFORCE(IsOp()); return op_desc_.get(); } // Set the `wrapper` that wraps the Node. `wrapper` is owned by Node. template void WrappedBy(T* wrapper) { if (!wrapper_.empty()) { wrapper_deleter_(); } wrapper_ = wrapper; wrapper_deleter_ = [wrapper]() { delete wrapper; }; wrapper_type_ = std::type_index(typeid(T)); } // Return a reference to the `wrapper`. template T& Wrapper() { return *boost::any_cast(wrapper_); } // Test if the Node is wrapped by type T. template bool IsWrappedBy() { return std::type_index(typeid(T)) == wrapper_type_; } // Please don't use this API! int id() const { return id_; } bool IsOp() const { return type_ == Type::kOperation; } bool IsVar() const { return type_ == Type::kVariable; } bool IsCtrlVar() const { return type_ == Type::kVariable && Name().find(ir::Node::kControlDepVarName) != std::string::npos; } std::vector inputs; std::vector outputs; protected: const std::string name_; std::unique_ptr var_desc_; std::unique_ptr op_desc_; Type type_; int id_; private: friend class Graph; friend std::unique_ptr CreateNodeForTest(const std::string& name, Node::Type type); explicit Node(const std::string& name, Type type) : name_(name), var_desc_(nullptr), op_desc_(nullptr), type_(type), id_(count_++) {} explicit Node(VarDesc* var_desc) : name_(var_desc->Name()), var_desc_(new VarDesc(*var_desc)), op_desc_(nullptr), type_(Type::kVariable), id_(count_++) {} explicit Node(OpDesc* op_desc) : name_(op_desc->Type()), var_desc_(nullptr), op_desc_(new OpDesc(*op_desc, op_desc->Block())), type_(Type::kOperation), id_(count_++) {} Node() = delete; static int count_; // Please don't use this API or make this public. static void ResetId() { count_ = 0; } boost::any wrapper_; std::function wrapper_deleter_; std::type_index wrapper_type_ = std::type_index(typeid(void)); DISABLE_COPY_AND_ASSIGN(Node); }; std::unique_ptr CreateNodeForTest(const std::string& name, Node::Type type); } // namespace ir } // namespace framework } // namespace paddle