topk_op.cc 2.0 KB
Newer Older
1
// Copyright (c) 2020 PaddlePaddle Authors. All Rights Reserved.
2 3 4 5 6 7 8 9 10 11 12 13 14
//
// 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.

15
#include "lite/kernels/npu/bridges/graph.h"
16
#include "lite/kernels/npu/bridges/registry.h"
17
#include "lite/kernels/npu/bridges/utility.h"
18 19 20

namespace paddle {
namespace lite {
21
namespace subgraph {
22 23
namespace npu {

24
int TopkConverter(void* ctx, OpLite* op, KernelBase* kernel) {
25 26 27 28
  CHECK(ctx != nullptr);
  CHECK(op != nullptr);
  auto graph = static_cast<Graph*>(ctx);
  auto op_info = op->op_info();
29
  auto op_type = op_info->Type();
30
  auto scope = op->scope();
31
  VLOG(3) << "[NPU] Converting " + op_type + "...";
32

33 34
  // Get input and output vars and op attributes
  auto x_name = op_info->Input("X").front();
35 36
  auto x = scope->FindTensor(x_name);

37 38
  auto out_name = op_info->Output("Out").front();

39 40
  int k = op_info->GetAttr<int>("k");

41
  // X node
42 43 44
  std::shared_ptr<Node> x_node = nullptr;
  if (graph->Has(x_name)) {
    x_node = graph->Get(x_name);
45
  } else {
46
    x_node = graph->Add(x_name, *x);
47 48
  }

49 50 51 52 53 54 55 56 57 58
  // k node
  std::shared_ptr<Node> k_node = graph->Add<int>(out_name + "/k", k);

  // topk node
  auto topk_node = graph->Add<ge::op::TopK>(out_name);
  auto topk_op = topk_node->data<ge::op::TopK>();
  topk_op->set_input_x(*x_node->data());
  topk_op->set_input_k(*k_node->data());
  topk_op->set_attr_format(0);

59
  return SUCCESS;
60 61 62
}

}  // namespace npu
63
}  // namespace subgraph
64 65 66
}  // namespace lite
}  // namespace paddle

67
REGISTER_SUBGRAPH_BRIDGE(top_k,
68
                         kNPU,
69
                         paddle::lite::subgraph::npu::TopkConverter);