Model.h

Go to the documentation of this file.

/*
 * Copyright (c) 2020 Samsung Electronics Co., Ltd. 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.
 */
 
#ifndef __ONERT_IR_MODEL_H__
#define __ONERT_IR_MODEL_H__
 
#include <memory>
#include <unordered_map>
 
#include "ir/IGraph.h"
#include "ir/Index.h"
#include "util/ObjectManager.h"
 
namespace onert::backend::custom
{
class IKernelBuilder;
} // namespace onert::backend::custom
 
namespace onert::ir
{
 
class Model
{
public:
  Model() = default;
  Model(const Model &obj) = default;
  Model(Model &&) = default;
  Model &operator=(const Model &) = default;
  Model &operator=(Model &&) = default;
  ~Model() = default;
 
  void push(SubgraphIndex index, const std::shared_ptr<IGraph> &subg) { _subgraphs[index] = subg; }
 
  void remove(const SubgraphIndex &index) { _subgraphs.erase(index); }
 
  const std::shared_ptr<IGraph> &at(const SubgraphIndex &index) const
  {
    return _subgraphs.at(index);
  }
  const std::shared_ptr<IGraph> &at(const SubgraphIndex &index) const {…}
  std::shared_ptr<IGraph> &at(const SubgraphIndex &index) { return _subgraphs.at(index); }
 
  bool exist(const SubgraphIndex &index) const
  {
    auto it = _subgraphs.find(index);
    return it != _subgraphs.end();
  }
  bool exist(const SubgraphIndex &index) const {…}
 
  void iterate(const std::function<void(const SubgraphIndex &, const IGraph &)> &fn) const
  {
    for (const auto &[subg_idx, subg] : _subgraphs)
    {
      fn(subg_idx, *subg);
    }
  }
  void iterate(const std::function<void(const SubgraphIndex &, const IGraph &)> &fn) const {…}
 
  void iterate(const std::function<void(const SubgraphIndex &, IGraph &)> &fn)
  {
    for (const auto &[subg_idx, subg] : _subgraphs)
    {
      fn(subg_idx, *subg);
    }
  }
  void iterate(const std::function<void(const SubgraphIndex &, IGraph &)> &fn) {…}
 
  size_t subgraphs_count() const { return _subgraphs.size(); }
 
  std::shared_ptr<IGraph> primary_subgraph() const { return _subgraphs.at(SubgraphIndex{0}); }
 
  template <typename Graph, std::enable_if_t<std::is_base_of_v<IGraph, Graph>, bool> = true>
  bool hasOnly()
  {
    for (const auto &e : _subgraphs)
    {
      if (std::dynamic_pointer_cast<Graph>(e.second) == nullptr)
        return false;
    }
    return true;
  }
  bool hasOnly() {…}
 
private:
  std::unordered_map<SubgraphIndex, std::shared_ptr<IGraph>> _subgraphs;
 
  // Custom operations support
public:
  void
  bindKernelBuilder(const std::shared_ptr<onert::backend::custom::IKernelBuilder> &kernel_builder)
  {
    _kernel_builder = kernel_builder;
  }
  bindKernelBuilder(const std::shared_ptr<onert::backend::custom::IKernelBuilder> &kernel_builder) {…}
 
  const std::shared_ptr<backend::custom::IKernelBuilder> &getKernelBuilder() const
  {
    return _kernel_builder;
  }
  const std::shared_ptr<backend::custom::IKernelBuilder> &getKernelBuilder() const {…}
 
private:
  std::shared_ptr<backend::custom::IKernelBuilder> _kernel_builder;
 
public:
  void add_metadata(const std::string &name, std::unique_ptr<const ir::Data> data)
  {
    _metadatas.emplace(name, std::move(data));
  }
  void add_metadata(const std::string &name, std::unique_ptr<const ir::Data> data) {…}
 
  bool exists_metadata(const std::string &name) const
  {
    return _metadatas.find(name) != _metadatas.end();
  }
  bool exists_metadata(const std::string &name) const {…}
 
  // NOTE The corresponding metadata is deleted from the model and returned
  std::unique_ptr<const ir::Data> extract_metadata(const std::string name)
  {
    auto m = _metadatas.find(name);
 
    if (m == _metadatas.end())
      throw std::out_of_range{"no meatdata named " + name};
 
    auto data = std::move(m->second);
    _metadatas.erase(m);
    return data;
  }
  std::unique_ptr<const ir::Data> extract_metadata(const std::string name) {…}
 
private:
  // TODO: Apply Heterogeneous lookup for unordered containers (transparent hashing) since C++20
  //       to use `std::string_view` with lookup functions in unordered containers
  std::unordered_map<std::string, std::unique_ptr<const ir::Data>> _metadatas;
};
class Model {…};
} // namespace onert::ir
 
#endif // __ONERT_IR_MODEL_H__