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_utcopy_6.c 11 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556
  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 UNIT
  41. #define INV(a) (ONE / (a))
  42. #else
  43. #define INV(a) (ONE)
  44. #endif
  45. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG offset, FLOAT *b){
  46. BLASLONG i, ii, j, jj;
  47. FLOAT data01, data02, data03, data04, data05, data06;
  48. FLOAT data09, data10, data11, data12, data13, data14;
  49. FLOAT data17, data18, data19, data20, data21, data22;
  50. FLOAT data25, data26, data27, data28, data29, data30;
  51. FLOAT data33, data34, data35, data36, data37, data38;
  52. FLOAT data41, data42, data43, data44, data45, data46;
  53. FLOAT *a1, *a2, *a3, *a4, *a5, *a6, *a7, *a8;
  54. jj = offset;
  55. BLASLONG mmod6, nmod6, k;
  56. mmod6 = m - (m/6)*6 ;
  57. nmod6 = n - (n/6)*6 ;
  58. // j = (n >> 3);
  59. j = (n / 6);
  60. while (j > 0){
  61. a1 = a + 0 * lda;
  62. a2 = a + 1 * lda;
  63. a3 = a + 2 * lda;
  64. a4 = a + 3 * lda;
  65. a5 = a + 4 * lda;
  66. a6 = a + 5 * lda;
  67. // i = (m >> 3);
  68. i = (m / 6);
  69. ii = 0;
  70. while (i > 0) {
  71. if (ii == jj) {
  72. #ifndef UNIT
  73. data01 = *(a1 + 0);
  74. #endif
  75. data09 = *(a2 + 0);
  76. #ifndef UNIT
  77. data10 = *(a2 + 1);
  78. #endif
  79. data17 = *(a3 + 0);
  80. data18 = *(a3 + 1);
  81. #ifndef UNIT
  82. data19 = *(a3 + 2);
  83. #endif
  84. data25 = *(a4 + 0);
  85. data26 = *(a4 + 1);
  86. data27 = *(a4 + 2);
  87. #ifndef UNIT
  88. data28 = *(a4 + 3);
  89. #endif
  90. data33 = *(a5 + 0);
  91. data34 = *(a5 + 1);
  92. data35 = *(a5 + 2);
  93. data36 = *(a5 + 3);
  94. #ifndef UNIT
  95. data37 = *(a5 + 4);
  96. #endif
  97. data41 = *(a6 + 0);
  98. data42 = *(a6 + 1);
  99. data43 = *(a6 + 2);
  100. data44 = *(a6 + 3);
  101. data45 = *(a6 + 4);
  102. #ifndef UNIT
  103. data46 = *(a6 + 5);
  104. #endif
  105. *(b + 0) = INV(data01);
  106. *(b + 6) = data09;
  107. *(b + 7) = INV(data10);
  108. *(b + 12) = data17;
  109. *(b + 13) = data18;
  110. *(b + 14) = INV(data19);
  111. *(b + 18) = data25;
  112. *(b + 19) = data26;
  113. *(b + 20) = data27;
  114. *(b + 21) = INV(data28);
  115. *(b + 24) = data33;
  116. *(b + 25) = data34;
  117. *(b + 26) = data35;
  118. *(b + 27) = data36;
  119. *(b + 28) = INV(data37);
  120. *(b + 30) = data41;
  121. *(b + 31) = data42;
  122. *(b + 32) = data43;
  123. *(b + 33) = data44;
  124. *(b + 34) = data45;
  125. *(b + 35) = INV(data46);
  126. }
  127. if (ii > jj) {
  128. data01 = *(a1 + 0);
  129. data02 = *(a1 + 1);
  130. data03 = *(a1 + 2);
  131. data04 = *(a1 + 3);
  132. data05 = *(a1 + 4);
  133. data06 = *(a1 + 5);
  134. data09 = *(a2 + 0);
  135. data10 = *(a2 + 1);
  136. data11 = *(a2 + 2);
  137. data12 = *(a2 + 3);
  138. data13 = *(a2 + 4);
  139. data14 = *(a2 + 5);
  140. data17 = *(a3 + 0);
  141. data18 = *(a3 + 1);
  142. data19 = *(a3 + 2);
  143. data20 = *(a3 + 3);
  144. data21 = *(a3 + 4);
  145. data22 = *(a3 + 5);
  146. data25 = *(a4 + 0);
  147. data26 = *(a4 + 1);
  148. data27 = *(a4 + 2);
  149. data28 = *(a4 + 3);
  150. data29 = *(a4 + 4);
  151. data30 = *(a4 + 5);
  152. data33 = *(a5 + 0);
  153. data34 = *(a5 + 1);
  154. data35 = *(a5 + 2);
  155. data36 = *(a5 + 3);
  156. data37 = *(a5 + 4);
  157. data38 = *(a5 + 5);
  158. data41 = *(a6 + 0);
  159. data42 = *(a6 + 1);
  160. data43 = *(a6 + 2);
  161. data44 = *(a6 + 3);
  162. data45 = *(a6 + 4);
  163. data46 = *(a6 + 5);
  164. *(b + 0) = data01;
  165. *(b + 1) = data02;
  166. *(b + 2) = data03;
  167. *(b + 3) = data04;
  168. *(b + 4) = data05;
  169. *(b + 5) = data06;
  170. *(b + 6) = data09;
  171. *(b + 7) = data10;
  172. *(b + 8) = data11;
  173. *(b + 9) = data12;
  174. *(b + 10) = data13;
  175. *(b + 11) = data14;
  176. *(b + 12) = data17;
  177. *(b + 13) = data18;
  178. *(b + 14) = data19;
  179. *(b + 15) = data20;
  180. *(b + 16) = data21;
  181. *(b + 17) = data22;
  182. *(b + 18) = data25;
  183. *(b + 19) = data26;
  184. *(b + 20) = data27;
  185. *(b + 21) = data28;
  186. *(b + 22) = data29;
  187. *(b + 23) = data30;
  188. *(b + 24) = data33;
  189. *(b + 25) = data34;
  190. *(b + 26) = data35;
  191. *(b + 27) = data36;
  192. *(b + 28) = data37;
  193. *(b + 29) = data38;
  194. *(b + 30) = data41;
  195. *(b + 31) = data42;
  196. *(b + 32) = data43;
  197. *(b + 33) = data44;
  198. *(b + 34) = data45;
  199. *(b + 35) = data46;
  200. }
  201. a1 += 6 * lda;
  202. a2 += 6 * lda;
  203. a3 += 6 * lda;
  204. a4 += 6 * lda;
  205. a5 += 6 * lda;
  206. a6 += 6 * lda;
  207. a7 += 6 * lda;
  208. a8 += 6 * lda;
  209. b += 36;
  210. i --;
  211. ii += 6;
  212. }
  213. if (mmod6 & 4) {
  214. if (ii == jj) {
  215. #ifndef UNIT
  216. data01 = *(a1 + 0);
  217. #endif
  218. data09 = *(a2 + 0);
  219. #ifndef UNIT
  220. data10 = *(a2 + 1);
  221. #endif
  222. data17 = *(a3 + 0);
  223. data18 = *(a3 + 1);
  224. #ifndef UNIT
  225. data19 = *(a3 + 2);
  226. #endif
  227. data25 = *(a4 + 0);
  228. data26 = *(a4 + 1);
  229. data27 = *(a4 + 2);
  230. #ifndef UNIT
  231. data28 = *(a4 + 3);
  232. #endif
  233. *(b + 0) = INV(data01);
  234. *(b + 6) = data09;
  235. *(b + 7) = INV(data10);
  236. *(b + 12) = data17;
  237. *(b + 13) = data18;
  238. *(b + 14) = INV(data19);
  239. *(b + 18) = data25;
  240. *(b + 19) = data26;
  241. *(b + 20) = data27;
  242. *(b + 21) = INV(data28);
  243. }
  244. if (ii > jj) {
  245. data01 = *(a1 + 0);
  246. data02 = *(a1 + 1);
  247. data03 = *(a1 + 2);
  248. data04 = *(a1 + 3);
  249. data05 = *(a1 + 4);
  250. data06 = *(a1 + 5);
  251. data09 = *(a2 + 0);
  252. data10 = *(a2 + 1);
  253. data11 = *(a2 + 2);
  254. data12 = *(a2 + 3);
  255. data13 = *(a2 + 4);
  256. data14 = *(a2 + 5);
  257. data17 = *(a3 + 0);
  258. data18 = *(a3 + 1);
  259. data19 = *(a3 + 2);
  260. data20 = *(a3 + 3);
  261. data21 = *(a3 + 4);
  262. data22 = *(a3 + 5);
  263. data25 = *(a4 + 0);
  264. data26 = *(a4 + 1);
  265. data27 = *(a4 + 2);
  266. data28 = *(a4 + 3);
  267. data29 = *(a4 + 4);
  268. data30 = *(a4 + 5);
  269. *(b + 0) = data01;
  270. *(b + 1) = data02;
  271. *(b + 2) = data03;
  272. *(b + 3) = data04;
  273. *(b + 4) = data05;
  274. *(b + 5) = data06;
  275. *(b + 6) = data09;
  276. *(b + 7) = data10;
  277. *(b + 8) = data11;
  278. *(b + 9) = data12;
  279. *(b + 10) = data13;
  280. *(b + 11) = data14;
  281. *(b + 12) = data17;
  282. *(b + 13) = data18;
  283. *(b + 14) = data19;
  284. *(b + 15) = data20;
  285. *(b + 16) = data21;
  286. *(b + 17) = data22;
  287. *(b + 18) = data25;
  288. *(b + 19) = data26;
  289. *(b + 20) = data27;
  290. *(b + 21) = data28;
  291. *(b + 22) = data29;
  292. *(b + 23) = data30;
  293. }
  294. a1 += 4 * lda;
  295. a2 += 4 * lda;
  296. /* a3 += 4 * lda;
  297. a4 += 4 * lda; */
  298. b += 24;
  299. ii += 4;
  300. }
  301. if (mmod6 & 2) {
  302. if (ii == jj) {
  303. #ifndef UNIT
  304. data01 = *(a1 + 0);
  305. #endif
  306. data09 = *(a2 + 0);
  307. #ifndef UNIT
  308. data10 = *(a2 + 1);
  309. #endif
  310. *(b + 0) = INV(data01);
  311. *(b + 6) = data09;
  312. *(b + 7) = INV(data10);
  313. }
  314. if (ii > jj) {
  315. data01 = *(a1 + 0);
  316. data02 = *(a1 + 1);
  317. data03 = *(a1 + 2);
  318. data04 = *(a1 + 3);
  319. data05 = *(a1 + 4);
  320. data06 = *(a1 + 5);
  321. data09 = *(a2 + 0);
  322. data10 = *(a2 + 1);
  323. data11 = *(a2 + 2);
  324. data12 = *(a2 + 3);
  325. data13 = *(a2 + 4);
  326. data14 = *(a2 + 5);
  327. *(b + 0) = data01;
  328. *(b + 1) = data02;
  329. *(b + 2) = data03;
  330. *(b + 3) = data04;
  331. *(b + 4) = data05;
  332. *(b + 5) = data06;
  333. *(b + 6) = data09;
  334. *(b + 7) = data10;
  335. *(b + 8) = data11;
  336. *(b + 9) = data12;
  337. *(b + 10) = data13;
  338. *(b + 11) = data14;
  339. }
  340. a1 += 2 * lda;
  341. // a2 += 2 * lda;
  342. b += 12;
  343. ii += 2;
  344. }
  345. if (mmod6 & 1) {
  346. if (ii == jj) {
  347. #ifndef UNIT
  348. data01 = *(a1 + 0);
  349. #endif
  350. *(b + 0) = INV(data01);
  351. }
  352. if (ii > jj) {
  353. data01 = *(a1 + 0);
  354. data02 = *(a1 + 1);
  355. data03 = *(a1 + 2);
  356. data04 = *(a1 + 3);
  357. data05 = *(a1 + 4);
  358. data06 = *(a1 + 5);
  359. *(b + 0) = data01;
  360. *(b + 1) = data02;
  361. *(b + 2) = data03;
  362. *(b + 3) = data04;
  363. *(b + 4) = data05;
  364. *(b + 5) = data06;
  365. }
  366. b += 6;
  367. }
  368. a += 6;
  369. jj += 6;
  370. j --;
  371. }
  372. if (nmod6 & 4) {
  373. a1 = a;
  374. a += 4;
  375. ii = 0;
  376. for (i = 0; i < m; i++) {
  377. if ((ii >= jj ) && (ii - jj < 4)) {
  378. for (k = 0; k < ii - jj; k ++) {
  379. *(b + k) = *(a1 + k);
  380. }
  381. *(b + ii - jj) = INV(*(a1 + ii - jj));
  382. }
  383. if (ii - jj >= 4) {
  384. *(b + 0) = *(a1 + 0);
  385. *(b + 1) = *(a1 + 1);
  386. *(b + 2) = *(a1 + 2);
  387. *(b + 3) = *(a1 + 3);
  388. }
  389. b += 4;
  390. a1 += lda;
  391. ii ++;
  392. }
  393. jj += 4;
  394. }
  395. if (nmod6 & 2) {
  396. a1 = a + 0 * lda;
  397. a2 = a + 1 * lda;
  398. i = (m >> 1);
  399. ii = 0;
  400. while (i > 0) {
  401. if (ii == jj) {
  402. #ifndef UNIT
  403. data01 = *(a1 + 0);
  404. #endif
  405. data09 = *(a2 + 0);
  406. #ifndef UNIT
  407. data10 = *(a2 + 1);
  408. #endif
  409. *(b + 0) = INV(data01);
  410. *(b + 2) = data09;
  411. *(b + 3) = INV(data10);
  412. }
  413. if (ii > jj) {
  414. data01 = *(a1 + 0);
  415. data02 = *(a1 + 1);
  416. data09 = *(a2 + 0);
  417. data10 = *(a2 + 1);
  418. *(b + 0) = data01;
  419. *(b + 1) = data02;
  420. *(b + 2) = data09;
  421. *(b + 3) = data10;
  422. }
  423. a1 += 2 * lda;
  424. a2 += 2 * lda;
  425. b += 4;
  426. i --;
  427. ii += 2;
  428. }
  429. if (m & 1) {
  430. if (ii == jj) {
  431. #ifndef UNIT
  432. data01 = *(a1 + 0);
  433. #endif
  434. *(b + 0) = INV(data01);
  435. }
  436. if (ii > jj) {
  437. data01 = *(a1 + 0);
  438. data02 = *(a1 + 1);
  439. *(b + 0) = data01;
  440. *(b + 1) = data02;
  441. }
  442. b += 2;
  443. }
  444. a += 2;
  445. jj += 2;
  446. }
  447. if (nmod6 & 1) {
  448. a1 = a + 0 * lda;
  449. i = m;
  450. ii = 0;
  451. while (i > 0) {
  452. if (ii == jj) {
  453. #ifndef UNIT
  454. data01 = *(a1 + 0);
  455. #endif
  456. *(b + 0) = INV(data01);
  457. }
  458. if (ii > jj) {
  459. data01 = *(a1 + 0);
  460. *(b + 0) = data01;
  461. }
  462. a1 += lda;
  463. b += 1;
  464. i --;
  465. ii += 1;
  466. }
  467. }
  468. return 0;
  469. }