conv_op.cc 6.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14
// 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.

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

namespace paddle {
namespace lite {
22
namespace subgraph {
23 24
namespace xpu {

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

34 35 36
  // Get input and output vars and op attributes
  auto input_name = op_info->Input("Input").front();
  auto input = scope->FindMutableTensor(input_name);
37
  auto input_dims = input->dims();
38 39
  auto filter_name = op_info->Input("Filter").front();
  auto filter = scope->FindMutableTensor(filter_name);
40
  auto filter_dims = filter->dims();
41
  auto output_name = op_info->Output("Output").front();
42 43 44 45 46 47 48 49 50
  auto bs = input_dims[0];
  auto oc = filter_dims[0];
  CHECK_EQ(input_dims.size(), 4);
  CHECK_EQ(filter_dims.size(), 4);
  auto strides = op_info->GetAttr<std::vector<int>>("strides");
  auto paddings = op_info->GetAttr<std::vector<int>>("paddings");
  auto groups = op_info->GetAttr<int>("groups");
  auto dilations = op_info->GetAttr<std::vector<int>>("dilations");
  auto fuse_relu = op_info->GetAttr<bool>("fuse_relu");
H
HappyAngel 已提交
51 52
  CHECK_EQ(strides.size(), 2L);
  CHECK_EQ(dilations.size(), 2L);
53

54
  // Input node
55 56 57
  std::shared_ptr<Node> input_node = nullptr;
  if (graph->Has(input_name)) {
    input_node = graph->Get(input_name);
58
  } else {
59
    input_node = graph->Add(input_name, *input);
60 61
  }

62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
  if (paddings.size() == 2L) {
    for (size_t i = 0; i < strides.size(); ++i) {
      int copy_pad = *(paddings.begin() + 2 * i);
      paddings.insert(paddings.begin() + 2 * i + 1, copy_pad);
    }
  }
  CHECK_EQ(paddings.size(), 4L)
      << "Paddings size should be the same or twice as the input size.";

  std::string padding_algorithm("");
  if (op_info->HasAttr("padding_algorithm")) {
    padding_algorithm = op_info->GetAttr<std::string>("padding_algorithm");
  }
  operators::UpdatePaddingAndDilation(&paddings,
                                      &dilations,
                                      strides,
                                      padding_algorithm,
                                      input_dims,
                                      filter_dims);

82 83 84 85
  std::vector<int64_t> output_shape({bs, oc});
  for (size_t i = 0; i < 2; i++) {
    const int dkernel = dilations[i] * (filter_dims[2 + i] - 1) + 1;
    output_shape.push_back(
H
HappyAngel 已提交
86 87 88
        (input_dims[i + 2] + paddings[2 * i] + paddings[2 * i + 1] - dkernel) /
            strides[i] +
        1);
89 90 91
  }
  DDim output_dims(output_shape);

92
  // Filter node
93
  auto filter_node = graph->Add(filter_name, *filter);
94

95
  // Conv node
96
  auto conv_attrs = xtcl::make_node<xtcl::network::Conv2DAttrs>();
97 98 99
  conv_attrs->strides = std::move(CvtShape<xtcl::xIndexExpr>(strides));
  conv_attrs->padding = std::move(CvtShape<xtcl::xIndexExpr>(paddings));
  conv_attrs->dilation = std::move(CvtShape<xtcl::xIndexExpr>(dilations));
100 101 102 103 104 105 106
  conv_attrs->groups = groups;
  // conv_attrs->channels = nullptr;
  conv_attrs->kernel_size = std::move(xtcl::Array<xtcl::xIndexExpr>(nullptr));
  conv_attrs->data_layout = "NCHW";
  conv_attrs->kernel_layout = "OIHW";
  conv_attrs->out_layout = "";
  // conv_attrs->out_dtype = "";
107
  auto conv_node =
108 109 110
      graph->Add(output_name,
                 graph->builder_.CreateConv2D(
                     *input_node->data(), *filter_node->data(), conv_attrs));
111

112
  // Add bias node if exists bias
113 114 115 116
  // supports the bias nodes with the following dimensions
  // 0: {oc}
  // 1: {1, oc, oh, ow}
  // 2: {n, oc, oh, ow}
117
  if (HasInputArg(op_info, scope, "Bias")) {
118 119
    auto bias_name = op_info->Input("Bias").front();
    auto bias = scope->FindMutableTensor(bias_name);
120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
    auto bias_dims = bias->dims();
    auto bias_data_size = bias_dims.production();
    auto output_data_size = output_dims.production();
    std::vector<int64_t> bias_shape;
    bool is_channel_bias = false;
    if (bias_data_size == oc) {
      // 0: {oc}
      bias_shape = {oc};
      is_channel_bias = true;
    } else if (bias_data_size == output_data_size / bs) {
      // 1: {1, oc, oh, ow}
      bias_shape = {1, output_dims[1], output_dims[2], output_dims[3]};
    } else if (bias_data_size == output_data_size) {
      // 2: {n, oc, oh, ow}
      bias_shape = output_dims.Vectorize();
    } else {
136
      LOG(ERROR) << "[XPU] Bias dimension " << bias_dims
137 138 139
                 << " isn't supported in conv2d Op when output dimension is "
                 << output_dims;
    }
140 141 142
    std::shared_ptr<Node> bias_node = nullptr;
    if (graph->Has(bias_name)) {
      bias_node = graph->Get(bias_name);
143
    } else {
144
      bias_node = graph->Add(bias_name, *bias, bias_shape);
145 146
    }
    if (is_channel_bias) {
147 148 149
      conv_node = graph->Add(output_name,
                             graph->builder_.CreateBiasAdd(
                                 *conv_node->data(), 1, *bias_node->data()));
150
    } else {
151 152 153 154
      conv_node =
          graph->Add(output_name,
                     graph->builder_.CreateBinaryOp(
                         "add", *conv_node->data(), *bias_node->data()));
155 156 157 158
    }
  }

  if (fuse_relu) {
159
    // Append relu node if fuse_relu is true
160
    graph->Add(output_name, graph->builder_.CreateRelu(*conv_node->data()));
161
  }
162
  return REBUILD_WHEN_SHAPE_CHANGED;
163 164 165
}

}  // namespace xpu
166
}  // namespace subgraph
167 168 169
}  // namespace lite
}  // namespace paddle

170 171
REGISTER_SUBGRAPH_BRIDGE(conv2d,
                         kXPU,
172
                         paddle::lite::subgraph::xpu::ConvConverter);
173 174
REGISTER_SUBGRAPH_BRIDGE(depthwise_conv2d,
                         kXPU,
175
                         paddle::lite::subgraph::xpu::ConvConverter);