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_LN.c 8.6 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337
  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 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 += (m - 1) * m;
  83. b += (m - 1) * n;
  84. for (i = m - 1; i >= 0; i--) {
  85. aa = *(a + i);
  86. for (j = 0; j < n; j ++) {
  87. bb = *(c + i + j * ldc);
  88. bb *= aa;
  89. *b = bb;
  90. *(c + i + j * ldc) = bb;
  91. b ++;
  92. for (k = 0; k < i; k ++){
  93. *(c + k + j * ldc) -= bb * *(a + k);
  94. }
  95. }
  96. a -= m;
  97. b -= 2 * n;
  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 += (m - 1) * m * 2;
  108. b += (m - 1) * n * 2;
  109. for (i = m - 1; i >= 0; i--) {
  110. aa1 = *(a + i * 2 + 0);
  111. aa2 = *(a + i * 2 + 1);
  112. for (j = 0; j < n; j ++) {
  113. bb1 = *(c + i * 2 + 0 + j * ldc);
  114. bb2 = *(c + i * 2 + 1 + j * 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. *(b + 0) = cc1;
  123. *(b + 1) = cc2;
  124. *(c + i * 2 + 0 + j * ldc) = cc1;
  125. *(c + i * 2 + 1 + j * ldc) = cc2;
  126. b += 2;
  127. for (k = 0; k < i; k ++){
  128. #ifndef CONJ
  129. *(c + k * 2 + 0 + j * ldc) -= cc1 * *(a + k * 2 + 0) - cc2 * *(a + k * 2 + 1);
  130. *(c + k * 2 + 1 + j * ldc) -= cc1 * *(a + k * 2 + 1) + cc2 * *(a + k * 2 + 0);
  131. #else
  132. *(c + k * 2 + 0 + j * ldc) -= cc1 * *(a + k * 2 + 0) + cc2 * *(a + k * 2 + 1);
  133. *(c + k * 2 + 1 + j * ldc) -= - cc1 * *(a + k * 2 + 1) + cc2 * *(a + k * 2 + 0);
  134. #endif
  135. }
  136. }
  137. a -= m * 2;
  138. b -= 4 * n;
  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 KERNEL LN : m = %3ld n = %3ld k = %3ld offset = %3ld\n",
  152. m, n, k, offset);
  153. #endif
  154. j = (n >> GEMM_UNROLL_N_SHIFT);
  155. while (j > 0) {
  156. kk = m + offset;
  157. if (m & (GEMM_UNROLL_M - 1)) {
  158. for (i = 1; i < GEMM_UNROLL_M; i *= 2){
  159. if (m & i) {
  160. aa = a + ((m & ~(i - 1)) - i) * k * COMPSIZE;
  161. cc = c + ((m & ~(i - 1)) - i) * COMPSIZE;
  162. if (k - kk > 0) {
  163. GEMM_KERNEL(i, GEMM_UNROLL_N, k - kk, dm1,
  164. #ifdef COMPLEX
  165. ZERO,
  166. #endif
  167. aa + i * kk * COMPSIZE,
  168. b + GEMM_UNROLL_N * kk * COMPSIZE,
  169. cc,
  170. ldc);
  171. }
  172. solve(i, GEMM_UNROLL_N,
  173. aa + (kk - i) * i * COMPSIZE,
  174. b + (kk - i) * GEMM_UNROLL_N * COMPSIZE,
  175. cc, ldc);
  176. kk -= i;
  177. }
  178. }
  179. }
  180. i = (m >> GEMM_UNROLL_M_SHIFT);
  181. if (i > 0) {
  182. aa = a + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * k * COMPSIZE;
  183. cc = c + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * COMPSIZE;
  184. do {
  185. if (k - kk > 0) {
  186. GEMM_KERNEL(GEMM_UNROLL_M, GEMM_UNROLL_N, k - kk, dm1,
  187. #ifdef COMPLEX
  188. ZERO,
  189. #endif
  190. aa + GEMM_UNROLL_M * kk * COMPSIZE,
  191. b + GEMM_UNROLL_N * kk * COMPSIZE,
  192. cc,
  193. ldc);
  194. }
  195. solve(GEMM_UNROLL_M, GEMM_UNROLL_N,
  196. aa + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_M * COMPSIZE,
  197. b + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_N * COMPSIZE,
  198. cc, ldc);
  199. aa -= GEMM_UNROLL_M * k * COMPSIZE;
  200. cc -= GEMM_UNROLL_M * COMPSIZE;
  201. kk -= GEMM_UNROLL_M;
  202. i --;
  203. } while (i > 0);
  204. }
  205. b += GEMM_UNROLL_N * k * COMPSIZE;
  206. c += GEMM_UNROLL_N * ldc * COMPSIZE;
  207. j --;
  208. }
  209. if (n & (GEMM_UNROLL_N - 1)) {
  210. j = (GEMM_UNROLL_N >> 1);
  211. while (j > 0) {
  212. if (n & j) {
  213. kk = m + offset;
  214. if (m & (GEMM_UNROLL_M - 1)) {
  215. for (i = 1; i < GEMM_UNROLL_M; i *= 2){
  216. if (m & i) {
  217. aa = a + ((m & ~(i - 1)) - i) * k * COMPSIZE;
  218. cc = c + ((m & ~(i - 1)) - i) * COMPSIZE;
  219. if (k - kk > 0) {
  220. GEMM_KERNEL(i, j, k - kk, dm1,
  221. #ifdef COMPLEX
  222. ZERO,
  223. #endif
  224. aa + i * kk * COMPSIZE,
  225. b + j * kk * COMPSIZE,
  226. cc, ldc);
  227. }
  228. solve(i, j,
  229. aa + (kk - i) * i * COMPSIZE,
  230. b + (kk - i) * j * COMPSIZE,
  231. cc, ldc);
  232. kk -= i;
  233. }
  234. }
  235. }
  236. i = (m >> GEMM_UNROLL_M_SHIFT);
  237. if (i > 0) {
  238. aa = a + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * k * COMPSIZE;
  239. cc = c + ((m & ~(GEMM_UNROLL_M - 1)) - GEMM_UNROLL_M) * COMPSIZE;
  240. do {
  241. if (k - kk > 0) {
  242. GEMM_KERNEL(GEMM_UNROLL_M, j, k - kk, dm1,
  243. #ifdef COMPLEX
  244. ZERO,
  245. #endif
  246. aa + GEMM_UNROLL_M * kk * COMPSIZE,
  247. b + j * kk * COMPSIZE,
  248. cc,
  249. ldc);
  250. }
  251. solve(GEMM_UNROLL_M, j,
  252. aa + (kk - GEMM_UNROLL_M) * GEMM_UNROLL_M * COMPSIZE,
  253. b + (kk - GEMM_UNROLL_M) * j * COMPSIZE,
  254. cc, ldc);
  255. aa -= GEMM_UNROLL_M * k * COMPSIZE;
  256. cc -= GEMM_UNROLL_M * COMPSIZE;
  257. kk -= GEMM_UNROLL_M;
  258. i --;
  259. } while (i > 0);
  260. }
  261. b += j * k * COMPSIZE;
  262. c += j * ldc * COMPSIZE;
  263. }
  264. j >>= 1;
  265. }
  266. }
  267. return 0;
  268. }