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.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551
  1. /*********************************************************************/
  2. /* Copyright 2009, 2010 The University of Texas at Austin. */
  3. /* All rights reserved. */
  4. /* */
  5. /* Redistribution and use in source and binary forms, with or */
  6. /* without modification, are permitted provided that the following */
  7. /* conditions are met: */
  8. /* */
  9. /* 1. Redistributions of source code must retain the above */
  10. /* copyright notice, this list of conditions and the following */
  11. /* disclaimer. */
  12. /* */
  13. /* 2. Redistributions in binary form must reproduce the above */
  14. /* copyright notice, this list of conditions and the following */
  15. /* disclaimer in the documentation and/or other materials */
  16. /* provided with the distribution. */
  17. /* */
  18. /* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
  19. /* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
  20. /* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
  21. /* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
  22. /* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
  23. /* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
  24. /* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
  25. /* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
  26. /* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
  27. /* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
  28. /* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
  29. /* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
  30. /* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
  31. /* POSSIBILITY OF SUCH DAMAGE. */
  32. /* */
  33. /* The views and conclusions contained in the software and */
  34. /* documentation are those of the authors and should not be */
  35. /* interpreted as representing official policies, either expressed */
  36. /* or implied, of The University of Texas at Austin. */
  37. /*********************************************************************/
  38. #include <stdio.h>
  39. #include <stdlib.h>
  40. #include "common.h"
  41. #ifdef FUNCTION_PROFILE
  42. #include "functable.h"
  43. #endif
  44. #ifndef COMPLEX
  45. #define SMP_THRESHOLD_MIN 65536.0
  46. #ifdef XDOUBLE
  47. #define ERROR_NAME "QGEMM "
  48. #elif defined(DOUBLE)
  49. #define ERROR_NAME "DGEMM "
  50. #else
  51. #define ERROR_NAME "SGEMM "
  52. #endif
  53. #else
  54. #define SMP_THRESHOLD_MIN 8192.0
  55. #ifndef GEMM3M
  56. #ifdef XDOUBLE
  57. #define ERROR_NAME "XGEMM "
  58. #elif defined(DOUBLE)
  59. #define ERROR_NAME "ZGEMM "
  60. #else
  61. #define ERROR_NAME "CGEMM "
  62. #endif
  63. #else
  64. #ifdef XDOUBLE
  65. #define ERROR_NAME "XGEMM3M "
  66. #elif defined(DOUBLE)
  67. #define ERROR_NAME "ZGEMM3M "
  68. #else
  69. #define ERROR_NAME "CGEMM3M "
  70. #endif
  71. #endif
  72. #endif
  73. #ifndef GEMM_MULTITHREAD_THRESHOLD
  74. #define GEMM_MULTITHREAD_THRESHOLD 4
  75. #endif
  76. static int (*gemm[])(blas_arg_t *, BLASLONG *, BLASLONG *, IFLOAT *, IFLOAT *, BLASLONG) = {
  77. #ifndef GEMM3M
  78. GEMM_NN, GEMM_TN, GEMM_RN, GEMM_CN,
  79. GEMM_NT, GEMM_TT, GEMM_RT, GEMM_CT,
  80. GEMM_NR, GEMM_TR, GEMM_RR, GEMM_CR,
  81. GEMM_NC, GEMM_TC, GEMM_RC, GEMM_CC,
  82. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  83. GEMM_THREAD_NN, GEMM_THREAD_TN, GEMM_THREAD_RN, GEMM_THREAD_CN,
  84. GEMM_THREAD_NT, GEMM_THREAD_TT, GEMM_THREAD_RT, GEMM_THREAD_CT,
  85. GEMM_THREAD_NR, GEMM_THREAD_TR, GEMM_THREAD_RR, GEMM_THREAD_CR,
  86. GEMM_THREAD_NC, GEMM_THREAD_TC, GEMM_THREAD_RC, GEMM_THREAD_CC,
  87. #endif
  88. #else
  89. GEMM3M_NN, GEMM3M_TN, GEMM3M_RN, GEMM3M_CN,
  90. GEMM3M_NT, GEMM3M_TT, GEMM3M_RT, GEMM3M_CT,
  91. GEMM3M_NR, GEMM3M_TR, GEMM3M_RR, GEMM3M_CR,
  92. GEMM3M_NC, GEMM3M_TC, GEMM3M_RC, GEMM3M_CC,
  93. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  94. GEMM3M_THREAD_NN, GEMM3M_THREAD_TN, GEMM3M_THREAD_RN, GEMM3M_THREAD_CN,
  95. GEMM3M_THREAD_NT, GEMM3M_THREAD_TT, GEMM3M_THREAD_RT, GEMM3M_THREAD_CT,
  96. GEMM3M_THREAD_NR, GEMM3M_THREAD_TR, GEMM3M_THREAD_RR, GEMM3M_THREAD_CR,
  97. GEMM3M_THREAD_NC, GEMM3M_THREAD_TC, GEMM3M_THREAD_RC, GEMM3M_THREAD_CC,
  98. #endif
  99. #endif
  100. };
  101. #ifdef SMALL_MATRIX_OPT
  102. #ifndef COMPLEX
  103. static int (*gemm_small_kernel[])(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT ,FLOAT *, BLASLONG, FLOAT, FLOAT *, BLASLONG) = {
  104. #ifndef GEMM3M
  105. GEMM_SMALL_KERNEL_NN, GEMM_SMALL_KERNEL_TN, NULL, NULL,
  106. GEMM_SMALL_KERNEL_NT, GEMM_SMALL_KERNEL_TT, NULL, NULL,
  107. #endif
  108. };
  109. static int (*gemm_small_kernel_b0[])(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG) = {
  110. #ifndef GEMM3M
  111. GEMM_SMALL_KERNEL_B0_NN, GEMM_SMALL_KERNEL_B0_TN, NULL, NULL,
  112. GEMM_SMALL_KERNEL_B0_NT, GEMM_SMALL_KERNEL_B0_TT, NULL, NULL,
  113. #endif
  114. };
  115. #else
  116. static int (*zgemm_small_kernel[])(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT , FLOAT, FLOAT *, BLASLONG, FLOAT , FLOAT, FLOAT *, BLASLONG) = {
  117. #ifndef GEMM3M
  118. GEMM_SMALL_KERNEL_NN, GEMM_SMALL_KERNEL_TN, GEMM_SMALL_KERNEL_RN, GEMM_SMALL_KERNEL_CN,
  119. GEMM_SMALL_KERNEL_NT, GEMM_SMALL_KERNEL_TT, GEMM_SMALL_KERNEL_RT, GEMM_SMALL_KERNEL_CT,
  120. GEMM_SMALL_KERNEL_NR, GEMM_SMALL_KERNEL_TR, GEMM_SMALL_KERNEL_RR, GEMM_SMALL_KERNEL_CR,
  121. GEMM_SMALL_KERNEL_NC, GEMM_SMALL_KERNEL_TC, GEMM_SMALL_KERNEL_RC, GEMM_SMALL_KERNEL_CC,
  122. #endif
  123. };
  124. static int (*zgemm_small_kernel_b0[])(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT , FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG) = {
  125. #ifndef GEMM3M
  126. GEMM_SMALL_KERNEL_B0_NN, GEMM_SMALL_KERNEL_B0_TN, GEMM_SMALL_KERNEL_B0_RN, GEMM_SMALL_KERNEL_B0_CN,
  127. GEMM_SMALL_KERNEL_B0_NT, GEMM_SMALL_KERNEL_B0_TT, GEMM_SMALL_KERNEL_B0_RT, GEMM_SMALL_KERNEL_B0_CT,
  128. GEMM_SMALL_KERNEL_B0_NR, GEMM_SMALL_KERNEL_B0_TR, GEMM_SMALL_KERNEL_B0_RR, GEMM_SMALL_KERNEL_B0_CR,
  129. GEMM_SMALL_KERNEL_B0_NC, GEMM_SMALL_KERNEL_B0_TC, GEMM_SMALL_KERNEL_B0_RC, GEMM_SMALL_KERNEL_B0_CC,
  130. #endif
  131. };
  132. #endif
  133. #endif
  134. #ifndef CBLAS
  135. void NAME(char *TRANSA, char *TRANSB,
  136. blasint *M, blasint *N, blasint *K,
  137. FLOAT *alpha,
  138. IFLOAT *a, blasint *ldA,
  139. IFLOAT *b, blasint *ldB,
  140. FLOAT *beta,
  141. FLOAT *c, blasint *ldC){
  142. blas_arg_t args;
  143. int transa, transb, nrowa, nrowb;
  144. blasint info;
  145. char transA, transB;
  146. IFLOAT *buffer;
  147. IFLOAT *sa, *sb;
  148. #if defined (SMP) || defined(SMALL_MATRIX_OPT)
  149. double MNK;
  150. #endif
  151. #ifdef SMP
  152. #ifndef COMPLEX
  153. #ifdef XDOUBLE
  154. int mode = BLAS_XDOUBLE | BLAS_REAL;
  155. #elif defined(DOUBLE)
  156. int mode = BLAS_DOUBLE | BLAS_REAL;
  157. #else
  158. int mode = BLAS_SINGLE | BLAS_REAL;
  159. #endif
  160. #else
  161. #ifdef XDOUBLE
  162. int mode = BLAS_XDOUBLE | BLAS_COMPLEX;
  163. #elif defined(DOUBLE)
  164. int mode = BLAS_DOUBLE | BLAS_COMPLEX;
  165. #else
  166. int mode = BLAS_SINGLE | BLAS_COMPLEX;
  167. #endif
  168. #endif
  169. #endif
  170. #if defined(SMP) && !defined(NO_AFFINITY) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  171. int nodes;
  172. #endif
  173. PRINT_DEBUG_NAME;
  174. args.m = *M;
  175. args.n = *N;
  176. args.k = *K;
  177. args.a = (void *)a;
  178. args.b = (void *)b;
  179. args.c = (void *)c;
  180. args.lda = *ldA;
  181. args.ldb = *ldB;
  182. args.ldc = *ldC;
  183. args.alpha = (void *)alpha;
  184. args.beta = (void *)beta;
  185. transA = *TRANSA;
  186. transB = *TRANSB;
  187. TOUPPER(transA);
  188. TOUPPER(transB);
  189. transa = -1;
  190. transb = -1;
  191. if (transA == 'N') transa = 0;
  192. if (transA == 'T') transa = 1;
  193. #ifndef COMPLEX
  194. if (transA == 'R') transa = 0;
  195. if (transA == 'C') transa = 1;
  196. #else
  197. if (transA == 'R') transa = 2;
  198. if (transA == 'C') transa = 3;
  199. #endif
  200. if (transB == 'N') transb = 0;
  201. if (transB == 'T') transb = 1;
  202. #ifndef COMPLEX
  203. if (transB == 'R') transb = 0;
  204. if (transB == 'C') transb = 1;
  205. #else
  206. if (transB == 'R') transb = 2;
  207. if (transB == 'C') transb = 3;
  208. #endif
  209. nrowa = args.m;
  210. if (transa & 1) nrowa = args.k;
  211. nrowb = args.k;
  212. if (transb & 1) nrowb = args.n;
  213. info = 0;
  214. if (args.ldc < args.m) info = 13;
  215. if (args.ldb < nrowb) info = 10;
  216. if (args.lda < nrowa) info = 8;
  217. if (args.k < 0) info = 5;
  218. if (args.n < 0) info = 4;
  219. if (args.m < 0) info = 3;
  220. if (transb < 0) info = 2;
  221. if (transa < 0) info = 1;
  222. if (info){
  223. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  224. return;
  225. }
  226. #else
  227. void CNAME(enum CBLAS_ORDER order, enum CBLAS_TRANSPOSE TransA, enum CBLAS_TRANSPOSE TransB,
  228. blasint m, blasint n, blasint k,
  229. #ifndef COMPLEX
  230. FLOAT alpha,
  231. FLOAT *a, blasint lda,
  232. FLOAT *b, blasint ldb,
  233. FLOAT beta,
  234. FLOAT *c, blasint ldc) {
  235. #else
  236. void *valpha,
  237. void *va, blasint lda,
  238. void *vb, blasint ldb,
  239. void *vbeta,
  240. void *vc, blasint ldc) {
  241. FLOAT *alpha = (FLOAT*) valpha;
  242. FLOAT *beta = (FLOAT*) vbeta;
  243. FLOAT *a = (FLOAT*) va;
  244. FLOAT *b = (FLOAT*) vb;
  245. FLOAT *c = (FLOAT*) vc;
  246. #endif
  247. blas_arg_t args;
  248. int transa, transb;
  249. blasint nrowa, nrowb, info;
  250. XFLOAT *buffer;
  251. XFLOAT *sa, *sb;
  252. #if defined (SMP) || defined(SMALL_MATRIX_OPT)
  253. double MNK;
  254. #endif
  255. #ifdef SMP
  256. #ifndef COMPLEX
  257. #ifdef XDOUBLE
  258. int mode = BLAS_XDOUBLE | BLAS_REAL;
  259. #elif defined(DOUBLE)
  260. int mode = BLAS_DOUBLE | BLAS_REAL;
  261. #else
  262. int mode = BLAS_SINGLE | BLAS_REAL;
  263. #endif
  264. #else
  265. #ifdef XDOUBLE
  266. int mode = BLAS_XDOUBLE | BLAS_COMPLEX;
  267. #elif defined(DOUBLE)
  268. int mode = BLAS_DOUBLE | BLAS_COMPLEX;
  269. #else
  270. int mode = BLAS_SINGLE | BLAS_COMPLEX;
  271. #endif
  272. #endif
  273. #endif
  274. #if defined(SMP) && !defined(NO_AFFINITY) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  275. int nodes;
  276. #endif
  277. PRINT_DEBUG_CNAME;
  278. #if !defined(COMPLEX) && !defined(DOUBLE) && defined(USE_SGEMM_KERNEL_DIRECT)
  279. #ifdef DYNAMIC_ARCH
  280. if (support_avx512() )
  281. #endif
  282. if (beta == 0 && alpha == 1.0 && order == CblasRowMajor && TransA == CblasNoTrans && TransB == CblasNoTrans && SGEMM_DIRECT_PERFORMANT(m,n,k)) {
  283. SGEMM_DIRECT(m, n, k, a, lda, b, ldb, c, ldc);
  284. return;
  285. }
  286. #endif
  287. #ifndef COMPLEX
  288. args.alpha = (void *)&alpha;
  289. args.beta = (void *)&beta;
  290. #else
  291. args.alpha = (void *)alpha;
  292. args.beta = (void *)beta;
  293. #endif
  294. transa = -1;
  295. transb = -1;
  296. info = 0;
  297. if (order == CblasColMajor) {
  298. args.m = m;
  299. args.n = n;
  300. args.k = k;
  301. args.a = (void *)a;
  302. args.b = (void *)b;
  303. args.c = (void *)c;
  304. args.lda = lda;
  305. args.ldb = ldb;
  306. args.ldc = ldc;
  307. if (TransA == CblasNoTrans) transa = 0;
  308. if (TransA == CblasTrans) transa = 1;
  309. #ifndef COMPLEX
  310. if (TransA == CblasConjNoTrans) transa = 0;
  311. if (TransA == CblasConjTrans) transa = 1;
  312. #else
  313. if (TransA == CblasConjNoTrans) transa = 2;
  314. if (TransA == CblasConjTrans) transa = 3;
  315. #endif
  316. if (TransB == CblasNoTrans) transb = 0;
  317. if (TransB == CblasTrans) transb = 1;
  318. #ifndef COMPLEX
  319. if (TransB == CblasConjNoTrans) transb = 0;
  320. if (TransB == CblasConjTrans) transb = 1;
  321. #else
  322. if (TransB == CblasConjNoTrans) transb = 2;
  323. if (TransB == CblasConjTrans) transb = 3;
  324. #endif
  325. nrowa = args.m;
  326. if (transa & 1) nrowa = args.k;
  327. nrowb = args.k;
  328. if (transb & 1) nrowb = args.n;
  329. info = -1;
  330. if (args.ldc < args.m) info = 13;
  331. if (args.ldb < nrowb) info = 10;
  332. if (args.lda < nrowa) info = 8;
  333. if (args.k < 0) info = 5;
  334. if (args.n < 0) info = 4;
  335. if (args.m < 0) info = 3;
  336. if (transb < 0) info = 2;
  337. if (transa < 0) info = 1;
  338. }
  339. if (order == CblasRowMajor) {
  340. args.m = n;
  341. args.n = m;
  342. args.k = k;
  343. args.a = (void *)b;
  344. args.b = (void *)a;
  345. args.c = (void *)c;
  346. args.lda = ldb;
  347. args.ldb = lda;
  348. args.ldc = ldc;
  349. if (TransB == CblasNoTrans) transa = 0;
  350. if (TransB == CblasTrans) transa = 1;
  351. #ifndef COMPLEX
  352. if (TransB == CblasConjNoTrans) transa = 0;
  353. if (TransB == CblasConjTrans) transa = 1;
  354. #else
  355. if (TransB == CblasConjNoTrans) transa = 2;
  356. if (TransB == CblasConjTrans) transa = 3;
  357. #endif
  358. if (TransA == CblasNoTrans) transb = 0;
  359. if (TransA == CblasTrans) transb = 1;
  360. #ifndef COMPLEX
  361. if (TransA == CblasConjNoTrans) transb = 0;
  362. if (TransA == CblasConjTrans) transb = 1;
  363. #else
  364. if (TransA == CblasConjNoTrans) transb = 2;
  365. if (TransA == CblasConjTrans) transb = 3;
  366. #endif
  367. nrowa = args.m;
  368. if (transa & 1) nrowa = args.k;
  369. nrowb = args.k;
  370. if (transb & 1) nrowb = args.n;
  371. info = -1;
  372. if (args.ldc < args.m) info = 13;
  373. if (args.ldb < nrowb) info = 10;
  374. if (args.lda < nrowa) info = 8;
  375. if (args.k < 0) info = 5;
  376. if (args.n < 0) info = 4;
  377. if (args.m < 0) info = 3;
  378. if (transb < 0) info = 2;
  379. if (transa < 0) info = 1;
  380. }
  381. if (info >= 0) {
  382. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  383. return;
  384. }
  385. #endif
  386. if ((args.m == 0) || (args.n == 0)) return;
  387. #if 0
  388. fprintf(stderr, "m = %4d n = %d k = %d lda = %4d ldb = %4d ldc = %4d\n",
  389. args.m, args.n, args.k, args.lda, args.ldb, args.ldc);
  390. #endif
  391. IDEBUG_START;
  392. FUNCTION_PROFILE_START();
  393. #if defined(SMP) || defined(SMALL_MATRIX_OPT)
  394. MNK = (double) args.m * (double) args.n * (double) args.k;
  395. #endif
  396. #ifdef SMALL_MATRIX_OPT
  397. //need to tune small matrices cases.
  398. if(MNK <= 100.0*100.0*100.0){
  399. #if !defined(COMPLEX)
  400. if(*(FLOAT *)(args.beta) == 0.0){
  401. (gemm_small_kernel_b0[(transb << 2) | transa])(args.m, args.n, args.k, args.a, args.lda, *(FLOAT *)(args.alpha), args.b, args.ldb, args.c, args.ldc);
  402. }else{
  403. (gemm_small_kernel[(transb << 2) | transa])(args.m, args.n, args.k, args.a, args.lda, *(FLOAT *)(args.alpha), args.b, args.ldb, *(FLOAT *)(args.beta), args.c, args.ldc);
  404. }
  405. #else
  406. if(beta[0] == 0.0 && beta[1] == 0.0){
  407. (zgemm_small_kernel_b0[(transb << 2) | transa])(args.m, args.n, args.k, args.a, args.lda, alpha[0], alpha[1], args.b, args.ldb, args.c, args.ldc);
  408. }else{
  409. (zgemm_small_kernel[(transb << 2) | transa])(args.m, args.n, args.k, args.a, args.lda, alpha[0], alpha[1], args.b, args.ldb, beta[0], beta[1], args.c, args.ldc);
  410. }
  411. #endif
  412. return;
  413. }
  414. #endif
  415. buffer = (XFLOAT *)blas_memory_alloc(0);
  416. sa = (XFLOAT *)((BLASLONG)buffer +GEMM_OFFSET_A);
  417. sb = (XFLOAT *)(((BLASLONG)sa + ((GEMM_P * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)) + GEMM_OFFSET_B);
  418. #ifdef SMP
  419. mode |= (transa << BLAS_TRANSA_SHIFT);
  420. mode |= (transb << BLAS_TRANSB_SHIFT);
  421. if ( MNK <= (SMP_THRESHOLD_MIN * (double) GEMM_MULTITHREAD_THRESHOLD) )
  422. args.nthreads = 1;
  423. else
  424. args.nthreads = num_cpu_avail(3);
  425. args.common = NULL;
  426. if (args.nthreads == 1) {
  427. #endif
  428. (gemm[(transb << 2) | transa])(&args, NULL, NULL, sa, sb, 0);
  429. #ifdef SMP
  430. } else {
  431. #ifndef USE_SIMPLE_THREADED_LEVEL3
  432. #ifndef NO_AFFINITY
  433. nodes = get_num_nodes();
  434. if ((nodes > 1) && get_node_equal()) {
  435. args.nthreads /= nodes;
  436. gemm_thread_mn(mode, &args, NULL, NULL, gemm[16 | (transb << 2) | transa], sa, sb, nodes);
  437. } else {
  438. #endif
  439. (gemm[16 | (transb << 2) | transa])(&args, NULL, NULL, sa, sb, 0);
  440. #else
  441. GEMM_THREAD(mode, &args, NULL, NULL, gemm[(transb << 2) | transa], sa, sb, args.nthreads);
  442. #endif
  443. #ifndef USE_SIMPLE_THREADED_LEVEL3
  444. #ifndef NO_AFFINITY
  445. }
  446. #endif
  447. #endif
  448. #endif
  449. #ifdef SMP
  450. }
  451. #endif
  452. blas_memory_free(buffer);
  453. FUNCTION_PROFILE_END(COMPSIZE * COMPSIZE, args.m * args.k + args.k * args.n + args.m * args.n, 2 * args.m * args.n * args.k);
  454. IDEBUG_END;
  455. return;
  456. }