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.

trmm_L.c 14 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504
  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 <ctype.h>
  40. #include "common.h"
  41. const static FLOAT dp1 = 1.;
  42. #ifdef CONJ
  43. #define GEMM_KERNEL GEMM_KERNEL_L
  44. #define TRMM_KERNEL_N TRMM_KERNEL_LR
  45. #define TRMM_KERNEL_T TRMM_KERNEL_LC
  46. #else
  47. #define GEMM_KERNEL GEMM_KERNEL_N
  48. #define TRMM_KERNEL_N TRMM_KERNEL_LN
  49. #define TRMM_KERNEL_T TRMM_KERNEL_LT
  50. #endif
  51. #undef TIMING
  52. #ifdef TIMING
  53. #define START_RPCC() rpcc_counter = rpcc()
  54. #define STOP_RPCC(COUNTER) COUNTER += rpcc() - rpcc_counter
  55. #else
  56. #define START_RPCC()
  57. #define STOP_RPCC(COUNTER)
  58. #endif
  59. int CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG dummy) {
  60. BLASLONG m, n, lda, ldb;
  61. FLOAT *beta, *a, *b;
  62. BLASLONG ls, is, js;
  63. BLASLONG min_l, min_i, min_j;
  64. BLASLONG jjs, min_jj;
  65. #ifdef TIMING
  66. unsigned long long rpcc_counter;
  67. unsigned long long innercost = 0;
  68. unsigned long long outercost = 0;
  69. unsigned long long gemmcost = 0;
  70. unsigned long long trmmcost = 0;
  71. double total;
  72. #endif
  73. m = args -> m;
  74. n = args -> n;
  75. a = (FLOAT *)args -> a;
  76. b = (FLOAT *)args -> b;
  77. lda = args -> lda;
  78. ldb = args -> ldb;
  79. beta = (FLOAT *)args -> beta;
  80. if (range_n) {
  81. BLASLONG n_from = *(((BLASLONG *)range_n) + 0);
  82. BLASLONG n_to = *(((BLASLONG *)range_n) + 1);
  83. n = n_to - n_from;
  84. b += n_from * ldb * COMPSIZE;
  85. }
  86. if (beta) {
  87. #ifndef COMPLEX
  88. if (beta[0] != ONE)
  89. GEMM_BETA(m, n, 0, beta[0], NULL, 0, NULL, 0, b, ldb);
  90. if (beta[0] == ZERO) return 0;
  91. #else
  92. if ((beta[0] != ONE) || (beta[1] != ZERO))
  93. GEMM_BETA(m, n, 0, beta[0], beta[1], NULL, 0, NULL, 0, b, ldb);
  94. if ((beta[0] == ZERO) && (beta[1] == ZERO)) return 0;
  95. #endif
  96. }
  97. for(js = 0; js < n; js += GEMM_R){
  98. min_j = n - js;
  99. if (min_j > GEMM_R) min_j = GEMM_R;
  100. #if (defined(UPPER) && !defined(TRANSA)) || (!defined(UPPER) && defined(TRANSA))
  101. min_l = m;
  102. if (min_l > GEMM_Q) min_l = GEMM_Q;
  103. min_i = min_l;
  104. if (min_i > GEMM_P) min_i = GEMM_P;
  105. if( min_i > GEMM_UNROLL_M){
  106. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  107. }
  108. START_RPCC();
  109. #ifndef TRANSA
  110. TRMM_IUTCOPY(min_l, min_i, a, lda, 0, 0, sa);
  111. #else
  112. TRMM_ILNCOPY(min_l, min_i, a, lda, 0, 0, sa);
  113. #endif
  114. STOP_RPCC(innercost);
  115. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  116. min_jj = min_j + js - jjs;
  117. #if defined(SKYLAKEX) || defined(COOPERLAKE) || defined(SAPPHIRERAPIDS)
  118. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  119. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  120. #else
  121. if (min_jj >= GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  122. else
  123. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  124. #endif
  125. START_RPCC();
  126. GEMM_ONCOPY(min_l, min_jj, b + (jjs * ldb) * COMPSIZE, ldb, sb + min_l * (jjs - js) * COMPSIZE);
  127. STOP_RPCC(outercost);
  128. START_RPCC();
  129. TRMM_KERNEL_N(min_i, min_jj, min_l, dp1,
  130. #ifdef COMPLEX
  131. ZERO,
  132. #endif
  133. sa, sb + min_l * (jjs - js) * COMPSIZE, b + (jjs * ldb) * COMPSIZE, ldb, 0);
  134. STOP_RPCC(trmmcost);
  135. }
  136. for(is = min_i; is < min_l; is += min_i){
  137. min_i = min_l - is;
  138. if (min_i > GEMM_P) min_i = GEMM_P;
  139. if( min_i > GEMM_UNROLL_M){
  140. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  141. }
  142. START_RPCC();
  143. #ifndef TRANSA
  144. TRMM_IUTCOPY(min_l, min_i, a, lda, 0, is, sa);
  145. #else
  146. TRMM_ILNCOPY(min_l, min_i, a, lda, 0, is, sa);
  147. #endif
  148. STOP_RPCC(innercost);
  149. START_RPCC();
  150. TRMM_KERNEL_N(min_i, min_j, min_l, dp1,
  151. #ifdef COMPLEX
  152. ZERO,
  153. #endif
  154. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is);
  155. STOP_RPCC(trmmcost);
  156. }
  157. for(ls = min_l; ls < m; ls += GEMM_Q){
  158. min_l = m - ls;
  159. if (min_l > GEMM_Q) min_l = GEMM_Q;
  160. min_i = ls;
  161. if (min_i > GEMM_P) min_i = GEMM_P;
  162. if( min_i > GEMM_UNROLL_M){
  163. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  164. }
  165. START_RPCC();
  166. #ifndef TRANSA
  167. GEMM_ITCOPY(min_l, min_i, a + (ls * lda) * COMPSIZE, lda, sa);
  168. #else
  169. GEMM_INCOPY(min_l, min_i, a + (ls ) * COMPSIZE, lda, sa);
  170. #endif
  171. STOP_RPCC(innercost);
  172. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  173. min_jj = min_j + js - jjs;
  174. #if defined(SKYLAKEX) || defined(COOPERLAKE) || defined(SAPPHIRERAPIDS)
  175. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  176. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  177. #else
  178. if (min_jj >= GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  179. else
  180. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  181. #endif
  182. START_RPCC();
  183. GEMM_ONCOPY(min_l, min_jj, b + (ls + jjs * ldb) * COMPSIZE, ldb, sb + min_l * (jjs - js) * COMPSIZE);
  184. STOP_RPCC(gemmcost);
  185. START_RPCC();
  186. GEMM_KERNEL(min_i, min_jj, min_l, dp1,
  187. #ifdef COMPLEX
  188. ZERO,
  189. #endif
  190. sa, sb + min_l * (jjs - js) * COMPSIZE,
  191. b + (jjs * ldb) * COMPSIZE, ldb);
  192. STOP_RPCC(gemmcost);
  193. }
  194. for(is = min_i; is < ls; is += min_i){
  195. min_i = ls - is;
  196. if (min_i > GEMM_P) min_i = GEMM_P;
  197. if( min_i > GEMM_UNROLL_M){
  198. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  199. }
  200. START_RPCC();
  201. #ifndef TRANSA
  202. GEMM_ITCOPY(min_l, min_i, a + (is + ls * lda) * COMPSIZE, lda, sa);
  203. #else
  204. GEMM_INCOPY(min_l, min_i, a + (ls + is * lda) * COMPSIZE, lda, sa);
  205. #endif
  206. STOP_RPCC(innercost);
  207. START_RPCC();
  208. GEMM_KERNEL(min_i, min_j, min_l, dp1,
  209. #ifdef COMPLEX
  210. ZERO,
  211. #endif
  212. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb);
  213. STOP_RPCC(gemmcost);
  214. }
  215. for(is = ls; is < ls + min_l; is += min_i){
  216. min_i = ls + min_l - is;
  217. if (min_i > GEMM_P) min_i = GEMM_P;
  218. if( min_i > GEMM_UNROLL_M){
  219. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  220. }
  221. START_RPCC();
  222. #ifndef TRANSA
  223. TRMM_IUTCOPY(min_l, min_i, a, lda, ls, is, sa);
  224. #else
  225. TRMM_ILNCOPY(min_l, min_i, a, lda, ls, is, sa);
  226. #endif
  227. STOP_RPCC(innercost);
  228. START_RPCC();
  229. TRMM_KERNEL_N(min_i, min_j, min_l, dp1,
  230. #ifdef COMPLEX
  231. ZERO,
  232. #endif
  233. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is - ls);
  234. STOP_RPCC(trmmcost);
  235. }
  236. }
  237. #else
  238. min_l = m;
  239. if (min_l > GEMM_Q) min_l = GEMM_Q;
  240. min_i = min_l;
  241. if (min_i > GEMM_P) min_i = GEMM_P;
  242. if (min_i > GEMM_UNROLL_M){
  243. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  244. }
  245. START_RPCC();
  246. #ifndef TRANSA
  247. TRMM_ILTCOPY(min_l, min_i, a, lda, m - min_l, m - min_l, sa);
  248. #else
  249. TRMM_IUNCOPY(min_l, min_i, a, lda, m - min_l, m - min_l, sa);
  250. #endif
  251. STOP_RPCC(innercost);
  252. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  253. min_jj = min_j + js - jjs;
  254. #if defined(SKYLAKEX) || defined(COOPERLAKE) || defined(SAPPHIRERAPIDS)
  255. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  256. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  257. #else
  258. if (min_jj >= GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  259. else
  260. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  261. #endif
  262. START_RPCC();
  263. GEMM_ONCOPY(min_l, min_jj, b + (m - min_l + jjs * ldb) * COMPSIZE, ldb,
  264. sb + min_l * (jjs - js) * COMPSIZE);
  265. STOP_RPCC(outercost);
  266. START_RPCC();
  267. TRMM_KERNEL_T(min_i, min_jj, min_l, dp1,
  268. #ifdef COMPLEX
  269. ZERO,
  270. #endif
  271. sa, sb + min_l * (jjs - js) * COMPSIZE,
  272. b + (m - min_l + jjs * ldb) * COMPSIZE, ldb, 0);
  273. STOP_RPCC(trmmcost);
  274. }
  275. for(is = m - min_l + min_i; is < m; is += min_i){
  276. min_i = m - is;
  277. if (min_i > GEMM_P) min_i = GEMM_P;
  278. if (min_i > GEMM_UNROLL_M){
  279. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  280. }
  281. START_RPCC();
  282. #ifndef TRANSA
  283. TRMM_ILTCOPY(min_l, min_i, a, lda, m - min_l, is, sa);
  284. #else
  285. TRMM_IUNCOPY(min_l, min_i, a, lda, m - min_l, is, sa);
  286. #endif
  287. STOP_RPCC(innercost);
  288. START_RPCC();
  289. TRMM_KERNEL_T(min_i, min_j, min_l, dp1,
  290. #ifdef COMPLEX
  291. ZERO,
  292. #endif
  293. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is - m + min_l);
  294. STOP_RPCC(trmmcost);
  295. }
  296. for(ls = m - min_l; ls > 0; ls -= GEMM_Q){
  297. min_l = ls;
  298. if (min_l > GEMM_Q) min_l = GEMM_Q;
  299. min_i = min_l;
  300. if (min_i > GEMM_P) min_i = GEMM_P;
  301. if (min_i > GEMM_UNROLL_M){
  302. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  303. }
  304. START_RPCC();
  305. #ifndef TRANSA
  306. TRMM_ILTCOPY(min_l, min_i, a, lda, ls - min_l, ls - min_l, sa);
  307. #else
  308. TRMM_IUNCOPY(min_l, min_i, a, lda, ls - min_l, ls - min_l, sa);
  309. #endif
  310. STOP_RPCC(innercost);
  311. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  312. min_jj = min_j + js - jjs;
  313. #if defined(SKYLAKEX) || defined(COOPERLAKE) || defined(SAPPHIRERAPIDS)
  314. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  315. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  316. #else
  317. if (min_jj >= GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  318. else
  319. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  320. #endif
  321. START_RPCC();
  322. GEMM_ONCOPY(min_l, min_jj, b + (ls - min_l + jjs * ldb) * COMPSIZE, ldb,
  323. sb + min_l * (jjs - js) * COMPSIZE);
  324. STOP_RPCC(outercost);
  325. START_RPCC();
  326. TRMM_KERNEL_T(min_i, min_jj, min_l, dp1,
  327. #ifdef COMPLEX
  328. ZERO,
  329. #endif
  330. sa, sb + min_l * (jjs - js) * COMPSIZE,
  331. b + (ls - min_l + jjs * ldb) * COMPSIZE, ldb, 0);
  332. STOP_RPCC(trmmcost);
  333. }
  334. for(is = ls - min_l + min_i; is < ls; is += min_i){
  335. min_i = ls - is;
  336. if (min_i > GEMM_P) min_i = GEMM_P;
  337. if (min_i > GEMM_UNROLL_M){
  338. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  339. }
  340. START_RPCC();
  341. #ifndef TRANSA
  342. TRMM_ILTCOPY(min_l, min_i, a, lda, ls - min_l, is, sa);
  343. #else
  344. TRMM_IUNCOPY(min_l, min_i, a, lda, ls - min_l, is, sa);
  345. #endif
  346. STOP_RPCC(innercost);
  347. START_RPCC();
  348. TRMM_KERNEL_T(min_i, min_j, min_l, dp1,
  349. #ifdef COMPLEX
  350. ZERO,
  351. #endif
  352. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is - ls + min_l);
  353. STOP_RPCC(trmmcost);
  354. }
  355. for(is = ls; is < m; is += min_i){
  356. min_i = m - is;
  357. if (min_i > GEMM_P) min_i = GEMM_P;
  358. if (min_i > GEMM_UNROLL_M){
  359. min_i = (min_i / GEMM_UNROLL_M) * GEMM_UNROLL_M;
  360. }
  361. START_RPCC();
  362. #ifndef TRANSA
  363. GEMM_ITCOPY(min_l, min_i, a + (is + (ls - min_l) * lda) * COMPSIZE, lda, sa);
  364. #else
  365. GEMM_INCOPY(min_l, min_i, a + ((ls - min_l) + is * lda) * COMPSIZE, lda, sa);
  366. #endif
  367. STOP_RPCC(innercost);
  368. START_RPCC();
  369. GEMM_KERNEL(min_i, min_j, min_l, dp1,
  370. #ifdef COMPLEX
  371. ZERO,
  372. #endif
  373. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb);
  374. STOP_RPCC(gemmcost);
  375. }
  376. }
  377. #endif
  378. }
  379. #ifdef TIMING
  380. total = (double)outercost + (double)innercost + (double)gemmcost + (double)trmmcost;
  381. printf( "Copy A : %5.2f Copy B: %5.2f GEMM Kernel : %5.2f TRMM Kerlnel : %5.2f kernel Effi. : %5.2f Total Effi. : %5.2f\n",
  382. innercost / total * 100., outercost / total * 100.,
  383. gemmcost / total * 100., trmmcost / total * 100.,
  384. (double)n * (double)n * (double)n / (double)(trmmcost + gemmcost) * 100. * (double)COMPSIZE / 2.,
  385. (double)n * (double)n * (double)n / total * 100. * (double)COMPSIZE / 2.);
  386. #endif
  387. return 0;
  388. }