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.

gemmt.c 13 kB

2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
2 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589
  1. /*********************************************************************/
  2. /* Copyright 2022, The OpenBLAS Project. */
  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. /*********************************************************************/
  34. #include <stdio.h>
  35. #include <stdlib.h>
  36. #include "common.h"
  37. #ifndef COMPLEX
  38. #define SMP_THRESHOLD_MIN 65536.0
  39. #ifdef XDOUBLE
  40. #define ERROR_NAME "QGEMMT "
  41. #elif defined(DOUBLE)
  42. #define ERROR_NAME "DGEMMT "
  43. #elif defined(BFLOAT16)
  44. #define ERROR_NAME "SBGEMMT "
  45. #else
  46. #define ERROR_NAME "SGEMMT "
  47. #endif
  48. #else
  49. #define SMP_THRESHOLD_MIN 8192.0
  50. #ifdef XDOUBLE
  51. #define ERROR_NAME "XGEMMT "
  52. #elif defined(DOUBLE)
  53. #define ERROR_NAME "ZGEMMT "
  54. #else
  55. #define ERROR_NAME "CGEMMT "
  56. #endif
  57. #endif
  58. #ifndef GEMM_MULTITHREAD_THRESHOLD
  59. #define GEMM_MULTITHREAD_THRESHOLD 4
  60. #endif
  61. #ifndef CBLAS
  62. void NAME(char *UPLO, char *TRANSA, char *TRANSB,
  63. blasint * M, blasint * K,
  64. FLOAT * Alpha,
  65. IFLOAT * a, blasint * ldA,
  66. IFLOAT * b, blasint * ldB, FLOAT * Beta, FLOAT * c, blasint * ldC)
  67. {
  68. blasint m, k;
  69. blasint lda, ldb, ldc;
  70. int transa, transb, uplo;
  71. blasint info;
  72. char transA, transB, Uplo;
  73. IFLOAT *buffer;
  74. IFLOAT *aa, *bb;
  75. FLOAT *cc;
  76. #if defined(COMPLEX)
  77. FLOAT alpha_r, alpha_i, beta_r, beta_i;
  78. #else
  79. FLOAT alpha, beta;
  80. #endif
  81. PRINT_DEBUG_NAME;
  82. m = *M;
  83. k = *K;
  84. #if defined(COMPLEX)
  85. FLOAT *alpha = Alpha;
  86. alpha_r = *(Alpha + 0);
  87. alpha_i = *(Alpha + 1);
  88. beta_r = *(Beta + 0);
  89. beta_i = *(Beta + 1);
  90. #else
  91. alpha = *Alpha;
  92. beta = *Beta;
  93. #endif
  94. lda = *ldA;
  95. ldb = *ldB;
  96. ldc = *ldC;
  97. transA = *TRANSA;
  98. transB = *TRANSB;
  99. Uplo = *UPLO;
  100. TOUPPER(transA);
  101. TOUPPER(transB);
  102. TOUPPER(Uplo);
  103. transa = -1;
  104. transb = -1;
  105. uplo = -1;
  106. if (transA == 'N')
  107. transa = 0;
  108. if (transA == 'T')
  109. transa = 1;
  110. #ifndef COMPLEX
  111. if (transA == 'R')
  112. transa = 0;
  113. if (transA == 'C')
  114. transa = 1;
  115. #else
  116. if (transA == 'R')
  117. transa = 2;
  118. if (transA == 'C')
  119. transa = 3;
  120. #endif
  121. if (transB == 'N')
  122. transb = 0;
  123. if (transB == 'T')
  124. transb = 1;
  125. #ifndef COMPLEX
  126. if (transB == 'R')
  127. transb = 0;
  128. if (transB == 'C')
  129. transb = 1;
  130. #else
  131. if (transB == 'R')
  132. transb = 2;
  133. if (transB == 'C')
  134. transb = 3;
  135. #endif
  136. if (Uplo == 'U')
  137. uplo = 0;
  138. if (Uplo == 'L')
  139. uplo = 1;
  140. info = 0;
  141. if (uplo < 0)
  142. info = 14;
  143. if (ldc < m)
  144. info = 13;
  145. if (k < 0)
  146. info = 5;
  147. if (m < 0)
  148. info = 3;
  149. if (transb < 0)
  150. info = 2;
  151. if (transa < 0)
  152. info = 1;
  153. if (info) {
  154. BLASFUNC(xerbla) (ERROR_NAME, &info, sizeof(ERROR_NAME));
  155. return;
  156. }
  157. #else
  158. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo,
  159. enum CBLAS_TRANSPOSE TransA, enum CBLAS_TRANSPOSE TransB, blasint M,
  160. blasint k,
  161. #ifndef COMPLEX
  162. FLOAT alpha,
  163. IFLOAT * A, blasint LDA,
  164. IFLOAT * B, blasint LDB, FLOAT beta, FLOAT * c, blasint ldc)
  165. {
  166. #else
  167. void *valpha,
  168. void *va, blasint LDA,
  169. void *vb, blasint LDB, void *vbeta, void *vc, blasint ldc)
  170. {
  171. FLOAT *alpha = (FLOAT *) valpha;
  172. FLOAT *beta = (FLOAT *) vbeta;
  173. FLOAT *A = (FLOAT *) va;
  174. FLOAT *B = (FLOAT *) vb;
  175. FLOAT *c = (FLOAT *) vc;
  176. #endif
  177. FLOAT *aa, *bb, *cc;
  178. int transa, transb, uplo;
  179. blasint info;
  180. blasint m, lda, ldb;
  181. FLOAT *a, *b;
  182. XFLOAT *buffer;
  183. PRINT_DEBUG_CNAME;
  184. transa = -1;
  185. transb = -1;
  186. info = 0;
  187. if (order == CblasColMajor) {
  188. if (TransA == CblasNoTrans)
  189. transa = 0;
  190. if (TransA == CblasTrans)
  191. transa = 1;
  192. #ifndef COMPLEX
  193. if (TransA == CblasConjNoTrans)
  194. transa = 0;
  195. if (TransA == CblasConjTrans)
  196. transa = 1;
  197. #else
  198. if (TransA == CblasConjNoTrans)
  199. transa = 2;
  200. if (TransA == CblasConjTrans)
  201. transa = 3;
  202. #endif
  203. if (TransB == CblasNoTrans)
  204. transb = 0;
  205. if (TransB == CblasTrans)
  206. transb = 1;
  207. #ifndef COMPLEX
  208. if (TransB == CblasConjNoTrans)
  209. transb = 0;
  210. if (TransB == CblasConjTrans)
  211. transb = 1;
  212. #else
  213. if (TransB == CblasConjNoTrans)
  214. transb = 2;
  215. if (TransB == CblasConjTrans)
  216. transb = 3;
  217. #endif
  218. a = (void *)A;
  219. b = (void *)B;
  220. lda = LDA;
  221. ldb = LDB;
  222. info = -1;
  223. if (ldc < m)
  224. info = 13;
  225. if (k < 0)
  226. info = 5;
  227. if (m < 0)
  228. info = 3;
  229. if (transb < 0)
  230. info = 2;
  231. if (transa < 0)
  232. info = 1;
  233. }
  234. if (order == CblasRowMajor) {
  235. a = (void *)B;
  236. b = (void *)A;
  237. lda = LDB;
  238. ldb = LDA;
  239. if (TransB == CblasNoTrans)
  240. transa = 0;
  241. if (TransB == CblasTrans)
  242. transa = 1;
  243. #ifndef COMPLEX
  244. if (TransB == CblasConjNoTrans)
  245. transa = 0;
  246. if (TransB == CblasConjTrans)
  247. transa = 1;
  248. #else
  249. if (TransB == CblasConjNoTrans)
  250. transa = 2;
  251. if (TransB == CblasConjTrans)
  252. transa = 3;
  253. #endif
  254. if (TransA == CblasNoTrans)
  255. transb = 0;
  256. if (TransA == CblasTrans)
  257. transb = 1;
  258. #ifndef COMPLEX
  259. if (TransA == CblasConjNoTrans)
  260. transb = 0;
  261. if (TransA == CblasConjTrans)
  262. transb = 1;
  263. #else
  264. if (TransA == CblasConjNoTrans)
  265. transb = 2;
  266. if (TransA == CblasConjTrans)
  267. transb = 3;
  268. #endif
  269. info = -1;
  270. if (ldc < m)
  271. info = 13;
  272. if (k < 0)
  273. info = 5;
  274. if (m < 0)
  275. info = 3;
  276. if (transb < 0)
  277. info = 2;
  278. if (transa < 0)
  279. info = 1;
  280. }
  281. uplo = -1;
  282. if (Uplo == CblasUpper)
  283. uplo = 0;
  284. if (Uplo == CblasLower)
  285. uplo = 1;
  286. if (uplo < 0)
  287. info = 14;
  288. if (info >= 0) {
  289. BLASFUNC(xerbla) (ERROR_NAME, &info, sizeof(ERROR_NAME));
  290. return;
  291. }
  292. #if defined(COMPLEX)
  293. FLOAT alpha_r = *(alpha + 0);
  294. FLOAT alpha_i = *(alpha + 1);
  295. FLOAT beta_r = *(beta + 0);
  296. FLOAT beta_i = *(beta + 1);
  297. #endif
  298. #endif
  299. int buffer_size;
  300. blasint l;
  301. blasint i, j;
  302. #ifdef SMP
  303. int nthreads;
  304. #endif
  305. #if defined(COMPLEX)
  306. #ifdef SMP
  307. static int (*gemv_thread[]) (BLASLONG, BLASLONG, FLOAT *, FLOAT *,
  308. BLASLONG, FLOAT *, BLASLONG, FLOAT *,
  309. BLASLONG, FLOAT *, int) = {
  310. #ifdef XDOUBLE
  311. xgemv_thread_n, xgemv_thread_t, xgemv_thread_r, xgemv_thread_c,
  312. xgemv_thread_o, xgemv_thread_u, xgemv_thread_s,
  313. xgemv_thread_d,
  314. #elif defined DOUBLE
  315. zgemv_thread_n, zgemv_thread_t, zgemv_thread_r, zgemv_thread_c,
  316. zgemv_thread_o, zgemv_thread_u, zgemv_thread_s,
  317. zgemv_thread_d,
  318. #else
  319. cgemv_thread_n, cgemv_thread_t, cgemv_thread_r, cgemv_thread_c,
  320. cgemv_thread_o, cgemv_thread_u, cgemv_thread_s,
  321. cgemv_thread_d,
  322. #endif
  323. };
  324. #endif
  325. int (*gemv[]) (BLASLONG, BLASLONG, BLASLONG, FLOAT, FLOAT, FLOAT *,
  326. BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG,
  327. FLOAT *) = {
  328. GEMV_N, GEMV_T, GEMV_R, GEMV_C, GEMV_O, GEMV_U, GEMV_S, GEMV_D,};
  329. #else
  330. #ifdef SMP
  331. static int (*gemv_thread[]) (BLASLONG, BLASLONG, FLOAT, FLOAT *,
  332. BLASLONG, FLOAT *, BLASLONG, FLOAT *,
  333. BLASLONG, FLOAT *, int) = {
  334. #ifdef XDOUBLE
  335. qgemv_thread_n, qgemv_thread_t,
  336. #elif defined DOUBLE
  337. dgemv_thread_n, dgemv_thread_t,
  338. #else
  339. sgemv_thread_n, sgemv_thread_t,
  340. #endif
  341. };
  342. #endif
  343. int (*gemv[]) (BLASLONG, BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG,
  344. FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  345. GEMV_N, GEMV_T,};
  346. #endif
  347. if ((m == 0) )
  348. return;
  349. IDEBUG_START;
  350. const blasint incb = (transb == 0) ? 1 : ldb;
  351. if (uplo == 1) {
  352. for (i = 0; i < m; i++) {
  353. j = m - i;
  354. l = j;
  355. #if defined(COMPLEX)
  356. aa = a + i * 2;
  357. bb = b + i * ldb * 2;
  358. if (transa) {
  359. aa = a + lda * i * 2;
  360. }
  361. if (transb)
  362. bb = b + i * 2;
  363. cc = c + i * 2 * ldc + i * 2;
  364. #else
  365. aa = a + i;
  366. bb = b + i * ldb;
  367. if (transa) {
  368. aa = a + lda * i;
  369. }
  370. if (transb)
  371. bb = b + i;
  372. cc = c + i * ldc + i;
  373. #endif
  374. #if defined(COMPLEX)
  375. if (beta_r != ONE || beta_i != ZERO)
  376. SCAL_K(l, 0, 0, beta_r, beta_i, cc, 1, NULL, 0,
  377. NULL, 0);
  378. if (alpha_r == ZERO && alpha_i == ZERO)
  379. return;
  380. #else
  381. if (beta != ONE)
  382. SCAL_K(l, 0, 0, beta, cc, 1, NULL, 0, NULL, 0);
  383. if (alpha == ZERO)
  384. continue;
  385. #endif
  386. IDEBUG_START;
  387. buffer_size = j + k + 128 / sizeof(FLOAT);
  388. #ifdef WINDOWS_ABI
  389. buffer_size += 160 / sizeof(FLOAT);
  390. #endif
  391. // for alignment
  392. buffer_size = (buffer_size + 3) & ~3;
  393. STACK_ALLOC(buffer_size, FLOAT, buffer);
  394. #ifdef SMP
  395. if (1L * j * k < 2304L * GEMM_MULTITHREAD_THRESHOLD)
  396. nthreads = 1;
  397. else
  398. nthreads = num_cpu_avail(2);
  399. if (nthreads == 1) {
  400. #endif
  401. #if defined(COMPLEX)
  402. if (!transa)
  403. (gemv[(int)transa]) (j, k, 0, alpha_r, alpha_i,
  404. aa, lda, bb, incb, cc, 1,
  405. buffer);
  406. else
  407. (gemv[(int)transa]) (k, j, 0, alpha_r, alpha_i,
  408. aa, lda, bb, incb, cc, 1,
  409. buffer);
  410. #else
  411. if (!transa)
  412. (gemv[(int)transa]) (j, k, 0, alpha, aa, lda,
  413. bb, incb, cc, 1, buffer);
  414. else
  415. (gemv[(int)transa]) (k, j, 0, alpha, aa, lda,
  416. bb, incb, cc, 1, buffer);
  417. #endif
  418. #ifdef SMP
  419. } else {
  420. if (!transa)
  421. (gemv_thread[(int)transa]) (j, k, alpha, aa,
  422. lda, bb, incb, cc,
  423. 1, buffer,
  424. nthreads);
  425. else
  426. (gemv_thread[(int)transa]) (k, j, alpha, aa,
  427. lda, bb, incb, cc,
  428. 1, buffer,
  429. nthreads);
  430. }
  431. #endif
  432. STACK_FREE(buffer);
  433. }
  434. } else {
  435. for (i = 0; i < m; i++) {
  436. j = i + 1;
  437. l = j;
  438. #if defined COMPLEX
  439. bb = b + i * ldb * 2;
  440. if (transb) {
  441. bb = b + i * 2;
  442. }
  443. cc = c + i * 2 * ldc;
  444. #else
  445. bb = b + i * ldb;
  446. if (transb) {
  447. bb = b + i;
  448. }
  449. cc = c + i * ldc;
  450. #endif
  451. #if defined(COMPLEX)
  452. if (beta_r != ONE || beta_i != ZERO)
  453. SCAL_K(l, 0, 0, beta_r, beta_i, cc, 1, NULL, 0,
  454. NULL, 0);
  455. if (alpha_r == ZERO && alpha_i == ZERO)
  456. return;
  457. #else
  458. if (beta != ONE)
  459. SCAL_K(l, 0, 0, beta, cc, 1, NULL, 0, NULL, 0);
  460. if (alpha == ZERO)
  461. continue;
  462. #endif
  463. IDEBUG_START;
  464. buffer_size = j + k + 128 / sizeof(FLOAT);
  465. #ifdef WINDOWS_ABI
  466. buffer_size += 160 / sizeof(FLOAT);
  467. #endif
  468. // for alignment
  469. buffer_size = (buffer_size + 3) & ~3;
  470. STACK_ALLOC(buffer_size, FLOAT, buffer);
  471. #ifdef SMP
  472. if (1L * j * k < 2304L * GEMM_MULTITHREAD_THRESHOLD)
  473. nthreads = 1;
  474. else
  475. nthreads = num_cpu_avail(2);
  476. if (nthreads == 1) {
  477. #endif
  478. #if defined(COMPLEX)
  479. if (!transa)
  480. (gemv[(int)transa]) (j, k, 0, alpha_r, alpha_i,
  481. a, lda, bb, incb, cc, 1,
  482. buffer);
  483. else
  484. (gemv[(int)transa]) (k, j, 0, alpha_r, alpha_i,
  485. a, lda, bb, incb, cc, 1,
  486. buffer);
  487. #else
  488. if (!transa)
  489. (gemv[(int)transa]) (j, k, 0, alpha, a, lda, bb,
  490. incb, cc, 1, buffer);
  491. else
  492. (gemv[(int)transa]) (k, j, 0, alpha, a, lda, bb,
  493. incb, cc, 1, buffer);
  494. #endif
  495. #ifdef SMP
  496. } else {
  497. if (!transa)
  498. (gemv_thread[(int)transa]) (j, k, alpha, a, lda,
  499. bb, incb, cc, 1,
  500. buffer, nthreads);
  501. else
  502. (gemv_thread[(int)transa]) (k, j, alpha, a, lda,
  503. bb, incb, cc, 1,
  504. buffer, nthreads);
  505. }
  506. #endif
  507. STACK_FREE(buffer);
  508. }
  509. }
  510. IDEBUG_END;
  511. return;
  512. }