-
Notifications
You must be signed in to change notification settings - Fork 4.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
add diag layer and its converter (#4935)
- Loading branch information
Showing
13 changed files
with
429 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,91 @@ | ||
// Tencent is pleased to support the open source community by making ncnn available. | ||
// | ||
// Copyright (C) 2023 THL A29 Limited, a Tencent company. All rights reserved. | ||
// | ||
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except | ||
// in compliance with the License. You may obtain a copy of the License at | ||
// | ||
// https://opensource.org/licenses/BSD-3-Clause | ||
// | ||
// 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. | ||
|
||
#include "diag.h" | ||
|
||
namespace ncnn { | ||
|
||
Diag::Diag() | ||
{ | ||
one_blob_only = true; | ||
support_inplace = false; | ||
} | ||
|
||
int Diag::load_param(const ParamDict& pd) | ||
{ | ||
diagonal = pd.get(0, 0); | ||
|
||
return 0; | ||
} | ||
|
||
int Diag::forward(const Mat& bottom_blob, Mat& top_blob, const Option& opt) const | ||
{ | ||
int dims = bottom_blob.dims; | ||
size_t elemsize = bottom_blob.elemsize; | ||
|
||
if (dims == 1) | ||
{ | ||
int w = bottom_blob.w; | ||
int top_w = w + ((diagonal >= 0) ? diagonal : -diagonal); | ||
|
||
top_blob.create(top_w, top_w, elemsize, opt.blob_allocator); | ||
if (top_blob.empty()) | ||
return -100; | ||
|
||
top_blob.fill(0.0f); | ||
|
||
int bias_r = -std::min(diagonal, 0); | ||
int bias_c = std::max(diagonal, 0); | ||
|
||
for (int i = 0; i < w; i++) | ||
{ | ||
top_blob.row(i + bias_r)[i + bias_c] = bottom_blob[i]; | ||
} | ||
} | ||
if (dims == 2) | ||
{ | ||
int w = bottom_blob.w; | ||
int h = bottom_blob.h; | ||
|
||
int len = 0; | ||
int minimum = std::min(w - h, 0); | ||
int maximum = std::max(w - h, 0); | ||
if (diagonal <= maximum && diagonal >= minimum) | ||
len = std::min(w, h); | ||
else if (diagonal > -h && diagonal < minimum) | ||
len = diagonal + h; | ||
else if (diagonal > maximum && diagonal < w) | ||
len = -diagonal + w; | ||
|
||
top_blob.create(len, elemsize, opt.blob_allocator); | ||
if (top_blob.empty()) | ||
{ | ||
if (len == 0) | ||
return 0; | ||
return -100; | ||
} | ||
|
||
int bias_r = -std::min(diagonal, 0); | ||
int bias_c = std::max(diagonal, 0); | ||
|
||
for (int i = 0; i < len; i++) | ||
{ | ||
top_blob[i] = bottom_blob.row(i + bias_r)[i + bias_c]; | ||
} | ||
} | ||
|
||
return 0; | ||
} | ||
|
||
} // namespace ncnn |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
// Tencent is pleased to support the open source community by making ncnn available. | ||
// | ||
// Copyright (C) 2023 THL A29 Limited, a Tencent company. All rights reserved. | ||
// | ||
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except | ||
// in compliance with the License. You may obtain a copy of the License at | ||
// | ||
// https://opensource.org/licenses/BSD-3-Clause | ||
// | ||
// 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 LAYER_DIAG_H | ||
#define LAYER_DIAG_H | ||
|
||
#include "layer.h" | ||
|
||
namespace ncnn { | ||
|
||
class Diag : public Layer | ||
{ | ||
public: | ||
Diag(); | ||
|
||
virtual int load_param(const ParamDict& pd); | ||
|
||
virtual int forward(const Mat& bottom_blob, Mat& top_blob, const Option& opt) const; | ||
|
||
public: | ||
int diagonal; | ||
}; | ||
|
||
} // namespace ncnn | ||
|
||
#endif // LAYER_DIAG_H |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,58 @@ | ||
// Tencent is pleased to support the open source community by making ncnn available. | ||
// | ||
// Copyright (C) 2023 THL A29 Limited, a Tencent company. All rights reserved. | ||
// | ||
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except | ||
// in compliance with the License. You may obtain a copy of the License at | ||
// | ||
// https://opensource.org/licenses/BSD-3-Clause | ||
// | ||
// 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. | ||
|
||
#include "layer/diag.h" | ||
#include "testutil.h" | ||
|
||
static int test_diag(const ncnn::Mat& a, int diagonal) | ||
{ | ||
ncnn::ParamDict pd; | ||
pd.set(0, diagonal); | ||
|
||
std::vector<ncnn::Mat> weights(0); | ||
|
||
int ret = test_layer<ncnn::Diag>("Diag", pd, weights, a); | ||
if (ret != 0) | ||
{ | ||
fprintf(stderr, "test_diag failed a.dims=%d a=(%d %d %d %d)\n", a.dims, a.w, a.h, a.d, a.c); | ||
} | ||
|
||
return ret; | ||
} | ||
|
||
static int test_diag_0() | ||
{ | ||
return 0 | ||
|| test_diag(RandomMat(5, 24), 3) | ||
|| test_diag(RandomMat(7, 12), 0) | ||
|| test_diag(RandomMat(6, 6), -4) | ||
|| test_diag(RandomMat(3, 4), -6); | ||
} | ||
|
||
static int test_diag_1() | ||
{ | ||
return 0 | ||
|| test_diag(RandomMat(5), -1) | ||
|| test_diag(RandomMat(7), 0) | ||
|| test_diag(RandomMat(3), 2); | ||
} | ||
|
||
int main() | ||
{ | ||
SRAND(7767517); | ||
|
||
return 0 | ||
|| test_diag_0() | ||
|| test_diag_1(); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
// Tencent is pleased to support the open source community by making ncnn available. | ||
// | ||
// Copyright (C) 2023 THL A29 Limited, a Tencent company. All rights reserved. | ||
// | ||
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except | ||
// in compliance with the License. You may obtain a copy of the License at | ||
// | ||
// https://opensource.org/licenses/BSD-3-Clause | ||
// | ||
// 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. | ||
|
||
#include "pass_level2.h" | ||
|
||
namespace pnnx { | ||
|
||
class torch_diag : public GraphRewriterPass | ||
{ | ||
public: | ||
const char* match_pattern_graph() const | ||
{ | ||
return R"PNNXIR(7767517 | ||
4 3 | ||
pnnx.Input input_0 0 1 input | ||
pnnx.Input input_1 0 1 diagonal | ||
aten::diag op_0 2 1 input diagonal out | ||
pnnx.Output output 1 0 out | ||
)PNNXIR"; | ||
} | ||
|
||
const char* type_str() const | ||
{ | ||
return "torch.diag"; | ||
} | ||
}; | ||
|
||
REGISTER_GLOBAL_PNNX_GRAPH_REWRITER_PASS(torch_diag, 20) | ||
|
||
} // namespace pnnx |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,63 @@ | ||
// Tencent is pleased to support the open source community by making ncnn available. | ||
// | ||
// Copyright (C) 2023 THL A29 Limited, a Tencent company. All rights reserved. | ||
// | ||
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except | ||
// in compliance with the License. You may obtain a copy of the License at | ||
// | ||
// https://opensource.org/licenses/BSD-3-Clause | ||
// | ||
// 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. | ||
|
||
#include "pass_ncnn.h" | ||
|
||
namespace pnnx { | ||
|
||
namespace ncnn { | ||
|
||
class torch_diag : public GraphRewriterPass | ||
{ | ||
public: | ||
const char* match_pattern_graph() const | ||
{ | ||
return R"PNNXIR(7767517 | ||
3 2 | ||
pnnx.Input input 0 1 input | ||
torch.diag op_0 1 1 input out diagonal=%diagonal | ||
pnnx.Output output 1 0 out | ||
)PNNXIR"; | ||
} | ||
|
||
const char* type_str() const | ||
{ | ||
return "Diag"; | ||
} | ||
|
||
const char* name_str() const | ||
{ | ||
return "diag"; | ||
} | ||
|
||
void write(Operator* op, const std::map<std::string, Parameter>& captured_params) const | ||
{ | ||
int diagonal = captured_params.at("diagonal").i; | ||
int input_rank = op->inputs[0]->shape.size(); | ||
|
||
if (input_rank > 2) | ||
{ | ||
fprintf(stderr, "diag %d-rank tensor is not supported yet!\n", input_rank); | ||
return; | ||
} | ||
|
||
op->params["0"] = diagonal; | ||
} | ||
}; | ||
|
||
REGISTER_GLOBAL_PNNX_NCNN_GRAPH_REWRITER_PASS(torch_diag, 20) | ||
|
||
} // namespace ncnn | ||
|
||
} // namespace pnnx |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.