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.

trsm_kernel_RT_UNROLLN6.c 8.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351
  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. #ifndef COMPLEX
  79. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  80. FLOAT aa, bb;
  81. int i, j, k;
  82. a += (n - 1) * m;
  83. b += (n - 1) * n;
  84. for (i = n - 1; i >= 0; i--) {
  85. bb = *(b + i);
  86. for (j = 0; j < m; j ++) {
  87. aa = *(c + j + i * ldc);
  88. aa *= bb;
  89. *a = aa;
  90. *(c + j + i * ldc) = aa;
  91. a ++;
  92. for (k = 0; k < i; k ++){
  93. *(c + j + k * ldc) -= aa * *(b + k);
  94. }
  95. }
  96. b -= n;
  97. a -= 2 * m;
  98. }
  99. }
  100. #else
  101. static inline void solve(BLASLONG m, BLASLONG n, FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc) {
  102. FLOAT aa1, aa2;
  103. FLOAT bb1, bb2;
  104. FLOAT cc1, cc2;
  105. int i, j, k;
  106. ldc *= 2;
  107. a += (n - 1) * m * 2;
  108. b += (n - 1) * n * 2;
  109. for (i = n - 1; i >= 0; i--) {
  110. bb1 = *(b + i * 2 + 0);
  111. bb2 = *(b + i * 2 + 1);
  112. for (j = 0; j < m; j ++) {
  113. aa1 = *(c + j * 2 + 0 + i * ldc);
  114. aa2 = *(c + j * 2 + 1 + i * ldc);
  115. #ifndef CONJ
  116. cc1 = aa1 * bb1 - aa2 * bb2;
  117. cc2 = aa1 * bb2 + aa2 * bb1;
  118. #else
  119. cc1 = aa1 * bb1 + aa2 * bb2;
  120. cc2 = - aa1 * bb2 + aa2 * bb1;
  121. #endif
  122. *(a + 0) = cc1;
  123. *(a + 1) = cc2;
  124. *(c + j * 2 + 0 + i * ldc) = cc1;
  125. *(c + j * 2 + 1 + i * ldc) = cc2;
  126. a += 2;
  127. for (k = 0; k < i; k ++){
  128. #ifndef CONJ
  129. *(c + j * 2 + 0 + k * ldc) -= cc1 * *(b + k * 2 + 0) - cc2 * *(b + k * 2 + 1);
  130. *(c + j * 2 + 1 + k * ldc) -= cc1 * *(b + k * 2 + 1) + cc2 * *(b + k * 2 + 0);
  131. #else
  132. *(c + j * 2 + 0 + k * ldc) -= cc1 * *(b + k * 2 + 0) + cc2 * *(b + k * 2 + 1);
  133. *(c + j * 2 + 1 + k * ldc) -= -cc1 * *(b + k * 2 + 1) + cc2 * *(b + k * 2 + 0);
  134. #endif
  135. }
  136. }
  137. b -= n * 2;
  138. a -= 4 * m;
  139. }
  140. }
  141. #endif
  142. int CNAME(BLASLONG m, BLASLONG n, BLASLONG k, FLOAT dummy1,
  143. #ifdef COMPLEX
  144. FLOAT dummy2,
  145. #endif
  146. FLOAT *a, FLOAT *b, FLOAT *c, BLASLONG ldc, BLASLONG offset){
  147. BLASLONG i, j;
  148. FLOAT *aa, *cc;
  149. BLASLONG kk;
  150. #if 0
  151. fprintf(stderr, "TRSM RT KERNEL m = %3ld n = %3ld k = %3ld offset = %3ld\n",
  152. m, n, k, offset);
  153. #endif
  154. kk = n - offset;
  155. c += n * ldc * COMPSIZE;
  156. b += n * k * COMPSIZE;
  157. BLASLONG nmodN = n - n/6*6 ;
  158. // if (n & (GEMM_UNROLL_N - 1)) {
  159. if (nmodN) {
  160. j = 1;
  161. while (j < GEMM_UNROLL_N) {
  162. if (nmodN & j) {
  163. aa = a;
  164. b -= j * k * COMPSIZE;
  165. c -= j * ldc* COMPSIZE;
  166. cc = c;
  167. i = (m >> GEMM_UNROLL_M_SHIFT);
  168. if (i > 0) {
  169. do {
  170. if (k - kk > 0) {
  171. GEMM_KERNEL(GEMM_UNROLL_M, j, k - kk, dm1,
  172. #ifdef COMPLEX
  173. ZERO,
  174. #endif
  175. aa + GEMM_UNROLL_M * kk * COMPSIZE,
  176. b + j * kk * COMPSIZE,
  177. cc,
  178. ldc);
  179. }
  180. solve(GEMM_UNROLL_M, j,
  181. aa + (kk - j) * GEMM_UNROLL_M * COMPSIZE,
  182. b + (kk - j) * j * COMPSIZE,
  183. cc, ldc);
  184. aa += GEMM_UNROLL_M * k * COMPSIZE;
  185. cc += GEMM_UNROLL_M * COMPSIZE;
  186. i --;
  187. } while (i > 0);
  188. }
  189. if (m & (GEMM_UNROLL_M - 1)) {
  190. i = (GEMM_UNROLL_M >> 1);
  191. do {
  192. if (m & i) {
  193. if (k - kk > 0) {
  194. GEMM_KERNEL(i, j, k - kk, dm1,
  195. #ifdef COMPLEX
  196. ZERO,
  197. #endif
  198. aa + i * kk * COMPSIZE,
  199. b + j * kk * COMPSIZE,
  200. cc, ldc);
  201. }
  202. solve(i, j,
  203. aa + (kk - j) * i * COMPSIZE,
  204. b + (kk - j) * j * COMPSIZE,
  205. cc, ldc);
  206. aa += i * k * COMPSIZE;
  207. cc += i * COMPSIZE;
  208. }
  209. i >>= 1;
  210. } while (i > 0);
  211. }
  212. kk -= j;
  213. }
  214. j <<= 1;
  215. }
  216. }
  217. // j = (n >> GEMM_UNROLL_N_SHIFT);
  218. j = (n / 6);
  219. if (j > 0) {
  220. do {
  221. aa = a;
  222. b -= GEMM_UNROLL_N * k * COMPSIZE;
  223. c -= GEMM_UNROLL_N * ldc * COMPSIZE;
  224. cc = c;
  225. i = (m >> GEMM_UNROLL_M_SHIFT);
  226. if (i > 0) {
  227. do {
  228. if (k - kk > 0) {
  229. GEMM_KERNEL(GEMM_UNROLL_M, GEMM_UNROLL_N, k - kk, dm1,
  230. #ifdef COMPLEX
  231. ZERO,
  232. #endif
  233. aa + GEMM_UNROLL_M * kk * COMPSIZE,
  234. b + GEMM_UNROLL_N * kk * COMPSIZE,
  235. cc,
  236. ldc);
  237. }
  238. solve(GEMM_UNROLL_M, GEMM_UNROLL_N,
  239. aa + (kk - GEMM_UNROLL_N) * GEMM_UNROLL_M * COMPSIZE,
  240. b + (kk - GEMM_UNROLL_N) * GEMM_UNROLL_N * COMPSIZE,
  241. cc, ldc);
  242. aa += GEMM_UNROLL_M * k * COMPSIZE;
  243. cc += GEMM_UNROLL_M * COMPSIZE;
  244. i --;
  245. } while (i > 0);
  246. }
  247. if (m & (GEMM_UNROLL_M - 1)) {
  248. i = (GEMM_UNROLL_M >> 1);
  249. do {
  250. if (m & i) {
  251. if (k - kk > 0) {
  252. GEMM_KERNEL(i, GEMM_UNROLL_N, k - kk, dm1,
  253. #ifdef COMPLEX
  254. ZERO,
  255. #endif
  256. aa + i * kk * COMPSIZE,
  257. b + GEMM_UNROLL_N * kk * COMPSIZE,
  258. cc,
  259. ldc);
  260. }
  261. solve(i, GEMM_UNROLL_N,
  262. aa + (kk - GEMM_UNROLL_N) * i * COMPSIZE,
  263. b + (kk - GEMM_UNROLL_N) * GEMM_UNROLL_N * COMPSIZE,
  264. cc, ldc);
  265. aa += i * k * COMPSIZE;
  266. cc += i * COMPSIZE;
  267. }
  268. i >>= 1;
  269. } while (i > 0);
  270. }
  271. kk -= GEMM_UNROLL_N;
  272. j --;
  273. } while (j > 0);
  274. }
  275. return 0;
  276. }