graph.h 1.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48
// Copyright (c) 2019 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 <memory>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#include "lite/core/op_lite.h"
#include "lite/core/tensor.h"

namespace paddle {
namespace lite {
namespace subgraph {
namespace bm {

// Graph to collect all of converted BM IR nodes
class Graph {
 public:
  void AddNode(const std::string& name);
  bool HasNode(const std::string& name) {
    return nodes_.find(name) != nodes_.end();
  }
  void CreateCompilerHandle();
  void* GetCompilerHandle() { return compiler_handle_; }

 private:
  std::unordered_map<std::string, std::string> nodes_;
  void* compiler_handle_;
};

}  // namespace bm
}  // namespace subgraph
}  // namespace lite
}  // namespace paddle