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.

dgemm_small_kernel_nn_power10.c 30 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923
  1. /***************************************************************************
  2. Copyright (c) 2021, 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. #include <altivec.h>
  29. typedef __vector unsigned char vec_t;
  30. #if !__has_builtin(__builtin_vsx_assemble_pair)
  31. #define __builtin_vsx_assemble_pair __builtin_mma_assemble_pair
  32. #endif
  33. #if !defined(B0)
  34. #define SAVE_4x2_ACC(ACC, N, M) \
  35. __builtin_mma_disassemble_acc((void *)result, ACC); \
  36. rc0 = vec_xl(0, C+(N+0)*ldc+M); \
  37. rc0 = vec_mul(rc0, vbeta); \
  38. result[0] = vec_madd(result[0], valpha, rc0); \
  39. vec_xst(result[0], 0, C+(N+0)*ldc+M); \
  40. rc0 = vec_xl(0, C+(N+1)*ldc+M); \
  41. rc0 = vec_mul(rc0, vbeta); \
  42. result[1] = vec_madd(result[1], valpha, rc0); \
  43. vec_xst(result[1], 0, C+(N+1)*ldc+M); \
  44. rc0 = vec_xl(0, C+(N+2)*ldc+M); \
  45. rc0 = vec_mul(rc0, vbeta); \
  46. result[2] = vec_madd(result[2], valpha, rc0); \
  47. vec_xst(result[2], 0, C+(N+2)*ldc+M); \
  48. rc0 = vec_xl(0, C+(N+3)*ldc+M); \
  49. rc0 = vec_mul(rc0, vbeta); \
  50. result[3] = vec_madd(result[3], valpha, rc0); \
  51. vec_xst(result[3], 0, C+(N+3)*ldc+M);
  52. #define SAVE_4x1_ACC(ACC, N, M) \
  53. __builtin_mma_disassemble_acc((void *)result, ACC); \
  54. rc0 = vec_xl_len(C+(N+0)*ldc+M, 8); \
  55. rc0 = vec_mul(rc0, vbeta); \
  56. result[0] = vec_madd(result[0], valpha, rc0); \
  57. vec_xst_len(result[0], C+(N+0)*ldc+M, 8); \
  58. rc0 = vec_xl_len(C+(N+1)*ldc+M, 8); \
  59. rc0 = vec_mul(rc0, vbeta); \
  60. result[1] = vec_madd(result[1], valpha, rc0); \
  61. vec_xst_len(result[1], C+(N+1)*ldc+M, 8); \
  62. rc0 = vec_xl_len(C+(N+2)*ldc+M, 8); \
  63. rc0 = vec_mul(rc0, vbeta); \
  64. result[2] = vec_madd(result[2], valpha, rc0); \
  65. vec_xst_len(result[2], C+(N+2)*ldc+M, 8); \
  66. rc0 = vec_xl_len(C+(N+3)*ldc+M, 8); \
  67. rc0 = vec_mul(rc0, vbeta); \
  68. result[3] = vec_madd(result[3], valpha, rc0); \
  69. vec_xst_len(result[3], C+(N+3)*ldc+M, 8);
  70. #define SAVE_2x2_ACC(ACC, N, M) \
  71. __builtin_mma_disassemble_acc((void *)result, ACC); \
  72. rc0 = vec_xl(0, C+(N+0)*ldc+M); \
  73. rc0 = vec_mul(rc0, vbeta); \
  74. result[0] = vec_madd(result[0], valpha, rc0); \
  75. vec_xst(result[0], 0, C+(N+0)*ldc+M); \
  76. rc0 = vec_xl(0, C+(N+1)*ldc+M); \
  77. rc0 = vec_mul(rc0, vbeta); \
  78. result[1] = vec_madd(result[1], valpha, rc0); \
  79. vec_xst(result[1], 0, C+(N+1)*ldc+M);
  80. #define SAVE_2x1_ACC(ACC, N, M) \
  81. __builtin_mma_disassemble_acc((void *)result, ACC); \
  82. rc0 = vec_xl_len(C+(N+0)*ldc+M, 8); \
  83. rc0 = vec_mul(rc0, vbeta); \
  84. result[0] = vec_madd(result[0], valpha, rc0); \
  85. vec_xst_len(result[0], C+(N+0)*ldc+M, 8); \
  86. rc0 = vec_xl_len(C+(N+1)*ldc+M, 8); \
  87. rc0 = vec_mul(rc0, vbeta); \
  88. result[1] = vec_madd(result[1], valpha, rc0); \
  89. vec_xst_len(result[1], C+(N+1)*ldc+M, 8);
  90. #define SAVE_1x4_VSR(result, N, M) \
  91. rc0 = vec_xl(0, C+((N)*ldc)+M); \
  92. rc0 = vec_mul(rc0, vbeta); \
  93. result = vec_madd(result, valpha, rc0); \
  94. vec_xst(result, 0, C+((N)*ldc)+M);
  95. #else
  96. #define SAVE_4x2_ACC(ACC, N, M) \
  97. __builtin_mma_disassemble_acc((void *)result, ACC); \
  98. result[0] = vec_mul(result[0], valpha); \
  99. vec_xst(result[0], 0, C+(N+0)*ldc+M); \
  100. result[1] = vec_mul(result[1], valpha); \
  101. vec_xst(result[1], 0, C+(N+1)*ldc+M); \
  102. result[2] = vec_mul(result[2], valpha); \
  103. vec_xst(result[2], 0, C+(N+2)*ldc+M); \
  104. result[3] = vec_mul(result[3], valpha); \
  105. vec_xst(result[3], 0, C+(N+3)*ldc+M);
  106. #define SAVE_4x1_ACC(ACC, N, M) \
  107. __builtin_mma_disassemble_acc((void *)result, ACC); \
  108. result[0] = vec_mul(result[0], valpha); \
  109. vec_xst_len(result[0], C+(N+0)*ldc+M, 8); \
  110. result[1] = vec_mul(result[1], valpha); \
  111. vec_xst_len(result[1], C+(N+1)*ldc+M, 8); \
  112. result[2] = vec_mul(result[2], valpha); \
  113. vec_xst_len(result[2], C+(N+2)*ldc+M, 8); \
  114. result[3] = vec_mul(result[3], valpha); \
  115. vec_xst_len(result[3], C+(N+3)*ldc+M, 8);
  116. #define SAVE_2x2_ACC(ACC, N, M) \
  117. __builtin_mma_disassemble_acc((void *)result, ACC); \
  118. result[0] = vec_mul(result[0], valpha); \
  119. vec_xst(result[0], 0, C+(N+0)*ldc+M); \
  120. result[1] = vec_mul(result[1], valpha); \
  121. vec_xst(result[1], 0, C+(N+1)*ldc+M);
  122. #define SAVE_2x1_ACC(ACC, N, M) \
  123. __builtin_mma_disassemble_acc((void *)result, ACC); \
  124. result[0] = vec_mul(result[0], valpha); \
  125. vec_xst_len(result[0], C+(N+0)*ldc+M, 8); \
  126. result[1] = vec_mul(result[1], valpha); \
  127. vec_xst_len(result[1], C+(N+1)*ldc+M, 8);
  128. #define SAVE_1x4_VSR(result, N, M) \
  129. result = vec_mul(result, valpha); \
  130. vec_xst(result, 0, C+((N)*ldc)+M);
  131. #endif
  132. #define INIT_8ACCS() \
  133. __builtin_mma_xxsetaccz(&acc0); \
  134. __builtin_mma_xxsetaccz(&acc1); \
  135. __builtin_mma_xxsetaccz(&acc2); \
  136. __builtin_mma_xxsetaccz(&acc3); \
  137. __builtin_mma_xxsetaccz(&acc4); \
  138. __builtin_mma_xxsetaccz(&acc5); \
  139. __builtin_mma_xxsetaccz(&acc6); \
  140. __builtin_mma_xxsetaccz(&acc7);
  141. #define INIT_4ACCS() \
  142. __builtin_mma_xxsetaccz(&acc0); \
  143. __builtin_mma_xxsetaccz(&acc1); \
  144. __builtin_mma_xxsetaccz(&acc2); \
  145. __builtin_mma_xxsetaccz(&acc3);
  146. #define INIT_2ACCS() \
  147. __builtin_mma_xxsetaccz(&acc0); \
  148. __builtin_mma_xxsetaccz(&acc1);
  149. #define INIT_1ACC() __builtin_mma_xxsetaccz(&acc0);
  150. #if (defined(__GNUC__) && (__GNUC__ == 10 || (__GNUC__ == 11 && __GNUC_MINOR__ <= 2)))
  151. #if defined(_AIX)
  152. #define LOAD_PAIR(pair, v0, v1) \
  153. __builtin_vsx_assemble_pair(&pair, (vec_t)v0, (vec_t)v1);
  154. #else
  155. #define LOAD_PAIR(pair, v0, v1) \
  156. __builtin_vsx_assemble_pair(&pair, (vec_t)v1, (vec_t)v0);
  157. #endif
  158. #else
  159. #define LOAD_PAIR(pair, v0, v1) \
  160. __builtin_vsx_build_pair(&pair, (vec_t)v0, (vec_t)v1);
  161. #endif
  162. #define LOAD_A_1x8(K, M) \
  163. ra0 = vec_xl(0, A+((K)*lda)+M+0); \
  164. ra1 = vec_xl(0, A+((K)*lda)+M+2); \
  165. ra2 = vec_xl(0, A+((K)*lda)+M+4); \
  166. ra3 = vec_xl(0, A+((K)*lda)+M+6);
  167. #define LOAD_A_1x4(K, M) \
  168. ra0 = vec_xl(0, A+((K)*lda)+M+0); \
  169. ra1 = vec_xl(0, A+((K)*lda)+M+2); \
  170. #define LOAD_A_1x2(K, M) \
  171. ra0 = vec_xl(0, A+((K)*lda)+M+0);
  172. #define LOAD_A_1x1(K, M) \
  173. ra0 = vec_splats(A[((K)*lda)+M+0]);
  174. #define LOAD_BTP_8x2(N, K) \
  175. rb0 = vec_xl(0, B+(N+0)*ldb+K+0); \
  176. rb1 = vec_xl(0, B+(N+1)*ldb+K+0); \
  177. rb2 = vec_xl(0, B+(N+2)*ldb+K+0); \
  178. rb3 = vec_xl(0, B+(N+3)*ldb+K+0); \
  179. t0 = vec_mergeh(rb0, rb1); \
  180. t1 = vec_mergeh(rb2, rb3); \
  181. LOAD_PAIR(pb0, t0, t1); \
  182. t0 = vec_mergel(rb0, rb1); \
  183. t1 = vec_mergel(rb2, rb3); \
  184. LOAD_PAIR(pb2, t0, t1); \
  185. rb4 = vec_xl(0, B+(N+4)*ldb+K+0); \
  186. rb5 = vec_xl(0, B+(N+5)*ldb+K+0); \
  187. rb6 = vec_xl(0, B+(N+6)*ldb+K+0); \
  188. rb7 = vec_xl(0, B+(N+7)*ldb+K+0); \
  189. t0 = vec_mergeh(rb4, rb5); \
  190. t1 = vec_mergeh(rb6, rb7); \
  191. LOAD_PAIR(pb1, t0, t1); \
  192. t0 = vec_mergel(rb4, rb5); \
  193. t1 = vec_mergel(rb6, rb7); \
  194. LOAD_PAIR(pb3, t0, t1);
  195. #define LOAD_BTP_8x1(N, K) \
  196. rb0 = vec_xor(rb0, rb0); \
  197. rb0 = vec_insert(B[(N+0)*ldb+K], rb0, 0); \
  198. rb0 = vec_insert(B[(N+1)*ldb+K], rb0, 1); \
  199. rb1 = vec_xor(rb1, rb1); \
  200. rb1 = vec_insert(B[(N+2)*ldb+K], rb1, 0); \
  201. rb1 = vec_insert(B[(N+3)*ldb+K], rb1, 1); \
  202. LOAD_PAIR(pb0, rb0, rb1); \
  203. rb2 = vec_xor(rb2, rb2); \
  204. rb2 = vec_insert(B[(N+4)*ldb+K], rb2, 0); \
  205. rb2 = vec_insert(B[(N+5)*ldb+K], rb2, 1); \
  206. rb3 = vec_xor(rb3, rb3); \
  207. rb3 = vec_insert(B[(N+6)*ldb+K], rb3, 0); \
  208. rb3 = vec_insert(B[(N+7)*ldb+K], rb3, 1); \
  209. LOAD_PAIR(pb1, rb2, rb3);
  210. #define LOAD_BTP_4x2(N, K) \
  211. rb0 = vec_xl(0, B+(N+0)*ldb+K+0); \
  212. rb1 = vec_xl(0, B+(N+1)*ldb+K+0); \
  213. rb2 = vec_xl(0, B+(N+2)*ldb+K+0); \
  214. rb3 = vec_xl(0, B+(N+3)*ldb+K+0); \
  215. t0 = vec_mergeh(rb0, rb1); \
  216. t1 = vec_mergeh(rb2, rb3); \
  217. LOAD_PAIR(pb0, t0, t1); \
  218. t0 = vec_mergel(rb0, rb1); \
  219. t1 = vec_mergel(rb2, rb3); \
  220. LOAD_PAIR(pb1, t0, t1);
  221. #define LOAD_BTP_4x1(N, K) \
  222. rb0 = vec_xor(rb0, rb0); \
  223. rb0 = vec_insert(B[(N+0)*ldb+K], rb0, 0); \
  224. rb0 = vec_insert(B[(N+1)*ldb+K], rb0, 1); \
  225. rb1 = vec_xor(rb1, rb1); \
  226. rb1 = vec_insert(B[(N+2)*ldb+K], rb1, 0); \
  227. rb1 = vec_insert(B[(N+3)*ldb+K], rb1, 1); \
  228. LOAD_PAIR(pb0, rb0, rb1);
  229. #define LOAD_BTP_2x2(N, K) \
  230. rb0 = vec_xl(0, B+(N+0)*ldb+K+0); \
  231. rb1 = vec_xl(0, B+(N+1)*ldb+K+0); \
  232. t0 = vec_mergeh(rb0, rb1); \
  233. __builtin_vsx_assemble_pair(&pb0, (vec_t)t0, (vec_t)t0); \
  234. t1 = vec_mergel(rb0, rb1); \
  235. __builtin_vsx_assemble_pair(&pb1, (vec_t)t1, (vec_t)t1);
  236. #define LOAD_BTP_2x1(N, K) \
  237. rb0 = vec_xor(rb0, rb0); \
  238. rb0 = vec_insert(B[(N+0)*ldb+K], rb0, 0); \
  239. rb0 = vec_insert(B[(N+1)*ldb+K], rb0, 1); \
  240. __builtin_vsx_assemble_pair(&pb0, (vec_t)rb0, (vec_t)rb0);
  241. #define LOAD_B_1x1(N, K) \
  242. rb0 = vec_splats(B[((N)*ldb)+K]);
  243. #define KERNEL_MMA_8ACC(b0, b1, b2, b3, b4, b5, b6, b7, \
  244. a0, a1, a2, a3, a4, a5, a6, a7) \
  245. __builtin_mma_xvf64gerpp(&acc0, b0, (vec_t)a0); \
  246. __builtin_mma_xvf64gerpp(&acc1, b1, (vec_t)a1); \
  247. __builtin_mma_xvf64gerpp(&acc2, b2, (vec_t)a2); \
  248. __builtin_mma_xvf64gerpp(&acc3, b3, (vec_t)a3); \
  249. __builtin_mma_xvf64gerpp(&acc4, b4, (vec_t)a4); \
  250. __builtin_mma_xvf64gerpp(&acc5, b5, (vec_t)a5); \
  251. __builtin_mma_xvf64gerpp(&acc6, b6, (vec_t)a6); \
  252. __builtin_mma_xvf64gerpp(&acc7, b7, (vec_t)a7);
  253. #define KERNEL_MMA_4ACC(b0, b1, b2, b3, a0, a1, a2, a3) \
  254. __builtin_mma_xvf64gerpp(&acc0, b0, (vec_t)a0); \
  255. __builtin_mma_xvf64gerpp(&acc1, b1, (vec_t)a1); \
  256. __builtin_mma_xvf64gerpp(&acc2, b2, (vec_t)a2); \
  257. __builtin_mma_xvf64gerpp(&acc3, b3, (vec_t)a3);
  258. #define KERNEL_MMA_2ACC(b0, b1, a0, a1) \
  259. __builtin_mma_xvf64gerpp(&acc0, b0, (vec_t)a0); \
  260. __builtin_mma_xvf64gerpp(&acc1, b1, (vec_t)a1);
  261. #define KERNEL_MMA_1ACC(b0, a0) \
  262. __builtin_mma_xvf64gerpp(&acc0, b0, (vec_t)a0);
  263. #define KERNEL_VMADD_4VSR(a0, a1, a2, a3, b0, b1, b2, b3) \
  264. result = vec_madd(a0, b0, result); \
  265. result1 = vec_madd(a1, b1, result1); \
  266. result2 = vec_madd(a2, b2, result2); \
  267. result3 = vec_madd(a3, b3, result3);
  268. #define KERNEL_VMADD_2VSR(a0, a1, b0, b1) \
  269. result = vec_madd(a0, b0, result); \
  270. result1 = vec_madd(a1, b1, result1);
  271. #define KERNEL_VMADD_1VSR(a0, b0) \
  272. result = vec_madd(a0, b0, result);
  273. #define PACK_B(pb0, pb1, offset) \
  274. *((__vector_pair *)(void *)(packB+(k*8)+0+offset)) = pb0; \
  275. *((__vector_pair *)(void *)(packB+(k*8)+4+offset)) = pb1;
  276. #define LOAD_PACKED_B(pb0, pb1, offset) \
  277. pb0 = *((__vector_pair *)((void *)(packB+(k*8)+0+offset))); \
  278. pb1 = *((__vector_pair *)((void *)(packB+(k*8)+4+offset)));
  279. #ifdef B0
  280. int CNAME(BLASLONG M, BLASLONG N, BLASLONG K, IFLOAT * A, BLASLONG lda, FLOAT alpha, IFLOAT * B, BLASLONG ldb, FLOAT * C, BLASLONG ldc)
  281. #else
  282. int CNAME(BLASLONG M, BLASLONG N, BLASLONG K, IFLOAT * A, BLASLONG lda, FLOAT alpha, IFLOAT * B, BLASLONG ldb, FLOAT beta, FLOAT * C, BLASLONG ldc)
  283. #endif
  284. {
  285. BLASLONG m, n, k;
  286. BLASLONG m8 = M & ~7;
  287. BLASLONG m4 = M & ~3;
  288. BLASLONG m2 = M & ~1;
  289. BLASLONG n8 = N & ~7;
  290. BLASLONG n4 = N & ~3;
  291. BLASLONG n2 = N & ~1;
  292. BLASLONG k2 = K & ~1;
  293. #if defined(__GNUC__) && !defined(__clang__)
  294. int has_packing = (M >= 32 && N >= 32 && K >= 32) ? 1 : 0;
  295. #else
  296. int has_packing = 0;
  297. #endif
  298. double *packB;
  299. if (has_packing) packB = (double *)malloc(K*8*sizeof(double));
  300. vector double valpha = vec_splats(alpha);
  301. #if !defined(B0)
  302. vector double vbeta = vec_splats(beta);
  303. #endif
  304. for (n = 0; n < n8; n += 8) {
  305. for (m = 0; m < m8; m += 8) {
  306. __vector_quad acc0, acc1, acc2, acc3, acc4, acc5, acc6, acc7;
  307. INIT_8ACCS();
  308. register vector double ra0, ra1, ra2, ra3;
  309. register vector double rb0, rb1, rb2, rb3, rb4, rb5, rb6, rb7;
  310. register vector double t0, t1;
  311. __vector_pair pb0, pb1, pb2, pb3;
  312. if (has_packing) {
  313. if (m == 0) {
  314. for (k = 0; k < k2; k += 2) {
  315. LOAD_A_1x8(k, m);
  316. LOAD_BTP_8x2(n, k);
  317. KERNEL_MMA_8ACC(pb0, pb1, pb0, pb1, pb0, pb1, pb0, pb1,
  318. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  319. PACK_B(pb0, pb1, 0);
  320. LOAD_A_1x8(k+1, m);
  321. KERNEL_MMA_8ACC(pb2, pb3, pb2, pb3, pb2, pb3, pb2, pb3,
  322. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  323. PACK_B(pb2, pb3, 8);
  324. }
  325. for (; k < K; k++) {
  326. LOAD_A_1x8(k, m);
  327. LOAD_BTP_8x1(n, k);
  328. KERNEL_MMA_8ACC(pb0, pb1, pb0, pb1, pb0, pb1, pb0, pb1,
  329. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  330. PACK_B(pb0, pb1, 0);
  331. }
  332. } else {
  333. for (k = 0; k < k2; k += 2) {
  334. LOAD_A_1x8(k, m);
  335. LOAD_PACKED_B(pb0, pb1, 0);
  336. KERNEL_MMA_8ACC(pb0, pb1, pb0, pb1, pb0, pb1, pb0, pb1,
  337. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  338. LOAD_A_1x8(k+1, m);
  339. LOAD_PACKED_B(pb2, pb3, 8);
  340. KERNEL_MMA_8ACC(pb2, pb3, pb2, pb3, pb2, pb3, pb2, pb3,
  341. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  342. }
  343. for (; k < K; k++) {
  344. LOAD_A_1x8(k, m);
  345. LOAD_PACKED_B(pb0, pb1, 0);
  346. KERNEL_MMA_8ACC(pb0, pb1, pb0, pb1, pb0, pb1, pb0, pb1,
  347. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  348. }
  349. }
  350. } else {
  351. for (k = 0; k < k2; k += 2) {
  352. LOAD_A_1x8(k, m);
  353. LOAD_BTP_8x2(n, k);
  354. KERNEL_MMA_8ACC(pb0, pb1, pb0, pb1, pb0, pb1, pb0, pb1,
  355. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  356. LOAD_A_1x8(k+1, m);
  357. KERNEL_MMA_8ACC(pb2, pb3, pb2, pb3, pb2, pb3, pb2, pb3,
  358. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  359. }
  360. for (; k < K; k++) {
  361. LOAD_A_1x8(k, m);
  362. LOAD_BTP_8x1(n, k);
  363. KERNEL_MMA_8ACC(pb0, pb1, pb0, pb1, pb0, pb1, pb0, pb1,
  364. ra0, ra0, ra1, ra1, ra2, ra2, ra3, ra3);
  365. }
  366. }
  367. #if !defined(B0)
  368. register vector double rc0;
  369. #endif
  370. vector double result[4];
  371. SAVE_4x2_ACC(&acc0, n+0, m+0);
  372. SAVE_4x2_ACC(&acc2, n+0, m+2);
  373. SAVE_4x2_ACC(&acc4, n+0, m+4);
  374. SAVE_4x2_ACC(&acc6, n+0, m+6);
  375. SAVE_4x2_ACC(&acc1, n+4, m+0);
  376. SAVE_4x2_ACC(&acc3, n+4, m+2);
  377. SAVE_4x2_ACC(&acc5, n+4, m+4);
  378. SAVE_4x2_ACC(&acc7, n+4, m+6);
  379. }
  380. for (; m < m4; m += 4) {
  381. __vector_quad acc0, acc1, acc2, acc3;
  382. INIT_4ACCS();
  383. register vector double ra0, ra1;
  384. register vector double rb0, rb1, rb2, rb3, rb4, rb5, rb6, rb7;
  385. register vector double t0, t1;
  386. __vector_pair pb0, pb1, pb2, pb3;
  387. if (!has_packing) {
  388. for (k = 0; k < k2; k += 2) {
  389. LOAD_A_1x4(k, m);
  390. LOAD_BTP_8x2(n, k);
  391. KERNEL_MMA_4ACC(pb0, pb1, pb0, pb1, ra0, ra0, ra1, ra1);
  392. LOAD_A_1x4(k+1, m);
  393. KERNEL_MMA_4ACC(pb2, pb3, pb2, pb3, ra0, ra0, ra1, ra1);
  394. }
  395. for (; k < K; k++) {
  396. LOAD_A_1x4(k, m);
  397. LOAD_BTP_8x1(n, k);
  398. KERNEL_MMA_4ACC(pb0, pb1, pb0, pb1, ra0, ra0, ra1, ra1);
  399. }
  400. } else {
  401. for (k = 0; k < k2; k += 2) {
  402. LOAD_A_1x4(k, m);
  403. LOAD_PACKED_B(pb0, pb1, 0);
  404. KERNEL_MMA_4ACC(pb0, pb1, pb0, pb1, ra0, ra0, ra1, ra1);
  405. LOAD_A_1x4(k+1, m);
  406. LOAD_PACKED_B(pb2, pb3, 8);
  407. KERNEL_MMA_4ACC(pb2, pb3, pb2, pb3, ra0, ra0, ra1, ra1);
  408. }
  409. for (; k < K; k++) {
  410. LOAD_A_1x4(k, m);
  411. LOAD_PACKED_B(pb0, pb1, 0);
  412. KERNEL_MMA_4ACC(pb0, pb1, pb0, pb1, ra0, ra0, ra1, ra1);
  413. }
  414. }
  415. #if !defined(B0)
  416. register vector double rc0;
  417. #endif
  418. vector double result[4];
  419. SAVE_4x2_ACC(&acc0, n+0, m+0);
  420. SAVE_4x2_ACC(&acc2, n+0, m+2);
  421. SAVE_4x2_ACC(&acc1, n+4, m+0);
  422. SAVE_4x2_ACC(&acc3, n+4, m+2);
  423. }
  424. for (; m < m2; m += 2) {
  425. __vector_quad acc0, acc1, acc2, acc3;
  426. INIT_4ACCS();
  427. register vector double ra0;
  428. register vector double rb0, rb1, rb2, rb3, rb4, rb5, rb6, rb7;
  429. register vector double t0, t1;
  430. __vector_pair pb0, pb1, pb2, pb3;
  431. if (!has_packing) {
  432. for (k = 0; k < k2; k += 2) {
  433. LOAD_A_1x2(k, m);
  434. LOAD_BTP_8x2(n, k);
  435. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  436. LOAD_A_1x2(k+1, m);
  437. KERNEL_MMA_2ACC(pb2, pb3, ra0, ra0);
  438. }
  439. for (; k < K; k++) {
  440. LOAD_A_1x2(k, m);
  441. LOAD_BTP_8x1(n, k);
  442. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  443. }
  444. } else {
  445. for (k = 0; k < k2; k += 2) {
  446. LOAD_A_1x2(k, m);
  447. LOAD_PACKED_B(pb0, pb1, 0);
  448. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  449. LOAD_A_1x2(k+1, m);
  450. LOAD_PACKED_B(pb2, pb3, 8);
  451. KERNEL_MMA_2ACC(pb2, pb3, ra0, ra0);
  452. }
  453. for (; k < K; k++) {
  454. LOAD_A_1x2(k, m);
  455. LOAD_PACKED_B(pb0, pb1, 0);
  456. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  457. }
  458. }
  459. #if !defined(B0)
  460. register vector double rc0;
  461. #endif
  462. vector double result[4];
  463. SAVE_4x2_ACC(&acc0, n+0, m+0);
  464. SAVE_4x2_ACC(&acc1, n+4, m+0);
  465. }
  466. for (; m < M; m++) {
  467. __vector_quad acc0, acc1;
  468. INIT_2ACCS();
  469. register vector double ra0;
  470. register vector double rb0, rb1, rb2, rb3, rb4, rb5, rb6, rb7;
  471. register vector double t0, t1;
  472. __vector_pair pb0, pb1, pb2, pb3;
  473. if (!has_packing) {
  474. for (k = 0; k < k2; k += 2) {
  475. LOAD_A_1x1(k, m);
  476. LOAD_BTP_8x2(n, k);
  477. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  478. LOAD_A_1x1(k+1, m);
  479. KERNEL_MMA_2ACC(pb2, pb3, ra0, ra0);
  480. }
  481. for (; k < K; k++) {
  482. LOAD_A_1x1(k, m);
  483. LOAD_BTP_8x1(n, k);
  484. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  485. }
  486. } else {
  487. for (k = 0; k < k2; k += 2) {
  488. LOAD_A_1x1(k, m);
  489. LOAD_PACKED_B(pb0, pb1, 0);
  490. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  491. LOAD_A_1x1(k+1, m);
  492. LOAD_PACKED_B(pb2, pb3, 8);
  493. KERNEL_MMA_2ACC(pb2, pb3, ra0, ra0);
  494. }
  495. for (; k < K; k++) {
  496. LOAD_A_1x1(k, m);
  497. LOAD_PACKED_B(pb0, pb1, 0);
  498. KERNEL_MMA_2ACC(pb0, pb1, ra0, ra0);
  499. }
  500. }
  501. #if !defined(B0)
  502. register vector double rc0;
  503. #endif
  504. vector double result[4];
  505. SAVE_4x1_ACC(&acc0, n+0, m+0);
  506. SAVE_4x1_ACC(&acc1, n+4, m+0);
  507. }
  508. }
  509. for (; n < n4; n += 4) {
  510. for (m = 0; m < m8; m += 8) {
  511. __vector_quad acc0, acc1, acc2, acc3;
  512. INIT_4ACCS();
  513. register vector double ra0, ra1, ra2, ra3;
  514. register vector double rb0, rb1, rb2, rb3;
  515. register vector double t0, t1;
  516. __vector_pair pb0, pb1;
  517. for (k = 0; k < k2; k += 2) {
  518. LOAD_A_1x8(k, m);
  519. LOAD_BTP_4x2(n, k);
  520. KERNEL_MMA_4ACC(pb0, pb0, pb0, pb0, ra0, ra1, ra2, ra3);
  521. LOAD_A_1x8(k+1, m);
  522. KERNEL_MMA_4ACC(pb1, pb1, pb1, pb1, ra0, ra1, ra2, ra3);
  523. }
  524. for (; k < K; k++) {
  525. LOAD_A_1x8(k, m);
  526. LOAD_BTP_4x1(n, k);
  527. KERNEL_MMA_4ACC(pb0, pb0, pb0, pb0, ra0, ra1, ra2, ra3);
  528. }
  529. #if !defined(B0)
  530. register vector double rc0;
  531. #endif
  532. vector double result[4];
  533. SAVE_4x2_ACC(&acc0, n+0, m+0);
  534. SAVE_4x2_ACC(&acc1, n+0, m+2);
  535. SAVE_4x2_ACC(&acc2, n+0, m+4);
  536. SAVE_4x2_ACC(&acc3, n+0, m+6);
  537. }
  538. for (; m < m4; m += 4) {
  539. __vector_quad acc0, acc1;
  540. INIT_2ACCS();
  541. register vector double ra0, ra1;
  542. register vector double rb0, rb1, rb2, rb3;
  543. register vector double t0, t1;
  544. __vector_pair pb0, pb1;
  545. for (k = 0; k < k2; k += 2) {
  546. LOAD_A_1x4(k, m);
  547. LOAD_BTP_4x2(n, k);
  548. KERNEL_MMA_2ACC(pb0, pb0, ra0, ra1);
  549. LOAD_A_1x4(k+1, m);
  550. KERNEL_MMA_2ACC(pb1, pb1, ra0, ra1);
  551. }
  552. for (; k < K; k++) {
  553. LOAD_A_1x4(k, m);
  554. LOAD_BTP_4x1(n, k);
  555. KERNEL_MMA_2ACC(pb0, pb0, ra0, ra1);
  556. }
  557. #if !defined(B0)
  558. register vector double rc0;
  559. #endif
  560. vector double result[4];
  561. SAVE_4x2_ACC(&acc0, n+0, m+0);
  562. SAVE_4x2_ACC(&acc1, n+0, m+2);
  563. }
  564. for (; m < m2; m += 2) {
  565. __vector_quad acc0;
  566. INIT_1ACC();
  567. register vector double ra0;
  568. register vector double rb0, rb1, rb2, rb3;
  569. register vector double t0, t1;
  570. __vector_pair pb0, pb1;
  571. for (k = 0; k < k2; k += 2) {
  572. LOAD_A_1x2(k, m);
  573. LOAD_BTP_4x2(n, k);
  574. KERNEL_MMA_1ACC(pb0, ra0);
  575. LOAD_A_1x2(k+1, m);
  576. KERNEL_MMA_1ACC(pb1, ra0);
  577. }
  578. for (; k < K; k++) {
  579. LOAD_A_1x2(k, m);
  580. LOAD_BTP_4x1(n, k);
  581. KERNEL_MMA_1ACC(pb0, ra0);
  582. }
  583. #if !defined(B0)
  584. register vector double rc0;
  585. #endif
  586. vector double result[4];
  587. SAVE_4x2_ACC(&acc0, n, m);
  588. }
  589. for (; m < M; m++) {
  590. __vector_quad acc0;
  591. INIT_1ACC();
  592. register vector double ra0;
  593. register vector double rb0, rb1, rb2, rb3;
  594. register vector double t0, t1;
  595. __vector_pair pb0, pb1;
  596. for (k = 0; k < k2; k += 2) {
  597. LOAD_A_1x1(k, m);
  598. LOAD_BTP_4x2(n, k);
  599. KERNEL_MMA_1ACC(pb0, ra0);
  600. LOAD_A_1x1(k+1, m);
  601. KERNEL_MMA_1ACC(pb1, ra0);
  602. }
  603. for (; k < K; k++) {
  604. LOAD_A_1x1(k, m);
  605. LOAD_BTP_4x1(n, k);
  606. KERNEL_MMA_1ACC(pb0, ra0);
  607. }
  608. #if !defined(B0)
  609. register vector double rc0;
  610. #endif
  611. vector double result[4];
  612. SAVE_4x1_ACC(&acc0, n, m);
  613. }
  614. }
  615. for (; n < n2; n += 2) {
  616. for (m = 0; m < m8; m += 8) {
  617. __vector_quad acc0, acc1, acc2, acc3;
  618. INIT_4ACCS();
  619. register vector double ra0, ra1, ra2, ra3;
  620. register vector double rb0, rb1;
  621. register vector double t0, t1;
  622. __vector_pair pb0, pb1;
  623. for (k = 0; k < k2; k += 2) {
  624. LOAD_A_1x8(k, m);
  625. LOAD_BTP_2x2(n, k);
  626. KERNEL_MMA_4ACC(pb0, pb0, pb0, pb0, ra0, ra1, ra2, ra3);
  627. LOAD_A_1x8(k+1, m);
  628. KERNEL_MMA_4ACC(pb1, pb1, pb1, pb1, ra0, ra1, ra2, ra3);
  629. }
  630. for (; k < K; k++) {
  631. LOAD_A_1x8(k, m);
  632. LOAD_BTP_2x1(n, k);
  633. KERNEL_MMA_4ACC(pb0, pb0, pb0, pb0, ra0, ra1, ra2, ra3);
  634. }
  635. #if !defined(B0)
  636. register vector double rc0;
  637. #endif
  638. vector double result[4];
  639. SAVE_2x2_ACC(&acc0, n+0, m+0);
  640. SAVE_2x2_ACC(&acc1, n+0, m+2);
  641. SAVE_2x2_ACC(&acc2, n+0, m+4);
  642. SAVE_2x2_ACC(&acc3, n+0, m+6);
  643. }
  644. for (; m < m4; m += 4) {
  645. __vector_quad acc0, acc1;
  646. INIT_2ACCS();
  647. register vector double ra0, ra1;
  648. register vector double rb0, rb1;
  649. register vector double t0, t1;
  650. __vector_pair pb0, pb1;
  651. for (k = 0; k < k2; k += 2) {
  652. LOAD_A_1x4(k, m);
  653. LOAD_BTP_2x2(n, k);
  654. KERNEL_MMA_2ACC(pb0, pb0, ra0, ra1);
  655. LOAD_A_1x4(k+1, m);
  656. KERNEL_MMA_2ACC(pb1, pb1, ra0, ra1);
  657. }
  658. for (; k < K; k++) {
  659. LOAD_A_1x4(k, m);
  660. LOAD_BTP_2x1(n, k);
  661. KERNEL_MMA_2ACC(pb0, pb0, ra0, ra1);
  662. }
  663. #if !defined(B0)
  664. register vector double rc0;
  665. #endif
  666. vector double result[4];
  667. SAVE_2x2_ACC(&acc0, n+0, m+0);
  668. SAVE_2x2_ACC(&acc1, n+0, m+2);
  669. }
  670. for (; m < m2; m += 2) {
  671. __vector_quad acc0;
  672. INIT_1ACC();
  673. register vector double ra0;
  674. register vector double rb0, rb1;
  675. register vector double t0, t1;
  676. __vector_pair pb0, pb1;
  677. for (k = 0; k < k2; k += 2) {
  678. LOAD_A_1x2(k, m);
  679. LOAD_BTP_2x2(n, k);
  680. KERNEL_MMA_1ACC(pb0, ra0);
  681. LOAD_A_1x2(k+1, m);
  682. KERNEL_MMA_1ACC(pb1, ra0);
  683. }
  684. for (; k < K; k++) {
  685. LOAD_A_1x2(k, m);
  686. LOAD_BTP_2x1(n, k);
  687. KERNEL_MMA_1ACC(pb0, ra0);
  688. }
  689. #if !defined(B0)
  690. register vector double rc0;
  691. #endif
  692. vector double result[4];
  693. SAVE_2x2_ACC(&acc0, n+0, m+0);
  694. }
  695. for (; m < M; m++) {
  696. __vector_quad acc0;
  697. INIT_1ACC();
  698. register vector double ra0;
  699. register vector double rb0, rb1;
  700. register vector double t0, t1;
  701. __vector_pair pb0, pb1;
  702. for (k = 0; k < k2; k += 2) {
  703. LOAD_A_1x1(k, m);
  704. LOAD_BTP_2x2(n, k);
  705. KERNEL_MMA_1ACC(pb0, ra0);
  706. LOAD_A_1x1(k+1, m);
  707. KERNEL_MMA_1ACC(pb1, ra0);
  708. }
  709. for (; k < K; k++) {
  710. LOAD_A_1x1(k, m);
  711. LOAD_BTP_2x1(n, k);
  712. KERNEL_MMA_1ACC(pb0, ra0);
  713. }
  714. #if !defined(B0)
  715. register vector double rc0;
  716. #endif
  717. vector double result[4];
  718. SAVE_2x1_ACC(&acc0, n+0, m+0);
  719. }
  720. }
  721. for (; n < N; n++) {
  722. for (m = 0; m < m8; m += 8) {
  723. vector double result = ((vector double){0.,0.});
  724. vector double result1 = ((vector double){0.,0.});
  725. vector double result2 = ((vector double){0.,0.});
  726. vector double result3 = ((vector double){0.,0.});
  727. register vector double ra0, ra1, ra2, ra3;
  728. register vector double rb0;
  729. for (k = 0; k < K; k++) {
  730. LOAD_A_1x8(k, m);
  731. LOAD_B_1x1(n, k);
  732. KERNEL_VMADD_4VSR(ra0, ra1, ra2, ra3, rb0, rb0, rb0, rb0);
  733. }
  734. #if !defined(B0)
  735. register vector double rc0;
  736. #endif
  737. SAVE_1x4_VSR(result, n, m+0);
  738. SAVE_1x4_VSR(result1, n, m+2);
  739. SAVE_1x4_VSR(result2, n, m+4);
  740. SAVE_1x4_VSR(result3, n, m+6);
  741. }
  742. for (; m < m4; m += 4) {
  743. vector double result = ((vector double){0.,0.});
  744. vector double result1 = ((vector double){0.,0.});
  745. register vector double ra0, ra1;
  746. register vector double rb0;
  747. for (k = 0; k < K; k++) {
  748. LOAD_A_1x4(k, m);
  749. LOAD_B_1x1(n, k);
  750. KERNEL_VMADD_2VSR(ra0, ra1, rb0, rb0);
  751. }
  752. #if !defined(B0)
  753. register vector double rc0;
  754. #endif
  755. SAVE_1x4_VSR(result, n, m+0);
  756. SAVE_1x4_VSR(result1, n, m+2);
  757. }
  758. for (; m < m2; m += 2) {
  759. vector double result = ((vector double){0.,0.});
  760. register vector double ra0;
  761. register vector double rb0;
  762. for (k = 0; k < K; k++) {
  763. LOAD_A_1x2(k, m);
  764. LOAD_B_1x1(n, k);
  765. KERNEL_VMADD_1VSR(ra0, rb0);
  766. }
  767. #if !defined(B0)
  768. register vector double rc0;
  769. #endif
  770. SAVE_1x4_VSR(result, n, m+0);
  771. }
  772. for (; m < M; m++) {
  773. FLOAT result = 0.0;
  774. for (k = 0; k < K; k++) {
  775. result += A[m+k*lda] * B[n*ldb+k];
  776. }
  777. result = result * alpha;
  778. #if !defined(B0)
  779. C[n*ldc+m] = (C[n*ldc+m] * beta) + result;
  780. #else
  781. C[n*ldc+m] = result;
  782. #endif
  783. }
  784. }
  785. if (has_packing) free(packB);
  786. return 0;
  787. }