summaryrefslogtreecommitdiff
path: root/runtime/onert/backend/acl_common/AclSubTensorAnalyzer.h
blob: 83d7ad6fd7490ed203b96e37c22ee68a4d256990 (plain)
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/*
 * 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_BACKEND_ACL_COMMON_ACL_SUB_TENSOR_ANALYZER_H__
#define __ONERT_BACKEND_ACL_COMMON_ACL_SUB_TENSOR_ANALYZER_H__

#include <ir/OperationVisitor.h>
#include <ir/Graph.h>
#include "ParentInfo.h"

namespace onert
{
namespace backend
{
namespace acl_common
{

/**
 * @brief Class to analyze tensor subsumption
 */
class AclSubTensorAnalyzer : public ir::OperationVisitor
{
public:
  /**
   * @brief     Construct a new SubTensorAnalyzer object
   * @param[in] ctx Graph operand set
   */
  AclSubTensorAnalyzer(const ir::Graph &graph) : _graph{graph}
  {
    // DO NOTHING
  }

public:
  void setLayout(ir::Layout layout) { _current_op_layout = layout; }

  void visit(const ir::operation::Concat &node) override
  {
    //  If operator is concat, fill subsumption info
    int32_t axis_raw = node.param().axis;

    const auto &output_index = node.getOutputs().at(0);
    const auto &inputs = node.getInputs();

    int32_t axis_point = 0;
    const auto rank = _graph.operands().at(output_index).shape().rank();
    int32_t axis = axis_raw < 0 ? (axis_raw + rank) : axis_raw;
    assert(rank > axis);

    for (const auto &ind : inputs)
    {
      // NOTE Not support the case that concat's input is a constant or a input of model
      if (_graph.operands().at(ind).isConstant() || _graph.getInputs().contains(ind))
      {
        return;
      }
    }

    for (const auto &input_index : inputs)
    {
      auto input_shape = _graph.operands().at(input_index).shape();
      assert(rank == input_shape.rank());

      ir::Coordinates coordinate_info{};
      for (int i = 0; i < rank; i++)
      {
        coordinate_info.set(i, 0);
      }
      coordinate_info.set(axis, axis_point);

      _parent_map.emplace(
          input_index, acl_common::ParentInfo{output_index, _current_op_layout, coordinate_info});

      axis_point += input_shape.dim(axis);
    }
  }

  std::unordered_map<ir::OperandIndex, ParentInfo> &&releaseParentMap()
  {
    return std::move(_parent_map);
  }

private:
  const ir::Graph &_graph;
  std::unordered_map<ir::OperandIndex, ParentInfo> _parent_map;
  ir::Layout _current_op_layout{ir::Layout::UNKNOWN};
};

} // namespace acl_common
} // namespace backend
} // namespace onert

#endif // __ONERT_BACKEND_ACL_COMMON_ACL_SUB_TENSOR_ANALYZER_H__