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_ltcopy_4.c 10 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479
  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. data03 = *(a1 + 2);
  68. data04 = *(a1 + 3);
  69. data05 = *(a1 + 4);
  70. data06 = *(a1 + 5);
  71. data07 = *(a1 + 6);
  72. data08 = *(a1 + 7);
  73. #ifndef UNIT
  74. data11 = *(a2 + 2);
  75. data12 = *(a2 + 3);
  76. #endif
  77. data13 = *(a2 + 4);
  78. data14 = *(a2 + 5);
  79. data15 = *(a2 + 6);
  80. data16 = *(a2 + 7);
  81. #ifndef UNIT
  82. data21 = *(a3 + 4);
  83. data22 = *(a3 + 5);
  84. #endif
  85. data23 = *(a3 + 6);
  86. data24 = *(a3 + 7);
  87. #ifndef UNIT
  88. data31 = *(a4 + 6);
  89. data32 = *(a4 + 7);
  90. #endif
  91. compinv(b + 0, data01, data02);
  92. *(b + 2) = data03;
  93. *(b + 3) = data04;
  94. *(b + 4) = data05;
  95. *(b + 5) = data06;
  96. *(b + 6) = data07;
  97. *(b + 7) = data08;
  98. compinv(b + 10, data11, data12);
  99. *(b + 12) = data13;
  100. *(b + 13) = data14;
  101. *(b + 14) = data15;
  102. *(b + 15) = data16;
  103. compinv(b + 20, data21, data22);
  104. *(b + 22) = data23;
  105. *(b + 23) = data24;
  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. data03 = *(a1 + 2);
  189. data04 = *(a1 + 3);
  190. data05 = *(a1 + 4);
  191. data06 = *(a1 + 5);
  192. data07 = *(a1 + 6);
  193. data08 = *(a1 + 7);
  194. #ifndef UNIT
  195. data11 = *(a2 + 2);
  196. data12 = *(a2 + 3);
  197. #endif
  198. data13 = *(a2 + 4);
  199. data14 = *(a2 + 5);
  200. data15 = *(a2 + 6);
  201. data16 = *(a2 + 7);
  202. compinv(b + 0, data01, data02);
  203. *(b + 2) = data03;
  204. *(b + 3) = data04;
  205. *(b + 4) = data05;
  206. *(b + 5) = data06;
  207. *(b + 6) = data07;
  208. *(b + 7) = data08;
  209. compinv(b + 10, data11, data12);
  210. *(b + 12) = data13;
  211. *(b + 13) = data14;
  212. *(b + 14) = data15;
  213. *(b + 15) = data16;
  214. }
  215. if (ii < jj) {
  216. data01 = *(a1 + 0);
  217. data02 = *(a1 + 1);
  218. data03 = *(a1 + 2);
  219. data04 = *(a1 + 3);
  220. data05 = *(a1 + 4);
  221. data06 = *(a1 + 5);
  222. data07 = *(a1 + 6);
  223. data08 = *(a1 + 7);
  224. data09 = *(a2 + 0);
  225. data10 = *(a2 + 1);
  226. data11 = *(a2 + 2);
  227. data12 = *(a2 + 3);
  228. data13 = *(a2 + 4);
  229. data14 = *(a2 + 5);
  230. data15 = *(a2 + 6);
  231. data16 = *(a2 + 7);
  232. *(b + 0) = data01;
  233. *(b + 1) = data02;
  234. *(b + 2) = data03;
  235. *(b + 3) = data04;
  236. *(b + 4) = data05;
  237. *(b + 5) = data06;
  238. *(b + 6) = data07;
  239. *(b + 7) = data08;
  240. *(b + 8) = data09;
  241. *(b + 9) = data10;
  242. *(b + 10) = data11;
  243. *(b + 11) = data12;
  244. *(b + 12) = data13;
  245. *(b + 13) = data14;
  246. *(b + 14) = data15;
  247. *(b + 15) = data16;
  248. }
  249. a1 += 2 * lda;
  250. // a2 += 2 * lda;
  251. b += 16;
  252. ii += 2;
  253. }
  254. if (m & 1) {
  255. if (ii == jj) {
  256. #ifndef UNIT
  257. data01 = *(a1 + 0);
  258. data02 = *(a1 + 1);
  259. #endif
  260. data03 = *(a1 + 2);
  261. data04 = *(a1 + 3);
  262. data05 = *(a1 + 4);
  263. data06 = *(a1 + 5);
  264. data07 = *(a1 + 6);
  265. data08 = *(a1 + 7);
  266. compinv(b + 0, data01, data02);
  267. *(b + 2) = data03;
  268. *(b + 3) = data04;
  269. *(b + 4) = data05;
  270. *(b + 5) = data06;
  271. *(b + 6) = data07;
  272. *(b + 7) = data08;
  273. }
  274. if (ii < jj) {
  275. data01 = *(a1 + 0);
  276. data02 = *(a1 + 1);
  277. data03 = *(a1 + 2);
  278. data04 = *(a1 + 3);
  279. data05 = *(a1 + 4);
  280. data06 = *(a1 + 5);
  281. data07 = *(a1 + 6);
  282. data08 = *(a1 + 7);
  283. *(b + 0) = data01;
  284. *(b + 1) = data02;
  285. *(b + 2) = data03;
  286. *(b + 3) = data04;
  287. *(b + 4) = data05;
  288. *(b + 5) = data06;
  289. *(b + 6) = data07;
  290. *(b + 7) = data08;
  291. }
  292. // a1 += lda;
  293. b += 8;
  294. // ii += 1;
  295. }
  296. a += 8;
  297. jj += 4;
  298. j --;
  299. }
  300. if (n & 2) {
  301. a1 = a + 0 * lda;
  302. a2 = a + 1 * lda;
  303. ii = 0;
  304. i = (m >> 1);
  305. while (i > 0) {
  306. if (ii == jj) {
  307. #ifndef UNIT
  308. data01 = *(a1 + 0);
  309. data02 = *(a1 + 1);
  310. #endif
  311. data03 = *(a1 + 2);
  312. data04 = *(a1 + 3);
  313. #ifndef UNIT
  314. data11 = *(a2 + 2);
  315. data12 = *(a2 + 3);
  316. #endif
  317. compinv(b + 0, data01, data02);
  318. *(b + 2) = data03;
  319. *(b + 3) = data04;
  320. compinv(b + 6, data11, data12);
  321. }
  322. if (ii < jj) {
  323. data01 = *(a1 + 0);
  324. data02 = *(a1 + 1);
  325. data03 = *(a1 + 2);
  326. data04 = *(a1 + 3);
  327. data09 = *(a2 + 0);
  328. data10 = *(a2 + 1);
  329. data11 = *(a2 + 2);
  330. data12 = *(a2 + 3);
  331. *(b + 0) = data01;
  332. *(b + 1) = data02;
  333. *(b + 2) = data03;
  334. *(b + 3) = data04;
  335. *(b + 4) = data09;
  336. *(b + 5) = data10;
  337. *(b + 6) = data11;
  338. *(b + 7) = data12;
  339. }
  340. a1 += 2 * lda;
  341. a2 += 2 * lda;
  342. b += 8;
  343. i --;
  344. ii += 2;
  345. }
  346. if (m & 1) {
  347. if (ii == jj) {
  348. #ifndef UNIT
  349. data01 = *(a1 + 0);
  350. data02 = *(a1 + 1);
  351. #endif
  352. data03 = *(a1 + 2);
  353. data04 = *(a1 + 3);
  354. compinv(b + 0, data01, data02);
  355. *(b + 2) = data03;
  356. *(b + 3) = data04;
  357. }
  358. if (ii < jj) {
  359. data01 = *(a1 + 0);
  360. data02 = *(a1 + 1);
  361. data03 = *(a1 + 2);
  362. data04 = *(a1 + 3);
  363. *(b + 0) = data01;
  364. *(b + 1) = data02;
  365. *(b + 2) = data03;
  366. *(b + 3) = data04;
  367. }
  368. // a1 += lda;
  369. b += 4;
  370. // ii += 1;
  371. }
  372. a += 4;
  373. jj += 2;
  374. }
  375. if (n & 1) {
  376. a1 = a + 0 * lda;
  377. ii = 0;
  378. i = m;
  379. while (i > 0) {
  380. if (ii == jj) {
  381. #ifndef UNIT
  382. data01 = *(a1 + 0);
  383. data02 = *(a1 + 1);
  384. #endif
  385. compinv(b + 0, data01, data02);
  386. }
  387. if (ii < jj) {
  388. data01 = *(a1 + 0);
  389. data02 = *(a1 + 1);
  390. *(b + 0) = data01;
  391. *(b + 1) = data02;
  392. }
  393. a1 += lda;
  394. b += 2;
  395. i --;
  396. ii += 1;
  397. }
  398. // a += 2;
  399. // jj += 1;
  400. }
  401. return 0;
  402. }