|
| 1 | +// Copyright 2025 Tencent |
| 2 | +// SPDX-License-Identifier: BSD-3-Clause |
| 3 | + |
| 4 | +#include "testutil.h" |
| 5 | + |
| 6 | +static int test_gemm_nt(int M, int N, int K, int transA, int transB, int output_transpose, int constantA, int constantB) |
| 7 | +{ |
| 8 | + ncnn::ParamDict pd; |
| 9 | + pd.set(2, transA); |
| 10 | + pd.set(3, transB); |
| 11 | + pd.set(4, constantA); |
| 12 | + pd.set(5, constantB); |
| 13 | + pd.set(6, 1); |
| 14 | + pd.set(7, M); |
| 15 | + pd.set(8, N); |
| 16 | + pd.set(9, K); |
| 17 | + pd.set(10, -1); |
| 18 | + pd.set(14, output_transpose); |
| 19 | + |
| 20 | + std::vector<ncnn::Mat> weights; |
| 21 | + if (constantA) weights.push_back(transA ? ncnn::Mat(M, K) : ncnn::Mat(K, M)); |
| 22 | + if (constantB) weights.push_back(transB ? ncnn::Mat(K, N) : ncnn::Mat(N, K)); |
| 23 | + |
| 24 | + std::vector<ncnn::Mat> a; |
| 25 | + if (!constantA) a.push_back(transA ? ncnn::Mat(M, K) : ncnn::Mat(K, M)); |
| 26 | + if (!constantB) a.push_back(transB ? ncnn::Mat(K, N) : ncnn::Mat(N, K)); |
| 27 | + |
| 28 | + for (size_t i = 0; i < weights.size(); i++) |
| 29 | + { |
| 30 | + Randomize(weights[i]); |
| 31 | + } |
| 32 | + |
| 33 | + for (size_t i = 0; i < a.size(); i++) |
| 34 | + { |
| 35 | + Randomize(a[i]); |
| 36 | + } |
| 37 | + |
| 38 | + float epsilon = 0.001; |
| 39 | + |
| 40 | + int ret = test_layer("Gemm", pd, weights, a, 1, epsilon, 0, TEST_LAYER_ENABLE_THREADING); |
| 41 | + if (ret != 0) |
| 42 | + { |
| 43 | + fprintf(stderr, "test_gemm_nt failed M=%d N=%d K=%d transA=%d transB=%d output_transpose=%d constantA=%d constantB=%d\n", M, N, K, transA, transB, output_transpose, constantA, constantB); |
| 44 | + } |
| 45 | + |
| 46 | + return ret; |
| 47 | +} |
| 48 | + |
| 49 | +static int test_gemm_0(int M, int N, int K) |
| 50 | +{ |
| 51 | + return 0 |
| 52 | + || test_gemm_nt(M, N, K, 0, 0, 0, 0, 0) |
| 53 | + || test_gemm_nt(M, N, K, 0, 1, 0, 0, 0) |
| 54 | + || test_gemm_nt(M, N, K, 1, 0, 1, 0, 0) |
| 55 | + || test_gemm_nt(M, N, K, 1, 1, 1, 0, 0) |
| 56 | + |
| 57 | + || test_gemm_nt(M, N, K, 0, 0, 1, 1, 0) |
| 58 | + || test_gemm_nt(M, N, K, 0, 1, 1, 1, 0) |
| 59 | + || test_gemm_nt(M, N, K, 1, 0, 0, 1, 0) |
| 60 | + || test_gemm_nt(M, N, K, 1, 1, 0, 1, 0) |
| 61 | + |
| 62 | + || test_gemm_nt(M, N, K, 0, 0, 0, 0, 1) |
| 63 | + || test_gemm_nt(M, N, K, 0, 1, 1, 0, 1) |
| 64 | + || test_gemm_nt(M, N, K, 1, 0, 0, 0, 1) |
| 65 | + || test_gemm_nt(M, N, K, 1, 1, 1, 0, 1) |
| 66 | + |
| 67 | + || test_gemm_nt(M, N, K, 0, 0, 1, 1, 1) |
| 68 | + || test_gemm_nt(M, N, K, 0, 1, 0, 1, 1) |
| 69 | + || test_gemm_nt(M, N, K, 1, 0, 1, 1, 1) |
| 70 | + || test_gemm_nt(M, N, K, 1, 1, 0, 1, 1); |
| 71 | +} |
| 72 | + |
| 73 | +int main() |
| 74 | +{ |
| 75 | + SRAND(7767517); |
| 76 | + |
| 77 | + int mnk[][3] = { |
| 78 | + {1, 20, 40}, |
| 79 | + {20, 2, 39}, |
| 80 | + {3, 30, 13}, |
| 81 | + {33, 1, 19} |
| 82 | + }; |
| 83 | + |
| 84 | + int mnk_count = sizeof(mnk) / sizeof(int) / 3; |
| 85 | + |
| 86 | + for (int i = 0; i < mnk_count; i++) |
| 87 | + { |
| 88 | + int M = mnk[i][0]; |
| 89 | + int N = mnk[i][1]; |
| 90 | + int K = mnk[i][2]; |
| 91 | + |
| 92 | + int ret = test_gemm_0(M, N, K); |
| 93 | + |
| 94 | + if (ret != 0) |
| 95 | + return ret; |
| 96 | + } |
| 97 | + |
| 98 | + return 0; |
| 99 | +} |
0 commit comments