You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

trsm_kernel_RN_rvv_v1.c 9.2 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337
  1. /***************************************************************************
  2. Copyright (c) 2022, The OpenBLAS Project
  3. All rights reserved.
  4. Redistribution and use in source and binary forms, with or without
  5. modification, are permitted provided that the following conditions are
  6. met:
  7. 1. Redistributions of source code must retain the above copyright
  8. notice, this list of conditions and the following disclaimer.
  9. 2. Redistributions in binary form must reproduce the above copyright
  10. notice, this list of conditions and the following disclaimer in
  11. the documentation and/or other materials provided with the
  12. distribution.
  13. 3. Neither the name of the OpenBLAS project nor the names of
  14. its contributors may be used to endorse or promote products
  15. derived from this software without specific prior written permission.
  16. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  17. AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  19. ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBLAS PROJECT OR CONTRIBUTORS BE
  20. LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  22. SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  23. CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  24. OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
  25. USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. *****************************************************************************/
  27. #include "common.h"
  28. #if !defined(DOUBLE)
  29. #define VSETVL(n) __riscv_vsetvl_e32m2(n)
  30. #define VSETVL_MAX __riscv_vsetvlmax_e32m2()
  31. #define FLOAT_V_T vfloat32m2_t
  32. #define FLOAT_VX2_T vfloat32m2x2_t
  33. #define VGET_VX2 __riscv_vget_v_f32m2x2_f32m2
  34. #define VSET_VX2 __riscv_vset_v_f32m2_f32m2x2
  35. #define VLEV_FLOAT __riscv_vle32_v_f32m2
  36. #define VSSEV_FLOAT __riscv_vsse32_v_f32m2
  37. #define VSEV_FLOAT __riscv_vse32_v_f32m2
  38. #define VLSEG2_FLOAT __riscv_vlseg2e32_v_f32m2x2
  39. #define VSSEG2_FLOAT __riscv_vsseg2e32_v_f32m2x2
  40. #define VFMACCVF_FLOAT __riscv_vfmacc_vf_f32m2
  41. #define VFNMSACVF_FLOAT __riscv_vfnmsac_vf_f32m2
  42. #define VFMULVF_FLOAT __riscv_vfmul_vf_f32m2
  43. #else
  44. #define VSETVL(n) __riscv_vsetvl_e64m2(n)
  45. #define VSETVL_MAX __riscv_vsetvlmax_e64m2()
  46. #define FLOAT_V_T vfloat64m2_t
  47. #define FLOAT_VX2_T vfloat64m2x2_t
  48. #define VGET_VX2 __riscv_vget_v_f64m2x2_f64m2
  49. #define VSET_VX2 __riscv_vset_v_f64m2_f64m2x2
  50. #define VLEV_FLOAT __riscv_vle64_v_f64m2
  51. #define VSSEV_FLOAT __riscv_vsse64_v_f64m2
  52. #define VSEV_FLOAT __riscv_vse64_v_f64m2
  53. #define VLSEG2_FLOAT __riscv_vlseg2e64_v_f64m2x2
  54. #define VSSEG2_FLOAT __riscv_vsseg2e64_v_f64m2x2
  55. #define VFMVVF_FLOAT __riscv_vfmv_v_f_f64m2
  56. #define VFMACCVF_FLOAT __riscv_vfmacc_vf_f64m2
  57. #define VFNMSACVF_FLOAT __riscv_vfnmsac_vf_f64m2
  58. #define VFMULVF_FLOAT __riscv_vfmul_vf_f64m2
  59. #endif
  60. static FLOAT dm1 = -1.;
  61. #ifdef CONJ
  62. #define GEMM_KERNEL GEMM_KERNEL_R
  63. #else
  64. #define GEMM_KERNEL GEMM_KERNEL_N
  65. #endif
  66. #if GEMM_DEFAULT_UNROLL_N == 1
  67. #define GEMM_UNROLL_N_SHIFT 0
  68. #endif
  69. #if GEMM_DEFAULT_UNROLL_N == 2
  70. #define GEMM_UNROLL_N_SHIFT 1
  71. #endif
  72. #if GEMM_DEFAULT_UNROLL_N == 4
  73. #define GEMM_UNROLL_N_SHIFT 2
  74. #endif
  75. #if GEMM_DEFAULT_UNROLL_N == 8
  76. #define GEMM_UNROLL_N_SHIFT 3
  77. #endif
  78. #if GEMM_DEFAULT_UNROLL_N == 16
  79. #define GEMM_UNROLL_N_SHIFT 4
  80. #endif
  81. // Optimizes the implementation in ../arm64/trsm_kernel_RN_sve.c
  82. #ifndef COMPLEX
  83. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  84. FLOAT bb;
  85. FLOAT *pci, *pcj;
  86. int i, j, k;
  87. FLOAT_V_T va, vc;
  88. size_t vl;
  89. for (i = 0; i < n; i++) {
  90. bb = *(b + i);
  91. pci = c + i * ldc;
  92. pcj = c;
  93. for (j = m; j > 0; j -= vl) {
  94. vl = VSETVL(j);
  95. va = VLEV_FLOAT(pci, vl);
  96. va = VFMULVF_FLOAT(va, bb, vl);
  97. VSEV_FLOAT(a, va, vl);
  98. VSEV_FLOAT(pci, va, vl);
  99. a += vl;
  100. pci += vl;
  101. for (k = i + 1; k < n; k ++){
  102. vc = VLEV_FLOAT(pcj + k * ldc, vl);
  103. vc = VFNMSACVF_FLOAT(vc, *(b + k), va, vl);
  104. VSEV_FLOAT(pcj + k * ldc, vc, vl);
  105. }
  106. pcj += vl;
  107. }
  108. b += n;
  109. }
  110. }
  111. #else
  112. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  113. FLOAT bb1, bb2;
  114. FLOAT *pci, *pcj;
  115. int i, j, k;
  116. FLOAT_VX2_T vax2, vsx2, vcx2;
  117. FLOAT_V_T va1, va2, vs1, vs2, vc1, vc2;
  118. size_t vl;
  119. for (i = 0; i < n; i++) {
  120. bb1 = *(b + i * 2 + 0);
  121. bb2 = *(b + i * 2 + 1);
  122. pci = c + i * ldc * 2;
  123. pcj = c;
  124. for (j = m; j > 0; j -= vl) {
  125. vl = VSETVL(j);
  126. vax2 = VLSEG2_FLOAT(pci, vl);
  127. va1 = VGET_VX2(vax2, 0);
  128. va2 = VGET_VX2(vax2, 1);
  129. #ifndef CONJ
  130. vs1 = VFMULVF_FLOAT(va1, bb1, vl);
  131. vs1 = VFNMSACVF_FLOAT(vs1, bb2, va2, vl);
  132. vs2 = VFMULVF_FLOAT(va1, bb2, vl);
  133. vs2 = VFMACCVF_FLOAT(vs2, bb1, va2, vl);
  134. #else
  135. vs1 = VFMULVF_FLOAT(va1, bb1, vl);
  136. vs1 = VFMACCVF_FLOAT(vs1, bb2, va2, vl);
  137. vs2 = VFMULVF_FLOAT(va2, bb1, vl);
  138. vs2 = VFNMSACVF_FLOAT(vs2, bb2, va1, vl);
  139. #endif
  140. vsx2 = VSET_VX2(vsx2, 0, vs1);
  141. vsx2 = VSET_VX2(vsx2, 1, vs2);
  142. VSSEG2_FLOAT(a, vsx2, vl);
  143. VSSEG2_FLOAT(pci, vsx2, vl);
  144. a += vl * 2;
  145. pci += vl * 2;
  146. for (k = i + 1; k < n; k ++){
  147. vcx2 = VLSEG2_FLOAT(pcj + k * ldc * 2, vl);
  148. vc1 = VGET_VX2(vcx2, 0);
  149. vc2 = VGET_VX2(vcx2, 1);
  150. #ifndef CONJ
  151. vc1 = VFMACCVF_FLOAT(vc1, *(b + k * 2 + 1), vs2, vl);
  152. vc1 = VFNMSACVF_FLOAT(vc1, *(b + k * 2 + 0), vs1, vl);
  153. vc2 = VFNMSACVF_FLOAT(vc2, *(b + k * 2 + 1), vs1, vl);
  154. vc2 = VFNMSACVF_FLOAT(vc2, *(b + k * 2 + 0), vs2, vl);
  155. #else
  156. vc1 = VFNMSACVF_FLOAT(vc1, *(b + k * 2 + 0), vs1, vl);
  157. vc1 = VFNMSACVF_FLOAT(vc1, *(b + k * 2 + 1), vs2, vl);
  158. vc2 = VFMACCVF_FLOAT(vc2, *(b + k * 2 + 1), vs1, vl);
  159. vc2 = VFNMSACVF_FLOAT(vc2, *(b + k * 2 + 0), vs2, vl);
  160. #endif
  161. vcx2 = VSET_VX2(vcx2, 0, vc1);
  162. vcx2 = VSET_VX2(vcx2, 1, vc2);
  163. VSSEG2_FLOAT(pcj + k * ldc * 2, vcx2, vl);
  164. }
  165. pcj += vl * 2;
  166. }
  167. b += n * 2;
  168. }
  169. }
  170. #endif
  171. int CNAME(BLASLONG m, BLASLONG n, BLASLONG k, FLOAT dummy1,
  172. #ifdef COMPLEX
  173. FLOAT dummy2,
  174. #endif
  175. FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, BLASLONG offset){
  176. FLOAT *aa, *cc;
  177. BLASLONG kk;
  178. BLASLONG i, j;
  179. size_t vl = VSETVL_MAX;
  180. //fprintf(stderr, "%s , %s, m = %4ld n = %4ld k = %4ld offset = %4ld\n", __FILE__, __FUNCTION__, m, n, k, offset); // Debug
  181. j = (n >> GEMM_UNROLL_N_SHIFT);
  182. kk = -offset;
  183. while (j > 0) {
  184. aa = a;
  185. cc = c;
  186. i = vl;
  187. if (i <= m) {
  188. do {
  189. if (kk > 0) {
  190. GEMM_KERNEL(vl, GEMM_UNROLL_N, kk, dm1,
  191. #ifdef COMPLEX
  192. ZERO,
  193. #endif
  194. aa, b, cc, ldc);
  195. }
  196. solve(vl, GEMM_UNROLL_N,
  197. aa + kk * vl * COMPSIZE,
  198. b + kk * GEMM_UNROLL_N * COMPSIZE,
  199. cc, ldc);
  200. aa += vl * k * COMPSIZE;
  201. cc += vl * COMPSIZE;
  202. i += vl;
  203. } while (i <= m);
  204. }
  205. i = m % vl;
  206. if (i) {
  207. if (kk > 0) {
  208. GEMM_KERNEL(i, GEMM_UNROLL_N, kk, dm1,
  209. #ifdef COMPLEX
  210. ZERO,
  211. #endif
  212. aa, b, cc, ldc);
  213. }
  214. solve(i, GEMM_UNROLL_N,
  215. aa + kk * i * COMPSIZE,
  216. b + kk * GEMM_UNROLL_N * COMPSIZE,
  217. cc, ldc);
  218. aa += i * k * COMPSIZE;
  219. cc += i * COMPSIZE;
  220. }
  221. kk += GEMM_UNROLL_N;
  222. b += GEMM_UNROLL_N * k * COMPSIZE;
  223. c += GEMM_UNROLL_N * ldc * COMPSIZE;
  224. j --;
  225. }
  226. if (n & (GEMM_UNROLL_N - 1)) {
  227. j = (GEMM_UNROLL_N >> 1);
  228. while (j > 0) {
  229. if (n & j) {
  230. aa = a;
  231. cc = c;
  232. i = vl;
  233. while (i <= m) {
  234. if (kk > 0) {
  235. GEMM_KERNEL(vl, j, kk, dm1,
  236. #ifdef COMPLEX
  237. ZERO,
  238. #endif
  239. aa,
  240. b,
  241. cc,
  242. ldc);
  243. }
  244. solve(vl, j,
  245. aa + kk * vl * COMPSIZE,
  246. b + kk * j * COMPSIZE, cc, ldc);
  247. aa += vl * k * COMPSIZE;
  248. cc += vl * COMPSIZE;
  249. i += vl;
  250. }
  251. i = m % vl;
  252. if (i) {
  253. if (kk > 0) {
  254. GEMM_KERNEL(i, j, kk, dm1,
  255. #ifdef COMPLEX
  256. ZERO,
  257. #endif
  258. aa,
  259. b,
  260. cc,
  261. ldc);
  262. }
  263. solve(i, j,
  264. aa + kk * i * COMPSIZE,
  265. b + kk * j * COMPSIZE, cc, ldc);
  266. aa += i * k * COMPSIZE;
  267. cc += i * COMPSIZE;
  268. }
  269. b += j * k * COMPSIZE;
  270. c += j * ldc * COMPSIZE;
  271. kk += j;
  272. }
  273. j >>= 1;
  274. }
  275. }
  276. return 0;
  277. }