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.

trmmkernel_4x8.c 22 kB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402
  1. #include "common.h"
  2. #include <stdbool.h>
  3. int CNAME(BLASLONG bm,BLASLONG bn,BLASLONG bk,FLOAT alpha,FLOAT* ba,FLOAT* bb,FLOAT* C,BLASLONG ldc ,BLASLONG offset)
  4. {
  5. BLASLONG i,j,k;
  6. FLOAT *C0,*C1,*C2,*C3,*C4,*C5,*C6,*C7,*ptrba,*ptrbb;
  7. FLOAT res0_0;
  8. FLOAT res0_1;
  9. FLOAT res0_2;
  10. FLOAT res0_3;
  11. FLOAT res1_0;
  12. FLOAT res1_1;
  13. FLOAT res1_2;
  14. FLOAT res1_3;
  15. FLOAT res2_0;
  16. FLOAT res2_1;
  17. FLOAT res2_2;
  18. FLOAT res2_3;
  19. FLOAT res3_0;
  20. FLOAT res3_1;
  21. FLOAT res3_2;
  22. FLOAT res3_3;
  23. FLOAT res4_0;
  24. FLOAT res4_1;
  25. FLOAT res4_2;
  26. FLOAT res4_3;
  27. FLOAT res5_0;
  28. FLOAT res5_1;
  29. FLOAT res5_2;
  30. FLOAT res5_3;
  31. FLOAT res6_0;
  32. FLOAT res6_1;
  33. FLOAT res6_2;
  34. FLOAT res6_3;
  35. FLOAT res7_0;
  36. FLOAT res7_1;
  37. FLOAT res7_2;
  38. FLOAT res7_3;
  39. FLOAT a0;
  40. FLOAT a1;
  41. FLOAT b0;
  42. FLOAT b1;
  43. FLOAT b2;
  44. FLOAT b3;
  45. FLOAT b4;
  46. FLOAT b5;
  47. FLOAT b6;
  48. FLOAT b7;
  49. BLASLONG off, temp;
  50. bool left;
  51. bool transposed;
  52. bool backwards;
  53. #ifdef LEFT
  54. left = true;
  55. #else
  56. left = false;
  57. #endif
  58. #ifdef TRANSA
  59. transposed = true;
  60. #else
  61. transposed = false;
  62. #endif
  63. backwards = left != transposed;
  64. if (!left) {
  65. off = -offset;
  66. }
  67. for (j=0; j<bn/8; j+=1) // do blocks of the Mx8 loops
  68. {
  69. C0 = C;
  70. C1 = C0+ldc;
  71. C2 = C1+ldc;
  72. C3 = C2+ldc;
  73. C4 = C3+ldc;
  74. C5 = C4+ldc;
  75. C6 = C5+ldc;
  76. C7 = C6+ldc;
  77. if (left) {
  78. off = offset;
  79. }
  80. ptrba = ba;
  81. for (i=0; i<bm/4; i+=1) // do blocks of 4x4
  82. {
  83. ptrbb = bb;
  84. if (backwards)
  85. {
  86. ptrba += off*4; // number of values in A
  87. ptrbb += off*8; // number of values in B
  88. }
  89. res0_0 = 0;
  90. res0_1 = 0;
  91. res0_2 = 0;
  92. res0_3 = 0;
  93. res1_0 = 0;
  94. res1_1 = 0;
  95. res1_2 = 0;
  96. res1_3 = 0;
  97. res2_0 = 0;
  98. res2_1 = 0;
  99. res2_2 = 0;
  100. res2_3 = 0;
  101. res3_0 = 0;
  102. res3_1 = 0;
  103. res3_2 = 0;
  104. res3_3 = 0;
  105. res4_0 = 0;
  106. res4_1 = 0;
  107. res4_2 = 0;
  108. res4_3 = 0;
  109. res5_0 = 0;
  110. res5_1 = 0;
  111. res5_2 = 0;
  112. res5_3 = 0;
  113. res6_0 = 0;
  114. res6_1 = 0;
  115. res6_2 = 0;
  116. res6_3 = 0;
  117. res7_0 = 0;
  118. res7_1 = 0;
  119. res7_2 = 0;
  120. res7_3 = 0;
  121. temp = backwards ? bk-off :
  122. left ? off + 4 : // number of values in A
  123. off + 8; // number of values in B
  124. for (k=0; k<temp; k++)
  125. {
  126. b0 = ptrbb[0];
  127. b1 = ptrbb[1];
  128. b2 = ptrbb[2];
  129. b3 = ptrbb[3];
  130. b4 = ptrbb[4];
  131. b5 = ptrbb[5];
  132. b6 = ptrbb[6];
  133. b7 = ptrbb[7];
  134. a0 = ptrba[0];
  135. res0_0 += a0*b0;
  136. res1_0 += a0*b1;
  137. res2_0 += a0*b2;
  138. res3_0 += a0*b3;
  139. res4_0 += a0*b4;
  140. res5_0 += a0*b5;
  141. res6_0 += a0*b6;
  142. res7_0 += a0*b7;
  143. a1 = ptrba[1];
  144. res0_1 += a1*b0;
  145. res1_1 += a1*b1;
  146. res2_1 += a1*b2;
  147. res3_1 += a1*b3;
  148. res4_1 += a1*b4;
  149. res5_1 += a1*b5;
  150. res6_1 += a1*b6;
  151. res7_1 += a1*b7;
  152. a0 = ptrba[2];
  153. res0_2 += a0*b0;
  154. res1_2 += a0*b1;
  155. res2_2 += a0*b2;
  156. res3_2 += a0*b3;
  157. res4_2 += a0*b4;
  158. res5_2 += a0*b5;
  159. res6_2 += a0*b6;
  160. res7_2 += a0*b7;
  161. a1 = ptrba[3];
  162. res0_3 += a1*b0;
  163. res1_3 += a1*b1;
  164. res2_3 += a1*b2;
  165. res3_3 += a1*b3;
  166. res4_3 += a1*b4;
  167. res5_3 += a1*b5;
  168. res6_3 += a1*b6;
  169. res7_3 += a1*b7;
  170. ptrba = ptrba+4;
  171. ptrbb = ptrbb+8;
  172. }
  173. res0_0 *= alpha;
  174. res0_1 *= alpha;
  175. res0_2 *= alpha;
  176. res0_3 *= alpha;
  177. res1_0 *= alpha;
  178. res1_1 *= alpha;
  179. res1_2 *= alpha;
  180. res1_3 *= alpha;
  181. res2_0 *= alpha;
  182. res2_1 *= alpha;
  183. res2_2 *= alpha;
  184. res2_3 *= alpha;
  185. res3_0 *= alpha;
  186. res3_1 *= alpha;
  187. res3_2 *= alpha;
  188. res3_3 *= alpha;
  189. res4_0 *= alpha;
  190. res4_1 *= alpha;
  191. res4_2 *= alpha;
  192. res4_3 *= alpha;
  193. res5_0 *= alpha;
  194. res5_1 *= alpha;
  195. res5_2 *= alpha;
  196. res5_3 *= alpha;
  197. res6_0 *= alpha;
  198. res6_1 *= alpha;
  199. res6_2 *= alpha;
  200. res6_3 *= alpha;
  201. res7_0 *= alpha;
  202. res7_1 *= alpha;
  203. res7_2 *= alpha;
  204. res7_3 *= alpha;
  205. C0[0] = res0_0;
  206. C0[1] = res0_1;
  207. C0[2] = res0_2;
  208. C0[3] = res0_3;
  209. C1[0] = res1_0;
  210. C1[1] = res1_1;
  211. C1[2] = res1_2;
  212. C1[3] = res1_3;
  213. C2[0] = res2_0;
  214. C2[1] = res2_1;
  215. C2[2] = res2_2;
  216. C2[3] = res2_3;
  217. C3[0] = res3_0;
  218. C3[1] = res3_1;
  219. C3[2] = res3_2;
  220. C3[3] = res3_3;
  221. C4[0] = res4_0;
  222. C4[1] = res4_1;
  223. C4[2] = res4_2;
  224. C4[3] = res4_3;
  225. C5[0] = res5_0;
  226. C5[1] = res5_1;
  227. C5[2] = res5_2;
  228. C5[3] = res5_3;
  229. C6[0] = res6_0;
  230. C6[1] = res6_1;
  231. C6[2] = res6_2;
  232. C6[3] = res6_3;
  233. C7[0] = res7_0;
  234. C7[1] = res7_1;
  235. C7[2] = res7_2;
  236. C7[3] = res7_3;
  237. if (!backwards) {
  238. temp = bk-off;
  239. temp = left ? temp - 4 : // number of values in A
  240. temp - 8; // number of values in B
  241. ptrba += temp*4; // number of values in A
  242. ptrbb += temp*8; // number of values in B
  243. }
  244. #ifdef LEFT
  245. off += 4; // number of values in A
  246. #endif
  247. C0 = C0+4;
  248. C1 = C1+4;
  249. C2 = C2+4;
  250. C3 = C3+4;
  251. C4 = C4+4;
  252. C5 = C5+4;
  253. C6 = C6+4;
  254. C7 = C7+4;
  255. }
  256. if ( bm & 2 ) // do any 2x4 loop
  257. {
  258. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  259. ptrbb = bb;
  260. #else
  261. ptrba += off*2;
  262. ptrbb = bb + off*8;
  263. #endif
  264. res0_0 = 0;
  265. res0_1 = 0;
  266. res1_0 = 0;
  267. res1_1 = 0;
  268. res2_0 = 0;
  269. res2_1 = 0;
  270. res3_0 = 0;
  271. res3_1 = 0;
  272. res4_0 = 0;
  273. res4_1 = 0;
  274. res5_0 = 0;
  275. res5_1 = 0;
  276. res6_0 = 0;
  277. res6_1 = 0;
  278. res7_0 = 0;
  279. res7_1 = 0;
  280. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  281. temp = bk-off;
  282. #elif defined(LEFT)
  283. temp = off+2; // number of values in A
  284. #else
  285. temp = off+8; // number of values in B
  286. #endif
  287. for (k=0; k<temp; k++)
  288. {
  289. b0 = ptrbb[0];
  290. b1 = ptrbb[1];
  291. b2 = ptrbb[2];
  292. b3 = ptrbb[3];
  293. b4 = ptrbb[4];
  294. b5 = ptrbb[5];
  295. b6 = ptrbb[6];
  296. b7 = ptrbb[7];
  297. a0 = ptrba[0];
  298. res0_0 += a0*b0;
  299. res1_0 += a0*b1;
  300. res2_0 += a0*b2;
  301. res3_0 += a0*b3;
  302. res4_0 += a0*b4;
  303. res5_0 += a0*b5;
  304. res6_0 += a0*b6;
  305. res7_0 += a0*b7;
  306. a1 = ptrba[1];
  307. res0_1 += a1*b0;
  308. res1_1 += a1*b1;
  309. res2_1 += a1*b2;
  310. res3_1 += a1*b3;
  311. res4_1 += a1*b4;
  312. res5_1 += a1*b5;
  313. res6_1 += a1*b6;
  314. res7_1 += a1*b7;
  315. ptrba = ptrba+2;
  316. ptrbb = ptrbb+8;
  317. }
  318. res0_0 *= alpha;
  319. res0_1 *= alpha;
  320. res1_0 *= alpha;
  321. res1_1 *= alpha;
  322. res2_0 *= alpha;
  323. res2_1 *= alpha;
  324. res3_0 *= alpha;
  325. res3_1 *= alpha;
  326. res4_0 *= alpha;
  327. res4_1 *= alpha;
  328. res5_0 *= alpha;
  329. res5_1 *= alpha;
  330. res6_0 *= alpha;
  331. res6_1 *= alpha;
  332. res7_0 *= alpha;
  333. res7_1 *= alpha;
  334. C0[0] = res0_0;
  335. C0[1] = res0_1;
  336. C1[0] = res1_0;
  337. C1[1] = res1_1;
  338. C2[0] = res2_0;
  339. C2[1] = res2_1;
  340. C3[0] = res3_0;
  341. C3[1] = res3_1;
  342. C4[0] = res4_0;
  343. C4[1] = res4_1;
  344. C5[0] = res5_0;
  345. C5[1] = res5_1;
  346. C6[0] = res6_0;
  347. C6[1] = res6_1;
  348. C7[0] = res7_0;
  349. C7[1] = res7_1;
  350. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  351. temp = bk - off;
  352. #ifdef LEFT
  353. temp -= 2; // number of values in A
  354. #else
  355. temp -= 8; // number of values in B
  356. #endif
  357. ptrba += temp*2;
  358. ptrbb += temp*8;
  359. #endif
  360. #ifdef LEFT
  361. off += 2; // number of values in A
  362. #endif
  363. C0 = C0+2;
  364. C1 = C1+2;
  365. C2 = C2+2;
  366. C3 = C3+2;
  367. C4 = C4+2;
  368. C5 = C5+2;
  369. C6 = C6+2;
  370. C7 = C7+2;
  371. }
  372. if ( bm & 1 ) // do any 1x4 loop
  373. {
  374. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  375. ptrbb = bb;
  376. #else
  377. ptrba += off*1;
  378. ptrbb = bb + off*8;
  379. #endif
  380. res0_0 = 0;
  381. res1_0 = 0;
  382. res2_0 = 0;
  383. res3_0 = 0;
  384. res4_0 = 0;
  385. res5_0 = 0;
  386. res6_0 = 0;
  387. res7_0 = 0;
  388. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  389. temp = bk-off;
  390. #elif defined(LEFT)
  391. temp = off+1; // number of values in A
  392. #else
  393. temp = off+8; // number of values in B
  394. #endif
  395. for (k=0; k<temp; k++)
  396. {
  397. b0 = ptrbb[0];
  398. b1 = ptrbb[1];
  399. b2 = ptrbb[2];
  400. b3 = ptrbb[3];
  401. b4 = ptrbb[4];
  402. b5 = ptrbb[5];
  403. b6 = ptrbb[6];
  404. b7 = ptrbb[7];
  405. a0 = ptrba[0];
  406. res0_0 += a0*b0;
  407. res1_0 += a0*b1;
  408. res2_0 += a0*b2;
  409. res3_0 += a0*b3;
  410. res4_0 += a0*b4;
  411. res5_0 += a0*b5;
  412. res6_0 += a0*b6;
  413. res7_0 += a0*b7;
  414. ptrba = ptrba+1;
  415. ptrbb = ptrbb+8;
  416. }
  417. res0_0 *= alpha;
  418. res1_0 *= alpha;
  419. res2_0 *= alpha;
  420. res3_0 *= alpha;
  421. res4_0 *= alpha;
  422. res5_0 *= alpha;
  423. res6_0 *= alpha;
  424. res7_0 *= alpha;
  425. C0[0] = res0_0;
  426. C1[0] = res1_0;
  427. C2[0] = res2_0;
  428. C3[0] = res3_0;
  429. C4[0] = res4_0;
  430. C5[0] = res5_0;
  431. C6[0] = res6_0;
  432. C7[0] = res7_0;
  433. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  434. temp = bk - off;
  435. #ifdef LEFT
  436. temp -= 1; // number of values in A
  437. #else
  438. temp -= 8; // number of values in B
  439. #endif
  440. ptrba += temp*1;
  441. ptrbb += temp*8;
  442. #endif
  443. #ifdef LEFT
  444. off += 1; // number of values in A
  445. #endif
  446. C0 = C0+1;
  447. C1 = C1+1;
  448. C2 = C2+1;
  449. C3 = C3+1;
  450. C4 = C4+1;
  451. C5 = C5+1;
  452. C6 = C6+1;
  453. C7 = C7+1;
  454. }
  455. #if defined(TRMMKERNEL) && !defined(LEFT)
  456. off += 8;
  457. #endif
  458. k = (bk<<3);
  459. bb = bb+k;
  460. i = (ldc<<3);
  461. C = C+i;
  462. }
  463. for (j=0; j<(bn&4); j+=4) // do blocks of the Mx4 loops
  464. {
  465. C0 = C;
  466. C1 = C0+ldc;
  467. C2 = C1+ldc;
  468. C3 = C2+ldc;
  469. if (left) {
  470. off = offset;
  471. }
  472. ptrba = ba;
  473. for (i=0; i<bm/4; i+=1) // do blocks of 4x4
  474. {
  475. ptrbb = bb;
  476. if (backwards)
  477. {
  478. ptrba += off*4; // number of values in A
  479. ptrbb += off*4; // number of values in B
  480. }
  481. res0_0 = 0;
  482. res0_1 = 0;
  483. res0_2 = 0;
  484. res0_3 = 0;
  485. res1_0 = 0;
  486. res1_1 = 0;
  487. res1_2 = 0;
  488. res1_3 = 0;
  489. res2_0 = 0;
  490. res2_1 = 0;
  491. res2_2 = 0;
  492. res2_3 = 0;
  493. res3_0 = 0;
  494. res3_1 = 0;
  495. res3_2 = 0;
  496. res3_3 = 0;
  497. temp = backwards ? bk-off :
  498. left ? off + 4 : // number of values in A
  499. off + 4; // number of values in B
  500. for (k=0; k<temp; k++)
  501. {
  502. b0 = ptrbb[0];
  503. b1 = ptrbb[1];
  504. b2 = ptrbb[2];
  505. b3 = ptrbb[3];
  506. a0 = ptrba[0];
  507. res0_0 += a0*b0;
  508. res1_0 += a0*b1;
  509. res2_0 += a0*b2;
  510. res3_0 += a0*b3;
  511. a1 = ptrba[1];
  512. res0_1 += a1*b0;
  513. res1_1 += a1*b1;
  514. res2_1 += a1*b2;
  515. res3_1 += a1*b3;
  516. a0 = ptrba[2];
  517. res0_2 += a0*b0;
  518. res1_2 += a0*b1;
  519. res2_2 += a0*b2;
  520. res3_2 += a0*b3;
  521. a1 = ptrba[3];
  522. res0_3 += a1*b0;
  523. res1_3 += a1*b1;
  524. res2_3 += a1*b2;
  525. res3_3 += a1*b3;
  526. ptrba = ptrba+4;
  527. ptrbb = ptrbb+4;
  528. }
  529. res0_0 *= alpha;
  530. res0_1 *= alpha;
  531. res0_2 *= alpha;
  532. res0_3 *= alpha;
  533. res1_0 *= alpha;
  534. res1_1 *= alpha;
  535. res1_2 *= alpha;
  536. res1_3 *= alpha;
  537. res2_0 *= alpha;
  538. res2_1 *= alpha;
  539. res2_2 *= alpha;
  540. res2_3 *= alpha;
  541. res3_0 *= alpha;
  542. res3_1 *= alpha;
  543. res3_2 *= alpha;
  544. res3_3 *= alpha;
  545. C0[0] = res0_0;
  546. C0[1] = res0_1;
  547. C0[2] = res0_2;
  548. C0[3] = res0_3;
  549. C1[0] = res1_0;
  550. C1[1] = res1_1;
  551. C1[2] = res1_2;
  552. C1[3] = res1_3;
  553. C2[0] = res2_0;
  554. C2[1] = res2_1;
  555. C2[2] = res2_2;
  556. C2[3] = res2_3;
  557. C3[0] = res3_0;
  558. C3[1] = res3_1;
  559. C3[2] = res3_2;
  560. C3[3] = res3_3;
  561. if (!backwards) {
  562. temp = bk-off;
  563. temp = left ? temp - 4 : // number of values in A
  564. temp - 4; // number of values in B
  565. ptrba += temp*4; // number of values in A
  566. ptrbb += temp*4; // number of values in B
  567. }
  568. #ifdef LEFT
  569. off += 4; // number of values in A
  570. #endif
  571. C0 = C0+4;
  572. C1 = C1+4;
  573. C2 = C2+4;
  574. C3 = C3+4;
  575. }
  576. if ( bm & 2 ) // do any 2x4 loop
  577. {
  578. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  579. ptrbb = bb;
  580. #else
  581. ptrba += off*2;
  582. ptrbb = bb + off*4;
  583. #endif
  584. res0_0 = 0;
  585. res0_1 = 0;
  586. res1_0 = 0;
  587. res1_1 = 0;
  588. res2_0 = 0;
  589. res2_1 = 0;
  590. res3_0 = 0;
  591. res3_1 = 0;
  592. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  593. temp = bk-off;
  594. #elif defined(LEFT)
  595. temp = off+2; // number of values in A
  596. #else
  597. temp = off+4; // number of values in B
  598. #endif
  599. for (k=0; k<temp; k++)
  600. {
  601. b0 = ptrbb[0];
  602. b1 = ptrbb[1];
  603. b2 = ptrbb[2];
  604. b3 = ptrbb[3];
  605. a0 = ptrba[0];
  606. res0_0 += a0*b0;
  607. res1_0 += a0*b1;
  608. res2_0 += a0*b2;
  609. res3_0 += a0*b3;
  610. a1 = ptrba[1];
  611. res0_1 += a1*b0;
  612. res1_1 += a1*b1;
  613. res2_1 += a1*b2;
  614. res3_1 += a1*b3;
  615. ptrba = ptrba+2;
  616. ptrbb = ptrbb+4;
  617. }
  618. res0_0 *= alpha;
  619. res0_1 *= alpha;
  620. res1_0 *= alpha;
  621. res1_1 *= alpha;
  622. res2_0 *= alpha;
  623. res2_1 *= alpha;
  624. res3_0 *= alpha;
  625. res3_1 *= alpha;
  626. C0[0] = res0_0;
  627. C0[1] = res0_1;
  628. C1[0] = res1_0;
  629. C1[1] = res1_1;
  630. C2[0] = res2_0;
  631. C2[1] = res2_1;
  632. C3[0] = res3_0;
  633. C3[1] = res3_1;
  634. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  635. temp = bk - off;
  636. #ifdef LEFT
  637. temp -= 2; // number of values in A
  638. #else
  639. temp -= 4; // number of values in B
  640. #endif
  641. ptrba += temp*2;
  642. ptrbb += temp*4;
  643. #endif
  644. #ifdef LEFT
  645. off += 2; // number of values in A
  646. #endif
  647. C0 = C0+2;
  648. C1 = C1+2;
  649. C2 = C2+2;
  650. C3 = C3+2;
  651. }
  652. if ( bm & 1 ) // do any 1x4 loop
  653. {
  654. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  655. ptrbb = bb;
  656. #else
  657. ptrba += off*1;
  658. ptrbb = bb + off*4;
  659. #endif
  660. res0_0 = 0;
  661. res1_0 = 0;
  662. res2_0 = 0;
  663. res3_0 = 0;
  664. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  665. temp = bk-off;
  666. #elif defined(LEFT)
  667. temp = off+1; // number of values in A
  668. #else
  669. temp = off+4; // number of values in B
  670. #endif
  671. for (k=0; k<temp; k++)
  672. {
  673. b0 = ptrbb[0];
  674. b1 = ptrbb[1];
  675. b2 = ptrbb[2];
  676. b3 = ptrbb[3];
  677. a0 = ptrba[0];
  678. res0_0 += a0*b0;
  679. res1_0 += a0*b1;
  680. res2_0 += a0*b2;
  681. res3_0 += a0*b3;
  682. ptrba = ptrba+1;
  683. ptrbb = ptrbb+4;
  684. }
  685. res0_0 *= alpha;
  686. res1_0 *= alpha;
  687. res2_0 *= alpha;
  688. res3_0 *= alpha;
  689. C0[0] = res0_0;
  690. C1[0] = res1_0;
  691. C2[0] = res2_0;
  692. C3[0] = res3_0;
  693. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  694. temp = bk - off;
  695. #ifdef LEFT
  696. temp -= 1; // number of values in A
  697. #else
  698. temp -= 4; // number of values in B
  699. #endif
  700. ptrba += temp*1;
  701. ptrbb += temp*4;
  702. #endif
  703. #ifdef LEFT
  704. off += 1; // number of values in A
  705. #endif
  706. C0 = C0+1;
  707. C1 = C1+1;
  708. C2 = C2+1;
  709. C3 = C3+1;
  710. }
  711. #if defined(TRMMKERNEL) && !defined(LEFT)
  712. off += 4;
  713. #endif
  714. k = (bk<<2);
  715. bb = bb+k;
  716. i = (ldc<<2);
  717. C = C+i;
  718. }
  719. for (j=0; j<(bn&2); j+=2) // do the Mx2 loops
  720. {
  721. C0 = C;
  722. C1 = C0+ldc;
  723. #if defined(TRMMKERNEL) && defined(LEFT)
  724. off = offset;
  725. #endif
  726. ptrba = ba;
  727. for (i=0; i<bm/4; i+=1) // do blocks of 4x2
  728. {
  729. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  730. ptrbb = bb;
  731. #else
  732. ptrba += off*4;
  733. ptrbb = bb + off*2;
  734. #endif
  735. res0_0 = 0;
  736. res0_1 = 0;
  737. res0_2 = 0;
  738. res0_3 = 0;
  739. res1_0 = 0;
  740. res1_1 = 0;
  741. res1_2 = 0;
  742. res1_3 = 0;
  743. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  744. temp = bk-off;
  745. #elif defined(LEFT)
  746. temp = off+4; // number of values in A
  747. #else
  748. temp = off+2; // number of values in B
  749. #endif
  750. for (k=0; k<temp; k++)
  751. {
  752. b0 = ptrbb[0];
  753. b1 = ptrbb[1];
  754. a0 = ptrba[0];
  755. res0_0 += a0*b0;
  756. res1_0 += a0*b1;
  757. a1 = ptrba[1];
  758. res0_1 += a1*b0;
  759. res1_1 += a1*b1;
  760. a0 = ptrba[2];
  761. res0_2 += a0*b0;
  762. res1_2 += a0*b1;
  763. a1 = ptrba[3];
  764. res0_3 += a1*b0;
  765. res1_3 += a1*b1;
  766. ptrba = ptrba+4;
  767. ptrbb = ptrbb+2;
  768. }
  769. res0_0 *= alpha;
  770. res0_1 *= alpha;
  771. res0_2 *= alpha;
  772. res0_3 *= alpha;
  773. res1_0 *= alpha;
  774. res1_1 *= alpha;
  775. res1_2 *= alpha;
  776. res1_3 *= alpha;
  777. C0[0] = res0_0;
  778. C0[1] = res0_1;
  779. C0[2] = res0_2;
  780. C0[3] = res0_3;
  781. C1[0] = res1_0;
  782. C1[1] = res1_1;
  783. C1[2] = res1_2;
  784. C1[3] = res1_3;
  785. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  786. temp = bk - off;
  787. #ifdef LEFT
  788. temp -= 4; // number of values in A
  789. #else
  790. temp -= 2; // number of values in B
  791. #endif
  792. ptrba += temp*4;
  793. ptrbb += temp*2;
  794. #endif
  795. #ifdef LEFT
  796. off += 4; // number of values in A
  797. #endif
  798. C0 = C0+4;
  799. C1 = C1+4;
  800. }
  801. if ( bm & 2 ) // do any 2x2 loop
  802. {
  803. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  804. ptrbb = bb;
  805. #else
  806. ptrba += off*2;
  807. ptrbb = bb + off*2;
  808. #endif
  809. res0_0 = 0;
  810. res0_1 = 0;
  811. res1_0 = 0;
  812. res1_1 = 0;
  813. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  814. temp = bk-off;
  815. #elif defined(LEFT)
  816. temp = off+2; // number of values in A
  817. #else
  818. temp = off+2; // number of values in B
  819. #endif
  820. for (k=0; k<temp; k++)
  821. {
  822. b0 = ptrbb[0];
  823. b1 = ptrbb[1];
  824. a0 = ptrba[0];
  825. res0_0 += a0*b0;
  826. res1_0 += a0*b1;
  827. a1 = ptrba[1];
  828. res0_1 += a1*b0;
  829. res1_1 += a1*b1;
  830. ptrba = ptrba+2;
  831. ptrbb = ptrbb+2;
  832. }
  833. res0_0 *= alpha;
  834. res0_1 *= alpha;
  835. res1_0 *= alpha;
  836. res1_1 *= alpha;
  837. C0[0] = res0_0;
  838. C0[1] = res0_1;
  839. C1[0] = res1_0;
  840. C1[1] = res1_1;
  841. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  842. temp = bk - off;
  843. #ifdef LEFT
  844. temp -= 2; // number of values in A
  845. #else
  846. temp -= 2; // number of values in B
  847. #endif
  848. ptrba += temp*2;
  849. ptrbb += temp*2;
  850. #endif
  851. #ifdef LEFT
  852. off += 2; // number of values in A
  853. #endif
  854. C0 = C0+2;
  855. C1 = C1+2;
  856. }
  857. if ( bm & 1 ) // do any 1x2 loop
  858. {
  859. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  860. ptrbb = bb;
  861. #else
  862. ptrba += off*1;
  863. ptrbb = bb + off*2;
  864. #endif
  865. res0_0 = 0;
  866. res1_0 = 0;
  867. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  868. temp = bk-off;
  869. #elif defined(LEFT)
  870. temp = off+1; // number of values in A
  871. #else
  872. temp = off+2; // number of values in B
  873. #endif
  874. for (k=0; k<temp; k++)
  875. {
  876. b0 = ptrbb[0];
  877. b1 = ptrbb[1];
  878. a0 = ptrba[0];
  879. res0_0 += a0*b0;
  880. res1_0 += a0*b1;
  881. ptrba = ptrba+1;
  882. ptrbb = ptrbb+2;
  883. }
  884. res0_0 *= alpha;
  885. res1_0 *= alpha;
  886. C0[0] = res0_0;
  887. C1[0] = res1_0;
  888. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  889. temp = bk - off;
  890. #ifdef LEFT
  891. temp -= 1; // number of values in A
  892. #else
  893. temp -= 2; // number of values in B
  894. #endif
  895. ptrba += temp*1;
  896. ptrbb += temp*2;
  897. #endif
  898. #ifdef LEFT
  899. off += 1; // number of values in A
  900. #endif
  901. C0 = C0+1;
  902. C1 = C1+1;
  903. }
  904. #if defined(TRMMKERNEL) && !defined(LEFT)
  905. off += 2;
  906. #endif
  907. k = (bk<<1);
  908. bb = bb+k;
  909. i = (ldc<<1);
  910. C = C+i;
  911. }
  912. for (j=0; j<(bn&1); j+=1) // do the Mx1 loops
  913. {
  914. C0 = C;
  915. #if defined(TRMMKERNEL) && defined(LEFT)
  916. off = offset;
  917. #endif
  918. ptrba = ba;
  919. for (i=0; i<bm/4; i+=1) // do blocks of 4x1 loops
  920. {
  921. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  922. ptrbb = bb;
  923. #else
  924. ptrba += off*4;
  925. ptrbb = bb + off*1;
  926. #endif
  927. res0_0 = 0;
  928. res0_1 = 0;
  929. res0_2 = 0;
  930. res0_3 = 0;
  931. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  932. temp = bk-off;
  933. #elif defined(LEFT)
  934. temp = off+4; // number of values in A
  935. #else
  936. temp = off+1; // number of values in B
  937. #endif
  938. for (k=0; k<temp; k++)
  939. {
  940. b0 = ptrbb[0];
  941. a0 = ptrba[0];
  942. res0_0 += a0*b0;
  943. a1 = ptrba[1];
  944. res0_1 += a1*b0;
  945. a0 = ptrba[2];
  946. res0_2 += a0*b0;
  947. a1 = ptrba[3];
  948. res0_3 += a1*b0;
  949. ptrba = ptrba+4;
  950. ptrbb = ptrbb+1;
  951. }
  952. res0_0 *= alpha;
  953. res0_1 *= alpha;
  954. res0_2 *= alpha;
  955. res0_3 *= alpha;
  956. C0[0] = res0_0;
  957. C0[1] = res0_1;
  958. C0[2] = res0_2;
  959. C0[3] = res0_3;
  960. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  961. temp = bk - off;
  962. #ifdef LEFT
  963. temp -= 4; // number of values in A
  964. #else
  965. temp -= 1; // number of values in B
  966. #endif
  967. ptrba += temp*4;
  968. ptrbb += temp*1;
  969. #endif
  970. #ifdef LEFT
  971. off += 4; // number of values in A
  972. #endif
  973. C0 = C0+4;
  974. }
  975. if ( bm & 2 ) // do any 2x1 loop
  976. {
  977. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  978. ptrbb = bb;
  979. #else
  980. ptrba += off*2;
  981. ptrbb = bb + off*1;
  982. #endif
  983. res0_0 = 0;
  984. res0_1 = 0;
  985. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  986. temp = bk-off;
  987. #elif defined(LEFT)
  988. temp = off+2; // number of values in A
  989. #else
  990. temp = off+1; // number of values in B
  991. #endif
  992. for (k=0; k<temp; k++)
  993. {
  994. b0 = ptrbb[0];
  995. a0 = ptrba[0];
  996. res0_0 += a0*b0;
  997. a1 = ptrba[1];
  998. res0_1 += a1*b0;
  999. ptrba = ptrba+2;
  1000. ptrbb = ptrbb+1;
  1001. }
  1002. res0_0 *= alpha;
  1003. res0_1 *= alpha;
  1004. C0[0] = res0_0;
  1005. C0[1] = res0_1;
  1006. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  1007. temp = bk - off;
  1008. #ifdef LEFT
  1009. temp -= 2; // number of values in A
  1010. #else
  1011. temp -= 1; // number of values in B
  1012. #endif
  1013. ptrba += temp*2;
  1014. ptrbb += temp*1;
  1015. #endif
  1016. #ifdef LEFT
  1017. off += 2; // number of values in A
  1018. #endif
  1019. C0 = C0+2;
  1020. }
  1021. if ( bm & 1 ) // do any 1x1 loop
  1022. {
  1023. #if (defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  1024. ptrbb = bb;
  1025. #else
  1026. ptrba += off*1;
  1027. ptrbb = bb + off*1;
  1028. #endif
  1029. res0_0 = 0;
  1030. #if (defined(LEFT) && !defined(TRANSA)) || (!defined(LEFT) && defined(TRANSA))
  1031. temp = bk-off;
  1032. #elif defined(LEFT)
  1033. temp = off+1; // number of values in A
  1034. #else
  1035. temp = off+1; // number of values in B
  1036. #endif
  1037. for (k=0; k<temp; k++)
  1038. {
  1039. b0 = ptrbb[0];
  1040. a0 = ptrba[0];
  1041. res0_0 += a0*b0;
  1042. ptrba = ptrba+1;
  1043. ptrbb = ptrbb+1;
  1044. }
  1045. res0_0 *= alpha;
  1046. C0[0] = res0_0;
  1047. #if ( defined(LEFT) && defined(TRANSA)) || (!defined(LEFT) && !defined(TRANSA))
  1048. temp = bk - off;
  1049. #ifdef LEFT
  1050. temp -= 1; // number of values in A
  1051. #else
  1052. temp -= 1; // number of values in B
  1053. #endif
  1054. ptrba += temp*1;
  1055. ptrbb += temp*1;
  1056. #endif
  1057. #ifdef LEFT
  1058. off += 1; // number of values in A
  1059. #endif
  1060. C0 = C0+1;
  1061. }
  1062. #if defined(TRMMKERNEL) && !defined(LEFT)
  1063. off += 1;
  1064. #endif
  1065. k = (bk<<0);
  1066. bb = bb+k;
  1067. C = C+ldc;
  1068. }
  1069. return 0;
  1070. }