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_power10.c 29 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989
  1. /*********************************************************************************
  2. Copyright (c) 2020, 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. #if defined(BFLOAT16) && defined(BFLOAT16CONVERSION)
  30. static float
  31. bfloat16tof32 (bfloat16 f16)
  32. {
  33. float result = 0;
  34. unsigned short *q = (unsigned short *) (&result);
  35. #if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
  36. q[0] = f16;
  37. #else
  38. q[1] = f16;
  39. #endif
  40. return result;
  41. }
  42. #define BF16TOF32(x) (bfloat16tof32(x))
  43. #else
  44. #define BF16TOF32(x) x
  45. #endif
  46. typedef __vector unsigned char vec_t;
  47. typedef FLOAT v4sf_t __attribute__ ((vector_size (16)));
  48. typedef FLOAT v2sf_t __attribute__ ((vector_size (8)));
  49. /*
  50. * BFLOAT16 xvbf16ger2pp instruction needs 4×2 matrix of
  51. * bfloat16 floating-point values as input. Hence this
  52. * merging is needed on A and B matrices.
  53. */
  54. #define MERGE_HIGH(x, y) (vec_t) vec_mergeh ((vector short)x, (vector short)y)
  55. #define MERGE_LOW(x, y) (vec_t) vec_mergel ((vector short)x, (vector short)y)
  56. #define SAVE_ACC(ACC, J) \
  57. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  58. rowC = (v4sf_t *) &CO[0* ldc+J]; \
  59. rowC[0] += result[0] * alpha; \
  60. rowC = (v4sf_t *) &CO[1*ldc+J]; \
  61. rowC[0] += result[1] * alpha; \
  62. rowC = (v4sf_t *) &CO[2*ldc+J]; \
  63. rowC[0] += result[2] * alpha; \
  64. rowC = (v4sf_t *) &CO[3*ldc+J]; \
  65. rowC[0] += result[3] * alpha;
  66. #define SAVE_ACC1(ACC, J) \
  67. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  68. rowC = (v4sf_t *) &CO[4* ldc+J]; \
  69. rowC[0] += result[0] * alpha; \
  70. rowC = (v4sf_t *) &CO[5*ldc+J]; \
  71. rowC[0] += result[1] * alpha; \
  72. rowC = (v4sf_t *) &CO[6*ldc+J]; \
  73. rowC[0] += result[2] * alpha; \
  74. rowC = (v4sf_t *) &CO[7*ldc+J]; \
  75. rowC[0] += result[3] * alpha;
  76. #define SAVE4x2_ACC(ACC, J) \
  77. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  78. rowC = (v2sf_t *) &CO[0* ldc+J]; \
  79. rowC[0] += result[0] * alpha; \
  80. rowC = (v2sf_t *) &CO[1* ldc+J]; \
  81. rowC[0] += result[2] * alpha; \
  82. rowC = (v2sf_t *) &CO[2* ldc+J]; \
  83. rowC[0] += result[4] * alpha; \
  84. rowC = (v2sf_t *) &CO[3* ldc+J]; \
  85. rowC[0] += result[6] * alpha;
  86. #define SAVE4x2_ACC1(ACC, J) \
  87. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  88. rowC = (v2sf_t *) &CO[4* ldc+J]; \
  89. rowC[0] += result[0] * alpha; \
  90. rowC = (v2sf_t *) &CO[5* ldc+J]; \
  91. rowC[0] += result[2] * alpha; \
  92. rowC = (v2sf_t *) &CO[6* ldc+J]; \
  93. rowC[0] += result[4] * alpha; \
  94. rowC = (v2sf_t *) &CO[7* ldc+J]; \
  95. rowC[0] += result[6] * alpha;
  96. #define SAVE4x2_ACC_SCALAR(ACC) { \
  97. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  98. res[0] = result[0] * alpha; \
  99. res[1] = result[1] * alpha; \
  100. res[2] = result[2] * alpha; \
  101. res[3] = result[3] * alpha; \
  102. CO[0 * ldc] += res[0][0]; \
  103. CO[1 * ldc] += res[1][0]; \
  104. CO[2 * ldc] += res[2][0]; \
  105. CO[3 * ldc] += res[3][0]; \
  106. }
  107. #define SAVE4x2_ACC1_SCALAR(ACC) { \
  108. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  109. res[0] = result[0] * alpha; \
  110. res[1] = result[1] * alpha; \
  111. res[2] = result[2] * alpha; \
  112. res[3] = result[3] * alpha; \
  113. CO[4 * ldc] += res[0][0]; \
  114. CO[5 * ldc] += res[1][0]; \
  115. CO[6 * ldc] += res[2][0]; \
  116. CO[7 * ldc] += res[3][0]; \
  117. }
  118. #define MMA __builtin_mma_xvbf16ger2pp
  119. #define SAVE2x4_ACC(ACC, J) \
  120. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  121. rowC = (v4sf_t *) &CO[0* ldc+J]; \
  122. rowC[0] += result[0] * alpha; \
  123. rowC = (v4sf_t *) &CO[1* ldc+J]; \
  124. rowC[0] += result[1] * alpha;
  125. #define SET_ACC_ZERO4() \
  126. __builtin_mma_xxsetaccz (&acc0); \
  127. __builtin_mma_xxsetaccz (&acc1); \
  128. __builtin_mma_xxsetaccz (&acc2); \
  129. __builtin_mma_xxsetaccz (&acc3);
  130. #define SET_ACC_ZERO8() \
  131. __builtin_mma_xxsetaccz (&acc0); \
  132. __builtin_mma_xxsetaccz (&acc1); \
  133. __builtin_mma_xxsetaccz (&acc2); \
  134. __builtin_mma_xxsetaccz (&acc3); \
  135. __builtin_mma_xxsetaccz (&acc4); \
  136. __builtin_mma_xxsetaccz (&acc5); \
  137. __builtin_mma_xxsetaccz (&acc6); \
  138. __builtin_mma_xxsetaccz (&acc7);
  139. #define PREFETCH1(x, y) asm volatile ("dcbt %0, %1" : : "r" (x), "b" (y) : "memory");
  140. /*************************************************************************************
  141. * SBGEMM Kernel
  142. *************************************************************************************/
  143. int
  144. CNAME (BLASLONG m, BLASLONG n, BLASLONG k, FLOAT alpha, IFLOAT * A,
  145. IFLOAT * B, FLOAT * C, BLASLONG ldc)
  146. {
  147. BLASLONG i1;
  148. v4sf_t valpha = { alpha, alpha, alpha, alpha };
  149. vector short vzero = { 0, 0, 0, 0, 0, 0, 0, 0 };
  150. /* Loop for n >= 8. */
  151. for (i1 = 0; i1 < (n >> 3); i1++)
  152. {
  153. BLASLONG j;
  154. FLOAT *CO;
  155. IFLOAT *AO;
  156. CO = C;
  157. C += ldc << 3;
  158. AO = A;
  159. PREFETCH1 (A, 128);
  160. PREFETCH1 (A, 256);
  161. /* Loop for m >= 16. */
  162. for (j = 0; j < (m >> 4); j++)
  163. {
  164. IFLOAT *BO = B;
  165. v4sf_t *rowC;
  166. v4sf_t result[4];
  167. __vector_quad acc0, acc1, acc2, acc3, acc4, acc5, acc6, acc7;
  168. SET_ACC_ZERO8 ();
  169. BLASLONG l = 0;
  170. for (l = 0; l < k / 2; l++)
  171. {
  172. vec_t *rowA = (vec_t *) & (AO[l << 5]);
  173. vec_t *rowB = (vec_t *) & (BO[l << 4]);
  174. MMA (&acc0, rowB[0], rowA[0]);
  175. MMA (&acc1, rowB[1], rowA[0]);
  176. MMA (&acc2, rowB[0], rowA[1]);
  177. MMA (&acc3, rowB[1], rowA[1]);
  178. MMA (&acc4, rowB[0], rowA[2]);
  179. MMA (&acc5, rowB[1], rowA[2]);
  180. MMA (&acc6, rowB[0], rowA[3]);
  181. MMA (&acc7, rowB[1], rowA[3]);
  182. }
  183. if (k % 2 == 1)
  184. {
  185. if (k > 1)
  186. l = (k / 2) << 4;
  187. vec_t *rowA = (vec_t *) & (AO[l << 1]);
  188. vec_t *rowB = (vec_t *) & (BO[l]);
  189. vec_t rowB_h = MERGE_HIGH (rowB[0], vzero);
  190. vec_t rowB_l = MERGE_LOW (rowB[0], vzero);
  191. vec_t rowA_h = MERGE_HIGH (rowA[0], vzero);
  192. vec_t rowA_l = MERGE_LOW (rowA[0], vzero);
  193. vec_t rowA2_h = MERGE_HIGH (rowA[1], vzero);
  194. vec_t rowA2_l = MERGE_LOW (rowA[1], vzero);
  195. MMA (&acc0, rowB_h, rowA_h);
  196. MMA (&acc1, rowB_l, rowA_h);
  197. MMA (&acc2, rowB_h, rowA_l);
  198. MMA (&acc3, rowB_l, rowA_l);
  199. MMA (&acc4, rowB_h, rowA2_h);
  200. MMA (&acc5, rowB_l, rowA2_h);
  201. MMA (&acc6, rowB_h, rowA2_l);
  202. MMA (&acc7, rowB_l, rowA2_l);
  203. }
  204. SAVE_ACC (&acc0, 0);
  205. SAVE_ACC (&acc2, 4);
  206. SAVE_ACC1 (&acc1, 0);
  207. SAVE_ACC1 (&acc3, 4);
  208. SAVE_ACC (&acc4, 8);
  209. SAVE_ACC (&acc6, 12);
  210. SAVE_ACC1 (&acc5, 8);
  211. SAVE_ACC1 (&acc7, 12);
  212. CO += 16;
  213. AO += (k << 4);
  214. BO += (k << 3);
  215. }
  216. if (m & 8)
  217. {
  218. IFLOAT *BO = B;
  219. v4sf_t *rowC;
  220. v4sf_t result[4];
  221. __vector_quad acc0, acc1, acc2, acc3;
  222. SET_ACC_ZERO4 ();
  223. BLASLONG l = 0;
  224. for (l = 0; l < k / 2; l++)
  225. {
  226. vec_t *rowA = (vec_t *) & (AO[l << 4]);
  227. vec_t *rowB = (vec_t *) & (BO[l << 4]);
  228. MMA (&acc0, rowB[0], rowA[0]);
  229. MMA (&acc1, rowB[1], rowA[0]);
  230. MMA (&acc2, rowB[0], rowA[1]);
  231. MMA (&acc3, rowB[1], rowA[1]);
  232. }
  233. if (k % 2 == 1)
  234. {
  235. if (k > 1)
  236. l = (k / 2) << 4;
  237. vec_t *rowA = (vec_t *) & (AO[l]);
  238. vec_t *rowB = (vec_t *) & (BO[l]);
  239. vec_t rowB_h = MERGE_HIGH (rowB[0], vzero);
  240. vec_t rowB_l = MERGE_LOW (rowB[0], vzero);
  241. vec_t rowA_h = MERGE_HIGH (rowA[0], vzero);
  242. vec_t rowA_l = MERGE_LOW (rowA[0], vzero);
  243. MMA (&acc0, rowB_h, rowA_h);
  244. MMA (&acc1, rowB_l, rowA_h);
  245. MMA (&acc2, rowB_h, rowA_l);
  246. MMA (&acc3, rowB_l, rowA_l);
  247. }
  248. SAVE_ACC (&acc0, 0);
  249. SAVE_ACC (&acc2, 4);
  250. SAVE_ACC1 (&acc1, 0);
  251. SAVE_ACC1 (&acc3, 4);
  252. CO += 8;
  253. AO += (k << 3);
  254. BO += (k << 3);
  255. }
  256. if (m & 4)
  257. {
  258. IFLOAT *BO = B;
  259. v4sf_t *rowC;
  260. v4sf_t result[4];
  261. __vector_quad acc0, acc1;
  262. __builtin_mma_xxsetaccz (&acc0);
  263. __builtin_mma_xxsetaccz (&acc1);
  264. BLASLONG l = 0;
  265. for (l = 0; l < k / 2; l++)
  266. {
  267. vec_t *rowA = (vec_t *) & (AO[l << 3]);
  268. vec_t *rowB = (vec_t *) & (BO[l << 4]);
  269. MMA (&acc0, rowB[0], rowA[0]);
  270. MMA (&acc1, rowB[1], rowA[0]);
  271. }
  272. if (k % 2 == 1)
  273. {
  274. if (k > 1)
  275. l = (k / 2) << 3;
  276. vector short rowA =
  277. { AO[l + 0], 0, AO[l + 1], 0, AO[l + 2], 0, AO[l + 3], 0 };
  278. vec_t *rowB = (vec_t *) & (BO[l << 1]);
  279. MMA (&acc0, MERGE_HIGH (rowB[0], vzero), (vec_t) rowA);
  280. MMA (&acc1, MERGE_LOW (rowB[0], vzero), (vec_t) rowA);
  281. }
  282. SAVE_ACC (&acc0, 0);
  283. SAVE_ACC1 (&acc1, 0);
  284. CO += 4;
  285. AO += (k << 2);
  286. BO += (k << 3);
  287. }
  288. if (m & 2)
  289. {
  290. IFLOAT *BO = B;
  291. v2sf_t *rowC;
  292. v2sf_t result[8];
  293. __vector_quad acc0, acc1;
  294. __builtin_mma_xxsetaccz (&acc0);
  295. __builtin_mma_xxsetaccz (&acc1);
  296. BLASLONG l = 0;
  297. for (l = 0; l < k / 2; l++)
  298. {
  299. vector short rowA =
  300. { AO[(l << 2) + 0], AO[(l << 2) + 2], AO[(l << 2) + 1],
  301. AO[(l << 2) + 3],
  302. 0, 0, 0, 0
  303. };
  304. vec_t *rowB = (vec_t *) & (BO[l << 4]);
  305. MMA (&acc0, rowB[0], (vec_t) rowA);
  306. MMA (&acc1, rowB[1], (vec_t) rowA);
  307. }
  308. if (k % 2 == 1)
  309. {
  310. if (k > 1)
  311. l = (k / 2) << 2;
  312. vector short rowA = { AO[l + 0], 0, AO[l + 1], 0, 0, 0, 0, 0 };
  313. vec_t *rowB = (vec_t *) & (BO[(l << 2)]);
  314. MMA (&acc0, MERGE_HIGH (rowB[0], vzero), (vec_t) rowA);
  315. MMA (&acc1, MERGE_LOW (rowB[0], vzero), (vec_t) rowA);
  316. }
  317. SAVE4x2_ACC (&acc0, 0);
  318. SAVE4x2_ACC1 (&acc1, 0);
  319. CO += 2;
  320. AO += (k << 1);
  321. BO += (k << 3);
  322. }
  323. if (m & 1)
  324. {
  325. IFLOAT *BO = B;
  326. v2sf_t *rowC;
  327. v4sf_t result[4], res[4];
  328. __vector_quad acc0, acc1;
  329. __builtin_mma_xxsetaccz (&acc0);
  330. __builtin_mma_xxsetaccz (&acc1);
  331. BLASLONG l = 0;
  332. for (l = 0; l < k / 2; l++)
  333. {
  334. vector short rowA =
  335. { AO[(l << 1) + 0], AO[(l << 1) + 1], 0, 0, 0, 0, 0, 0};
  336. vec_t *rowB = (vec_t *) & (BO[l << 4]);
  337. MMA (&acc0, rowB[0], (vec_t) rowA);
  338. MMA (&acc1, rowB[1], (vec_t) rowA);
  339. }
  340. if (k % 2 == 1)
  341. {
  342. if (k > 1)
  343. l = (k / 2) << 1;
  344. vector short rowA = { AO[l], 0, 0, 0, 0, 0, 0, 0 };
  345. vec_t *rowB = (vec_t *) & (BO[(l << 3)]);
  346. MMA (&acc0, MERGE_HIGH (rowB[0], vzero), (vec_t) rowA);
  347. MMA (&acc1, MERGE_LOW (rowB[0], vzero), (vec_t) rowA);
  348. }
  349. SAVE4x2_ACC_SCALAR (&acc0);
  350. SAVE4x2_ACC1_SCALAR (&acc1);
  351. CO += 1;
  352. AO += k;
  353. BO += (k << 3);
  354. }
  355. B += k << 3;
  356. }
  357. if (n & 4)
  358. {
  359. BLASLONG j;
  360. FLOAT *CO;
  361. IFLOAT *AO;
  362. CO = C;
  363. C += ldc << 2;
  364. AO = A;
  365. /* Loop for m >= 32. */
  366. for (j = 0; j < (m >> 5); j++)
  367. {
  368. IFLOAT *BO = B;
  369. IFLOAT *A1 = AO + (16 * k);
  370. v4sf_t *rowC;
  371. v4sf_t result[4];
  372. __vector_quad acc0, acc1, acc2, acc3, acc4, acc5, acc6, acc7;
  373. SET_ACC_ZERO8 ();
  374. BLASLONG l = 0;
  375. for (l = 0; l < k / 2; l++)
  376. {
  377. vec_t *rowA = (vec_t *) & (AO[l << 5]);
  378. vec_t *rowA1 = (vec_t *) & (A1[l << 5]);
  379. vec_t *rowB = (vec_t *) & (BO[l << 3]);
  380. MMA (&acc0, rowB[0], rowA[0]);
  381. MMA (&acc1, rowB[0], rowA[1]);
  382. MMA (&acc2, rowB[0], rowA[2]);
  383. MMA (&acc3, rowB[0], rowA[3]);
  384. MMA (&acc4, rowB[0], rowA1[0]);
  385. MMA (&acc5, rowB[0], rowA1[1]);
  386. MMA (&acc6, rowB[0], rowA1[2]);
  387. MMA (&acc7, rowB[0], rowA1[3]);
  388. }
  389. if (k % 2 == 1)
  390. {
  391. if (k > 1)
  392. l = (k / 2) << 3;
  393. vec_t *rowA = (vec_t *) & (AO[(l << 2)]);
  394. vec_t *rowA1 = (vec_t *) & (A1[(l << 2)]);
  395. vector short rowB_mrg =
  396. { BO[l], 0, BO[l + 1], 0, BO[l + 2], 0, BO[l + 3], 0 };
  397. MMA (&acc0, (vec_t)rowB_mrg, MERGE_HIGH (rowA[0], vzero));
  398. MMA (&acc1, (vec_t)rowB_mrg, MERGE_LOW (rowA[0], vzero));
  399. MMA (&acc2, (vec_t)rowB_mrg, MERGE_HIGH (rowA[1], vzero));
  400. MMA (&acc3, (vec_t)rowB_mrg, MERGE_LOW (rowA[1], vzero));
  401. MMA (&acc4, (vec_t)rowB_mrg, MERGE_HIGH (rowA1[0], vzero));
  402. MMA (&acc5, (vec_t)rowB_mrg, MERGE_LOW (rowA1[0], vzero));
  403. MMA (&acc6, (vec_t)rowB_mrg, MERGE_HIGH (rowA1[1], vzero));
  404. MMA (&acc7, (vec_t)rowB_mrg, MERGE_LOW (rowA1[1], vzero));
  405. }
  406. SAVE_ACC (&acc0, 0);
  407. SAVE_ACC (&acc1, 4);
  408. CO += 8;
  409. SAVE_ACC (&acc2, 0);
  410. SAVE_ACC (&acc3, 4);
  411. CO += 8;
  412. SAVE_ACC (&acc4, 0);
  413. SAVE_ACC (&acc5, 4);
  414. CO += 8;
  415. SAVE_ACC (&acc6, 0);
  416. SAVE_ACC (&acc7, 4);
  417. CO += 8;
  418. AO += k << 5;
  419. BO += k << 2;
  420. }
  421. if (m & 16)
  422. {
  423. IFLOAT *BO = B;
  424. v4sf_t *rowC;
  425. v4sf_t result[4];
  426. __vector_quad acc0, acc1, acc2, acc3;
  427. SET_ACC_ZERO4 ();
  428. BLASLONG l = 0;
  429. for (l = 0; l < k / 2; l++)
  430. {
  431. vec_t *rowA = (vec_t *) & (AO[l << 5]);
  432. vec_t *rowB = (vec_t *) & (BO[l << 3]);
  433. MMA (&acc0, rowB[0], rowA[0]);
  434. MMA (&acc1, rowB[0], rowA[1]);
  435. MMA (&acc2, rowB[0], rowA[2]);
  436. MMA (&acc3, rowB[0], rowA[3]);
  437. }
  438. if (k % 2 == 1)
  439. {
  440. if (k > 1)
  441. l = (k / 2) << 3;
  442. vec_t *rowA = (vec_t *) & (AO[(l << 2)]);
  443. vector short rowB_mrg =
  444. { BO[l], 0, BO[l + 1], 0, BO[l + 2], 0, BO[l + 3], 0 };
  445. MMA (&acc0, (vec_t)rowB_mrg, MERGE_HIGH (rowA[0], vzero));
  446. MMA (&acc1, (vec_t)rowB_mrg, MERGE_LOW (rowA[0], vzero));
  447. MMA (&acc2, (vec_t)rowB_mrg, MERGE_HIGH (rowA[1], vzero));
  448. MMA (&acc3, (vec_t)rowB_mrg, MERGE_LOW (rowA[1], vzero));
  449. }
  450. SAVE_ACC (&acc0, 0);
  451. SAVE_ACC (&acc1, 4);
  452. CO += 8;
  453. SAVE_ACC (&acc2, 0);
  454. SAVE_ACC (&acc3, 4);
  455. CO += 8;
  456. AO += k << 4;
  457. BO += k << 2;
  458. }
  459. if (m & 8)
  460. {
  461. IFLOAT *BO = B;
  462. v4sf_t *rowC;
  463. v4sf_t result[4];
  464. __vector_quad acc0, acc1;
  465. __builtin_mma_xxsetaccz (&acc0);
  466. __builtin_mma_xxsetaccz (&acc1);
  467. BLASLONG l = 0;
  468. for (l = 0; l < k / 2; l++)
  469. {
  470. vec_t *rowA = (vec_t *) & (AO[l << 4]);
  471. vec_t *rowB = (vec_t *) & (BO[l << 3]);
  472. MMA (&acc0, rowB[0], rowA[0]);
  473. MMA (&acc1, rowB[0], rowA[1]);
  474. }
  475. if (k % 2 == 1)
  476. {
  477. if (k > 1)
  478. l = (k / 2) << 3;
  479. vec_t *rowA = (vec_t *) & (AO[l << 1]);
  480. vec_t *rowB = (vec_t *) & (BO[l]);
  481. vector short rowB_mrg =
  482. { BO[l], 0, BO[l + 1], 0, BO[l + 2], 0, BO[l + 3], 0 };
  483. MMA (&acc0, (vec_t)rowB_mrg, MERGE_HIGH (rowA[0], vzero));
  484. MMA (&acc1, (vec_t)rowB_mrg, MERGE_LOW (rowA[0], vzero));
  485. }
  486. SAVE_ACC (&acc0, 0);
  487. SAVE_ACC (&acc1, 4);
  488. CO += 8;
  489. AO += k << 3;
  490. BO += k << 2;
  491. }
  492. if (m & 4)
  493. {
  494. IFLOAT *BO = B;
  495. v4sf_t *rowC;
  496. __vector_quad acc0;
  497. v4sf_t result[4];
  498. BLASLONG l = 0;
  499. __builtin_mma_xxsetaccz (&acc0);
  500. for (l = 0; l < k / 2; l++)
  501. {
  502. vec_t *rowA = (vec_t *) & (AO[l << 3]);
  503. vec_t *rowB = (vec_t *) & (BO[l << 3]);
  504. MMA (&acc0, rowB[0], rowA[0]);
  505. }
  506. if (k % 2 == 1)
  507. {
  508. if (k > 1)
  509. l = (k / 2) << 3;
  510. vector short rowA =
  511. { AO[l], 0, AO[l + 1], 0, AO[l + 2], 0, AO[l + 3], 0 };
  512. vector short rowB_mrg =
  513. { BO[l], 0, BO[l + 1], 0, BO[l + 2], 0, BO[l + 3], 0 };
  514. MMA (&acc0, (vec_t)(rowB_mrg), (vec_t) rowA);
  515. }
  516. SAVE_ACC (&acc0, 0);
  517. CO += 4;
  518. AO += k << 2;
  519. BO += k << 2;
  520. }
  521. if (m & 2)
  522. {
  523. IFLOAT *BO = B;
  524. v2sf_t *rowC;
  525. v2sf_t result[8];
  526. __vector_quad acc0;
  527. BLASLONG l = 0;
  528. __builtin_mma_xxsetaccz (&acc0);
  529. for (l = 0; l < k / 2; l++)
  530. {
  531. vector short rowA =
  532. { AO[(l << 2) + 0], AO[(l << 2) + 2], AO[(l << 2) + 1],
  533. AO[(l << 2) + 3],
  534. 0, 0, 0, 0
  535. };
  536. vec_t *rowB = (vec_t *) & (BO[l << 3]);
  537. MMA (&acc0, rowB[0], (vec_t) rowA);
  538. }
  539. if (k % 2 == 1)
  540. {
  541. if (k > 1)
  542. l = (k / 2) << 2;
  543. vector short rowA = { AO[l], 0, AO[l + 1], 0, 0, 0, 0, 0 };
  544. vector short rowB_mrg =
  545. { BO[(l<<1)], 0, BO[(l<<1) + 1], 0, BO[(l<<1) + 2], 0,
  546. BO[(l<<1) + 3], 0
  547. };
  548. MMA (&acc0, (vec_t)(rowB_mrg), (vec_t) rowA);
  549. }
  550. SAVE4x2_ACC (&acc0, 0);
  551. CO += 2;
  552. AO += k << 1;
  553. BO += k << 2;
  554. }
  555. if (m & 1)
  556. {
  557. IFLOAT *BO = B;
  558. v2sf_t *rowC;
  559. v4sf_t result[4], res[4];
  560. __vector_quad acc0;
  561. BLASLONG l = 0;
  562. __builtin_mma_xxsetaccz (&acc0);
  563. for (l = 0; l < k / 2; l++)
  564. {
  565. vector short rowA =
  566. { AO[(l << 1) + 0], AO[(l << 1) + 1], 0,
  567. 0, 0, 0, 0
  568. };
  569. vec_t *rowB = (vec_t *) & (BO[l << 3]);
  570. MMA (&acc0, rowB[0], (vec_t) rowA);
  571. }
  572. if (k % 2 == 1)
  573. {
  574. if (k > 1)
  575. l = (k / 2) << 1;
  576. vector short rowA = { AO[l], 0, 0, 0, 0, 0, 0, 0 };
  577. vector short rowB_mrg =
  578. { BO[(l<<2) + 0], 0, BO[(l<<2) + 1], 0, BO[(l <<2) + 2], 0,
  579. BO[(l<<2) + 3], 0
  580. };
  581. MMA (&acc0, (vec_t)(rowB_mrg), (vec_t) rowA);
  582. }
  583. SAVE4x2_ACC_SCALAR (&acc0);
  584. AO += k;
  585. BO += (k << 2);
  586. CO += 1;
  587. }
  588. B += k << 2;
  589. }
  590. if (n & 2)
  591. {
  592. BLASLONG j;
  593. FLOAT *CO;
  594. IFLOAT *AO;
  595. CO = C;
  596. C += ldc << 1;
  597. AO = A;
  598. /* Loop for m >= 32. */
  599. for (j = 0; j < (m >> 5); j++)
  600. {
  601. IFLOAT *BO = B;
  602. v4sf_t *rowC;
  603. v4sf_t result[4];
  604. IFLOAT *A1 = AO + (16 * k);
  605. __vector_quad acc0, acc1, acc2, acc3, acc4, acc5, acc6, acc7;
  606. SET_ACC_ZERO8 ();
  607. BLASLONG l = 0;
  608. for (l = 0; l < k / 2; l++)
  609. {
  610. vector short rowB =
  611. { BO[(l << 2) + 0], BO[(l << 2) + 2], BO[(l << 2) + 1],
  612. BO[(l << 2) + 3],
  613. 0, 0, 0, 0
  614. };
  615. vec_t *rowA = (vec_t *) & (AO[l << 5]);
  616. vec_t *rowA1 = (vec_t *) & (A1[l << 5]);
  617. MMA (&acc0, (vec_t) rowB, rowA[0]);
  618. MMA (&acc1, (vec_t) rowB, rowA[1]);
  619. MMA (&acc2, (vec_t) rowB, rowA[2]);
  620. MMA (&acc3, (vec_t) rowB, rowA[3]);
  621. MMA (&acc4, (vec_t) rowB, rowA1[0]);
  622. MMA (&acc5, (vec_t) rowB, rowA1[1]);
  623. MMA (&acc6, (vec_t) rowB, rowA1[2]);
  624. MMA (&acc7, (vec_t) rowB, rowA1[3]);
  625. }
  626. if (k % 2 == 1)
  627. {
  628. if (k > 1)
  629. l = (k / 2) << 2;
  630. vector short rowB = { BO[l + 0], 0, BO[l + 1], 0, 0, 0, 0, 0 };
  631. vec_t *rowA = (vec_t *) & (AO[l << 3]);
  632. vec_t *rowA1 = (vec_t *) & (A1[l << 3]);
  633. MMA (&acc0, (vec_t) rowB, MERGE_HIGH (rowA[0], vzero));
  634. MMA (&acc1, (vec_t) rowB, MERGE_LOW (rowA[0], vzero));
  635. MMA (&acc2, (vec_t) rowB, MERGE_HIGH (rowA[1], vzero));
  636. MMA (&acc3, (vec_t) rowB, MERGE_LOW (rowA[1], vzero));
  637. MMA (&acc4, (vec_t) rowB, MERGE_HIGH (rowA1[0], vzero));
  638. MMA (&acc5, (vec_t) rowB, MERGE_LOW (rowA1[0], vzero));
  639. MMA (&acc6, (vec_t) rowB, MERGE_HIGH (rowA1[1], vzero));
  640. MMA (&acc7, (vec_t) rowB, MERGE_LOW (rowA1[1], vzero));
  641. }
  642. SAVE2x4_ACC (&acc0, 0);
  643. SAVE2x4_ACC (&acc1, 4);
  644. SAVE2x4_ACC (&acc2, 8);
  645. SAVE2x4_ACC (&acc3, 12);
  646. CO += 16;
  647. SAVE2x4_ACC (&acc4, 0);
  648. SAVE2x4_ACC (&acc5, 4);
  649. SAVE2x4_ACC (&acc6, 8);
  650. SAVE2x4_ACC (&acc7, 12);
  651. CO += 16;
  652. AO += k << 5;
  653. BO += k << 1;
  654. }
  655. if (m & 16)
  656. {
  657. IFLOAT *BO = B;
  658. v4sf_t *rowC;
  659. v4sf_t result[4];
  660. __vector_quad acc0, acc1, acc2, acc3;
  661. SET_ACC_ZERO4 ();
  662. BLASLONG l = 0;
  663. for (l = 0; l < k / 2; l++)
  664. {
  665. vector short rowB =
  666. { BO[(l << 2) + 0], BO[(l << 2) + 2], BO[(l << 2) + 1],
  667. BO[(l << 2) + 3],
  668. 0, 0, 0, 0
  669. };
  670. vec_t *rowA = (vec_t *) & (AO[l << 5]);
  671. MMA (&acc0, (vec_t) rowB, rowA[0]);
  672. MMA (&acc1, (vec_t) rowB, rowA[1]);
  673. MMA (&acc2, (vec_t) rowB, rowA[2]);
  674. MMA (&acc3, (vec_t) rowB, rowA[3]);
  675. }
  676. if (k % 2 == 1)
  677. {
  678. if (k > 1)
  679. l = (k / 2) << 2;
  680. vector short rowB = { BO[l + 0], 0, BO[l + 1], 0, 0, 0, 0, 0 };
  681. vec_t *rowA = (vec_t *) & (AO[l << 3]);
  682. MMA (&acc0, (vec_t) rowB, MERGE_HIGH (rowA[0], vzero ));
  683. MMA (&acc1, (vec_t) rowB, MERGE_LOW (rowA[0], vzero));
  684. MMA (&acc2, (vec_t) rowB, MERGE_HIGH (rowA[1], vzero));
  685. MMA (&acc3, (vec_t) rowB, MERGE_LOW (rowA[1], vzero));
  686. }
  687. SAVE2x4_ACC (&acc0, 0);
  688. SAVE2x4_ACC (&acc1, 4);
  689. SAVE2x4_ACC (&acc2, 8);
  690. SAVE2x4_ACC (&acc3, 12);
  691. CO += 16;
  692. AO += k << 4;
  693. BO += k << 1;
  694. }
  695. if (m & 8)
  696. {
  697. IFLOAT *BO = B;
  698. v4sf_t *rowC;
  699. v4sf_t result[4];
  700. __vector_quad acc0, acc1;
  701. __builtin_mma_xxsetaccz (&acc0);
  702. __builtin_mma_xxsetaccz (&acc1);
  703. BLASLONG l = 0;
  704. for (l = 0; l < k / 2; l++)
  705. {
  706. vector short rowB =
  707. { BO[(l << 2) + 0], BO[(l << 2) + 2], BO[(l << 2) + 1],
  708. BO[(l << 2) + 3],
  709. 0, 0, 0, 0
  710. };
  711. vec_t *rowA = (vec_t *) & (AO[l << 4]);
  712. MMA (&acc0, (vec_t) rowB, rowA[0]);
  713. MMA (&acc1, (vec_t) rowB, rowA[1]);
  714. }
  715. if (k % 2 == 1)
  716. {
  717. if (k > 1)
  718. l = (k / 2) << 2;
  719. vector short rowB = { BO[l + 0], 0, BO[l + 1], 0, 0, 0, 0, 0 };
  720. vec_t *rowA = (vec_t *) & (AO[(l << 2)]);
  721. MMA (&acc0, (vec_t) rowB, MERGE_HIGH (rowA[0], vzero));
  722. MMA (&acc1, (vec_t) rowB, MERGE_LOW (rowA[0], vzero));
  723. }
  724. SAVE2x4_ACC (&acc0, 0);
  725. SAVE2x4_ACC (&acc1, 4);
  726. CO += 8;
  727. AO += k << 3;
  728. BO += k << 1;
  729. }
  730. if (m & 4)
  731. {
  732. IFLOAT *BO = B;
  733. v4sf_t *rowC;
  734. v4sf_t result[4];
  735. __vector_quad acc0;
  736. __builtin_mma_xxsetaccz (&acc0);
  737. BLASLONG l = 0;
  738. for (l = 0; l < k / 2; l++)
  739. {
  740. vector short rowB =
  741. { BO[(l << 2) + 0], BO[(l << 2) + 2], BO[(l << 2) + 1],
  742. BO[(l << 2) + 3],
  743. 0, 0, 0, 0
  744. };
  745. vec_t *rowA = (vec_t *) & (AO[l << 3]);
  746. MMA (&acc0, (vec_t) rowB, rowA[0]);
  747. }
  748. if (k % 2 == 1)
  749. {
  750. if (k > 1)
  751. l = (k / 2) << 2;
  752. vector short rowB = { BO[l + 0], 0, BO[l + 1], 0, 0, 0, 0, 0 };
  753. vector short rowA =
  754. { AO[(l << 1)], 0, AO[(l << 1) + 1] , 0 , AO[(l<<1) + 2],
  755. 0, AO[(l << 1) + 3], 0 };
  756. MMA (&acc0, (vec_t) rowB, (vec_t)(rowA));
  757. }
  758. SAVE2x4_ACC (&acc0, 0);
  759. CO += 4;
  760. AO += k << 2;
  761. BO += k << 1;
  762. }
  763. if (m & 2)
  764. {
  765. IFLOAT *BO = B;
  766. BLASLONG l = 0;
  767. v4sf_t t = { 0, 0, 0, 0 };
  768. for (l = 0; l < (k << 1); l += 2)
  769. {
  770. v4sf_t rowA =
  771. { BF16TOF32 (AO[l]), BF16TOF32 (AO[l]), BF16TOF32 (AO[l + 1]),
  772. BF16TOF32 (AO[l + 1])
  773. };
  774. v4sf_t rowB =
  775. { BF16TOF32 (BO[l]), BF16TOF32 (BO[l + 1]), BF16TOF32 (BO[l]),
  776. BF16TOF32 (BO[l + 1])
  777. };
  778. t += rowA * rowB;
  779. }
  780. t = t * valpha;
  781. CO[0 * ldc] += t[0];
  782. CO[1 * ldc] += t[1];
  783. CO[0 * ldc + 1] += t[2];
  784. CO[1 * ldc + 1] += t[3];
  785. CO += 2;
  786. AO += k << 1;
  787. BO += k << 1;
  788. }
  789. if (m & 1)
  790. {
  791. IFLOAT *BO = B;
  792. BLASLONG l = 0;
  793. v4sf_t t = { 0, 0, 0, 0 };
  794. for (l = 0; l < k; l++)
  795. {
  796. v4sf_t rowA = { BF16TOF32 (AO[l]), BF16TOF32 (AO[l]), 0, 0 };
  797. v4sf_t rowB =
  798. { BF16TOF32 (BO[l << 1]), BF16TOF32 (BO[(l << 1) + 1]), 0,
  799. 0
  800. };
  801. t += rowA * rowB;
  802. }
  803. CO[0 * ldc] += t[0] * alpha;
  804. CO[1 * ldc] += t[1] * alpha;
  805. CO += 1;
  806. AO += k;
  807. BO += k << 1;
  808. }
  809. B += k << 1;
  810. }
  811. if (n & 1)
  812. {
  813. BLASLONG j;
  814. FLOAT *CO;
  815. IFLOAT *AO;
  816. CO = C;
  817. C += ldc;
  818. AO = A;
  819. /* Loop for m >= 16. */
  820. for (j = 0; j < (m >> 4); j++)
  821. {
  822. IFLOAT *BO = B;
  823. v4sf_t *rowC;
  824. v4sf_t result[4];
  825. __vector_quad acc0, acc1, acc2, acc3;
  826. SET_ACC_ZERO4 ();
  827. BLASLONG l = 0;
  828. for (l = 0; l < k / 2; l++)
  829. {
  830. vector short rowB =
  831. { BO[l << 1], BO[(l << 1) + 1], 0, 0, 0, 0, 0, 0};
  832. vec_t *rowA = (vec_t *) & (AO[l << 5]);
  833. MMA (&acc0, (vec_t) rowB, rowA[0]);
  834. MMA (&acc1, (vec_t) rowB, rowA[1]);
  835. MMA (&acc2, (vec_t) rowB, rowA[2]);
  836. MMA (&acc3, (vec_t) rowB, rowA[3]);
  837. }
  838. if (k % 2 == 1)
  839. {
  840. if (k > 1)
  841. l = (k / 2) << 1;
  842. vector short rowB = { BO[l], 0, 0, 0, 0, 0, 0, 0 };
  843. vec_t *rowA = (vec_t *) & (AO[(l << 4)]);
  844. MMA (&acc0, (vec_t) rowB, MERGE_HIGH (rowA[0], vzero));
  845. MMA (&acc1, (vec_t) rowB, MERGE_LOW (rowA[0], vzero));
  846. MMA (&acc2, (vec_t) rowB, MERGE_HIGH (rowA[1], vzero));
  847. MMA (&acc3, (vec_t) rowB, MERGE_LOW (rowA[1], vzero));
  848. }
  849. rowC = (v4sf_t *) &CO[0];
  850. __builtin_mma_disassemble_acc ((void *)result, &acc0);
  851. rowC[0] += result[0] * alpha;
  852. __builtin_mma_disassemble_acc ((void *)result, &acc1);
  853. rowC[1] += result[0] * alpha;
  854. __builtin_mma_disassemble_acc ((void *)result, &acc2);
  855. rowC[2] += result[0] * alpha;
  856. __builtin_mma_disassemble_acc ((void *)result, &acc3);
  857. rowC[3] += result[0] * alpha;
  858. AO += k << 4;
  859. BO += k;
  860. CO += 16;
  861. }
  862. /* Loop for m >= 8. */
  863. if (m & 8)
  864. {
  865. IFLOAT *BO = B;
  866. v4sf_t *rowC;
  867. v4sf_t result[4];
  868. __vector_quad acc0, acc1;
  869. __builtin_mma_xxsetaccz (&acc0);
  870. __builtin_mma_xxsetaccz (&acc1);
  871. BLASLONG l = 0;
  872. for (l = 0; l < k / 2; l++)
  873. {
  874. vector short rowB =
  875. { BO[l << 1], BO[(l << 1) + 1], 0, 0, 0, 0, 0, 0};
  876. vec_t *rowA = (vec_t *) & (AO[l << 4]);
  877. MMA (&acc0, (vec_t) rowB, rowA[0]);
  878. MMA (&acc1, (vec_t) rowB, rowA[1]);
  879. }
  880. if (k % 2 == 1)
  881. {
  882. if (k > 1)
  883. l = (k / 2) << 1;
  884. vector short rowB = { BO[l], 0, 0, 0, 0, 0, 0, 0 };
  885. vec_t *rowA = (vec_t *) & (AO[(l << 3)]);
  886. MMA (&acc0, (vec_t) rowB, MERGE_HIGH (rowA[0], vzero));
  887. MMA (&acc1, (vec_t) rowB, MERGE_LOW (rowA[0], vzero));
  888. }
  889. rowC = (v4sf_t *) &CO[0];
  890. __builtin_mma_disassemble_acc ((void *)result, &acc0);
  891. rowC[0] += result[0] * alpha;
  892. __builtin_mma_disassemble_acc ((void *)result, &acc1);
  893. rowC[1] += result[0] * alpha;
  894. AO += k << 3;
  895. BO += k;
  896. CO += 8;
  897. }
  898. /* Loop for m >= 4. */
  899. if (m & 4)
  900. {
  901. IFLOAT *BO = B;
  902. v4sf_t *rowC;
  903. v4sf_t result[4];
  904. __vector_quad acc0;
  905. __builtin_mma_xxsetaccz (&acc0);
  906. BLASLONG l = 0;
  907. for (l = 0; l < k / 2; l++)
  908. {
  909. vector short rowB =
  910. { BO[l << 1], BO[(l << 1) + 1], 0, 0, 0, 0, 0, 0};
  911. vec_t *rowA = (vec_t *) & (AO[l << 3]);
  912. MMA (&acc0, (vec_t) rowB, rowA[0]);
  913. }
  914. if (k % 2 == 1)
  915. {
  916. if (k > 1)
  917. l = (k / 2) << 1;
  918. vector short rowB = { BO[l], 0, 0, 0, 0, 0, 0, 0 };
  919. vector short rowA =
  920. { AO[(l << 2)], 0, AO[(l << 2) + 1] , 0 ,
  921. AO[(l << 2) + 2], 0, AO[(l << 2) + 3], 0 };
  922. MMA (&acc0, (vec_t) rowB, (vec_t)(rowA));
  923. }
  924. rowC = (v4sf_t *) &CO[0];
  925. __builtin_mma_disassemble_acc ((void *)result, &acc0);
  926. rowC[0] += result[0] * alpha;
  927. AO += k << 2;
  928. BO += k;
  929. CO += 4;
  930. }
  931. /* Loop for m >= 2. */
  932. if (m & 2)
  933. {
  934. IFLOAT *BO = B;
  935. BLASLONG l = 0;
  936. v4sf_t t = { 0, 0, 0, 0 };
  937. for (l = 0; l < k; l++)
  938. {
  939. v4sf_t rowB = { BF16TOF32 (BO[l]), BF16TOF32 (BO[l]), 0, 0 };
  940. v4sf_t rowA =
  941. { BF16TOF32 (AO[l << 1]), BF16TOF32 (AO[(l << 1) + 1]), 0,
  942. 0
  943. };
  944. t += rowA * rowB;
  945. }
  946. t = t * valpha;
  947. CO[0] += t[0];
  948. CO[1] += t[1];
  949. AO += k << 1;
  950. BO += k;
  951. CO += 2;
  952. }
  953. /* Loop for m = 1. */
  954. if (m & 1)
  955. {
  956. IFLOAT *BO = B;
  957. BLASLONG l = 0;
  958. FLOAT t = 0;
  959. for (l = 0; l < k; l++)
  960. {
  961. t += BF16TOF32 (AO[l]) * BF16TOF32 (BO[l]);
  962. }
  963. AO += k;
  964. BO += k;
  965. CO[0] += t * alpha;
  966. CO += 1;
  967. }
  968. B += k;
  969. }
  970. return 0;
  971. }