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.

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