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.

zgemm3m_tcopy_4.c 9.5 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365
  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 <stdio.h>
  39. #include "common.h"
  40. #ifndef USE_ALPHA
  41. #define REAL_PART(a, b) (a)
  42. #define IMAGE_PART(a, b) (b)
  43. #else
  44. #define REAL_PART(a, b) (alpha_r * (a) - alpha_i * (b))
  45. #define IMAGE_PART(a, b) (alpha_i * (a) + alpha_r * (b))
  46. #endif
  47. #if defined(REAL_ONLY)
  48. #define CMULT(a, b) (REAL_PART(a, b))
  49. #elif defined(IMAGE_ONLY)
  50. #define CMULT(a, b) (IMAGE_PART(a, b))
  51. #else
  52. #define CMULT(a, b) (REAL_PART(a, b) + IMAGE_PART(a, b))
  53. #endif
  54. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda,
  55. #ifdef USE_ALPHA
  56. FLOAT alpha_r, FLOAT alpha_i,
  57. #endif
  58. FLOAT *b){
  59. BLASLONG i, j;
  60. FLOAT *a_offset, *a_offset1, *a_offset2, *a_offset3, *a_offset4;
  61. FLOAT *b_offset, *b_offset1, *b_offset2, *b_offset3;
  62. FLOAT a1, a2, a3, a4, a5, a6, a7, a8;
  63. /* silence compiler warnings about unused-but-set variables:
  64. depending on compile-time arguments either the odd or the
  65. even-numbered variables will not be used */
  66. (void)a1;
  67. (void)a2;
  68. (void)a3;
  69. (void)a4;
  70. (void)a5;
  71. (void)a6;
  72. (void)a7;
  73. (void)a8;
  74. a_offset = a;
  75. b_offset = b;
  76. lda *= 2;
  77. b_offset2 = b + m * (n & ~3);
  78. b_offset3 = b + m * (n & ~1);
  79. j = (m >> 2);
  80. if (j > 0){
  81. do{
  82. a_offset1 = a_offset;
  83. a_offset2 = a_offset1 + lda;
  84. a_offset3 = a_offset2 + lda;
  85. a_offset4 = a_offset3 + lda;
  86. a_offset += 4 * lda;
  87. b_offset1 = b_offset;
  88. b_offset += 16;
  89. i = (n >> 2);
  90. if (i > 0){
  91. do{
  92. a1 = *(a_offset1 + 0);
  93. a2 = *(a_offset1 + 1);
  94. a3 = *(a_offset1 + 2);
  95. a4 = *(a_offset1 + 3);
  96. a5 = *(a_offset1 + 4);
  97. a6 = *(a_offset1 + 5);
  98. a7 = *(a_offset1 + 6);
  99. a8 = *(a_offset1 + 7);
  100. *(b_offset1 + 0) = CMULT(a1, a2);
  101. *(b_offset1 + 1) = CMULT(a3, a4);
  102. *(b_offset1 + 2) = CMULT(a5, a6);
  103. *(b_offset1 + 3) = CMULT(a7, a8);
  104. a1 = *(a_offset2 + 0);
  105. a2 = *(a_offset2 + 1);
  106. a3 = *(a_offset2 + 2);
  107. a4 = *(a_offset2 + 3);
  108. a5 = *(a_offset2 + 4);
  109. a6 = *(a_offset2 + 5);
  110. a7 = *(a_offset2 + 6);
  111. a8 = *(a_offset2 + 7);
  112. *(b_offset1 + 4) = CMULT(a1, a2);
  113. *(b_offset1 + 5) = CMULT(a3, a4);
  114. *(b_offset1 + 6) = CMULT(a5, a6);
  115. *(b_offset1 + 7) = CMULT(a7, a8);
  116. a1 = *(a_offset3 + 0);
  117. a2 = *(a_offset3 + 1);
  118. a3 = *(a_offset3 + 2);
  119. a4 = *(a_offset3 + 3);
  120. a5 = *(a_offset3 + 4);
  121. a6 = *(a_offset3 + 5);
  122. a7 = *(a_offset3 + 6);
  123. a8 = *(a_offset3 + 7);
  124. *(b_offset1 + 8) = CMULT(a1, a2);
  125. *(b_offset1 + 9) = CMULT(a3, a4);
  126. *(b_offset1 + 10) = CMULT(a5, a6);
  127. *(b_offset1 + 11) = CMULT(a7, a8);
  128. a1 = *(a_offset4 + 0);
  129. a2 = *(a_offset4 + 1);
  130. a3 = *(a_offset4 + 2);
  131. a4 = *(a_offset4 + 3);
  132. a5 = *(a_offset4 + 4);
  133. a6 = *(a_offset4 + 5);
  134. a7 = *(a_offset4 + 6);
  135. a8 = *(a_offset4 + 7);
  136. *(b_offset1 + 12) = CMULT(a1, a2);
  137. *(b_offset1 + 13) = CMULT(a3, a4);
  138. *(b_offset1 + 14) = CMULT(a5, a6);
  139. *(b_offset1 + 15) = CMULT(a7, a8);
  140. a_offset1 += 8;
  141. a_offset2 += 8;
  142. a_offset3 += 8;
  143. a_offset4 += 8;
  144. b_offset1 += m * 4;
  145. i --;
  146. }while(i > 0);
  147. }
  148. if (n & 2) {
  149. a1 = *(a_offset1 + 0);
  150. a2 = *(a_offset1 + 1);
  151. a3 = *(a_offset1 + 2);
  152. a4 = *(a_offset1 + 3);
  153. a5 = *(a_offset2 + 0);
  154. a6 = *(a_offset2 + 1);
  155. a7 = *(a_offset2 + 2);
  156. a8 = *(a_offset2 + 3);
  157. *(b_offset2 + 0) = CMULT(a1, a2);
  158. *(b_offset2 + 1) = CMULT(a3, a4);
  159. *(b_offset2 + 2) = CMULT(a5, a6);
  160. *(b_offset2 + 3) = CMULT(a7, a8);
  161. a1 = *(a_offset3 + 0);
  162. a2 = *(a_offset3 + 1);
  163. a3 = *(a_offset3 + 2);
  164. a4 = *(a_offset3 + 3);
  165. a5 = *(a_offset4 + 0);
  166. a6 = *(a_offset4 + 1);
  167. a7 = *(a_offset4 + 2);
  168. a8 = *(a_offset4 + 3);
  169. *(b_offset2 + 4) = CMULT(a1, a2);
  170. *(b_offset2 + 5) = CMULT(a3, a4);
  171. *(b_offset2 + 6) = CMULT(a5, a6);
  172. *(b_offset2 + 7) = CMULT(a7, a8);
  173. a_offset1 += 4;
  174. a_offset2 += 4;
  175. a_offset3 += 4;
  176. a_offset4 += 4;
  177. b_offset2 += 8;
  178. }
  179. if (n & 1) {
  180. a1 = *(a_offset1 + 0);
  181. a2 = *(a_offset1 + 1);
  182. a3 = *(a_offset2 + 0);
  183. a4 = *(a_offset2 + 1);
  184. a5 = *(a_offset3 + 0);
  185. a6 = *(a_offset3 + 1);
  186. a7 = *(a_offset4 + 0);
  187. a8 = *(a_offset4 + 1);
  188. *(b_offset3 + 0) = CMULT(a1, a2);
  189. *(b_offset3 + 1) = CMULT(a3, a4);
  190. *(b_offset3 + 2) = CMULT(a5, a6);
  191. *(b_offset3 + 3) = CMULT(a7, a8);
  192. b_offset3 += 4;
  193. }
  194. j--;
  195. }while(j > 0);
  196. }
  197. if (m & 2){
  198. a_offset1 = a_offset;
  199. a_offset2 = a_offset1 + lda;
  200. a_offset += 2 * lda;
  201. b_offset1 = b_offset;
  202. b_offset += 8;
  203. i = (n >> 2);
  204. if (i > 0){
  205. do{
  206. a1 = *(a_offset1 + 0);
  207. a2 = *(a_offset1 + 1);
  208. a3 = *(a_offset1 + 2);
  209. a4 = *(a_offset1 + 3);
  210. a5 = *(a_offset1 + 4);
  211. a6 = *(a_offset1 + 5);
  212. a7 = *(a_offset1 + 6);
  213. a8 = *(a_offset1 + 7);
  214. *(b_offset1 + 0) = CMULT(a1, a2);
  215. *(b_offset1 + 1) = CMULT(a3, a4);
  216. *(b_offset1 + 2) = CMULT(a5, a6);
  217. *(b_offset1 + 3) = CMULT(a7, a8);
  218. a1 = *(a_offset2 + 0);
  219. a2 = *(a_offset2 + 1);
  220. a3 = *(a_offset2 + 2);
  221. a4 = *(a_offset2 + 3);
  222. a5 = *(a_offset2 + 4);
  223. a6 = *(a_offset2 + 5);
  224. a7 = *(a_offset2 + 6);
  225. a8 = *(a_offset2 + 7);
  226. *(b_offset1 + 4) = CMULT(a1, a2);
  227. *(b_offset1 + 5) = CMULT(a3, a4);
  228. *(b_offset1 + 6) = CMULT(a5, a6);
  229. *(b_offset1 + 7) = CMULT(a7, a8);
  230. a_offset1 += 8;
  231. a_offset2 += 8;
  232. b_offset1 += m * 4;
  233. i --;
  234. }while(i > 0);
  235. }
  236. if (n & 2) {
  237. a1 = *(a_offset1 + 0);
  238. a2 = *(a_offset1 + 1);
  239. a3 = *(a_offset1 + 2);
  240. a4 = *(a_offset1 + 3);
  241. a5 = *(a_offset2 + 0);
  242. a6 = *(a_offset2 + 1);
  243. a7 = *(a_offset2 + 2);
  244. a8 = *(a_offset2 + 3);
  245. *(b_offset2 + 0) = CMULT(a1, a2);
  246. *(b_offset2 + 1) = CMULT(a3, a4);
  247. *(b_offset2 + 2) = CMULT(a5, a6);
  248. *(b_offset2 + 3) = CMULT(a7, a8);
  249. a_offset1 += 4;
  250. a_offset2 += 4;
  251. b_offset2 += 4;
  252. }
  253. if (n & 1) {
  254. a1 = *(a_offset1 + 0);
  255. a2 = *(a_offset1 + 1);
  256. a3 = *(a_offset2 + 0);
  257. a4 = *(a_offset2 + 1);
  258. *(b_offset3 + 0) = CMULT(a1, a2);
  259. *(b_offset3 + 1) = CMULT(a3, a4);
  260. b_offset3 += 2;
  261. }
  262. }
  263. if (m & 1){
  264. a_offset1 = a_offset;
  265. b_offset1 = b_offset;
  266. i = (n >> 2);
  267. if (i > 0){
  268. do{
  269. a1 = *(a_offset1 + 0);
  270. a2 = *(a_offset1 + 1);
  271. a3 = *(a_offset1 + 2);
  272. a4 = *(a_offset1 + 3);
  273. a5 = *(a_offset1 + 4);
  274. a6 = *(a_offset1 + 5);
  275. a7 = *(a_offset1 + 6);
  276. a8 = *(a_offset1 + 7);
  277. *(b_offset1 + 0) = CMULT(a1, a2);
  278. *(b_offset1 + 1) = CMULT(a3, a4);
  279. *(b_offset1 + 2) = CMULT(a5, a6);
  280. *(b_offset1 + 3) = CMULT(a7, a8);
  281. a_offset1 += 8;
  282. b_offset1 += 4 * m;
  283. i --;
  284. }while(i > 0);
  285. }
  286. if (n & 2) {
  287. a1 = *(a_offset1 + 0);
  288. a2 = *(a_offset1 + 1);
  289. a3 = *(a_offset1 + 2);
  290. a4 = *(a_offset1 + 3);
  291. *(b_offset2 + 0) = CMULT(a1, a2);
  292. *(b_offset2 + 1) = CMULT(a3, a4);
  293. a_offset1 += 4;
  294. }
  295. if (n & 1) {
  296. a1 = *(a_offset1 + 0);
  297. a2 = *(a_offset1 + 1);
  298. *(b_offset3 + 0) = CMULT(a1, a2);
  299. }
  300. }
  301. return 0;
  302. }