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 13 kB

6 years ago
6 years ago
6 years ago
6 years ago
6 years ago
6 years ago
6 years ago
6 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468
  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. START_RPCC();
  106. #ifndef TRANSA
  107. TRMM_IUTCOPY(min_l, min_i, a, lda, 0, 0, sa);
  108. #else
  109. TRMM_ILNCOPY(min_l, min_i, a, lda, 0, 0, sa);
  110. #endif
  111. STOP_RPCC(innercost);
  112. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  113. min_jj = min_j + js - jjs;
  114. #ifdef SKYLAKEX
  115. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  116. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  117. #else
  118. if (min_jj > GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  119. else
  120. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  121. #endif
  122. START_RPCC();
  123. GEMM_ONCOPY(min_l, min_jj, b + (jjs * ldb) * COMPSIZE, ldb, sb + min_l * (jjs - js) * COMPSIZE);
  124. STOP_RPCC(outercost);
  125. START_RPCC();
  126. TRMM_KERNEL_N(min_i, min_jj, min_l, dp1,
  127. #ifdef COMPLEX
  128. ZERO,
  129. #endif
  130. sa, sb + min_l * (jjs - js) * COMPSIZE, b + (jjs * ldb) * COMPSIZE, ldb, 0);
  131. STOP_RPCC(trmmcost);
  132. }
  133. for(is = min_i; is < min_l; is += GEMM_P){
  134. min_i = min_l - is;
  135. if (min_i > GEMM_P) min_i = GEMM_P;
  136. START_RPCC();
  137. #ifndef TRANSA
  138. TRMM_IUTCOPY(min_l, min_i, a, lda, 0, is, sa);
  139. #else
  140. TRMM_ILNCOPY(min_l, min_i, a, lda, 0, is, sa);
  141. #endif
  142. STOP_RPCC(innercost);
  143. START_RPCC();
  144. TRMM_KERNEL_N(min_i, min_j, min_l, dp1,
  145. #ifdef COMPLEX
  146. ZERO,
  147. #endif
  148. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is);
  149. STOP_RPCC(trmmcost);
  150. }
  151. for(ls = min_l; ls < m; ls += GEMM_Q){
  152. min_l = m - ls;
  153. if (min_l > GEMM_Q) min_l = GEMM_Q;
  154. min_i = ls;
  155. if (min_i > GEMM_P) min_i = GEMM_P;
  156. START_RPCC();
  157. #ifndef TRANSA
  158. GEMM_ITCOPY(min_l, min_i, a + (ls * lda) * COMPSIZE, lda, sa);
  159. #else
  160. GEMM_INCOPY(min_l, min_i, a + (ls ) * COMPSIZE, lda, sa);
  161. #endif
  162. STOP_RPCC(innercost);
  163. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  164. min_jj = min_j + js - jjs;
  165. #ifdef SKYLAKEX
  166. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  167. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  168. #else
  169. if (min_jj > GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  170. else
  171. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  172. #endif
  173. START_RPCC();
  174. GEMM_ONCOPY(min_l, min_jj, b + (ls + jjs * ldb) * COMPSIZE, ldb, sb + min_l * (jjs - js) * COMPSIZE);
  175. STOP_RPCC(gemmcost);
  176. START_RPCC();
  177. GEMM_KERNEL(min_i, min_jj, min_l, dp1,
  178. #ifdef COMPLEX
  179. ZERO,
  180. #endif
  181. sa, sb + min_l * (jjs - js) * COMPSIZE,
  182. b + (jjs * ldb) * COMPSIZE, ldb);
  183. STOP_RPCC(gemmcost);
  184. }
  185. for(is = min_i; is < ls; is += GEMM_P){
  186. min_i = ls - is;
  187. if (min_i > GEMM_P) min_i = GEMM_P;
  188. START_RPCC();
  189. #ifndef TRANSA
  190. GEMM_ITCOPY(min_l, min_i, a + (is + ls * lda) * COMPSIZE, lda, sa);
  191. #else
  192. GEMM_INCOPY(min_l, min_i, a + (ls + is * lda) * COMPSIZE, lda, sa);
  193. #endif
  194. STOP_RPCC(innercost);
  195. START_RPCC();
  196. GEMM_KERNEL(min_i, min_j, min_l, dp1,
  197. #ifdef COMPLEX
  198. ZERO,
  199. #endif
  200. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb);
  201. STOP_RPCC(gemmcost);
  202. }
  203. for(is = ls; is < ls + min_l; is += GEMM_P){
  204. min_i = ls + min_l - is;
  205. if (min_i > GEMM_P) min_i = GEMM_P;
  206. START_RPCC();
  207. #ifndef TRANSA
  208. TRMM_IUTCOPY(min_l, min_i, a, lda, ls, is, sa);
  209. #else
  210. TRMM_ILNCOPY(min_l, min_i, a, lda, ls, is, sa);
  211. #endif
  212. STOP_RPCC(innercost);
  213. START_RPCC();
  214. TRMM_KERNEL_N(min_i, min_j, min_l, dp1,
  215. #ifdef COMPLEX
  216. ZERO,
  217. #endif
  218. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is - ls);
  219. STOP_RPCC(trmmcost);
  220. }
  221. }
  222. #else
  223. min_l = m;
  224. if (min_l > GEMM_Q) min_l = GEMM_Q;
  225. min_i = min_l;
  226. if (min_i > GEMM_P) min_i = GEMM_P;
  227. START_RPCC();
  228. #ifndef TRANSA
  229. TRMM_ILTCOPY(min_l, min_i, a, lda, m - min_l, m - min_l, sa);
  230. #else
  231. TRMM_IUNCOPY(min_l, min_i, a, lda, m - min_l, m - min_l, sa);
  232. #endif
  233. STOP_RPCC(innercost);
  234. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  235. min_jj = min_j + js - jjs;
  236. #ifdef SKYLAKEX
  237. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  238. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  239. #else
  240. if (min_jj > GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  241. else
  242. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  243. #endif
  244. START_RPCC();
  245. GEMM_ONCOPY(min_l, min_jj, b + (m - min_l + jjs * ldb) * COMPSIZE, ldb,
  246. sb + min_l * (jjs - js) * COMPSIZE);
  247. STOP_RPCC(outercost);
  248. START_RPCC();
  249. TRMM_KERNEL_T(min_i, min_jj, min_l, dp1,
  250. #ifdef COMPLEX
  251. ZERO,
  252. #endif
  253. sa, sb + min_l * (jjs - js) * COMPSIZE,
  254. b + (m - min_l + jjs * ldb) * COMPSIZE, ldb, 0);
  255. STOP_RPCC(trmmcost);
  256. }
  257. for(is = m - min_l + min_i; is < m; is += GEMM_P){
  258. min_i = m - is;
  259. if (min_i > GEMM_P) min_i = GEMM_P;
  260. START_RPCC();
  261. #ifndef TRANSA
  262. TRMM_ILTCOPY(min_l, min_i, a, lda, m - min_l, is, sa);
  263. #else
  264. TRMM_IUNCOPY(min_l, min_i, a, lda, m - min_l, is, sa);
  265. #endif
  266. STOP_RPCC(innercost);
  267. START_RPCC();
  268. TRMM_KERNEL_T(min_i, min_j, min_l, dp1,
  269. #ifdef COMPLEX
  270. ZERO,
  271. #endif
  272. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is - m + min_l);
  273. STOP_RPCC(trmmcost);
  274. }
  275. for(ls = m - min_l; ls > 0; ls -= GEMM_Q){
  276. min_l = ls;
  277. if (min_l > GEMM_Q) min_l = GEMM_Q;
  278. min_i = min_l;
  279. if (min_i > GEMM_P) min_i = GEMM_P;
  280. START_RPCC();
  281. #ifndef TRANSA
  282. TRMM_ILTCOPY(min_l, min_i, a, lda, ls - min_l, ls - min_l, sa);
  283. #else
  284. TRMM_IUNCOPY(min_l, min_i, a, lda, ls - min_l, ls - min_l, sa);
  285. #endif
  286. STOP_RPCC(innercost);
  287. for(jjs = js; jjs < js + min_j; jjs += min_jj){
  288. min_jj = min_j + js - jjs;
  289. #ifdef SKYLAKEX
  290. /* the current AVX512 s/d/c/z GEMM kernel requires n>=6*GEMM_UNROLL_N to achieve the best performance */
  291. if (min_jj >= 6*GEMM_UNROLL_N) min_jj = 6*GEMM_UNROLL_N;
  292. #else
  293. if (min_jj > GEMM_UNROLL_N*3) min_jj = GEMM_UNROLL_N*3;
  294. else
  295. if (min_jj > GEMM_UNROLL_N) min_jj = GEMM_UNROLL_N;
  296. #endif
  297. START_RPCC();
  298. GEMM_ONCOPY(min_l, min_jj, b + (ls - min_l + jjs * ldb) * COMPSIZE, ldb,
  299. sb + min_l * (jjs - js) * COMPSIZE);
  300. STOP_RPCC(outercost);
  301. START_RPCC();
  302. TRMM_KERNEL_T(min_i, min_jj, min_l, dp1,
  303. #ifdef COMPLEX
  304. ZERO,
  305. #endif
  306. sa, sb + min_l * (jjs - js) * COMPSIZE,
  307. b + (ls - min_l + jjs * ldb) * COMPSIZE, ldb, 0);
  308. STOP_RPCC(trmmcost);
  309. }
  310. for(is = ls - min_l + min_i; is < ls; is += GEMM_P){
  311. min_i = ls - is;
  312. if (min_i > GEMM_P) min_i = GEMM_P;
  313. START_RPCC();
  314. #ifndef TRANSA
  315. TRMM_ILTCOPY(min_l, min_i, a, lda, ls - min_l, is, sa);
  316. #else
  317. TRMM_IUNCOPY(min_l, min_i, a, lda, ls - min_l, is, sa);
  318. #endif
  319. STOP_RPCC(innercost);
  320. START_RPCC();
  321. TRMM_KERNEL_T(min_i, min_j, min_l, dp1,
  322. #ifdef COMPLEX
  323. ZERO,
  324. #endif
  325. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb, is - ls + min_l);
  326. STOP_RPCC(trmmcost);
  327. }
  328. for(is = ls; is < m; is += GEMM_P){
  329. min_i = m - is;
  330. if (min_i > GEMM_P) min_i = GEMM_P;
  331. START_RPCC();
  332. #ifndef TRANSA
  333. GEMM_ITCOPY(min_l, min_i, a + (is + (ls - min_l) * lda) * COMPSIZE, lda, sa);
  334. #else
  335. GEMM_INCOPY(min_l, min_i, a + ((ls - min_l) + is * lda) * COMPSIZE, lda, sa);
  336. #endif
  337. STOP_RPCC(innercost);
  338. START_RPCC();
  339. GEMM_KERNEL(min_i, min_j, min_l, dp1,
  340. #ifdef COMPLEX
  341. ZERO,
  342. #endif
  343. sa, sb, b + (is + js * ldb) * COMPSIZE, ldb);
  344. STOP_RPCC(gemmcost);
  345. }
  346. }
  347. #endif
  348. }
  349. #ifdef TIMING
  350. total = (double)outercost + (double)innercost + (double)gemmcost + (double)trmmcost;
  351. 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",
  352. innercost / total * 100., outercost / total * 100.,
  353. gemmcost / total * 100., trmmcost / total * 100.,
  354. (double)n * (double)n * (double)n / (double)(trmmcost + gemmcost) * 100. * (double)COMPSIZE / 2.,
  355. (double)n * (double)n * (double)n / total * 100. * (double)COMPSIZE / 2.);
  356. #endif
  357. return 0;
  358. }