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.

strsm_kernel_RN_bulldozer.c 12 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454
  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_R
  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. static void strsm_RN_solve_opt(BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, FLOAT *as, FLOAT *bs) __attribute__ ((noinline));
  79. static void strsm_RN_solve_opt(BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, FLOAT *as, FLOAT *bs)
  80. {
  81. FLOAT *c1 = c + ldc ;
  82. BLASLONG n1 = n * 8;
  83. BLASLONG i=0;
  84. __asm__ __volatile__
  85. (
  86. " vzeroupper \n\t"
  87. " prefetcht0 (%4) \n\t"
  88. " prefetcht0 (%5) \n\t"
  89. " vxorps %%xmm8 , %%xmm8 , %%xmm8 \n\t"
  90. " vxorps %%xmm9 , %%xmm9 , %%xmm9 \n\t"
  91. " vxorps %%xmm10, %%xmm10, %%xmm10 \n\t"
  92. " vxorps %%xmm11, %%xmm11, %%xmm11 \n\t"
  93. " vxorps %%xmm12, %%xmm12, %%xmm12 \n\t"
  94. " vxorps %%xmm13, %%xmm13, %%xmm13 \n\t"
  95. " vxorps %%xmm14, %%xmm14, %%xmm14 \n\t"
  96. " vxorps %%xmm15, %%xmm15, %%xmm15 \n\t"
  97. " cmpq $0, %0 \n\t"
  98. " je 2f \n\t"
  99. " .align 16 \n\t"
  100. "1: \n\t"
  101. " vbroadcastss (%3,%1,1), %%xmm0 \n\t" // read b
  102. " vmovups (%2,%1,8), %%xmm4 \n\t"
  103. " vbroadcastss 4(%3,%1,1), %%xmm1 \n\t"
  104. " vmovups 16(%2,%1,8), %%xmm5 \n\t"
  105. " vmovups 32(%2,%1,8), %%xmm6 \n\t"
  106. " vmovups 48(%2,%1,8), %%xmm7 \n\t"
  107. " vfmaddps %%xmm8 , %%xmm0 , %%xmm4 , %%xmm8 \n\t"
  108. " vfmaddps %%xmm12, %%xmm1 , %%xmm4 , %%xmm12 \n\t"
  109. " vfmaddps %%xmm9 , %%xmm0 , %%xmm5 , %%xmm9 \n\t"
  110. " vfmaddps %%xmm13, %%xmm1 , %%xmm5 , %%xmm13 \n\t"
  111. " vfmaddps %%xmm10, %%xmm0 , %%xmm6 , %%xmm10 \n\t"
  112. " vfmaddps %%xmm14, %%xmm1 , %%xmm6 , %%xmm14 \n\t"
  113. " addq $8, %1 \n\t"
  114. " vfmaddps %%xmm11, %%xmm0 , %%xmm7 , %%xmm11 \n\t"
  115. " vfmaddps %%xmm15, %%xmm1 , %%xmm7 , %%xmm15 \n\t"
  116. " cmpq %1, %0 \n\t"
  117. " jnz 1b \n\t"
  118. "2: \n\t"
  119. " vmovups (%4) , %%xmm0 \n\t"
  120. " vmovups 16(%4) , %%xmm1 \n\t"
  121. " vmovups 32(%4) , %%xmm2 \n\t"
  122. " vmovups 48(%4) , %%xmm3 \n\t"
  123. " vmovups (%5) , %%xmm4 \n\t"
  124. " vmovups 16(%5) , %%xmm5 \n\t"
  125. " vmovups 32(%5) , %%xmm6 \n\t"
  126. " vmovups 48(%5) , %%xmm7 \n\t"
  127. " vsubps %%xmm8 , %%xmm0 , %%xmm8 \n\t"
  128. " vsubps %%xmm9 , %%xmm1 , %%xmm9 \n\t"
  129. " vsubps %%xmm10, %%xmm2 , %%xmm10 \n\t"
  130. " vsubps %%xmm11, %%xmm3 , %%xmm11 \n\t"
  131. " vsubps %%xmm12, %%xmm4 , %%xmm12 \n\t"
  132. " vsubps %%xmm13, %%xmm5 , %%xmm13 \n\t"
  133. " vsubps %%xmm14, %%xmm6 , %%xmm14 \n\t"
  134. " vsubps %%xmm15, %%xmm7 , %%xmm15 \n\t"
  135. "3: \n\t" // i = 0
  136. " vbroadcastss (%7), %%xmm0 \n\t" // read bb
  137. " vbroadcastss 4(%7), %%xmm1 \n\t" // read b
  138. " vmulps %%xmm8 , %%xmm0 , %%xmm8 \n\t" // aa * bb
  139. " vmulps %%xmm9 , %%xmm0 , %%xmm9 \n\t"
  140. " vmulps %%xmm10 , %%xmm0 , %%xmm10 \n\t"
  141. " vmulps %%xmm11 , %%xmm0 , %%xmm11 \n\t"
  142. " vmovups %%xmm8 , (%6) \n\t" // write a
  143. " vmovups %%xmm9 , 16(%6) \n\t"
  144. " vmovups %%xmm10 , 32(%6) \n\t"
  145. " vmovups %%xmm11 , 48(%6) \n\t"
  146. " vmovups %%xmm8 , (%4) \n\t" // write c0
  147. " vmovups %%xmm9 , 16(%4) \n\t"
  148. " vmovups %%xmm10 , 32(%4) \n\t"
  149. " vmovups %%xmm11 , 48(%4) \n\t"
  150. " vfnmaddps %%xmm12 , %%xmm8 , %%xmm1 , %%xmm12 \n\t" // c = c - aa * b
  151. " vfnmaddps %%xmm13 , %%xmm9 , %%xmm1 , %%xmm13 \n\t"
  152. " vfnmaddps %%xmm14 , %%xmm10 , %%xmm1 , %%xmm14 \n\t"
  153. " vfnmaddps %%xmm15 , %%xmm11 , %%xmm1 , %%xmm15 \n\t"
  154. " \n\t" // i = 1
  155. " addq $8 , %7 \n\t" // b = b + 2
  156. " addq $64 , %6 \n\t" // a = a + 16
  157. " vbroadcastss 4(%7), %%xmm0 \n\t" // read bb
  158. " vmulps %%xmm12 , %%xmm0 , %%xmm12 \n\t" // aa * bb
  159. " vmulps %%xmm13 , %%xmm0 , %%xmm13 \n\t" // aa * bb
  160. " vmulps %%xmm14 , %%xmm0 , %%xmm14 \n\t" // aa * bb
  161. " vmulps %%xmm15 , %%xmm0 , %%xmm15 \n\t" // aa * bb
  162. " vmovups %%xmm12 , (%6) \n\t" // write a
  163. " vmovups %%xmm13 , 16(%6) \n\t" // write a
  164. " vmovups %%xmm14 , 32(%6) \n\t" // write a
  165. " vmovups %%xmm15 , 48(%6) \n\t" // write a
  166. " vmovups %%xmm12 , (%5) \n\t" // write c1
  167. " vmovups %%xmm13 , 16(%5) \n\t"
  168. " vmovups %%xmm14 , 32(%5) \n\t"
  169. " vmovups %%xmm15 , 48(%5) \n\t"
  170. " vzeroupper \n\t"
  171. :
  172. :
  173. "r" (n1), // 0
  174. "a" (i), // 1
  175. "r" (a), // 2
  176. "r" (b), // 3
  177. "r" (c), // 4
  178. "r" (c1), // 5
  179. "r" (as), // 6
  180. "r" (bs) // 7
  181. : "cc",
  182. "%xmm0", "%xmm1", "%xmm2", "%xmm3",
  183. "%xmm4", "%xmm5", "%xmm6", "%xmm7",
  184. "%xmm8", "%xmm9", "%xmm10", "%xmm11",
  185. "%xmm12", "%xmm13", "%xmm14", "%xmm15",
  186. "memory"
  187. );
  188. }
  189. #ifndef COMPLEX
  190. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  191. FLOAT aa, bb;
  192. int i, j, k;
  193. for (i = 0; i < n; i++) {
  194. bb = *(b + i);
  195. for (j = 0; j < m; j ++) {
  196. aa = *(c + j + i * ldc);
  197. aa *= bb;
  198. *a = aa;
  199. *(c + j + i * ldc) = aa;
  200. a ++;
  201. for (k = i + 1; k < n; k ++){
  202. *(c + j + k * ldc) -= aa * *(b + k);
  203. }
  204. }
  205. b += n;
  206. }
  207. }
  208. #else
  209. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  210. FLOAT aa1, aa2;
  211. FLOAT bb1, bb2;
  212. FLOAT cc1, cc2;
  213. int i, j, k;
  214. ldc *= 2;
  215. for (i = 0; i < n; i++) {
  216. bb1 = *(b + i * 2 + 0);
  217. bb2 = *(b + i * 2 + 1);
  218. for (j = 0; j < m; j ++) {
  219. aa1 = *(c + j * 2 + 0 + i * ldc);
  220. aa2 = *(c + j * 2 + 1 + i * ldc);
  221. #ifndef CONJ
  222. cc1 = aa1 * bb1 - aa2 * bb2;
  223. cc2 = aa1 * bb2 + aa2 * bb1;
  224. #else
  225. cc1 = aa1 * bb1 + aa2 * bb2;
  226. cc2 = -aa1 * bb2 + aa2 * bb1;
  227. #endif
  228. *(a + 0) = cc1;
  229. *(a + 1) = cc2;
  230. *(c + j * 2 + 0 + i * ldc) = cc1;
  231. *(c + j * 2 + 1 + i * ldc) = cc2;
  232. a += 2;
  233. for (k = i + 1; k < n; k ++){
  234. #ifndef CONJ
  235. *(c + j * 2 + 0 + k * ldc) -= cc1 * *(b + k * 2 + 0) - cc2 * *(b + k * 2 + 1);
  236. *(c + j * 2 + 1 + k * ldc) -= cc1 * *(b + k * 2 + 1) + cc2 * *(b + k * 2 + 0);
  237. #else
  238. *(c + j * 2 + 0 + k * ldc) -= cc1 * *(b + k * 2 + 0) + cc2 * *(b + k * 2 + 1);
  239. *(c + j * 2 + 1 + k * ldc) -= - cc1 * *(b + k * 2 + 1) + cc2 * *(b + k * 2 + 0);
  240. #endif
  241. }
  242. }
  243. b += n * 2;
  244. }
  245. }
  246. #endif
  247. int CNAME(BLASLONG m, BLASLONG n, BLASLONG k, FLOAT dummy1,
  248. #ifdef COMPLEX
  249. FLOAT dummy2,
  250. #endif
  251. FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, BLASLONG offset){
  252. FLOAT *aa, *cc;
  253. BLASLONG kk;
  254. BLASLONG i, j, jj;
  255. #if 0
  256. fprintf(stderr, "TRSM RN KERNEL m = %3ld n = %3ld k = %3ld offset = %3ld\n",
  257. m, n, k, offset);
  258. #endif
  259. jj = 0;
  260. j = (n >> GEMM_UNROLL_N_SHIFT);
  261. kk = -offset;
  262. while (j > 0) {
  263. aa = a;
  264. cc = c;
  265. i = (m >> GEMM_UNROLL_M_SHIFT);
  266. if (i > 0) {
  267. do {
  268. strsm_RN_solve_opt(kk, aa, b, cc, ldc, aa + kk * GEMM_UNROLL_M * COMPSIZE, b + kk * GEMM_UNROLL_N * COMPSIZE);
  269. aa += GEMM_UNROLL_M * k * COMPSIZE;
  270. cc += GEMM_UNROLL_M * COMPSIZE;
  271. i --;
  272. } while (i > 0);
  273. }
  274. if (m & (GEMM_UNROLL_M - 1)) {
  275. i = (GEMM_UNROLL_M >> 1);
  276. while (i > 0) {
  277. if (m & i) {
  278. if (kk > 0) {
  279. GEMM_KERNEL(i, GEMM_UNROLL_N, kk, dm1,
  280. #ifdef COMPLEX
  281. ZERO,
  282. #endif
  283. aa, b, cc, ldc);
  284. }
  285. solve(i, GEMM_UNROLL_N,
  286. aa + kk * i * COMPSIZE,
  287. b + kk * GEMM_UNROLL_N * COMPSIZE,
  288. cc, ldc);
  289. aa += i * k * COMPSIZE;
  290. cc += i * COMPSIZE;
  291. }
  292. i >>= 1;
  293. }
  294. }
  295. kk += GEMM_UNROLL_N;
  296. b += GEMM_UNROLL_N * k * COMPSIZE;
  297. c += GEMM_UNROLL_N * ldc * COMPSIZE;
  298. j --;
  299. jj += GEMM_UNROLL_M;
  300. }
  301. if (n & (GEMM_UNROLL_N - 1)) {
  302. j = (GEMM_UNROLL_N >> 1);
  303. while (j > 0) {
  304. if (n & j) {
  305. aa = a;
  306. cc = c;
  307. i = (m >> GEMM_UNROLL_M_SHIFT);
  308. while (i > 0) {
  309. if (kk > 0) {
  310. GEMM_KERNEL(GEMM_UNROLL_M, j, kk, dm1,
  311. #ifdef COMPLEX
  312. ZERO,
  313. #endif
  314. aa,
  315. b,
  316. cc,
  317. ldc);
  318. }
  319. solve(GEMM_UNROLL_M, j,
  320. aa + kk * GEMM_UNROLL_M * COMPSIZE,
  321. b + kk * j * COMPSIZE, cc, ldc);
  322. aa += GEMM_UNROLL_M * k * COMPSIZE;
  323. cc += GEMM_UNROLL_M * COMPSIZE;
  324. i --;
  325. }
  326. if (m & (GEMM_UNROLL_M - 1)) {
  327. i = (GEMM_UNROLL_M >> 1);
  328. while (i > 0) {
  329. if (m & i) {
  330. if (kk > 0) {
  331. GEMM_KERNEL(i, j, kk, dm1,
  332. #ifdef COMPLEX
  333. ZERO,
  334. #endif
  335. aa,
  336. b,
  337. cc,
  338. ldc);
  339. }
  340. solve(i, j,
  341. aa + kk * i * COMPSIZE,
  342. b + kk * j * COMPSIZE, cc, ldc);
  343. aa += i * k * COMPSIZE;
  344. cc += i * COMPSIZE;
  345. }
  346. i >>= 1;
  347. }
  348. }
  349. b += j * k * COMPSIZE;
  350. c += j * ldc * COMPSIZE;
  351. kk += j;
  352. }
  353. j >>= 1;
  354. }
  355. }
  356. return 0;
  357. }