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.

gemm.c 14 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514
  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. #elif defined(BFLOAT16)
  51. #define ERROR_NAME "SBGEMM "
  52. #else
  53. #define ERROR_NAME "SGEMM "
  54. #endif
  55. #else
  56. #define SMP_THRESHOLD_MIN 8192.0
  57. #ifndef GEMM3M
  58. #ifdef XDOUBLE
  59. #define ERROR_NAME "XGEMM "
  60. #elif defined(DOUBLE)
  61. #define ERROR_NAME "ZGEMM "
  62. #else
  63. #define ERROR_NAME "CGEMM "
  64. #endif
  65. #else
  66. #ifdef XDOUBLE
  67. #define ERROR_NAME "XGEMM3M "
  68. #elif defined(DOUBLE)
  69. #define ERROR_NAME "ZGEMM3M "
  70. #else
  71. #define ERROR_NAME "CGEMM3M "
  72. #endif
  73. #endif
  74. #endif
  75. #ifndef GEMM_MULTITHREAD_THRESHOLD
  76. #define GEMM_MULTITHREAD_THRESHOLD 4
  77. #endif
  78. static int (*gemm[])(blas_arg_t *, BLASLONG *, BLASLONG *, IFLOAT *, IFLOAT *, BLASLONG) = {
  79. #ifndef GEMM3M
  80. GEMM_NN, GEMM_TN, GEMM_RN, GEMM_CN,
  81. GEMM_NT, GEMM_TT, GEMM_RT, GEMM_CT,
  82. GEMM_NR, GEMM_TR, GEMM_RR, GEMM_CR,
  83. GEMM_NC, GEMM_TC, GEMM_RC, GEMM_CC,
  84. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  85. GEMM_THREAD_NN, GEMM_THREAD_TN, GEMM_THREAD_RN, GEMM_THREAD_CN,
  86. GEMM_THREAD_NT, GEMM_THREAD_TT, GEMM_THREAD_RT, GEMM_THREAD_CT,
  87. GEMM_THREAD_NR, GEMM_THREAD_TR, GEMM_THREAD_RR, GEMM_THREAD_CR,
  88. GEMM_THREAD_NC, GEMM_THREAD_TC, GEMM_THREAD_RC, GEMM_THREAD_CC,
  89. #endif
  90. #else
  91. GEMM3M_NN, GEMM3M_TN, GEMM3M_RN, GEMM3M_CN,
  92. GEMM3M_NT, GEMM3M_TT, GEMM3M_RT, GEMM3M_CT,
  93. GEMM3M_NR, GEMM3M_TR, GEMM3M_RR, GEMM3M_CR,
  94. GEMM3M_NC, GEMM3M_TC, GEMM3M_RC, GEMM3M_CC,
  95. #if defined(SMP) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  96. GEMM3M_THREAD_NN, GEMM3M_THREAD_TN, GEMM3M_THREAD_RN, GEMM3M_THREAD_CN,
  97. GEMM3M_THREAD_NT, GEMM3M_THREAD_TT, GEMM3M_THREAD_RT, GEMM3M_THREAD_CT,
  98. GEMM3M_THREAD_NR, GEMM3M_THREAD_TR, GEMM3M_THREAD_RR, GEMM3M_THREAD_CR,
  99. GEMM3M_THREAD_NC, GEMM3M_THREAD_TC, GEMM3M_THREAD_RC, GEMM3M_THREAD_CC,
  100. #endif
  101. #endif
  102. };
  103. #ifdef SMALL_MATRIX_OPT
  104. //Only support s/dgemm small matrix optimiztion so far.
  105. static int (*gemm_small_kernel[])(BLASLONG, BLASLONG, BLASLONG, FLOAT *, BLASLONG, FLOAT ,FLOAT *, BLASLONG, FLOAT, FLOAT *, BLASLONG) = {
  106. #ifndef GEMM3M
  107. #ifndef COMPLEX
  108. GEMM_SMALL_KERNEL_NN, GEMM_SMALL_KERNEL_TN, NULL, NULL,
  109. GEMM_SMALL_KERNEL_NT, GEMM_SMALL_KERNEL_TT, NULL, NULL,
  110. #endif
  111. #endif
  112. };
  113. #endif
  114. #ifndef CBLAS
  115. void NAME(char *TRANSA, char *TRANSB,
  116. blasint *M, blasint *N, blasint *K,
  117. FLOAT *alpha,
  118. IFLOAT *a, blasint *ldA,
  119. IFLOAT *b, blasint *ldB,
  120. FLOAT *beta,
  121. FLOAT *c, blasint *ldC){
  122. blas_arg_t args;
  123. int transa, transb, nrowa, nrowb;
  124. blasint info;
  125. char transA, transB;
  126. IFLOAT *buffer;
  127. IFLOAT *sa, *sb;
  128. #ifdef SMP
  129. double MNK;
  130. #if defined(USE_SIMPLE_THREADED_LEVEL3) || !defined(NO_AFFINITY)
  131. #ifndef COMPLEX
  132. #ifdef XDOUBLE
  133. int mode = BLAS_XDOUBLE | BLAS_REAL;
  134. #elif defined(DOUBLE)
  135. int mode = BLAS_DOUBLE | BLAS_REAL;
  136. #else
  137. int mode = BLAS_SINGLE | BLAS_REAL;
  138. #endif
  139. #else
  140. #ifdef XDOUBLE
  141. int mode = BLAS_XDOUBLE | BLAS_COMPLEX;
  142. #elif defined(DOUBLE)
  143. int mode = BLAS_DOUBLE | BLAS_COMPLEX;
  144. #else
  145. int mode = BLAS_SINGLE | BLAS_COMPLEX;
  146. #endif
  147. #endif
  148. #endif
  149. #endif
  150. #if defined(SMP) && !defined(NO_AFFINITY) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  151. int nodes;
  152. #endif
  153. PRINT_DEBUG_NAME;
  154. args.m = *M;
  155. args.n = *N;
  156. args.k = *K;
  157. args.a = (void *)a;
  158. args.b = (void *)b;
  159. args.c = (void *)c;
  160. args.lda = *ldA;
  161. args.ldb = *ldB;
  162. args.ldc = *ldC;
  163. args.alpha = (void *)alpha;
  164. args.beta = (void *)beta;
  165. transA = *TRANSA;
  166. transB = *TRANSB;
  167. TOUPPER(transA);
  168. TOUPPER(transB);
  169. transa = -1;
  170. transb = -1;
  171. if (transA == 'N') transa = 0;
  172. if (transA == 'T') transa = 1;
  173. #ifndef COMPLEX
  174. if (transA == 'R') transa = 0;
  175. if (transA == 'C') transa = 1;
  176. #else
  177. if (transA == 'R') transa = 2;
  178. if (transA == 'C') transa = 3;
  179. #endif
  180. if (transB == 'N') transb = 0;
  181. if (transB == 'T') transb = 1;
  182. #ifndef COMPLEX
  183. if (transB == 'R') transb = 0;
  184. if (transB == 'C') transb = 1;
  185. #else
  186. if (transB == 'R') transb = 2;
  187. if (transB == 'C') transb = 3;
  188. #endif
  189. nrowa = args.m;
  190. if (transa & 1) nrowa = args.k;
  191. nrowb = args.k;
  192. if (transb & 1) nrowb = args.n;
  193. info = 0;
  194. if (args.ldc < args.m) info = 13;
  195. if (args.ldb < nrowb) info = 10;
  196. if (args.lda < nrowa) info = 8;
  197. if (args.k < 0) info = 5;
  198. if (args.n < 0) info = 4;
  199. if (args.m < 0) info = 3;
  200. if (transb < 0) info = 2;
  201. if (transa < 0) info = 1;
  202. if (info){
  203. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  204. return;
  205. }
  206. #else
  207. void CNAME(enum CBLAS_ORDER order, enum CBLAS_TRANSPOSE TransA, enum CBLAS_TRANSPOSE TransB,
  208. blasint m, blasint n, blasint k,
  209. #ifndef COMPLEX
  210. FLOAT alpha,
  211. FLOAT *a, blasint lda,
  212. FLOAT *b, blasint ldb,
  213. FLOAT beta,
  214. FLOAT *c, blasint ldc) {
  215. #else
  216. void *valpha,
  217. void *va, blasint lda,
  218. void *vb, blasint ldb,
  219. void *vbeta,
  220. void *vc, blasint ldc) {
  221. FLOAT *alpha = (FLOAT*) valpha;
  222. FLOAT *beta = (FLOAT*) vbeta;
  223. FLOAT *a = (FLOAT*) va;
  224. FLOAT *b = (FLOAT*) vb;
  225. FLOAT *c = (FLOAT*) vc;
  226. #endif
  227. blas_arg_t args;
  228. int transa, transb;
  229. blasint nrowa, nrowb, info;
  230. XFLOAT *buffer;
  231. XFLOAT *sa, *sb;
  232. #ifdef SMP
  233. double MNK;
  234. #if defined(USE_SIMPLE_THREADED_LEVEL3) || !defined(NO_AFFINITY)
  235. #ifndef COMPLEX
  236. #ifdef XDOUBLE
  237. int mode = BLAS_XDOUBLE | BLAS_REAL;
  238. #elif defined(DOUBLE)
  239. int mode = BLAS_DOUBLE | BLAS_REAL;
  240. #else
  241. int mode = BLAS_SINGLE | BLAS_REAL;
  242. #endif
  243. #else
  244. #ifdef XDOUBLE
  245. int mode = BLAS_XDOUBLE | BLAS_COMPLEX;
  246. #elif defined(DOUBLE)
  247. int mode = BLAS_DOUBLE | BLAS_COMPLEX;
  248. #else
  249. int mode = BLAS_SINGLE | BLAS_COMPLEX;
  250. #endif
  251. #endif
  252. #endif
  253. #endif
  254. #if defined(SMP) && !defined(NO_AFFINITY) && !defined(USE_SIMPLE_THREADED_LEVEL3)
  255. int nodes;
  256. #endif
  257. PRINT_DEBUG_CNAME;
  258. #if !defined(COMPLEX) && !defined(DOUBLE) && defined(USE_SGEMM_KERNEL_DIRECT)
  259. #ifdef DYNAMIC_ARCH
  260. if (support_avx512() )
  261. #endif
  262. if (beta == 0 && alpha == 1.0 && order == CblasRowMajor && TransA == CblasNoTrans && TransB == CblasNoTrans && SGEMM_DIRECT_PERFORMANT(m,n,k)) {
  263. SGEMM_DIRECT(m, n, k, a, lda, b, ldb, c, ldc);
  264. return;
  265. }
  266. #endif
  267. #ifndef COMPLEX
  268. args.alpha = (void *)&alpha;
  269. args.beta = (void *)&beta;
  270. #else
  271. args.alpha = (void *)alpha;
  272. args.beta = (void *)beta;
  273. #endif
  274. transa = -1;
  275. transb = -1;
  276. info = 0;
  277. if (order == CblasColMajor) {
  278. args.m = m;
  279. args.n = n;
  280. args.k = k;
  281. args.a = (void *)a;
  282. args.b = (void *)b;
  283. args.c = (void *)c;
  284. args.lda = lda;
  285. args.ldb = ldb;
  286. args.ldc = ldc;
  287. if (TransA == CblasNoTrans) transa = 0;
  288. if (TransA == CblasTrans) transa = 1;
  289. #ifndef COMPLEX
  290. if (TransA == CblasConjNoTrans) transa = 0;
  291. if (TransA == CblasConjTrans) transa = 1;
  292. #else
  293. if (TransA == CblasConjNoTrans) transa = 2;
  294. if (TransA == CblasConjTrans) transa = 3;
  295. #endif
  296. if (TransB == CblasNoTrans) transb = 0;
  297. if (TransB == CblasTrans) transb = 1;
  298. #ifndef COMPLEX
  299. if (TransB == CblasConjNoTrans) transb = 0;
  300. if (TransB == CblasConjTrans) transb = 1;
  301. #else
  302. if (TransB == CblasConjNoTrans) transb = 2;
  303. if (TransB == CblasConjTrans) transb = 3;
  304. #endif
  305. nrowa = args.m;
  306. if (transa & 1) nrowa = args.k;
  307. nrowb = args.k;
  308. if (transb & 1) nrowb = args.n;
  309. info = -1;
  310. if (args.ldc < args.m) info = 13;
  311. if (args.ldb < nrowb) info = 10;
  312. if (args.lda < nrowa) info = 8;
  313. if (args.k < 0) info = 5;
  314. if (args.n < 0) info = 4;
  315. if (args.m < 0) info = 3;
  316. if (transb < 0) info = 2;
  317. if (transa < 0) info = 1;
  318. }
  319. if (order == CblasRowMajor) {
  320. args.m = n;
  321. args.n = m;
  322. args.k = k;
  323. args.a = (void *)b;
  324. args.b = (void *)a;
  325. args.c = (void *)c;
  326. args.lda = ldb;
  327. args.ldb = lda;
  328. args.ldc = ldc;
  329. if (TransB == CblasNoTrans) transa = 0;
  330. if (TransB == CblasTrans) transa = 1;
  331. #ifndef COMPLEX
  332. if (TransB == CblasConjNoTrans) transa = 0;
  333. if (TransB == CblasConjTrans) transa = 1;
  334. #else
  335. if (TransB == CblasConjNoTrans) transa = 2;
  336. if (TransB == CblasConjTrans) transa = 3;
  337. #endif
  338. if (TransA == CblasNoTrans) transb = 0;
  339. if (TransA == CblasTrans) transb = 1;
  340. #ifndef COMPLEX
  341. if (TransA == CblasConjNoTrans) transb = 0;
  342. if (TransA == CblasConjTrans) transb = 1;
  343. #else
  344. if (TransA == CblasConjNoTrans) transb = 2;
  345. if (TransA == CblasConjTrans) transb = 3;
  346. #endif
  347. nrowa = args.m;
  348. if (transa & 1) nrowa = args.k;
  349. nrowb = args.k;
  350. if (transb & 1) nrowb = args.n;
  351. info = -1;
  352. if (args.ldc < args.m) info = 13;
  353. if (args.ldb < nrowb) info = 10;
  354. if (args.lda < nrowa) info = 8;
  355. if (args.k < 0) info = 5;
  356. if (args.n < 0) info = 4;
  357. if (args.m < 0) info = 3;
  358. if (transb < 0) info = 2;
  359. if (transa < 0) info = 1;
  360. }
  361. if (info >= 0) {
  362. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  363. return;
  364. }
  365. #endif
  366. if ((args.m == 0) || (args.n == 0)) return;
  367. #if 0
  368. fprintf(stderr, "m = %4d n = %d k = %d lda = %4d ldb = %4d ldc = %4d\n",
  369. args.m, args.n, args.k, args.lda, args.ldb, args.ldc);
  370. #endif
  371. IDEBUG_START;
  372. FUNCTION_PROFILE_START();
  373. MNK = (double) args.m * (double) args.n * (double) args.k;
  374. #ifdef SMALL_MATRIX_OPT
  375. #if !defined(COMPLEX)
  376. //need to tune small matrices cases.
  377. if(MNK <= 100.0*100.0*100.0){
  378. (gemm_small_kernel[(transb << 2) | transa])(args.m, args.n, args.k, args.a, args.lda, *(FLOAT *)(args.alpha), args.b,
  379. args.ldb, *(FLOAT *)(args.beta), args.c, args.ldc);
  380. return;
  381. }
  382. #endif
  383. #endif
  384. buffer = (XFLOAT *)blas_memory_alloc(0);
  385. sa = (XFLOAT *)((BLASLONG)buffer +GEMM_OFFSET_A);
  386. sb = (XFLOAT *)(((BLASLONG)sa + ((GEMM_P * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)) + GEMM_OFFSET_B);
  387. #ifdef SMP
  388. #if defined(USE_SIMPLE_THREADED_LEVEL3) || !defined(NO_AFFINITY)
  389. mode |= (transa << BLAS_TRANSA_SHIFT);
  390. mode |= (transb << BLAS_TRANSB_SHIFT);
  391. #endif
  392. if ( MNK <= (SMP_THRESHOLD_MIN * (double) GEMM_MULTITHREAD_THRESHOLD) )
  393. args.nthreads = 1;
  394. else
  395. args.nthreads = num_cpu_avail(3);
  396. args.common = NULL;
  397. if (args.nthreads == 1) {
  398. #endif
  399. (gemm[(transb << 2) | transa])(&args, NULL, NULL, sa, sb, 0);
  400. #ifdef SMP
  401. } else {
  402. #ifndef USE_SIMPLE_THREADED_LEVEL3
  403. #ifndef NO_AFFINITY
  404. nodes = get_num_nodes();
  405. if ((nodes > 1) && get_node_equal()) {
  406. args.nthreads /= nodes;
  407. gemm_thread_mn(mode, &args, NULL, NULL, gemm[16 | (transb << 2) | transa], sa, sb, nodes);
  408. } else {
  409. #endif
  410. (gemm[16 | (transb << 2) | transa])(&args, NULL, NULL, sa, sb, 0);
  411. #else
  412. GEMM_THREAD(mode, &args, NULL, NULL, gemm[(transb << 2) | transa], sa, sb, args.nthreads);
  413. #endif
  414. #ifndef USE_SIMPLE_THREADED_LEVEL3
  415. #ifndef NO_AFFINITY
  416. }
  417. #endif
  418. #endif
  419. #endif
  420. #ifdef SMP
  421. }
  422. #endif
  423. blas_memory_free(buffer);
  424. FUNCTION_PROFILE_END(COMPSIZE * COMPSIZE, args.m * args.k + args.k * args.n + args.m * args.n, 2 * args.m * args.n * args.k);
  425. IDEBUG_END;
  426. return;
  427. }