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.

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

OpenBLAS is an optimized BLAS library based on GotoBLAS2 1.13 BSD version.