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.c 8.3 kB

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