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.

sbgemm_kernel_4x4_neoversev1_impl.c 12 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414
  1. /***************************************************************************
  2. * Copyright (c) 2024-2025, 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
  21. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  22. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  23. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  24. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  25. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  26. * POSSIBILITY OF SUCH DAMAGE.
  27. * *****************************************************************************/
  28. #include <arm_sve.h>
  29. #include "common.h"
  30. #define INIT_C(M, N) mc##M##N = svdup_f32(0);
  31. #define MATMUL(M, N) mc##M##N = svbfmmla(mc##M##N, ma##M, mb##N);
  32. #define INIT_C_4x4 \
  33. do { \
  34. INIT_C(0, 0); \
  35. INIT_C(0, 1); \
  36. INIT_C(1, 0); \
  37. INIT_C(1, 1); \
  38. } while (0);
  39. #ifdef ALPHA_ONE
  40. #define UPDATE_C(PG, PTR, DST, SRC) \
  41. do { \
  42. DST = svld1_f32((PG), (PTR)); \
  43. DST = svadd_z((PG), SRC, DST); \
  44. svst1_f32((PG), (PTR), DST); \
  45. } while (0);
  46. #else
  47. #define UPDATE_C(PG, PTR, DST, SRC) \
  48. do { \
  49. DST = svld1_f32((PG), (PTR)); \
  50. DST = svmad_z((PG), svalpha, SRC, DST); \
  51. svst1_f32((PG), (PTR), DST); \
  52. } while (0);
  53. #endif
  54. #define ZIP_EVEN_ELEMENTS(PG, mc0, mc1, tmp, vc) \
  55. do { \
  56. (tmp) = svuzp1_f32((mc0), (mc1)); \
  57. (vc) = svcompact_f32((PG), (tmp)); \
  58. } while (0)
  59. #define ZIP_ODD_ELEMENTS(PG, mc0, mc1, tmp, vc) \
  60. do { \
  61. (tmp) = svuzp2_f32((mc0), (mc1)); \
  62. (vc) = svcompact_f32((PG), (tmp)); \
  63. } while (0)
  64. #define ACCUMULATE_LAST4_TO_FIRST4(M, N, TMP) \
  65. do { \
  66. TMP = svext_f32(mc##M##N, mc##M##N, 4); \
  67. mc##M##N = svadd_f32_z(svptrue_b32(), mc##M##N, (TMP)); \
  68. } while (0)
  69. #ifdef ALPHA_ONE
  70. int sbgemm_kernel_neoversev1_alpha_one(BLASLONG m, BLASLONG n, BLASLONG k,
  71. FLOAT alpha, IFLOAT *A, IFLOAT *B,
  72. FLOAT *C, BLASLONG ldc)
  73. #else
  74. int sbgemm_kernel_neoversev1_alpha(BLASLONG m, BLASLONG n, BLASLONG k,
  75. FLOAT alpha, IFLOAT *A, IFLOAT *B, FLOAT *C,
  76. BLASLONG ldc)
  77. #endif
  78. {
  79. BLASLONG pad_k = (k + 7) & ~7;
  80. svbfloat16_t ma0, ma1, mb0, mb1;
  81. svfloat32_t mc00, mc01, mc10, mc11, vc0, vc1, vc2, vc3, oc0, oc1, oc2, oc3;
  82. svfloat32_t tmp;
  83. svfloat32_t svalpha = svdup_f32(alpha);
  84. svbool_t pg16_all = svptrue_b16();
  85. svbool_t pg32_first_1 = svwhilelt_b32(0, 1);
  86. svbool_t pg32_first_2 = svwhilelt_b32(0, 2);
  87. svbool_t pg32_first_4 = svwhilelt_b32(0, 4);
  88. svbool_t pg32_select_first_2_per_quadword = svdupq_b32(1, 1, 0, 0);
  89. bfloat16_t *ptr_a = (bfloat16_t *)A;
  90. bfloat16_t *ptr_b = (bfloat16_t *)B;
  91. FLOAT *ptr_c = C;
  92. bfloat16_t *ptr_a0;
  93. bfloat16_t *ptr_b0;
  94. FLOAT *ptr_c0, *ptr_c1, *ptr_c2, *ptr_c3;
  95. for (BLASLONG j = 0; j < n / 4; j++) {
  96. ptr_c0 = ptr_c;
  97. ptr_c1 = ptr_c0 + ldc;
  98. ptr_c2 = ptr_c1 + ldc;
  99. ptr_c3 = ptr_c2 + ldc;
  100. ptr_c += 4 * ldc;
  101. ptr_a = (bfloat16_t *)A;
  102. for (BLASLONG i = 0; i < m / 4; i++) {
  103. ptr_a0 = ptr_a;
  104. ptr_a += 4 * pad_k;
  105. ptr_b0 = ptr_b;
  106. INIT_C_4x4;
  107. for (BLASLONG p = 0; p < pad_k; p += 8) {
  108. ma0 = svld1_bf16(pg16_all, ptr_a0);
  109. ma1 = svld1_bf16(pg16_all, ptr_a0 + 16);
  110. mb0 = svld1_bf16(pg16_all, ptr_b0);
  111. mb1 = svld1_bf16(pg16_all, ptr_b0 + 16);
  112. MATMUL(0, 0);
  113. MATMUL(0, 1);
  114. MATMUL(1, 0);
  115. MATMUL(1, 1);
  116. ptr_a0 += 32;
  117. ptr_b0 += 32;
  118. }
  119. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  120. ACCUMULATE_LAST4_TO_FIRST4(0, 1, tmp);
  121. ACCUMULATE_LAST4_TO_FIRST4(1, 0, tmp);
  122. ACCUMULATE_LAST4_TO_FIRST4(1, 1, tmp);
  123. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc0);
  124. ZIP_ODD_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc1);
  125. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc01, mc11, tmp, vc2);
  126. ZIP_ODD_ELEMENTS(pg32_select_first_2_per_quadword, mc01, mc11, tmp, vc3);
  127. UPDATE_C(pg32_first_4, ptr_c0, oc0, vc0);
  128. UPDATE_C(pg32_first_4, ptr_c1, oc1, vc1);
  129. UPDATE_C(pg32_first_4, ptr_c2, oc2, vc2)
  130. UPDATE_C(pg32_first_4, ptr_c3, oc3, vc3)
  131. ptr_c0 += 4;
  132. ptr_c1 += 4;
  133. ptr_c2 += 4;
  134. ptr_c3 += 4;
  135. }
  136. if (m & 2) {
  137. ptr_a0 = ptr_a;
  138. ptr_a += 2 * pad_k;
  139. ptr_b0 = ptr_b;
  140. INIT_C(0, 0);
  141. INIT_C(0, 1);
  142. for (BLASLONG p = 0; p < pad_k; p += 8) {
  143. ma0 = svld1_bf16(pg16_all, ptr_a0);
  144. mb0 = svld1_bf16(pg16_all, ptr_b0);
  145. mb1 = svld1_bf16(pg16_all, ptr_b0 + 16);
  146. MATMUL(0, 0);
  147. MATMUL(0, 1);
  148. ptr_a0 += 16;
  149. ptr_b0 += 32;
  150. }
  151. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  152. ACCUMULATE_LAST4_TO_FIRST4(0, 1, tmp);
  153. vc0 = svuzp1(mc00, mc00);
  154. vc1 = svuzp2(mc00, mc00);
  155. vc2 = svuzp1(mc01, mc01);
  156. vc3 = svuzp2(mc01, mc01);
  157. UPDATE_C(pg32_first_2, ptr_c0, oc0, vc0);
  158. UPDATE_C(pg32_first_2, ptr_c1, oc1, vc1);
  159. UPDATE_C(pg32_first_2, ptr_c2, oc2, vc2);
  160. UPDATE_C(pg32_first_2, ptr_c3, oc3, vc3);
  161. ptr_c0 += 2;
  162. ptr_c1 += 2;
  163. ptr_c2 += 2;
  164. ptr_c3 += 2;
  165. }
  166. if (m & 1) {
  167. ptr_a0 = ptr_a;
  168. ptr_b0 = ptr_b;
  169. INIT_C(0, 0);
  170. INIT_C(0, 1);
  171. for (BLASLONG p = 0; p < pad_k; p += 8) {
  172. ma0 = svld1_bf16(pg16_all, ptr_a0);
  173. mb0 = svld1_bf16(pg16_all, ptr_b0);
  174. mb1 = svld1_bf16(pg16_all, ptr_b0 + 16);
  175. MATMUL(0, 0);
  176. MATMUL(0, 1);
  177. ptr_a0 += 16;
  178. ptr_b0 += 32;
  179. }
  180. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  181. ACCUMULATE_LAST4_TO_FIRST4(0, 1, tmp);
  182. // use compact is more straightforward
  183. vc1 = svuzp2(mc00, mc00);
  184. vc3 = svuzp2(mc01, mc01);
  185. UPDATE_C(pg32_first_1, ptr_c0, oc0, mc00);
  186. UPDATE_C(pg32_first_1, ptr_c1, oc1, vc1);
  187. UPDATE_C(pg32_first_1, ptr_c2, oc2, mc01);
  188. UPDATE_C(pg32_first_1, ptr_c3, oc3, vc3);
  189. }
  190. ptr_b += 4 * pad_k;
  191. }
  192. if (n & 2) {
  193. ptr_c0 = ptr_c;
  194. ptr_c1 = ptr_c0 + ldc;
  195. ptr_c += 2 * ldc;
  196. ptr_a = (bfloat16_t *)A;
  197. for (BLASLONG i = 0; i < m / 4; i++) {
  198. ptr_a0 = ptr_a;
  199. ptr_a += 4 * pad_k;
  200. ptr_b0 = ptr_b;
  201. INIT_C(0, 0);
  202. INIT_C(1, 0);
  203. for (BLASLONG p = 0; p < pad_k; p += 8) {
  204. ma0 = svld1_bf16(pg16_all, ptr_a0);
  205. ma1 = svld1_bf16(pg16_all, ptr_a0 + 16);
  206. mb0 = svld1_bf16(pg16_all, ptr_b0);
  207. MATMUL(0, 0);
  208. MATMUL(1, 0);
  209. ptr_a0 += 32;
  210. ptr_b0 += 16;
  211. }
  212. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  213. ACCUMULATE_LAST4_TO_FIRST4(1, 0, tmp);
  214. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc0);
  215. ZIP_ODD_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc2);
  216. UPDATE_C(pg32_first_4, ptr_c0, oc0, vc0);
  217. UPDATE_C(pg32_first_4, ptr_c1, oc2, vc2);
  218. ptr_c0 += 4;
  219. ptr_c1 += 4;
  220. }
  221. if (m & 2) {
  222. ptr_a0 = ptr_a;
  223. ptr_a += 2 * pad_k;
  224. ptr_b0 = ptr_b;
  225. INIT_C(0, 0);
  226. for (BLASLONG p = 0; p < pad_k; p += 8) {
  227. ma0 = svld1_bf16(pg16_all, ptr_a0);
  228. mb0 = svld1_bf16(pg16_all, ptr_b0);
  229. MATMUL(0, 0);
  230. ptr_a0 += 16;
  231. ptr_b0 += 16;
  232. }
  233. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  234. vc0 = svuzp1(mc00, mc00);
  235. vc1 = svuzp2(mc00, mc00);
  236. UPDATE_C(pg32_first_2, ptr_c0, oc0, vc0);
  237. UPDATE_C(pg32_first_2, ptr_c1, oc1, vc1);
  238. ptr_c0 += 2;
  239. ptr_c1 += 2;
  240. }
  241. if (m & 1) {
  242. ptr_a0 = ptr_a;
  243. ptr_b0 = ptr_b;
  244. INIT_C(0, 0);
  245. for (BLASLONG p = 0; p < pad_k; p += 8) {
  246. ma0 = svld1_bf16(pg16_all, ptr_a0);
  247. mb0 = svld1_bf16(pg16_all, ptr_b0);
  248. MATMUL(0, 0);
  249. ptr_a0 += 16;
  250. ptr_b0 += 16;
  251. }
  252. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  253. vc1 = svuzp2(mc00, mc00);
  254. UPDATE_C(pg32_first_1, ptr_c0, oc0, mc00);
  255. UPDATE_C(pg32_first_1, ptr_c1, oc1, vc1);
  256. }
  257. ptr_b += 2 * pad_k;
  258. }
  259. if (n & 1) { // TODO: this case seems a overhead. find out whether it's in our
  260. // case.
  261. ptr_c0 = ptr_c;
  262. ptr_a = (bfloat16_t *)A;
  263. for (BLASLONG i = 0; i < m / 4; i++) {
  264. ptr_a0 = ptr_a;
  265. ptr_a += 4 * pad_k;
  266. ptr_b0 = ptr_b;
  267. INIT_C(0, 0);
  268. INIT_C(1, 0);
  269. for (BLASLONG p = 0; p < pad_k; p += 8) {
  270. ma0 = svld1_bf16(pg16_all, ptr_a0);
  271. ma1 = svld1_bf16(pg16_all, ptr_a0 + 16);
  272. mb0 = svld1_bf16(pg16_all, ptr_b0);
  273. MATMUL(0, 0);
  274. MATMUL(1, 0);
  275. ptr_a0 += 32;
  276. ptr_b0 += 16;
  277. }
  278. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  279. ACCUMULATE_LAST4_TO_FIRST4(1, 0, tmp);
  280. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc0);
  281. UPDATE_C(pg32_first_4, ptr_c0, oc0, vc0);
  282. ptr_c0 += 4;
  283. }
  284. if (m & 2) {
  285. ptr_a0 = ptr_a;
  286. ptr_a += 2 * pad_k;
  287. ptr_b0 = ptr_b;
  288. INIT_C(0, 0);
  289. for (BLASLONG p = 0; p < pad_k; p += 8) {
  290. ma0 = svld1_bf16(pg16_all, ptr_a0);
  291. mb0 = svld1_bf16(pg16_all, ptr_b0);
  292. MATMUL(0, 0);
  293. ptr_a0 += 16;
  294. ptr_b0 += 16;
  295. }
  296. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  297. vc0 = svuzp1(mc00, mc00);
  298. UPDATE_C(pg32_first_2, ptr_c0, oc0, vc0);
  299. ptr_c0 += 2;
  300. }
  301. if (m & 1) {
  302. ptr_a0 = ptr_a;
  303. ptr_b0 = ptr_b;
  304. INIT_C(0, 0);
  305. for (BLASLONG p = 0; p < pad_k; p += 8) {
  306. ma0 = svld1_bf16(pg16_all, ptr_a0);
  307. mb0 = svld1_bf16(pg16_all, ptr_b0);
  308. MATMUL(0, 0);
  309. ptr_a0 += 16;
  310. ptr_b0 += 16;
  311. }
  312. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  313. UPDATE_C(pg32_first_1, ptr_c0, oc0, mc00);
  314. }
  315. }
  316. return 0;
  317. }