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.

ztrsm_utcopy_4.c 9.3 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444
  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. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG offset, FLOAT *b){
  41. BLASLONG i, ii, j, jj;
  42. FLOAT data01 = 0.0, data02 = 0.0, data03, data04;
  43. FLOAT data05, data06, data07, data08;
  44. FLOAT data09, data10, data11 = 0.0, data12 = 0.0;
  45. FLOAT data13, data14, data15, data16;
  46. FLOAT data17, data18, data19, data20;
  47. FLOAT data21, data22, data23, data24;
  48. FLOAT data25, data26, data27, data28;
  49. FLOAT data29, data30, data31, data32;
  50. FLOAT *a1, *a2, *a3, *a4;
  51. lda *= 2;
  52. jj = offset;
  53. j = (n >> 2);
  54. while (j > 0){
  55. a1 = a + 0 * lda;
  56. a2 = a + 1 * lda;
  57. a3 = a + 2 * lda;
  58. a4 = a + 3 * lda;
  59. ii = 0;
  60. i = (m >> 2);
  61. while (i > 0) {
  62. if (ii == jj) {
  63. #ifndef UNIT
  64. data01 = *(a1 + 0);
  65. data02 = *(a1 + 1);
  66. #endif
  67. data09 = *(a2 + 0);
  68. data10 = *(a2 + 1);
  69. #ifndef UNIT
  70. data11 = *(a2 + 2);
  71. data12 = *(a2 + 3);
  72. #endif
  73. data17 = *(a3 + 0);
  74. data18 = *(a3 + 1);
  75. data19 = *(a3 + 2);
  76. data20 = *(a3 + 3);
  77. #ifndef UNIT
  78. data21 = *(a3 + 4);
  79. data22 = *(a3 + 5);
  80. #endif
  81. data25 = *(a4 + 0);
  82. data26 = *(a4 + 1);
  83. data27 = *(a4 + 2);
  84. data28 = *(a4 + 3);
  85. data29 = *(a4 + 4);
  86. data30 = *(a4 + 5);
  87. #ifndef UNIT
  88. data31 = *(a4 + 6);
  89. data32 = *(a4 + 7);
  90. #endif
  91. compinv(b + 0, data01, data02);
  92. *(b + 8) = data09;
  93. *(b + 9) = data10;
  94. compinv(b + 10, data11, data12);
  95. *(b + 16) = data17;
  96. *(b + 17) = data18;
  97. *(b + 18) = data19;
  98. *(b + 19) = data20;
  99. compinv(b + 20, data21, data22);
  100. *(b + 24) = data25;
  101. *(b + 25) = data26;
  102. *(b + 26) = data27;
  103. *(b + 27) = data28;
  104. *(b + 28) = data29;
  105. *(b + 29) = data30;
  106. compinv(b + 30, data31, data32);
  107. }
  108. if (ii > jj) {
  109. data01 = *(a1 + 0);
  110. data02 = *(a1 + 1);
  111. data03 = *(a1 + 2);
  112. data04 = *(a1 + 3);
  113. data05 = *(a1 + 4);
  114. data06 = *(a1 + 5);
  115. data07 = *(a1 + 6);
  116. data08 = *(a1 + 7);
  117. data09 = *(a2 + 0);
  118. data10 = *(a2 + 1);
  119. data11 = *(a2 + 2);
  120. data12 = *(a2 + 3);
  121. data13 = *(a2 + 4);
  122. data14 = *(a2 + 5);
  123. data15 = *(a2 + 6);
  124. data16 = *(a2 + 7);
  125. data17 = *(a3 + 0);
  126. data18 = *(a3 + 1);
  127. data19 = *(a3 + 2);
  128. data20 = *(a3 + 3);
  129. data21 = *(a3 + 4);
  130. data22 = *(a3 + 5);
  131. data23 = *(a3 + 6);
  132. data24 = *(a3 + 7);
  133. data25 = *(a4 + 0);
  134. data26 = *(a4 + 1);
  135. data27 = *(a4 + 2);
  136. data28 = *(a4 + 3);
  137. data29 = *(a4 + 4);
  138. data30 = *(a4 + 5);
  139. data31 = *(a4 + 6);
  140. data32 = *(a4 + 7);
  141. *(b + 0) = data01;
  142. *(b + 1) = data02;
  143. *(b + 2) = data03;
  144. *(b + 3) = data04;
  145. *(b + 4) = data05;
  146. *(b + 5) = data06;
  147. *(b + 6) = data07;
  148. *(b + 7) = data08;
  149. *(b + 8) = data09;
  150. *(b + 9) = data10;
  151. *(b + 10) = data11;
  152. *(b + 11) = data12;
  153. *(b + 12) = data13;
  154. *(b + 13) = data14;
  155. *(b + 14) = data15;
  156. *(b + 15) = data16;
  157. *(b + 16) = data17;
  158. *(b + 17) = data18;
  159. *(b + 18) = data19;
  160. *(b + 19) = data20;
  161. *(b + 20) = data21;
  162. *(b + 21) = data22;
  163. *(b + 22) = data23;
  164. *(b + 23) = data24;
  165. *(b + 24) = data25;
  166. *(b + 25) = data26;
  167. *(b + 26) = data27;
  168. *(b + 27) = data28;
  169. *(b + 28) = data29;
  170. *(b + 29) = data30;
  171. *(b + 30) = data31;
  172. *(b + 31) = data32;
  173. }
  174. a1 += 4 * lda;
  175. a2 += 4 * lda;
  176. a3 += 4 * lda;
  177. a4 += 4 * lda;
  178. b += 32;
  179. i --;
  180. ii += 4;
  181. }
  182. if (m & 2) {
  183. if (ii == jj) {
  184. #ifndef UNIT
  185. data01 = *(a1 + 0);
  186. data02 = *(a1 + 1);
  187. #endif
  188. data09 = *(a2 + 0);
  189. data10 = *(a2 + 1);
  190. #ifndef UNIT
  191. data11 = *(a2 + 2);
  192. data12 = *(a2 + 3);
  193. #endif
  194. compinv(b + 0, data01, data02);
  195. *(b + 8) = data09;
  196. *(b + 9) = data10;
  197. compinv(b + 10, data11, data12);
  198. }
  199. if (ii > jj) {
  200. data01 = *(a1 + 0);
  201. data02 = *(a1 + 1);
  202. data03 = *(a1 + 2);
  203. data04 = *(a1 + 3);
  204. data05 = *(a1 + 4);
  205. data06 = *(a1 + 5);
  206. data07 = *(a1 + 6);
  207. data08 = *(a1 + 7);
  208. data09 = *(a2 + 0);
  209. data10 = *(a2 + 1);
  210. data11 = *(a2 + 2);
  211. data12 = *(a2 + 3);
  212. data13 = *(a2 + 4);
  213. data14 = *(a2 + 5);
  214. data15 = *(a2 + 6);
  215. data16 = *(a2 + 7);
  216. *(b + 0) = data01;
  217. *(b + 1) = data02;
  218. *(b + 2) = data03;
  219. *(b + 3) = data04;
  220. *(b + 4) = data05;
  221. *(b + 5) = data06;
  222. *(b + 6) = data07;
  223. *(b + 7) = data08;
  224. *(b + 8) = data09;
  225. *(b + 9) = data10;
  226. *(b + 10) = data11;
  227. *(b + 11) = data12;
  228. *(b + 12) = data13;
  229. *(b + 13) = data14;
  230. *(b + 14) = data15;
  231. *(b + 15) = data16;
  232. }
  233. a1 += 2 * lda;
  234. // a2 += 2 * lda;
  235. b += 16;
  236. ii += 2;
  237. }
  238. if (m & 1) {
  239. if (ii == jj) {
  240. #ifndef UNIT
  241. data01 = *(a1 + 0);
  242. data02 = *(a1 + 1);
  243. #endif
  244. compinv(b + 0, data01, data02);
  245. }
  246. if (ii > jj) {
  247. data01 = *(a1 + 0);
  248. data02 = *(a1 + 1);
  249. data03 = *(a1 + 2);
  250. data04 = *(a1 + 3);
  251. data05 = *(a1 + 4);
  252. data06 = *(a1 + 5);
  253. data07 = *(a1 + 6);
  254. data08 = *(a1 + 7);
  255. *(b + 0) = data01;
  256. *(b + 1) = data02;
  257. *(b + 2) = data03;
  258. *(b + 3) = data04;
  259. *(b + 4) = data05;
  260. *(b + 5) = data06;
  261. *(b + 6) = data07;
  262. *(b + 7) = data08;
  263. }
  264. // a1 += lda;
  265. b += 8;
  266. // ii += 1;
  267. }
  268. a += 8;
  269. jj += 4;
  270. j --;
  271. }
  272. if (n & 2) {
  273. a1 = a + 0 * lda;
  274. a2 = a + 1 * lda;
  275. ii = 0;
  276. i = (m >> 1);
  277. while (i > 0) {
  278. if (ii == jj) {
  279. #ifndef UNIT
  280. data01 = *(a1 + 0);
  281. data02 = *(a1 + 1);
  282. #endif
  283. data09 = *(a2 + 0);
  284. data10 = *(a2 + 1);
  285. #ifndef UNIT
  286. data11 = *(a2 + 2);
  287. data12 = *(a2 + 3);
  288. #endif
  289. compinv(b + 0, data01, data02);
  290. *(b + 4) = data09;
  291. *(b + 5) = data10;
  292. compinv(b + 6, data11, data12);
  293. }
  294. if (ii > jj) {
  295. data01 = *(a1 + 0);
  296. data02 = *(a1 + 1);
  297. data03 = *(a1 + 2);
  298. data04 = *(a1 + 3);
  299. data09 = *(a2 + 0);
  300. data10 = *(a2 + 1);
  301. data11 = *(a2 + 2);
  302. data12 = *(a2 + 3);
  303. *(b + 0) = data01;
  304. *(b + 1) = data02;
  305. *(b + 2) = data03;
  306. *(b + 3) = data04;
  307. *(b + 4) = data09;
  308. *(b + 5) = data10;
  309. *(b + 6) = data11;
  310. *(b + 7) = data12;
  311. }
  312. a1 += 2 * lda;
  313. a2 += 2 * lda;
  314. b += 8;
  315. i --;
  316. ii += 2;
  317. }
  318. if (m & 1) {
  319. if (ii == jj) {
  320. #ifndef UNIT
  321. data01 = *(a1 + 0);
  322. data02 = *(a1 + 1);
  323. #endif
  324. compinv(b + 0, data01, data02);
  325. }
  326. if (ii > jj) {
  327. data01 = *(a1 + 0);
  328. data02 = *(a1 + 1);
  329. data03 = *(a1 + 2);
  330. data04 = *(a1 + 3);
  331. *(b + 0) = data01;
  332. *(b + 1) = data02;
  333. *(b + 2) = data03;
  334. *(b + 3) = data04;
  335. }
  336. // a1 += lda;
  337. b += 4;
  338. // ii += 1;
  339. }
  340. a += 4;
  341. jj += 2;
  342. j --;
  343. }
  344. if (n & 1) {
  345. a1 = a + 0 * lda;
  346. ii = 0;
  347. i = m;
  348. while (i > 0) {
  349. if (ii == jj) {
  350. #ifndef UNIT
  351. data01 = *(a1 + 0);
  352. data02 = *(a1 + 1);
  353. #endif
  354. compinv(b + 0, data01, data02);
  355. }
  356. if (ii > jj) {
  357. data01 = *(a1 + 0);
  358. data02 = *(a1 + 1);
  359. *(b + 0) = data01;
  360. *(b + 1) = data02;
  361. }
  362. a1 += lda;
  363. b += 2;
  364. i --;
  365. ii += 1;
  366. }
  367. // a += 2;
  368. // jj += 1;
  369. }
  370. return 0;
  371. }