OSchip
/
OpenBLAS
Not watched
1
0
Fork 0
Code
Releases 66 Wiki evaluate Activity
Issues 0 Pull Requests 0 Datasets Model Cloudbrain HPC
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.
Tree: bec9d9f63d
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'bec9d9f63d'
${ noResults }
OpenBLAS/kernel/x86_64/dgemm_small_kernel_tt_skyla...

393 lines
16 kB
Raw Blame History 

  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. 

  28. #include <immintrin.h>

  29. #include "common.h"

  30. #include <stdio.h>

  31. 

  32. #define DECLARE_RESULT_512(M, N) __m512d result##M##N = _mm512_setzero_pd()

  33. #define BROADCAST_LOAD_A_512(M, N) __m512d Aval##M = _mm512_broadcastsd_pd(_mm_load_sd(&A[k  + lda * (i+M)]))

  34. #define LOAD_B_512(M,N)  __m512d Bval##N = _mm512_loadu_pd(&B[ldb * k + j + (N*8)])

  35. #define MASK_LOAD_B_512(M, N) __m512d Bval##N = _mm512_maskz_loadu_pd(mask, &B[ldb * k + j + (N*8)])

  36. #define MATMUL_512(M, N) result##M##N = _mm512_fmadd_pd(Aval##M, Bval##N, result##M##N)

  37. 

  38. #if defined(B0)

  39. #define STORE_8xy(v, N, x, y) _mm512_storeu_pd(&C[(j + N*8 + x + y*8)*ldc + i], v)

  40. #define STORE_4xy(v, N, x, y) _mm256_storeu_pd(&C[(j + N*8 + x + y*4)*ldc + i], v)

  41. #define SCATTER_STORE_512(M, N) result##M##N = _mm512_mul_pd(result##M##N, alpha_512); \

  42. 				_mm512_i64scatter_pd(&C[(j + N*8)*ldc + i + M], vindex_n, result##M##N, 8);

  43. #define MASK_SCATTER_STORE_512(M, N) result##M##N = _mm512_mul_pd(result##M##N, alpha_512); \

  44. 				    _mm512_mask_i64scatter_pd(&C[(j + N*8)*ldc + i + M], mask, vindex_n, result##M##N, 8);

  45. #else

  46. #define STORE_8xy(v, N, x, y) \

  47. 	asm("vfmadd231pd (%1), %2, %0": "+v"(v): "r"(&C[(j + N*8 + x + y*8)*ldc + i]), "v"(beta_512)); \

  48. 	_mm512_storeu_pd(&C[(j + N*8 + x + y*8)*ldc + i], v)

  49. #define STORE_4xy(v, N, x, y) \

  50. 	asm("vfmadd231pd (%1), %2, %0": "+v"(v): "r"(&C[(j + N*8 + x + y*4)*ldc + i]), "v"(beta_256)); \

  51. 	_mm256_storeu_pd(&C[(j + N*8 + x + y*4)*ldc + i], v)

  52. #define SCATTER_STORE_512(M, N) result##M##N = _mm512_mul_pd(result##M##N, alpha_512); \

  53. 				__m512d tmp##M##N = _mm512_i64gather_pd(vindex_n, &C[(j + N*8)*ldc + i + M], 8); \

  54. 				result##M##N = _mm512_fmadd_pd(tmp##M##N, beta_512, result##M##N); \

  55. 				_mm512_i64scatter_pd(&C[(j + N*8)*ldc + i + M], vindex_n, result##M##N, 8);

  56. #define MASK_SCATTER_STORE_512(M, N) result##M##N = _mm512_mul_pd(result##M##N, alpha_512); \

  57. 				__m512d tmp##M##N = _mm512_mask_i64gather_pd(_mm512_setzero_pd(), mask, vindex_n, &C[(j + N*8)*ldc + i + M], 8); \

  58. 				result##M##N = _mm512_fmadd_pd(tmp##M##N, beta_512, result##M##N); \

  59. 				_mm512_mask_i64scatter_pd(&C[(j + N*8)*ldc + i + M], mask, vindex_n, result##M##N, 8);

  60. #endif

  61. 

  62. #define REORDER_8x8(r0, r1, r2, r3, r4, r5, r6, r7) \

  63. 	__m512d t0, t1, t2, t3, t4, t5, t6, t7; \

  64. 	t0 = _mm512_unpacklo_pd(r0, r1); \

  65. 	t1 = _mm512_unpackhi_pd(r0, r1); \

  66. 	t2 = _mm512_unpacklo_pd(r2, r3); \

  67. 	t3 = _mm512_unpackhi_pd(r2, r3); \

  68. 	t4 = _mm512_unpacklo_pd(r4, r5); \

  69. 	t5 = _mm512_unpackhi_pd(r4, r5); \

  70. 	t6 = _mm512_unpacklo_pd(r6, r7); \

  71. 	t7 = _mm512_unpackhi_pd(r6, r7); \

  72. 	r0 = _mm512_shuffle_f64x2(t0, t2, 0x88); \

  73. 	r1 = _mm512_shuffle_f64x2(t1, t3, 0x88); \

  74. 	r2 = _mm512_shuffle_f64x2(t0, t2, 0xdd); \

  75. 	r3 = _mm512_shuffle_f64x2(t1, t3, 0xdd); \

  76. 	r4 = _mm512_shuffle_f64x2(t4, t6, 0x88); \

  77. 	r5 = _mm512_shuffle_f64x2(t5, t7, 0x88); \

  78. 	r6 = _mm512_shuffle_f64x2(t4, t6, 0xdd); \

  79. 	r7 = _mm512_shuffle_f64x2(t5, t7, 0xdd); \

  80. 	t0 = _mm512_permutex2var_pd(r0, idx_lo, r4); \

  81. 	t1 = _mm512_permutex2var_pd(r1, idx_lo, r5); \

  82. 	t2 = _mm512_permutex2var_pd(r2, idx_lo, r6); \

  83. 	t3 = _mm512_permutex2var_pd(r3, idx_lo, r7); \

  84. 	t4 = _mm512_permutex2var_pd(r0, idx_hi, r4); \

  85. 	t5 = _mm512_permutex2var_pd(r1, idx_hi, r5); \

  86. 	t6 = _mm512_permutex2var_pd(r2, idx_hi, r6); \

  87. 	t7 = _mm512_permutex2var_pd(r3, idx_hi, r7); \

  88. 	t0 = _mm512_mul_pd(t0, alpha_512); \

  89. 	t1 = _mm512_mul_pd(t1, alpha_512); \

  90. 	t2 = _mm512_mul_pd(t2, alpha_512); \

  91. 	t3 = _mm512_mul_pd(t3, alpha_512); \

  92. 	t4 = _mm512_mul_pd(t4, alpha_512); \

  93. 	t5 = _mm512_mul_pd(t5, alpha_512); \

  94. 	t6 = _mm512_mul_pd(t6, alpha_512); \

  95. 	t7 = _mm512_mul_pd(t7, alpha_512);

  96. 

  97. #define SAVE_8(N, x) {\

  98. 	STORE_8xy(t##x, N, x, 0); \

  99. }

  100. 

  101. #define REORDER_STORE_8x8(N) {\

  102. 	REORDER_8x8(result0##N, result1##N, result2##N, result3##N, result4##N, result5##N, result6##N, result7##N); \

  103. 	SAVE_8(N, 0); SAVE_8(N, 1); SAVE_8(N, 2); SAVE_8(N, 3); SAVE_8(N, 4); SAVE_8(N, 5); SAVE_8(N, 6); SAVE_8(N, 7); \

  104. }

  105. 

  106. #define MASK_SAVE_8() \

  107. 	switch (nn) { \

  108. 		case 8: SAVE_8(0, 7); \

  109. 		case 7: SAVE_8(0, 6); \

  110. 		case 6: SAVE_8(0, 5); \

  111. 		case 5: SAVE_8(0, 4); \

  112. 		case 4: SAVE_8(0, 3); \

  113. 		case 3: SAVE_8(0, 2); \

  114. 		case 2: SAVE_8(0, 1); \

  115. 		case 1: SAVE_8(0, 0); \

  116. 	}

  117. 

  118. #define MASK_REORDER_STORE_8x8(N) {\

  119. 	REORDER_8x8(result0##N, result1##N, result2##N, result3##N, result4##N, result5##N, result6##N, result7##N); \

  120. 	MASK_SAVE_8(); \

  121. }

  122. 

  123. #define REORDER_4x8(r0, r1, r2, r3) \

  124. 	__m512d t0, t1, t2, t3; \

  125. 	t0 = _mm512_unpacklo_pd(r0, r1); \

  126. 	t1 = _mm512_unpackhi_pd(r0, r1); \

  127. 	t2 = _mm512_unpacklo_pd(r2, r3); \

  128. 	t3 = _mm512_unpackhi_pd(r2, r3); \

  129. 	r0 = _mm512_permutex2var_pd(t0, idx_lo, t2); \

  130. 	r1 = _mm512_permutex2var_pd(t1, idx_lo, t3); \

  131. 	r2 = _mm512_permutex2var_pd(t0, idx_hi, t2); \

  132. 	r3 = _mm512_permutex2var_pd(t1, idx_hi, t3); \

  133. 	t0 = _mm512_mul_pd(r0, alpha_512); \

  134. 	t1 = _mm512_mul_pd(r1, alpha_512); \

  135. 	t2 = _mm512_mul_pd(r2, alpha_512); \

  136. 	t3 = _mm512_mul_pd(r3, alpha_512);

  137. 

  138. #define SAVE_4(N, x, y) {\

  139. 	__m256d v4 = _mm512_extractf64x4_pd(t##x, y); \

  140. 	STORE_4xy(v4, N, x, y); \

  141. }

  142. 

  143. #define REORDER_STORE_4x8(N) {\

  144. 	REORDER_4x8(result0##N, result1##N, result2##N, result3##N); \

  145. 	SAVE_4(N, 0, 0); SAVE_4(N, 1, 0); SAVE_4(N, 2, 0); SAVE_4(N, 3, 0); \

  146. 	SAVE_4(N, 0, 1); SAVE_4(N, 1, 1); SAVE_4(N, 2, 1); SAVE_4(N, 3, 1); \

  147. }

  148. 

  149. #define MASK_SAVE_4() \

  150. 	switch (nn) { \

  151. 		case 8: SAVE_4(0, 3, 1); \

  152. 		case 7: SAVE_4(0, 2, 1); \

  153. 		case 6: SAVE_4(0, 1, 1); \

  154. 		case 5: SAVE_4(0, 0, 1); \

  155. 		case 4: SAVE_4(0, 3, 0); \

  156. 		case 3: SAVE_4(0, 2, 0); \

  157. 		case 2: SAVE_4(0, 1, 0); \

  158. 		case 1: SAVE_4(0, 0, 0); \

  159. 	}

  160. 

  161. #define MASK_REORDER_STORE_4x8(N) {\

  162. 	REORDER_4x8(result0##N, result1##N, result2##N, result3##N); \

  163. 	MASK_SAVE_4(); \

  164. }

  165. 

  166. 

  167. #if defined(B0)

  168. int CNAME(BLASLONG M, BLASLONG N, BLASLONG K, FLOAT * A, BLASLONG lda, FLOAT alpha, FLOAT * B, BLASLONG ldb, FLOAT * C, BLASLONG ldc)

  169. #else

  170. int CNAME(BLASLONG M, BLASLONG N, BLASLONG K, FLOAT * A, BLASLONG lda, FLOAT alpha, FLOAT * B, BLASLONG ldb, FLOAT beta, FLOAT * C, BLASLONG ldc)

  171. #endif

  172. {

  173. 	// column major

  174. 	BLASLONG i, j, k;

  175. 

  176. 	BLASLONG m8 = M & ~7;

  177. 	BLASLONG m4 = M & ~3;

  178. 	BLASLONG m2 = M & ~1;

  179. 

  180. 	BLASLONG n32 = N & ~31;

  181. 	BLASLONG n16 = N & ~15;

  182. 

  183. 	__m512d alpha_512 = _mm512_broadcastsd_pd(_mm_load_sd(&alpha));

  184. #if !defined(B0)

  185. 	__m512d beta_512 = _mm512_broadcastsd_pd(_mm_load_sd(&beta));

  186. 	__m256d beta_256 = _mm256_broadcastsd_pd(_mm_load_sd(&beta));

  187. #endif

  188. 	long long permute_table[] = {

  189. 		0, 1, 4, 5, 0|8, 1|8, 4|8, 5|8,

  190. 		2, 3, 6, 7, 2|8, 3|8, 6|8, 7|8,

  191. 	};

  192. 	__m512i idx_lo = _mm512_loadu_si512(permute_table);

  193. 	__m512i idx_hi = _mm512_loadu_si512(permute_table + 8);

  194. 

  195. 	for (i = 0; i < m8; i += 8) {

  196. 		for (j = 0; j < n16; j += 16) {

  197. 			DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0); DECLARE_RESULT_512(2, 0); DECLARE_RESULT_512(3, 0);

  198. 			DECLARE_RESULT_512(4, 0); DECLARE_RESULT_512(5, 0); DECLARE_RESULT_512(6, 0); DECLARE_RESULT_512(7, 0);

  199. 

  200. 			DECLARE_RESULT_512(0, 1); DECLARE_RESULT_512(1, 1); DECLARE_RESULT_512(2, 1); DECLARE_RESULT_512(3, 1);

  201. 			DECLARE_RESULT_512(4, 1); DECLARE_RESULT_512(5, 1); DECLARE_RESULT_512(6, 1); DECLARE_RESULT_512(7, 1);

  202. 			for (k = 0; k < K; k++) {

  203. 				BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x); BROADCAST_LOAD_A_512(2, x); BROADCAST_LOAD_A_512(3, x);

  204. 				BROADCAST_LOAD_A_512(4, x); BROADCAST_LOAD_A_512(5, x); BROADCAST_LOAD_A_512(6, x); BROADCAST_LOAD_A_512(7, x);

  205. 				LOAD_B_512(x, 0); LOAD_B_512(x, 1);

  206. 				MATMUL_512(0, 0); MATMUL_512(1, 0); MATMUL_512(2, 0); MATMUL_512(3, 0);

  207. 				MATMUL_512(4, 0); MATMUL_512(5, 0); MATMUL_512(6, 0); MATMUL_512(7, 0);

  208. 				MATMUL_512(0, 1); MATMUL_512(1, 1); MATMUL_512(2, 1); MATMUL_512(3, 1);

  209. 				MATMUL_512(4, 1); MATMUL_512(5, 1); MATMUL_512(6, 1); MATMUL_512(7, 1);

  210. 			}

  211. 			REORDER_STORE_8x8(0);

  212. 			REORDER_STORE_8x8(1);

  213. 		}

  214. 		__mmask8 mask = 0xff;

  215. 		int nn = 8;

  216. 		for (; j < N; j += 8) {

  217. 			if (N - j < 8) {

  218. 				nn = N - j;

  219. 				mask = (1UL << nn) - 1;

  220. 			}

  221. 			DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0); DECLARE_RESULT_512(2, 0); DECLARE_RESULT_512(3, 0);

  222. 			DECLARE_RESULT_512(4, 0); DECLARE_RESULT_512(5, 0); DECLARE_RESULT_512(6, 0); DECLARE_RESULT_512(7, 0);

  223. 			for (k = 0; k < K; k++) {

  224. 				BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x); BROADCAST_LOAD_A_512(2, x); BROADCAST_LOAD_A_512(3, x);

  225. 				BROADCAST_LOAD_A_512(4, x); BROADCAST_LOAD_A_512(5, x); BROADCAST_LOAD_A_512(6, x); BROADCAST_LOAD_A_512(7, x);

  226. 				MASK_LOAD_B_512(x, 0);

  227. 				MATMUL_512(0, 0); MATMUL_512(1, 0); MATMUL_512(2, 0); MATMUL_512(3, 0);

  228. 				MATMUL_512(4, 0); MATMUL_512(5, 0); MATMUL_512(6, 0); MATMUL_512(7, 0);

  229. 			}

  230. 			MASK_REORDER_STORE_8x8(0);

  231. 		}

  232. 	}

  233. 	for (; i < m4; i += 4) {

  234. 		long long permute_table2[] = {

  235. 			0, 1, 0|8, 1|8, 4, 5, 4|8, 5|8,

  236. 			2, 3, 2|8, 3|8, 6, 7, 6|8, 7|8,

  237. 		};

  238. 		idx_lo = _mm512_loadu_si512(permute_table2);

  239. 		idx_hi = _mm512_loadu_si512(permute_table2 + 8);

  240. 

  241. 		for (j = 0; j < n32; j += 32) {

  242. 			DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0); DECLARE_RESULT_512(2, 0); DECLARE_RESULT_512(3, 0);

  243. 			DECLARE_RESULT_512(0, 1); DECLARE_RESULT_512(1, 1); DECLARE_RESULT_512(2, 1); DECLARE_RESULT_512(3, 1);

  244. 			DECLARE_RESULT_512(0, 2); DECLARE_RESULT_512(1, 2); DECLARE_RESULT_512(2, 2); DECLARE_RESULT_512(3, 2);

  245. 			DECLARE_RESULT_512(0, 3); DECLARE_RESULT_512(1, 3); DECLARE_RESULT_512(2, 3); DECLARE_RESULT_512(3, 3);

  246. 			for (k = 0; k < K; k++) {

  247. 				BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x); BROADCAST_LOAD_A_512(2, x); BROADCAST_LOAD_A_512(3, x);

  248. 				LOAD_B_512(x, 0); LOAD_B_512(x, 1); LOAD_B_512(x, 2); LOAD_B_512(x, 3);

  249. 				MATMUL_512(0, 0); MATMUL_512(1, 0); MATMUL_512(2, 0); MATMUL_512(3, 0);

  250. 				MATMUL_512(0, 1); MATMUL_512(1, 1); MATMUL_512(2, 1); MATMUL_512(3, 1);

  251. 				MATMUL_512(0, 2); MATMUL_512(1, 2); MATMUL_512(2, 2); MATMUL_512(3, 2);

  252. 				MATMUL_512(0, 3); MATMUL_512(1, 3); MATMUL_512(2, 3); MATMUL_512(3, 3);

  253. 			}

  254. 			REORDER_STORE_4x8(0);

  255. 			REORDER_STORE_4x8(1);

  256. 			REORDER_STORE_4x8(2);

  257. 			REORDER_STORE_4x8(3);

  258. 		}

  259. 		for (; j < n16; j += 16) {

  260. 			DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0); DECLARE_RESULT_512(2, 0); DECLARE_RESULT_512(3, 0);

  261. 			DECLARE_RESULT_512(0, 1); DECLARE_RESULT_512(1, 1); DECLARE_RESULT_512(2, 1); DECLARE_RESULT_512(3, 1);

  262. 			for (k = 0; k < K; k++) {

  263. 				BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x); BROADCAST_LOAD_A_512(2, x); BROADCAST_LOAD_A_512(3, x);

  264. 				LOAD_B_512(x, 0); LOAD_B_512(x, 1);

  265. 				MATMUL_512(0, 0); MATMUL_512(1, 0); MATMUL_512(2, 0); MATMUL_512(3, 0);

  266. 				MATMUL_512(0, 1); MATMUL_512(1, 1); MATMUL_512(2, 1); MATMUL_512(3, 1);

  267. 			}

  268. 			REORDER_STORE_4x8(0);

  269. 			REORDER_STORE_4x8(1);

  270. 		}

  271. 		__mmask8 mask = 0xff;

  272. 		int nn = 8;

  273. 		for (; j < N; j += 8) {

  274. 			if (N - j < 8) {

  275. 				nn = N - j;

  276. 				mask = (1UL << nn) - 1;

  277. 			}

  278. 			DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0); DECLARE_RESULT_512(2, 0); DECLARE_RESULT_512(3, 0);

  279. 			for (k = 0; k < K; k++) {

  280. 				BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x); BROADCAST_LOAD_A_512(2, x); BROADCAST_LOAD_A_512(3, x);

  281. 				MASK_LOAD_B_512(x, 0);

  282. 				MATMUL_512(0, 0); MATMUL_512(1, 0); MATMUL_512(2, 0); MATMUL_512(3, 0);

  283. 			}

  284. 			MASK_REORDER_STORE_4x8(0);

  285. 		}

  286. 	}

  287. 	if (i < M) {

  288. 		long long index_n[8];

  289. 		for (int ii = 0; ii < 8; ii++) {

  290. 			index_n[ii] = ii * ldc;

  291. 		}

  292. 		__m512i vindex_n = _mm512_loadu_si512(index_n);

  293. #if !defined(B0)

  294. 		__m512d beta_512 = _mm512_broadcastsd_pd(_mm_load_sd(&beta));

  295. #endif

  296. 		for (; i < m2; i += 2) {

  297. 			for (j = 0; j < n32; j += 32) {

  298. 				DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0);

  299. 				DECLARE_RESULT_512(0, 1); DECLARE_RESULT_512(1, 1);

  300. 				DECLARE_RESULT_512(0, 2); DECLARE_RESULT_512(1, 2);

  301. 				DECLARE_RESULT_512(0, 3); DECLARE_RESULT_512(1, 3);

  302. 				for (k = 0; k < K; k++) {

  303. 					BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x);

  304. 					LOAD_B_512(x, 0); LOAD_B_512(x, 1); LOAD_B_512(x, 2); LOAD_B_512(x, 3);

  305. 					MATMUL_512(0, 0); MATMUL_512(1, 0);

  306. 					MATMUL_512(0, 1); MATMUL_512(1, 1);

  307. 					MATMUL_512(0, 2); MATMUL_512(1, 2);

  308. 					MATMUL_512(0, 3); MATMUL_512(1, 3);

  309. 				}

  310. 				SCATTER_STORE_512(0, 0); SCATTER_STORE_512(1, 0);

  311. 				SCATTER_STORE_512(0, 1); SCATTER_STORE_512(1, 1);

  312. 				SCATTER_STORE_512(0, 2); SCATTER_STORE_512(1, 2);

  313. 				SCATTER_STORE_512(0, 3); SCATTER_STORE_512(1, 3);

  314. 			}

  315. 			for (; j < n16; j += 16) {

  316. 				DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0);

  317. 				DECLARE_RESULT_512(0, 1); DECLARE_RESULT_512(1, 1);

  318. 				for (k = 0; k < K; k++) {

  319. 					BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x);

  320. 					LOAD_B_512(x, 0); LOAD_B_512(x, 1);

  321. 					MATMUL_512(0, 0); MATMUL_512(1, 0);

  322. 					MATMUL_512(0, 1); MATMUL_512(1, 1);

  323. 				}

  324. 				SCATTER_STORE_512(0, 0); SCATTER_STORE_512(1, 0);

  325. 				SCATTER_STORE_512(0, 1); SCATTER_STORE_512(1, 1);

  326. 			}

  327. 			__mmask8 mask = 0xff;

  328. 			int nn = 8;

  329. 			for (; j < N; j += 8) {

  330. 				if (N - j < 8) {

  331. 					nn = N - j;

  332. 					mask = (1UL << nn) - 1;

  333. 				}

  334. 				DECLARE_RESULT_512(0, 0); DECLARE_RESULT_512(1, 0);

  335. 				for (k = 0; k < K; k++) {

  336. 					BROADCAST_LOAD_A_512(0, x); BROADCAST_LOAD_A_512(1, x);

  337. 					MASK_LOAD_B_512(x, 0);

  338. 					MATMUL_512(0, 0); MATMUL_512(1, 0);

  339. 				}

  340. 				MASK_SCATTER_STORE_512(0, 0); MASK_SCATTER_STORE_512(1, 0);

  341. 			}

  342. 		}

  343. 		for (; i < M; i += 1) {

  344. 			for (j = 0; j < n32; j += 32) {

  345. 				DECLARE_RESULT_512(0, 0);

  346. 				DECLARE_RESULT_512(0, 1);

  347. 				DECLARE_RESULT_512(0, 2);

  348. 				DECLARE_RESULT_512(0, 3);

  349. 				for (k = 0; k < K; k++) {

  350. 					BROADCAST_LOAD_A_512(0, x);

  351. 					LOAD_B_512(x, 0); LOAD_B_512(x, 1); LOAD_B_512(x, 2); LOAD_B_512(x, 3);

  352. 					MATMUL_512(0, 0);

  353. 					MATMUL_512(0, 1);

  354. 					MATMUL_512(0, 2);

  355. 					MATMUL_512(0, 3);

  356. 				}

  357. 				SCATTER_STORE_512(0, 0);

  358. 				SCATTER_STORE_512(0, 1);

  359. 				SCATTER_STORE_512(0, 2);

  360. 				SCATTER_STORE_512(0, 3);

  361. 			}

  362. 			for (; j < n16; j += 16) {

  363. 				DECLARE_RESULT_512(0, 0);

  364. 				DECLARE_RESULT_512(0, 1);

  365. 				for (k = 0; k < K; k++) {

  366. 					BROADCAST_LOAD_A_512(0, x);

  367. 					LOAD_B_512(x, 0); LOAD_B_512(x, 1);

  368. 					MATMUL_512(0, 0);

  369. 					MATMUL_512(0, 1);

  370. 				}

  371. 				SCATTER_STORE_512(0, 0);

  372. 				SCATTER_STORE_512(0, 1);

  373. 			}

  374. 			__mmask8 mask = 0xff;

  375. 			int nn = 8;

  376. 			for (; j < N; j += 8) {

  377. 				if (N - j < 8) {

  378. 					nn = N - j;

  379. 					mask = (1UL << nn) - 1;

  380. 				}

  381. 				DECLARE_RESULT_512(0, 0);

  382. 				for (k = 0; k < K; k++) {

  383. 					BROADCAST_LOAD_A_512(0, x);

  384. 					MASK_LOAD_B_512(x, 0);

  385. 					MATMUL_512(0, 0);

  386. 				}

  387. 				MASK_SCATTER_STORE_512(0, 0);

  388. 			}

  389. 		}

  390. 	}

  391. 	return 0;

  392. }