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.

level3_syr2k.c 12 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418
  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. #ifndef KERNEL_OPERATION
  39. #ifndef COMPLEX
  40. #define KERNEL_OPERATION(M, N, K, ALPHA, SA, SB, C, LDC, X, Y, FLAG) \
  41. KERNEL_FUNC(M, N, K, ALPHA[0], SA, SB, (FLOAT *)(C) + ((X) + (Y) * LDC) * COMPSIZE, LDC, (X) - (Y), FLAG)
  42. #else
  43. #define KERNEL_OPERATION(M, N, K, ALPHA, SA, SB, C, LDC, X, Y, FLAG) \
  44. KERNEL_FUNC(M, N, K, ALPHA[0], ALPHA[1], SA, SB, (FLOAT *)(C) + ((X) + (Y) * LDC) * COMPSIZE, LDC, (X) - (Y), FLAG)
  45. #endif
  46. #endif
  47. #ifndef KERNEL_OPERATION_C
  48. #define KERNEL_OPERATION_C KERNEL_OPERATION
  49. #endif
  50. #ifndef ICOPY_OPERATION
  51. #ifndef TRANS
  52. #define ICOPY_OPERATION(M, N, A, LDA, X, Y, BUFFER) GEMM_ITCOPY(M, N, (FLOAT *)(A) + ((Y) + (X) * (LDA)) * COMPSIZE, LDA, BUFFER);
  53. #else
  54. #define ICOPY_OPERATION(M, N, A, LDA, X, Y, BUFFER) GEMM_INCOPY(M, N, (FLOAT *)(A) + ((X) + (Y) * (LDA)) * COMPSIZE, LDA, BUFFER);
  55. #endif
  56. #endif
  57. #ifndef OCOPY_OPERATION
  58. #ifdef TRANS
  59. #define OCOPY_OPERATION(M, N, A, LDA, X, Y, BUFFER) GEMM_ONCOPY(M, N, (FLOAT *)(A) + ((X) + (Y) * (LDA)) * COMPSIZE, LDA, BUFFER);
  60. #else
  61. #define OCOPY_OPERATION(M, N, A, LDA, X, Y, BUFFER) GEMM_OTCOPY(M, N, (FLOAT *)(A) + ((Y) + (X) * (LDA)) * COMPSIZE, LDA, BUFFER);
  62. #endif
  63. #endif
  64. #ifndef M
  65. #define M args -> n
  66. #endif
  67. #ifndef N
  68. #define N args -> n
  69. #endif
  70. #ifndef K
  71. #define K args -> k
  72. #endif
  73. #ifndef A
  74. #define A args -> a
  75. #endif
  76. #ifndef B
  77. #define B args -> b
  78. #endif
  79. #ifndef C
  80. #define C args -> c
  81. #endif
  82. #ifndef LDA
  83. #define LDA args -> lda
  84. #endif
  85. #ifndef LDB
  86. #define LDB args -> ldb
  87. #endif
  88. #ifndef LDC
  89. #define LDC args -> ldc
  90. #endif
  91. int CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG dummy) {
  92. BLASLONG m_from, m_to, n_from, n_to, k, lda, ldb, ldc;
  93. FLOAT *a, *b, *c, *alpha, *beta;
  94. BLASLONG ls, is, js;
  95. BLASLONG min_l, min_i, min_j;
  96. BLASLONG jjs, min_jj;
  97. BLASLONG m_start, m_end;
  98. FLOAT *aa;
  99. k = K;
  100. a = (FLOAT *)A;
  101. b = (FLOAT *)B;
  102. c = (FLOAT *)C;
  103. lda = LDA;
  104. ldb = LDB;
  105. ldc = LDC;
  106. alpha = (FLOAT *)args -> alpha;
  107. beta = (FLOAT *)args -> beta;
  108. m_from = 0;
  109. m_to = M;
  110. if (range_m) {
  111. m_from = *(((BLASLONG *)range_m) + 0);
  112. m_to = *(((BLASLONG *)range_m) + 1);
  113. }
  114. n_from = 0;
  115. n_to = N;
  116. if (range_n) {
  117. n_from = *(((BLASLONG *)range_n) + 0);
  118. n_to = *(((BLASLONG *)range_n) + 1);
  119. }
  120. if (beta) {
  121. #if !defined(COMPLEX) || defined(HER2K)
  122. if (beta[0] != ONE)
  123. #else
  124. if ((beta[0] != ONE) || (beta[1] != ZERO))
  125. #endif
  126. syrk_beta(m_from, m_to, n_from, n_to, beta, c, ldc);
  127. }
  128. if ((k == 0) || (alpha == NULL)) return 0;
  129. if (alpha[0] == ZERO
  130. #ifdef COMPLEX
  131. && alpha[1] == ZERO
  132. #endif
  133. ) return 0;
  134. for(js = n_from; js < n_to; js += GEMM_R){
  135. min_j = n_to - js;
  136. if (min_j > GEMM_R) min_j = GEMM_R;
  137. #ifndef LOWER
  138. m_start = m_from;
  139. m_end = js + min_j;
  140. if (m_end > m_to) m_end = m_to;
  141. #else
  142. m_start = m_from;
  143. m_end = m_to;
  144. if (m_start < js) m_start = js;
  145. #endif
  146. for(ls = 0; ls < k; ls += min_l){
  147. min_l = k - ls;
  148. if (min_l >= GEMM_Q * 2) {
  149. min_l = GEMM_Q;
  150. } else
  151. if (min_l > GEMM_Q) {
  152. min_l = (min_l + 1) / 2;
  153. }
  154. min_i = m_end - m_start;
  155. if (min_i >= GEMM_P * 2) {
  156. min_i = GEMM_P;
  157. } else
  158. if (min_i > GEMM_P) {
  159. min_i = ((min_i / 2 + GEMM_UNROLL_MN - 1)/GEMM_UNROLL_MN) * GEMM_UNROLL_MN;
  160. }
  161. #ifndef LOWER
  162. if (m_start >= js) {
  163. ICOPY_OPERATION(min_l, min_i, a, lda, ls, m_start, sa);
  164. aa = sb + min_l * (m_start - js) * COMPSIZE;
  165. OCOPY_OPERATION(min_l, min_i, b, ldb, ls, m_start, aa);
  166. KERNEL_OPERATION(min_i, min_i, min_l, alpha, sa, aa, c, ldc, m_start, m_start, 1);
  167. jjs = m_start + min_i;
  168. } else {
  169. ICOPY_OPERATION(min_l, min_i, a, lda, ls, m_start, sa);
  170. jjs = js;
  171. }
  172. for(; jjs < js + min_j; jjs += GEMM_UNROLL_MN){
  173. min_jj = min_j + js - jjs;
  174. if (min_jj > GEMM_UNROLL_MN) min_jj = GEMM_UNROLL_MN;
  175. OCOPY_OPERATION(min_l, min_jj, b, ldb, ls, jjs, sb + min_l * (jjs - js) * COMPSIZE);
  176. KERNEL_OPERATION(min_i, min_jj, min_l, alpha,
  177. sa, sb + min_l * (jjs - js) * COMPSIZE,
  178. c, ldc, m_start, jjs, 1);
  179. }
  180. for(is = m_start + min_i; is < m_end; is += min_i){
  181. min_i = m_end - is;
  182. if (min_i >= GEMM_P * 2) {
  183. min_i = GEMM_P;
  184. } else
  185. if (min_i > GEMM_P) {
  186. min_i = ((min_i / 2 + GEMM_UNROLL_MN - 1)/GEMM_UNROLL_MN) * GEMM_UNROLL_MN;
  187. }
  188. ICOPY_OPERATION(min_l, min_i, a, lda, ls, is, sa);
  189. KERNEL_OPERATION(min_i, min_j, min_l, alpha, sa, sb, c, ldc, is, js, 1);
  190. }
  191. min_i = m_end - m_start;
  192. if (min_i >= GEMM_P * 2) {
  193. min_i = GEMM_P;
  194. } else
  195. if (min_i > GEMM_P) {
  196. min_i = ((min_i / 2 + GEMM_UNROLL_MN - 1)/GEMM_UNROLL_MN) * GEMM_UNROLL_MN;
  197. }
  198. if (m_start >= js) {
  199. ICOPY_OPERATION(min_l, min_i, b, ldb, ls, m_start, sa);
  200. aa = sb + min_l * (m_start - js) * COMPSIZE;
  201. OCOPY_OPERATION(min_l, min_i, a, lda, ls, m_start, aa);
  202. KERNEL_OPERATION_C(min_i, min_i, min_l, alpha, sa, aa, c, ldc, m_start, m_start, 0);
  203. jjs = m_start + min_i;
  204. } else {
  205. ICOPY_OPERATION(min_l, min_i, b, ldb, ls, m_start, sa);
  206. jjs = js;
  207. }
  208. for(; jjs < js + min_j; jjs += GEMM_UNROLL_MN){
  209. min_jj = min_j + js - jjs;
  210. if (min_jj > GEMM_UNROLL_MN) min_jj = GEMM_UNROLL_MN;
  211. OCOPY_OPERATION(min_l, min_jj, a, lda, ls, jjs, sb + min_l * (jjs - js) * COMPSIZE);
  212. KERNEL_OPERATION_C(min_i, min_jj, min_l, alpha,
  213. sa, sb + min_l * (jjs - js) * COMPSIZE,
  214. c, ldc, m_start, jjs, 0);
  215. }
  216. for(is = m_start + min_i; is < m_end; is += min_i){
  217. min_i = m_end - is;
  218. if (min_i >= GEMM_P * 2) {
  219. min_i = GEMM_P;
  220. } else
  221. if (min_i > GEMM_P) {
  222. min_i = ((min_i / 2 + GEMM_UNROLL_MN - 1)/GEMM_UNROLL_MN) * GEMM_UNROLL_MN;
  223. }
  224. ICOPY_OPERATION(min_l, min_i, b, ldb, ls, is, sa);
  225. KERNEL_OPERATION_C(min_i, min_j, min_l, alpha, sa, sb, c, ldc, is, js, 0);
  226. }
  227. #else
  228. aa = sb + min_l * (m_start - js) * COMPSIZE;
  229. ICOPY_OPERATION(min_l, min_i, a, lda, ls, m_start, sa);
  230. OCOPY_OPERATION(min_l, min_i, b, ldb, ls, m_start, aa);
  231. KERNEL_OPERATION(min_i, MIN(min_i, min_j + js - m_start), min_l, alpha,
  232. sa, aa, c, ldc, m_start, m_start, 1);
  233. for(jjs = js; jjs < m_start; jjs += GEMM_UNROLL_MN){
  234. min_jj = m_start - jjs;
  235. if (min_jj > GEMM_UNROLL_MN) min_jj = GEMM_UNROLL_MN;
  236. OCOPY_OPERATION(min_l, min_jj, b, ldb, ls, jjs, sb + min_l * (jjs - js) * COMPSIZE);
  237. KERNEL_OPERATION(min_i, min_jj, min_l, alpha,
  238. sa, sb + min_l * (jjs - js) * COMPSIZE, c, ldc, m_start, jjs, 1);
  239. }
  240. for(is = m_start + min_i; is < m_end; is += min_i){
  241. min_i = m_end - is;
  242. if (min_i >= GEMM_P * 2) {
  243. min_i = GEMM_P;
  244. } else
  245. if (min_i > GEMM_P) {
  246. min_i = ((min_i / 2 + GEMM_UNROLL_MN - 1)/GEMM_UNROLL_MN) * GEMM_UNROLL_MN;
  247. }
  248. aa = sb + min_l * (is - js) * COMPSIZE;
  249. if (is < js + min_j) {
  250. ICOPY_OPERATION(min_l, min_i, a, lda, ls, is, sa);
  251. OCOPY_OPERATION(min_l, min_i, b, ldb, ls, is, aa);
  252. KERNEL_OPERATION(min_i, MIN(min_i, min_j - is + js), min_l, alpha, sa, aa, c, ldc, is, is, 1);
  253. KERNEL_OPERATION(min_i, is - js, min_l, alpha, sa, sb, c, ldc, is, js, 1);
  254. } else {
  255. ICOPY_OPERATION(min_l, min_i, a, lda, ls, is, sa);
  256. KERNEL_OPERATION(min_i, min_j, min_l, alpha, sa, sb, c, ldc, is, js, 1);
  257. }
  258. }
  259. min_i = m_end - m_start;
  260. if (min_i >= GEMM_P * 2) {
  261. min_i = GEMM_P;
  262. } else
  263. if (min_i > GEMM_P) {
  264. min_i = ((min_i / 2 + GEMM_UNROLL_MN - 1)/GEMM_UNROLL_MN) * GEMM_UNROLL_MN;
  265. }
  266. aa = sb + min_l * (m_start - js) * COMPSIZE;
  267. ICOPY_OPERATION(min_l, min_i, b, ldb, ls, m_start, sa);
  268. OCOPY_OPERATION(min_l, min_i, a, lda, ls, m_start, aa);
  269. KERNEL_OPERATION_C(min_i, MIN(min_i, min_j + js - m_start), min_l, alpha,
  270. sa, aa, c, ldc, m_start, m_start, 0);
  271. for(jjs = js; jjs < m_start; jjs += GEMM_UNROLL_MN){
  272. min_jj = m_start - jjs;
  273. if (min_jj > GEMM_UNROLL_MN) min_jj = GEMM_UNROLL_MN;
  274. OCOPY_OPERATION(min_l, min_jj, a, lda, ls, jjs, sb + min_l * (jjs - js) * COMPSIZE);
  275. KERNEL_OPERATION_C(min_i, min_jj, min_l, alpha,
  276. sa, sb + min_l * (jjs - js) * COMPSIZE, c, ldc, m_start, jjs, 0);
  277. }
  278. for(is = m_start + min_i; is < m_end; is += min_i){
  279. min_i = m_end - is;
  280. if (min_i >= GEMM_P * 2) {
  281. min_i = GEMM_P;
  282. } else
  283. if (min_i > GEMM_P) {
  284. min_i = ((min_i / 2 + GEMM_UNROLL_MN - 1)/GEMM_UNROLL_MN) * GEMM_UNROLL_MN;
  285. }
  286. aa = sb + min_l * (is - js) * COMPSIZE;
  287. if (is < js + min_j) {
  288. ICOPY_OPERATION(min_l, min_i, b, ldb, ls, is, sa);
  289. OCOPY_OPERATION(min_l, min_i, a, lda, ls, is, aa);
  290. KERNEL_OPERATION_C(min_i, MIN(min_i, min_j - is + js), min_l, alpha, sa, aa, c, ldc, is, is, 0);
  291. KERNEL_OPERATION_C(min_i, is - js, min_l, alpha, sa, sb, c, ldc, is, js, 0);
  292. } else {
  293. ICOPY_OPERATION(min_l, min_i, b, ldb, ls, is, sa);
  294. KERNEL_OPERATION_C(min_i, min_j, min_l, alpha, sa, sb, c, ldc, is, js, 0);
  295. }
  296. }
  297. #endif
  298. }
  299. }
  300. return 0;
  301. }