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.

ztrsm_kernel_LN_bulldozer.c 14 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497
  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 "common.h"
  39. static FLOAT dm1 = -1.;
  40. #ifdef CONJ
  41. #define GEMM_KERNEL GEMM_KERNEL_L
  42. #else
  43. #define GEMM_KERNEL GEMM_KERNEL_N
  44. #endif
  45. #if GEMM_DEFAULT_UNROLL_M == 1
  46. #define GEMM_UNROLL_M_SHIFT 0
  47. #endif
  48. #if GEMM_DEFAULT_UNROLL_M == 2
  49. #define GEMM_UNROLL_M_SHIFT 1
  50. #endif
  51. #if GEMM_DEFAULT_UNROLL_M == 4
  52. #define GEMM_UNROLL_M_SHIFT 2
  53. #endif
  54. #if GEMM_DEFAULT_UNROLL_M == 6
  55. #define GEMM_UNROLL_M_SHIFT 2
  56. #endif
  57. #if GEMM_DEFAULT_UNROLL_M == 8
  58. #define GEMM_UNROLL_M_SHIFT 3
  59. #endif
  60. #if GEMM_DEFAULT_UNROLL_M == 16
  61. #define GEMM_UNROLL_M_SHIFT 4
  62. #endif
  63. #if GEMM_DEFAULT_UNROLL_N == 1
  64. #define GEMM_UNROLL_N_SHIFT 0
  65. #endif
  66. #if GEMM_DEFAULT_UNROLL_N == 2
  67. #define GEMM_UNROLL_N_SHIFT 1
  68. #endif
  69. #if GEMM_DEFAULT_UNROLL_N == 4
  70. #define GEMM_UNROLL_N_SHIFT 2
  71. #endif
  72. #if GEMM_DEFAULT_UNROLL_N == 8
  73. #define GEMM_UNROLL_N_SHIFT 3
  74. #endif
  75. #if GEMM_DEFAULT_UNROLL_N == 16
  76. #define GEMM_UNROLL_N_SHIFT 4
  77. #endif
  78. #ifndef CONJ
  79. static void ztrsm_LN_solve_opt(BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, FLOAT *as, FLOAT *bs) __attribute__ ((noinline));
  80. static void ztrsm_LN_solve_opt(BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, FLOAT *as, FLOAT *bs)
  81. {
  82. FLOAT *c1 = c + ldc*2 ;
  83. BLASLONG n1 = n * 4;
  84. BLASLONG i=0;
  85. __asm__ __volatile__
  86. (
  87. " vzeroupper \n\t"
  88. " prefetcht0 (%4) \n\t"
  89. " prefetcht0 (%5) \n\t"
  90. " vxorpd %%xmm8 , %%xmm8 , %%xmm8 \n\t"
  91. " vxorpd %%xmm9 , %%xmm9 , %%xmm9 \n\t"
  92. " vxorpd %%xmm10, %%xmm10, %%xmm10 \n\t"
  93. " vxorpd %%xmm11, %%xmm11, %%xmm11 \n\t"
  94. " vxorpd %%xmm12, %%xmm12, %%xmm12 \n\t"
  95. " vxorpd %%xmm13, %%xmm13, %%xmm13 \n\t"
  96. " vxorpd %%xmm14, %%xmm14, %%xmm14 \n\t"
  97. " vxorpd %%xmm15, %%xmm15, %%xmm15 \n\t"
  98. " cmpq $0, %0 \n\t"
  99. " je 3f \n\t"
  100. " .align 16 \n\t"
  101. "1: \n\t"
  102. " prefetcht0 256(%3,%1,8) \n\t"
  103. " prefetcht0 256(%2,%1,8) \n\t"
  104. " vmovddup (%3,%1,8), %%xmm0 \n\t" // b0 real, b0 real
  105. " vmovddup 8(%3,%1,8), %%xmm1 \n\t" // b0 imag, b0 imag
  106. " vmovups (%2,%1,8), %%xmm4 \n\t" // a0 real , a0 imag
  107. " vmovups 16(%2,%1,8), %%xmm5 \n\t" // a1 real , a1 imag
  108. " vmovddup 16(%3,%1,8), %%xmm2 \n\t" // b1 real, b1 real
  109. " vmovddup 24(%3,%1,8), %%xmm3 \n\t" // b1 imag, b1 imag
  110. " vfnmaddpd %%xmm8 , %%xmm0 , %%xmm4 , %%xmm8 \n\t" // a_real * b_real , a_imag * b_real
  111. " vfnmaddpd %%xmm9 , %%xmm1 , %%xmm4 , %%xmm9 \n\t" // a_real * b_imag , a_imag * b_imag
  112. " vfnmaddpd %%xmm10, %%xmm0 , %%xmm5 , %%xmm10 \n\t" // a_real * b_real , a_imag * b_real
  113. " vfnmaddpd %%xmm11, %%xmm1 , %%xmm5 , %%xmm11 \n\t" // a_real * b_imag , a_imag * b_imag
  114. " vfnmaddpd %%xmm12, %%xmm2 , %%xmm4 , %%xmm12 \n\t" // a_real * b_real , a_imag * b_real
  115. " vfnmaddpd %%xmm13, %%xmm3 , %%xmm4 , %%xmm13 \n\t" // a_real * b_imag , a_imag * b_imag
  116. " vfnmaddpd %%xmm14, %%xmm2 , %%xmm5 , %%xmm14 \n\t" // a_real * b_real , a_imag * b_real
  117. " vfnmaddpd %%xmm15, %%xmm3 , %%xmm5 , %%xmm15 \n\t" // a_real * b_imag , a_imag * b_imag
  118. " addq $4, %1 \n\t"
  119. " cmpq %1, %0 \n\t"
  120. " jz 2f \n\t"
  121. " vmovddup (%3,%1,8), %%xmm0 \n\t" // b0 real, b0 real
  122. " vmovddup 8(%3,%1,8), %%xmm1 \n\t" // b0 imag, b0 imag
  123. " vmovups (%2,%1,8), %%xmm4 \n\t" // a0 real , a0 imag
  124. " vmovups 16(%2,%1,8), %%xmm5 \n\t" // a1 real , a1 imag
  125. " vmovddup 16(%3,%1,8), %%xmm2 \n\t" // b1 real, b1 real
  126. " vmovddup 24(%3,%1,8), %%xmm3 \n\t" // b1 imag, b1 imag
  127. " vfnmaddpd %%xmm8 , %%xmm0 , %%xmm4 , %%xmm8 \n\t" // a_real * b_real , a_imag * b_real
  128. " vfnmaddpd %%xmm9 , %%xmm1 , %%xmm4 , %%xmm9 \n\t" // a_real * b_imag , a_imag * b_imag
  129. " vfnmaddpd %%xmm10, %%xmm0 , %%xmm5 , %%xmm10 \n\t" // a_real * b_real , a_imag * b_real
  130. " vfnmaddpd %%xmm11, %%xmm1 , %%xmm5 , %%xmm11 \n\t" // a_real * b_imag , a_imag * b_imag
  131. " vfnmaddpd %%xmm12, %%xmm2 , %%xmm4 , %%xmm12 \n\t" // a_real * b_real , a_imag * b_real
  132. " vfnmaddpd %%xmm13, %%xmm3 , %%xmm4 , %%xmm13 \n\t" // a_real * b_imag , a_imag * b_imag
  133. " vfnmaddpd %%xmm14, %%xmm2 , %%xmm5 , %%xmm14 \n\t" // a_real * b_real , a_imag * b_real
  134. " vfnmaddpd %%xmm15, %%xmm3 , %%xmm5 , %%xmm15 \n\t" // a_real * b_imag , a_imag * b_imag
  135. " addq $4, %1 \n\t"
  136. " cmpq %1, %0 \n\t"
  137. " jnz 1b \n\t"
  138. "2: \n\t"
  139. " vshufpd $0x01 , %%xmm9 , %%xmm9, %%xmm9 \n\t"
  140. " vshufpd $0x01 , %%xmm11 , %%xmm11 , %%xmm11 \n\t"
  141. " vshufpd $0x01 , %%xmm13 , %%xmm13 , %%xmm13 \n\t"
  142. " vshufpd $0x01 , %%xmm15 , %%xmm15 , %%xmm15 \n\t"
  143. " vaddsubpd %%xmm8 , %%xmm9 , %%xmm8 \n\t"
  144. " vaddsubpd %%xmm10, %%xmm11, %%xmm10 \n\t"
  145. " vaddsubpd %%xmm12, %%xmm13, %%xmm12 \n\t"
  146. " vaddsubpd %%xmm14, %%xmm15, %%xmm14 \n\t"
  147. " vxorpd %%xmm7 , %%xmm7 , %%xmm7 \n\t"
  148. " vaddsubpd %%xmm8 , %%xmm7 , %%xmm8 \n\t"
  149. " vaddsubpd %%xmm10, %%xmm7 , %%xmm10 \n\t"
  150. " vaddsubpd %%xmm12, %%xmm7 , %%xmm12 \n\t"
  151. " vaddsubpd %%xmm14, %%xmm7 , %%xmm14 \n\t"
  152. " vmovups (%4) , %%xmm0 \n\t"
  153. " vmovups 16(%4) , %%xmm1 \n\t"
  154. " vmovups (%5) , %%xmm4 \n\t"
  155. " vmovups 16(%5) , %%xmm5 \n\t"
  156. " vaddpd %%xmm0 , %%xmm8 , %%xmm8 \n\t"
  157. " vaddpd %%xmm1 , %%xmm10, %%xmm10 \n\t"
  158. " vaddpd %%xmm4 , %%xmm12, %%xmm12 \n\t"
  159. " vaddpd %%xmm5 , %%xmm14, %%xmm14 \n\t"
  160. " vmovups %%xmm8 , (%4) \n\t"
  161. " vmovups %%xmm10 ,16(%4) \n\t"
  162. " vmovups %%xmm12 , (%5) \n\t"
  163. " vmovups %%xmm14 ,16(%5) \n\t"
  164. "3: \n\t"
  165. " vzeroupper \n\t"
  166. :
  167. :
  168. "r" (n1), // 0
  169. "a" (i), // 1
  170. "r" (a), // 2
  171. "r" (b), // 3
  172. "r" (c), // 4
  173. "r" (c1), // 5
  174. "r" (as), // 6
  175. "r" (bs) // 7
  176. : "cc",
  177. "%xmm0", "%xmm1", "%xmm2", "%xmm3",
  178. "%xmm4", "%xmm5", "%xmm6", "%xmm7",
  179. "%xmm8", "%xmm9", "%xmm10", "%xmm11",
  180. "%xmm12", "%xmm13", "%xmm14", "%xmm15",
  181. "memory"
  182. );
  183. }
  184. #endif
  185. #ifndef COMPLEX
  186. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  187. FLOAT aa, bb;
  188. int i, j, k;
  189. a += (m - 1) * m;
  190. b += (m - 1) * n;
  191. for (i = m - 1; i >= 0; i--) {
  192. aa = *(a + i);
  193. for (j = 0; j < n; j ++) {
  194. bb = *(c + i + j * ldc);
  195. bb *= aa;
  196. *b = bb;
  197. *(c + i + j * ldc) = bb;
  198. b ++;
  199. for (k = 0; k < i; k ++){
  200. *(c + k + j * ldc) -= bb * *(a + k);
  201. }
  202. }
  203. a -= m;
  204. b -= 2 * n;
  205. }
  206. }
  207. #else
  208. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  209. FLOAT aa1, aa2;
  210. FLOAT bb1, bb2;
  211. FLOAT cc1, cc2;
  212. int i, j, k;
  213. ldc *= 2;
  214. a += (m - 1) * m * 2;
  215. b += (m - 1) * n * 2;
  216. for (i = m - 1; i >= 0; i--) {
  217. aa1 = *(a + i * 2 + 0);
  218. aa2 = *(a + i * 2 + 1);
  219. for (j = 0; j < n; j ++) {
  220. bb1 = *(c + i * 2 + 0 + j * ldc);
  221. bb2 = *(c + i * 2 + 1 + j * ldc);
  222. #ifndef CONJ
  223. cc1 = aa1 * bb1 - aa2 * bb2;
  224. cc2 = aa1 * bb2 + aa2 * bb1;
  225. #else
  226. cc1 = aa1 * bb1 + aa2 * bb2;
  227. cc2 = aa1 * bb2 - aa2 * bb1;
  228. #endif
  229. *(b + 0) = cc1;
  230. *(b + 1) = cc2;
  231. *(c + i * 2 + 0 + j * ldc) = cc1;
  232. *(c + i * 2 + 1 + j * ldc) = cc2;
  233. b += 2;
  234. for (k = 0; k < i; k ++){
  235. #ifndef CONJ
  236. *(c + k * 2 + 0 + j * ldc) -= cc1 * *(a + k * 2 + 0) - cc2 * *(a + k * 2 + 1);
  237. *(c + k * 2 + 1 + j * ldc) -= cc1 * *(a + k * 2 + 1) + cc2 * *(a + k * 2 + 0);
  238. #else
  239. *(c + k * 2 + 0 + j * ldc) -= cc1 * *(a + k * 2 + 0) + cc2 * *(a + k * 2 + 1);
  240. *(c + k * 2 + 1 + j * ldc) -= - cc1 * *(a + k * 2 + 1) + cc2 * *(a + k * 2 + 0);
  241. #endif
  242. }
  243. }
  244. a -= m * 2;
  245. b -= 4 * n;
  246. }
  247. }
  248. #endif
  249. int CNAME(BLASLONG m, BLASLONG n, BLASLONG k, FLOAT dummy1,
  250. #ifdef COMPLEX
  251. FLOAT dummy2,
  252. #endif
  253. FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, BLASLONG offset){
  254. BLASLONG i, j;
  255. FLOAT *aa, *cc;
  256. BLASLONG kk;
  257. #if 0
  258. fprintf(stderr, "TRSM KERNEL LN : m = %3ld n = %3ld k = %3ld offset = %3ld\n",
  259. m, n, k, offset);
  260. #endif
  261. j = (n >> GEMM_UNROLL_N_SHIFT);
  262. while (j > 0) {
  263. kk = m + offset;
  264. if (m & (GEMM_UNROLL_M - 1)) {
  265. for (i = 1; i < GEMM_UNROLL_M; i *= 2){
  266. if (m & i) {
  267. aa = a + ((m & ~(i - 1)) - i) * k * COMPSIZE;
  268. cc = c + ((m & ~(i - 1)) - i) * COMPSIZE;
  269. if (k - kk > 0) {
  270. GEMM_KERNEL(i, GEMM_UNROLL_N, k - kk, dm1,
  271. #ifdef COMPLEX
  272. ZERO,
  273. #endif
  274. aa + i * kk * COMPSIZE,
  275. b + GEMM_UNROLL_N * kk * COMPSIZE,
  276. cc,
  277. ldc);
  278. }
  279. solve(i, GEMM_UNROLL_N,
  280. aa + (kk - i) * i * COMPSIZE,
  281. b + (kk - i) * GEMM_UNROLL_N * COMPSIZE,
  282. cc, ldc);
  283. kk -= i;
  284. }
  285. }
  286. }
  287. i = (m >> GEMM_UNROLL_M_SHIFT);
  288. if (i > 0) {
  289. aa = a + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * k * COMPSIZE;
  290. cc = c + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * COMPSIZE;
  291. do {
  292. #ifdef CONJ
  293. if (k - kk > 0) {
  294. GEMM_KERNEL(GEMM_UNROLL_M, GEMM_UNROLL_N, k - kk, dm1,
  295. #ifdef COMPLEX
  296. ZERO,
  297. #endif
  298. aa + GEMM_UNROLL_M * kk * COMPSIZE,
  299. b + GEMM_UNROLL_N * kk * COMPSIZE,
  300. cc,
  301. ldc);
  302. }
  303. solve(GEMM_UNROLL_M, GEMM_UNROLL_N,
  304. aa + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_M * COMPSIZE,
  305. b + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_N * COMPSIZE,
  306. cc, ldc);
  307. #else
  308. ztrsm_LN_solve_opt(k-kk, aa + GEMM_UNROLL_M * kk * COMPSIZE, b + GEMM_UNROLL_N * kk * COMPSIZE, cc, ldc,
  309. aa + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_M * COMPSIZE, b + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_N * COMPSIZE);
  310. solve(GEMM_UNROLL_M, GEMM_UNROLL_N,
  311. aa + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_M * COMPSIZE,
  312. b + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_N * COMPSIZE,
  313. cc, ldc);
  314. #endif
  315. aa -= GEMM_UNROLL_M * k * COMPSIZE;
  316. cc -= GEMM_UNROLL_M * COMPSIZE;
  317. kk -= GEMM_UNROLL_M;
  318. i --;
  319. } while (i > 0);
  320. }
  321. b += GEMM_UNROLL_N * k * COMPSIZE;
  322. c += GEMM_UNROLL_N * ldc * COMPSIZE;
  323. j --;
  324. }
  325. if (n & (GEMM_UNROLL_N - 1)) {
  326. j = (GEMM_UNROLL_N >> 1);
  327. while (j > 0) {
  328. if (n & j) {
  329. kk = m + offset;
  330. if (m & (GEMM_UNROLL_M - 1)) {
  331. for (i = 1; i < GEMM_UNROLL_M; i *= 2){
  332. if (m & i) {
  333. aa = a + ((m & ~(i - 1)) - i) * k * COMPSIZE;
  334. cc = c + ((m & ~(i - 1)) - i) * COMPSIZE;
  335. if (k - kk > 0) {
  336. GEMM_KERNEL(i, j, k - kk, dm1,
  337. #ifdef COMPLEX
  338. ZERO,
  339. #endif
  340. aa + i * kk * COMPSIZE,
  341. b + j * kk * COMPSIZE,
  342. cc, ldc);
  343. }
  344. solve(i, j,
  345. aa + (kk - i) * i * COMPSIZE,
  346. b + (kk - i) * j * COMPSIZE,
  347. cc, ldc);
  348. kk -= i;
  349. }
  350. }
  351. }
  352. i = (m >> GEMM_UNROLL_M_SHIFT);
  353. if (i > 0) {
  354. aa = a + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * k * COMPSIZE;
  355. cc = c + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * COMPSIZE;
  356. do {
  357. if (k - kk > 0) {
  358. GEMM_KERNEL(GEMM_UNROLL_M, j, k - kk, dm1,
  359. #ifdef COMPLEX
  360. ZERO,
  361. #endif
  362. aa + GEMM_UNROLL_M * kk * COMPSIZE,
  363. b + j * kk * COMPSIZE,
  364. cc,
  365. ldc);
  366. }
  367. solve(GEMM_UNROLL_M, j,
  368. aa + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_M * COMPSIZE,
  369. b + (kk - GEMM_UNROLL_M) * j * COMPSIZE,
  370. cc, ldc);
  371. aa -= GEMM_UNROLL_M * k * COMPSIZE;
  372. cc -= GEMM_UNROLL_M * COMPSIZE;
  373. kk -= GEMM_UNROLL_M;
  374. i --;
  375. } while (i > 0);
  376. }
  377. b += j * k * COMPSIZE;
  378. c += j * ldc * COMPSIZE;
  379. }
  380. j >>= 1;
  381. }
  382. }
  383. return 0;
  384. }