node.h

Go to the documentation of this file.

/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you 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.
 */
 
#ifndef NNVM_NODE_H_
#define NNVM_NODE_H_
 
#include <memory>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
 
#include "base.h"
#include "c_api.h"
#include "op.h"
 
namespace nnvm {
 
// Forward declare node.
class Node;
class Symbol;
 
using ObjectPtr = std::shared_ptr<Node>;
 
struct NodeEntry {
  NodeEntry(ObjectPtr node, uint32_t index, uint32_t version)
      : node(std::move(node)), index(index), version(version) {}
 
  explicit NodeEntry(ObjectPtr node) : node(std::move(node)), index(), version() {}
 
  NodeEntry() : node(nullptr), index(), version() {}
 
  ObjectPtr node;
  uint32_t index;
  uint32_t version;
};
 
struct NodeEntryHash {
  size_t operator()(const NodeEntry& e) const {
    return std::hash<Node*>()(e.node.get()) ^ (std::hash<size_t>()(e.index) << 1 >> 1) ^
           (std::hash<size_t>()(e.version) << 1);
  }
};
 
struct NodeEntryEqual {
  size_t operator()(const NodeEntry& a, const NodeEntry& b) const {
    return (a.node.get() == b.node.get()) && (a.index == b.index) && (a.version == b.version);
  }
};
 
template <typename ValueType>
using NodeEntryMap = std::unordered_map<NodeEntry, ValueType, NodeEntryHash, NodeEntryEqual>;
 
struct NodeAttrs {
  const Op* op{nullptr};
  std::string name;
  std::unordered_map<std::string, std::string> dict;
  any parsed;
  std::vector<std::shared_ptr<Symbol> > subgraphs;
};
 
class NNVM_DLL Node {
 public:
  Node() = default;
  Node(const Op* op, const std::string& name) {
    this->attrs.op = op;
    this->attrs.name = name;
  }
  NodeAttrs attrs;
  std::vector<NodeEntry> inputs;
  std::vector<ObjectPtr> control_deps;
  any info;
  ~Node();
  inline const Op* op() const;
  inline bool is_variable() const;
  inline uint32_t num_outputs() const;
  inline uint32_t num_inputs() const;
  template <class... Args>
  static ObjectPtr Create(Args&&... args) {
    return std::make_shared<Node>(std::forward<Args>(args)...);
  }
};
 
inline NodeEntry MakeNode(const char* op_name, std::string node_name, std::vector<NodeEntry> inputs,
                          std::unordered_map<std::string, std::string> attrs =
                              std::unordered_map<std::string, std::string>()) {
  ObjectPtr p = Node::Create();
  p->attrs.op = nnvm::Op::Get(op_name);
  p->attrs.name = std::move(node_name);
  p->attrs.dict = attrs;
  if (p->attrs.op->attr_parser) {
    p->attrs.op->attr_parser(&(p->attrs));
  }
  p->inputs = std::move(inputs);
  return NodeEntry(p, 0, 0);
}
 
// implementation of functions.
inline const Op* Node::op() const { return this->attrs.op; }
 
inline bool Node::is_variable() const { return this->op() == nullptr; }
 
inline uint32_t Node::num_outputs() const {
  if (is_variable()) return 1;
  if (this->op()->get_num_outputs == nullptr) {
    return this->op()->num_outputs;
  } else {
    return this->op()->get_num_outputs(this->attrs);
  }
}
 
inline uint32_t Node::num_inputs() const {
  if (is_variable()) return 1;
  if (this->op()->get_num_inputs == nullptr) {
    return this->op()->num_inputs;
  } else {
    return this->op()->get_num_inputs(this->attrs);
  }
}
 
}  // namespace nnvm
 
#endif  // NNVM_NODE_H_