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.

bgemm_kernel_4x4_neoversev1_impl.c 14 kB

2 months ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430
  1. /***************************************************************************
  2. * Copyright (c) 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 <arm_neon.h>
  30. #include "common.h"
  31. #define INIT_C(M, N) mc##M##N = svdup_f32(0);
  32. #define MATMUL(M, N) mc##M##N = svbfmmla(mc##M##N, ma##M, mb##N);
  33. #define INIT_C_4x4 \
  34. do { \
  35. INIT_C(0, 0); \
  36. INIT_C(0, 1); \
  37. INIT_C(1, 0); \
  38. INIT_C(1, 1); \
  39. } while (0);
  40. #ifdef ALPHA_ONE
  41. #define UPDATE_C(PG16, PG32, PTR, TMP32, TMP16, SRC32) \
  42. do { \
  43. TMP32 = svreinterpret_f32_u32(svld1uh_u32((PG16), (uint16_t*)PTR)); \
  44. TMP32 = svadd_z((PG32), SRC32, TMP32); \
  45. TMP16 = svcvt_bf16_f32_z((PG32), TMP32); \
  46. TMP16 = svuzp1_bf16(TMP16, TMP16); \
  47. svst1_bf16((PG16), (PTR), TMP16); \
  48. } while (0)
  49. #else
  50. #define UPDATE_C(PG16, PG32, PTR, TMP32, TMP16, SRC32) \
  51. do { \
  52. TMP32 = svreinterpret_f32_u32(svld1uh_u32((PG16), (uint16_t*)PTR)); \
  53. TMP32 = svmad_z((PG32), svalpha, SRC32, TMP32); \
  54. TMP16 = svcvt_bf16_f32_z((PG32), TMP32); \
  55. TMP16 = svuzp1_bf16(TMP16, TMP16); \
  56. svst1_bf16((PG16), (PTR), TMP16); \
  57. } while (0)
  58. #endif
  59. #define ZIP_EVEN_ELEMENTS(PG, mc0, mc1, tmp, vc) \
  60. do { \
  61. (tmp) = svuzp1_f32((mc0), (mc1)); \
  62. (vc) = svcompact_f32((PG), (tmp)); \
  63. } while (0)
  64. #define ZIP_ODD_ELEMENTS(PG, mc0, mc1, tmp, vc) \
  65. do { \
  66. (tmp) = svuzp2_f32((mc0), (mc1)); \
  67. (vc) = svcompact_f32((PG), (tmp)); \
  68. } while (0)
  69. #define ACCUMULATE_LAST4_TO_FIRST4(M, N, TMP) \
  70. do { \
  71. TMP = svext_f32(mc##M##N, mc##M##N, 4); \
  72. mc##M##N = svadd_f32_z(svptrue_b32(), mc##M##N, (TMP)); \
  73. } while (0)
  74. #ifdef ALPHA_ONE
  75. int bgemm_kernel_neoversev1_alpha_one(BLASLONG m, BLASLONG n, BLASLONG k,
  76. FLOAT alpha, IFLOAT *A, IFLOAT *B,
  77. FLOAT *C, BLASLONG ldc)
  78. #else
  79. int bgemm_kernel_neoversev1_alpha(BLASLONG m, BLASLONG n, BLASLONG k,
  80. FLOAT alpha, IFLOAT *A, IFLOAT *B, FLOAT *C,
  81. BLASLONG ldc)
  82. #endif
  83. {
  84. BLASLONG pad_k = (k + 7) & ~7;
  85. svbfloat16_t ma0, ma1, mb0, mb1;
  86. svfloat32_t mc00, mc01, mc10, mc11, vc0, vc1, vc2, vc3;
  87. svfloat32_t tmp;
  88. #ifndef ALPHA_ONE
  89. bfloat16_t alpha_bf16;
  90. memcpy(&alpha_bf16, &alpha, sizeof(bfloat16_t));
  91. svfloat32_t svalpha = svdup_f32(vcvtah_f32_bf16(alpha_bf16));
  92. #endif
  93. svbool_t pg16_all = svptrue_b16();
  94. svbool_t pg32_first_1 = svwhilelt_b32(0, 1);
  95. svbool_t pg32_first_2 = svwhilelt_b32(0, 2);
  96. svbool_t pg32_first_4 = svwhilelt_b32(0, 4);
  97. svbool_t pg16_first_1 = svwhilelt_b16(0, 1);
  98. svbool_t pg16_first_2 = svwhilelt_b16(0, 2);
  99. svbool_t pg16_first_4 = svwhilelt_b16(0, 4);
  100. svbool_t pg32_select_first_2_per_quadword = svdupq_b32(1, 1, 0, 0);
  101. bfloat16_t *ptr_a = (bfloat16_t *)A;
  102. bfloat16_t *ptr_b = (bfloat16_t *)B;
  103. bfloat16_t *ptr_c = (bfloat16_t *)C;
  104. bfloat16_t *ptr_a0;
  105. bfloat16_t *ptr_b0;
  106. bfloat16_t *ptr_c0, *ptr_c1, *ptr_c2, *ptr_c3;
  107. svfloat32_t tmp32;
  108. svbfloat16_t tmp16;
  109. for (BLASLONG j = 0; j < n / 4; j++) {
  110. ptr_c0 = ptr_c;
  111. ptr_c1 = ptr_c0 + ldc;
  112. ptr_c2 = ptr_c1 + ldc;
  113. ptr_c3 = ptr_c2 + ldc;
  114. ptr_c += 4 * ldc;
  115. ptr_a = (bfloat16_t *)A;
  116. for (BLASLONG i = 0; i < m / 4; i++) {
  117. ptr_a0 = ptr_a;
  118. ptr_a += 4 * pad_k;
  119. ptr_b0 = ptr_b;
  120. INIT_C_4x4;
  121. for (BLASLONG p = 0; p < pad_k; p += 8) {
  122. ma0 = svld1_bf16(pg16_all, ptr_a0);
  123. ma1 = svld1_bf16(pg16_all, ptr_a0 + 16);
  124. mb0 = svld1_bf16(pg16_all, ptr_b0);
  125. mb1 = svld1_bf16(pg16_all, ptr_b0 + 16);
  126. MATMUL(0, 0);
  127. MATMUL(0, 1);
  128. MATMUL(1, 0);
  129. MATMUL(1, 1);
  130. ptr_a0 += 32;
  131. ptr_b0 += 32;
  132. }
  133. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  134. ACCUMULATE_LAST4_TO_FIRST4(0, 1, tmp);
  135. ACCUMULATE_LAST4_TO_FIRST4(1, 0, tmp);
  136. ACCUMULATE_LAST4_TO_FIRST4(1, 1, tmp);
  137. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc0);
  138. ZIP_ODD_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc1);
  139. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc01, mc11, tmp, vc2);
  140. ZIP_ODD_ELEMENTS(pg32_select_first_2_per_quadword, mc01, mc11, tmp, vc3);
  141. UPDATE_C(pg16_first_4, pg32_first_4, ptr_c0, tmp32, tmp16, vc0);
  142. UPDATE_C(pg16_first_4, pg32_first_4, ptr_c1, tmp32, tmp16, vc1);
  143. UPDATE_C(pg16_first_4, pg32_first_4, ptr_c2, tmp32, tmp16, vc2);
  144. UPDATE_C(pg16_first_4, pg32_first_4, ptr_c3, tmp32, tmp16, vc3);
  145. ptr_c0 += 4;
  146. ptr_c1 += 4;
  147. ptr_c2 += 4;
  148. ptr_c3 += 4;
  149. }
  150. if (m & 2) {
  151. ptr_a0 = ptr_a;
  152. ptr_a += 2 * pad_k;
  153. ptr_b0 = ptr_b;
  154. INIT_C(0, 0);
  155. INIT_C(0, 1);
  156. for (BLASLONG p = 0; p < pad_k; p += 8) {
  157. ma0 = svld1_bf16(pg16_all, ptr_a0);
  158. mb0 = svld1_bf16(pg16_all, ptr_b0);
  159. mb1 = svld1_bf16(pg16_all, ptr_b0 + 16);
  160. MATMUL(0, 0);
  161. MATMUL(0, 1);
  162. ptr_a0 += 16;
  163. ptr_b0 += 32;
  164. }
  165. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  166. ACCUMULATE_LAST4_TO_FIRST4(0, 1, tmp);
  167. vc0 = svuzp1(mc00, mc00);
  168. vc1 = svuzp2(mc00, mc00);
  169. vc2 = svuzp1(mc01, mc01);
  170. vc3 = svuzp2(mc01, mc01);
  171. UPDATE_C(pg16_first_2, pg32_first_2, ptr_c0, tmp32, tmp16, vc0);
  172. UPDATE_C(pg16_first_2, pg32_first_2, ptr_c1, tmp32, tmp16, vc1);
  173. UPDATE_C(pg16_first_2, pg32_first_2, ptr_c2, tmp32, tmp16, vc2);
  174. UPDATE_C(pg16_first_2, pg32_first_2, ptr_c3, tmp32, tmp16, vc3);
  175. ptr_c0 += 2;
  176. ptr_c1 += 2;
  177. ptr_c2 += 2;
  178. ptr_c3 += 2;
  179. }
  180. if (m & 1) {
  181. ptr_a0 = ptr_a;
  182. ptr_b0 = ptr_b;
  183. INIT_C(0, 0);
  184. INIT_C(0, 1);
  185. for (BLASLONG p = 0; p < pad_k; p += 8) {
  186. ma0 = svld1_bf16(pg16_all, ptr_a0);
  187. mb0 = svld1_bf16(pg16_all, ptr_b0);
  188. mb1 = svld1_bf16(pg16_all, ptr_b0 + 16);
  189. MATMUL(0, 0);
  190. MATMUL(0, 1);
  191. ptr_a0 += 16;
  192. ptr_b0 += 32;
  193. }
  194. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  195. ACCUMULATE_LAST4_TO_FIRST4(0, 1, tmp);
  196. // use compact is more straightforward
  197. vc1 = svuzp2(mc00, mc00);
  198. vc3 = svuzp2(mc01, mc01);
  199. UPDATE_C(pg16_first_1, pg32_first_1, ptr_c0, tmp32, tmp16, mc00);
  200. UPDATE_C(pg16_first_1, pg32_first_1, ptr_c1, tmp32, tmp16, vc1);
  201. UPDATE_C(pg16_first_1, pg32_first_1, ptr_c2, tmp32, tmp16, mc01);
  202. UPDATE_C(pg16_first_1, pg32_first_1, ptr_c3, tmp32, tmp16, vc3);
  203. }
  204. ptr_b += 4 * pad_k;
  205. }
  206. if (n & 2) {
  207. ptr_c0 = ptr_c;
  208. ptr_c1 = ptr_c0 + ldc;
  209. ptr_c += 2 * ldc;
  210. ptr_a = (bfloat16_t *)A;
  211. for (BLASLONG i = 0; i < m / 4; i++) {
  212. ptr_a0 = ptr_a;
  213. ptr_a += 4 * pad_k;
  214. ptr_b0 = ptr_b;
  215. INIT_C(0, 0);
  216. INIT_C(1, 0);
  217. for (BLASLONG p = 0; p < pad_k; p += 8) {
  218. ma0 = svld1_bf16(pg16_all, ptr_a0);
  219. ma1 = svld1_bf16(pg16_all, ptr_a0 + 16);
  220. mb0 = svld1_bf16(pg16_all, ptr_b0);
  221. MATMUL(0, 0);
  222. MATMUL(1, 0);
  223. ptr_a0 += 32;
  224. ptr_b0 += 16;
  225. }
  226. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  227. ACCUMULATE_LAST4_TO_FIRST4(1, 0, tmp);
  228. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc0);
  229. ZIP_ODD_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc2);
  230. UPDATE_C(pg16_first_4, pg32_first_4, ptr_c0, tmp32, tmp16, vc0);
  231. UPDATE_C(pg16_first_4, pg32_first_4, ptr_c1, tmp32, tmp16, vc2);
  232. ptr_c0 += 4;
  233. ptr_c1 += 4;
  234. }
  235. if (m & 2) {
  236. ptr_a0 = ptr_a;
  237. ptr_a += 2 * pad_k;
  238. ptr_b0 = ptr_b;
  239. INIT_C(0, 0);
  240. for (BLASLONG p = 0; p < pad_k; p += 8) {
  241. ma0 = svld1_bf16(pg16_all, ptr_a0);
  242. mb0 = svld1_bf16(pg16_all, ptr_b0);
  243. MATMUL(0, 0);
  244. ptr_a0 += 16;
  245. ptr_b0 += 16;
  246. }
  247. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  248. vc0 = svuzp1(mc00, mc00);
  249. vc1 = svuzp2(mc00, mc00);
  250. UPDATE_C(pg16_first_2, pg32_first_2, ptr_c0, tmp32, tmp16, vc0);
  251. UPDATE_C(pg16_first_2, pg32_first_2, ptr_c1, tmp32, tmp16, vc1);
  252. ptr_c0 += 2;
  253. ptr_c1 += 2;
  254. }
  255. if (m & 1) {
  256. ptr_a0 = ptr_a;
  257. ptr_b0 = ptr_b;
  258. INIT_C(0, 0);
  259. for (BLASLONG p = 0; p < pad_k; p += 8) {
  260. ma0 = svld1_bf16(pg16_all, ptr_a0);
  261. mb0 = svld1_bf16(pg16_all, ptr_b0);
  262. MATMUL(0, 0);
  263. ptr_a0 += 16;
  264. ptr_b0 += 16;
  265. }
  266. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  267. vc1 = svuzp2(mc00, mc00);
  268. UPDATE_C(pg16_first_1, pg32_first_1, ptr_c0, tmp32, tmp16, mc00);
  269. UPDATE_C(pg16_first_1, pg32_first_1, ptr_c1, tmp32, tmp16, vc1);
  270. }
  271. ptr_b += 2 * pad_k;
  272. }
  273. if (n & 1) { // TODO: this case seems a overhead. find out whether it's in our
  274. // case.
  275. ptr_c0 = ptr_c;
  276. ptr_a = (bfloat16_t *)A;
  277. for (BLASLONG i = 0; i < m / 4; i++) {
  278. ptr_a0 = ptr_a;
  279. ptr_a += 4 * pad_k;
  280. ptr_b0 = ptr_b;
  281. INIT_C(0, 0);
  282. INIT_C(1, 0);
  283. for (BLASLONG p = 0; p < pad_k; p += 8) {
  284. ma0 = svld1_bf16(pg16_all, ptr_a0);
  285. ma1 = svld1_bf16(pg16_all, ptr_a0 + 16);
  286. mb0 = svld1_bf16(pg16_all, ptr_b0);
  287. MATMUL(0, 0);
  288. MATMUL(1, 0);
  289. ptr_a0 += 32;
  290. ptr_b0 += 16;
  291. }
  292. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  293. ACCUMULATE_LAST4_TO_FIRST4(1, 0, tmp);
  294. ZIP_EVEN_ELEMENTS(pg32_select_first_2_per_quadword, mc00, mc10, tmp, vc0);
  295. UPDATE_C(pg16_first_4, pg32_first_4, ptr_c0, tmp32, tmp16, vc0);
  296. ptr_c0 += 4;
  297. }
  298. if (m & 2) {
  299. ptr_a0 = ptr_a;
  300. ptr_a += 2 * pad_k;
  301. ptr_b0 = ptr_b;
  302. INIT_C(0, 0);
  303. for (BLASLONG p = 0; p < pad_k; p += 8) {
  304. ma0 = svld1_bf16(pg16_all, ptr_a0);
  305. mb0 = svld1_bf16(pg16_all, ptr_b0);
  306. MATMUL(0, 0);
  307. ptr_a0 += 16;
  308. ptr_b0 += 16;
  309. }
  310. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  311. vc0 = svuzp1(mc00, mc00);
  312. UPDATE_C(pg16_first_2, pg32_first_2, ptr_c0, tmp32, tmp16, vc0);
  313. ptr_c0 += 2;
  314. }
  315. if (m & 1) {
  316. ptr_a0 = ptr_a;
  317. ptr_b0 = ptr_b;
  318. INIT_C(0, 0);
  319. for (BLASLONG p = 0; p < pad_k; p += 8) {
  320. ma0 = svld1_bf16(pg16_all, ptr_a0);
  321. mb0 = svld1_bf16(pg16_all, ptr_b0);
  322. MATMUL(0, 0);
  323. ptr_a0 += 16;
  324. ptr_b0 += 16;
  325. }
  326. ACCUMULATE_LAST4_TO_FIRST4(0, 0, tmp);
  327. UPDATE_C(pg16_first_1, pg32_first_1, ptr_c0, tmp32, tmp16, mc00);
  328. }
  329. }
  330. return 0;
  331. }