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.

ztrmm_uncopy_4.c 15 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679
  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 posX, BLASLONG posY, FLOAT *b){
  41. BLASLONG i, js;
  42. BLASLONG X;
  43. FLOAT data01, data02, data03, data04, data05, data06, data07, data08;
  44. FLOAT data09, data10, data11, data12, data13, data14, data15, data16;
  45. FLOAT data17, data18, data19, data20, data21, data22, data23, data24;
  46. FLOAT data25, data26, data27, data28, data29, data30, data31, data32;
  47. FLOAT *ao1, *ao2, *ao3, *ao4;
  48. lda += lda;
  49. js = (n >> 2);
  50. if (js > 0){
  51. do {
  52. X = posX;
  53. if (posX <= posY) {
  54. ao1 = a + posX * 2 + (posY + 0) * lda;
  55. ao2 = a + posX * 2 + (posY + 1) * lda;
  56. ao3 = a + posX * 2 + (posY + 2) * lda;
  57. ao4 = a + posX * 2 + (posY + 3) * lda;
  58. } else {
  59. ao1 = a + posY * 2 + (posX + 0) * lda;
  60. ao2 = a + posY * 2 + (posX + 1) * lda;
  61. ao3 = a + posY * 2 + (posX + 2) * lda;
  62. ao4 = a + posY * 2 + (posX + 3) * lda;
  63. }
  64. i = (m >> 2);
  65. if (i > 0) {
  66. do {
  67. if (X < posY) {
  68. data01 = *(ao1 + 0);
  69. data02 = *(ao1 + 1);
  70. data03 = *(ao1 + 2);
  71. data04 = *(ao1 + 3);
  72. data05 = *(ao1 + 4);
  73. data06 = *(ao1 + 5);
  74. data07 = *(ao1 + 6);
  75. data08 = *(ao1 + 7);
  76. data09 = *(ao2 + 0);
  77. data10 = *(ao2 + 1);
  78. data11 = *(ao2 + 2);
  79. data12 = *(ao2 + 3);
  80. data13 = *(ao2 + 4);
  81. data14 = *(ao2 + 5);
  82. data15 = *(ao2 + 6);
  83. data16 = *(ao2 + 7);
  84. data17 = *(ao3 + 0);
  85. data18 = *(ao3 + 1);
  86. data19 = *(ao3 + 2);
  87. data20 = *(ao3 + 3);
  88. data21 = *(ao3 + 4);
  89. data22 = *(ao3 + 5);
  90. data23 = *(ao3 + 6);
  91. data24 = *(ao3 + 7);
  92. data25 = *(ao4 + 0);
  93. data26 = *(ao4 + 1);
  94. data27 = *(ao4 + 2);
  95. data28 = *(ao4 + 3);
  96. data29 = *(ao4 + 4);
  97. data30 = *(ao4 + 5);
  98. data31 = *(ao4 + 6);
  99. data32 = *(ao4 + 7);
  100. b[ 0] = data01;
  101. b[ 1] = data02;
  102. b[ 2] = data09;
  103. b[ 3] = data10;
  104. b[ 4] = data17;
  105. b[ 5] = data18;
  106. b[ 6] = data25;
  107. b[ 7] = data26;
  108. b[ 8] = data03;
  109. b[ 9] = data04;
  110. b[10] = data11;
  111. b[11] = data12;
  112. b[12] = data19;
  113. b[13] = data20;
  114. b[14] = data27;
  115. b[15] = data28;
  116. b[16] = data05;
  117. b[17] = data06;
  118. b[18] = data13;
  119. b[19] = data14;
  120. b[20] = data21;
  121. b[21] = data22;
  122. b[22] = data29;
  123. b[23] = data30;
  124. b[24] = data07;
  125. b[25] = data08;
  126. b[26] = data15;
  127. b[27] = data16;
  128. b[28] = data23;
  129. b[29] = data24;
  130. b[30] = data31;
  131. b[31] = data32;
  132. ao1 += 8;
  133. ao2 += 8;
  134. ao3 += 8;
  135. ao4 += 8;
  136. b += 32;
  137. } else
  138. if (X > posY) {
  139. ao1 += 4 * lda;
  140. ao2 += 4 * lda;
  141. ao3 += 4 * lda;
  142. ao4 += 4 * lda;
  143. b += 32;
  144. } else {
  145. #ifdef UNIT
  146. data09 = *(ao2 + 0);
  147. data10 = *(ao2 + 1);
  148. data17 = *(ao3 + 0);
  149. data18 = *(ao3 + 1);
  150. data19 = *(ao3 + 2);
  151. data20 = *(ao3 + 3);
  152. data25 = *(ao4 + 0);
  153. data26 = *(ao4 + 1);
  154. data27 = *(ao4 + 2);
  155. data28 = *(ao4 + 3);
  156. data29 = *(ao4 + 4);
  157. data30 = *(ao4 + 5);
  158. b[ 0] = ONE;
  159. b[ 1] = ZERO;
  160. b[ 2] = data09;
  161. b[ 3] = data10;
  162. b[ 4] = data17;
  163. b[ 5] = data18;
  164. b[ 6] = data25;
  165. b[ 7] = data26;
  166. b[ 8] = ZERO;
  167. b[ 9] = ZERO;
  168. b[10] = ONE;
  169. b[11] = ZERO;
  170. b[12] = data19;
  171. b[13] = data20;
  172. b[14] = data27;
  173. b[15] = data28;
  174. b[16] = ZERO;
  175. b[17] = ZERO;
  176. b[18] = ZERO;
  177. b[19] = ZERO;
  178. b[20] = ONE;
  179. b[21] = ZERO;
  180. b[22] = data29;
  181. b[23] = data30;
  182. b[24] = ZERO;
  183. b[25] = ZERO;
  184. b[26] = ZERO;
  185. b[27] = ZERO;
  186. b[28] = ZERO;
  187. b[29] = ZERO;
  188. b[30] = ONE;
  189. b[31] = ZERO;
  190. #else
  191. data01 = *(ao1 + 0);
  192. data02 = *(ao1 + 1);
  193. data09 = *(ao2 + 0);
  194. data10 = *(ao2 + 1);
  195. data11 = *(ao2 + 2);
  196. data12 = *(ao2 + 3);
  197. data17 = *(ao3 + 0);
  198. data18 = *(ao3 + 1);
  199. data19 = *(ao3 + 2);
  200. data20 = *(ao3 + 3);
  201. data21 = *(ao3 + 4);
  202. data22 = *(ao3 + 5);
  203. data25 = *(ao4 + 0);
  204. data26 = *(ao4 + 1);
  205. data27 = *(ao4 + 2);
  206. data28 = *(ao4 + 3);
  207. data29 = *(ao4 + 4);
  208. data30 = *(ao4 + 5);
  209. data31 = *(ao4 + 6);
  210. data32 = *(ao4 + 7);
  211. b[ 0] = data01;
  212. b[ 1] = data02;
  213. b[ 2] = data09;
  214. b[ 3] = data10;
  215. b[ 4] = data17;
  216. b[ 5] = data18;
  217. b[ 6] = data25;
  218. b[ 7] = data26;
  219. b[ 8] = ZERO;
  220. b[ 9] = ZERO;
  221. b[10] = data11;
  222. b[11] = data12;
  223. b[12] = data19;
  224. b[13] = data20;
  225. b[14] = data27;
  226. b[15] = data28;
  227. b[16] = ZERO;
  228. b[17] = ZERO;
  229. b[18] = ZERO;
  230. b[19] = ZERO;
  231. b[20] = data21;
  232. b[21] = data22;
  233. b[22] = data29;
  234. b[23] = data30;
  235. b[24] = ZERO;
  236. b[25] = ZERO;
  237. b[26] = ZERO;
  238. b[27] = ZERO;
  239. b[28] = ZERO;
  240. b[29] = ZERO;
  241. b[30] = data31;
  242. b[31] = data32;
  243. #endif
  244. ao1 += 8;
  245. ao2 += 8;
  246. ao3 += 8;
  247. ao4 += 8;
  248. b += 32;
  249. }
  250. X += 4;
  251. i --;
  252. } while (i > 0);
  253. }
  254. i = (m & 3);
  255. if (i) {
  256. if (X < posY) {
  257. if (m & 2) {
  258. data01 = *(ao1 + 0);
  259. data02 = *(ao1 + 1);
  260. data03 = *(ao1 + 2);
  261. data04 = *(ao1 + 3);
  262. data09 = *(ao2 + 0);
  263. data10 = *(ao2 + 1);
  264. data11 = *(ao2 + 2);
  265. data12 = *(ao2 + 3);
  266. data17 = *(ao3 + 0);
  267. data18 = *(ao3 + 1);
  268. data19 = *(ao3 + 2);
  269. data20 = *(ao3 + 3);
  270. data25 = *(ao4 + 0);
  271. data26 = *(ao4 + 1);
  272. data27 = *(ao4 + 2);
  273. data28 = *(ao4 + 3);
  274. b[ 0] = data01;
  275. b[ 1] = data02;
  276. b[ 2] = data09;
  277. b[ 3] = data10;
  278. b[ 4] = data17;
  279. b[ 5] = data18;
  280. b[ 6] = data25;
  281. b[ 7] = data26;
  282. b[ 8] = data03;
  283. b[ 9] = data04;
  284. b[10] = data11;
  285. b[11] = data12;
  286. b[12] = data19;
  287. b[13] = data20;
  288. b[14] = data27;
  289. b[15] = data28;
  290. ao1 += 4;
  291. ao2 += 4;
  292. ao3 += 4;
  293. ao4 += 4;
  294. b += 16;
  295. }
  296. if (m & 1) {
  297. data01 = *(ao1 + 0);
  298. data02 = *(ao1 + 1);
  299. data09 = *(ao2 + 0);
  300. data10 = *(ao2 + 1);
  301. data17 = *(ao3 + 0);
  302. data18 = *(ao3 + 1);
  303. data25 = *(ao4 + 0);
  304. data26 = *(ao4 + 1);
  305. b[ 0] = data01;
  306. b[ 1] = data02;
  307. b[ 2] = data09;
  308. b[ 3] = data10;
  309. b[ 4] = data17;
  310. b[ 5] = data18;
  311. b[ 6] = data25;
  312. b[ 7] = data26;
  313. /* ao1 += 2;
  314. ao2 += 2;
  315. ao3 += 2;
  316. ao4 += 2; */
  317. b += 8;
  318. }
  319. } else
  320. if (X > posY) {
  321. if (m & 2) {
  322. /* ao1 += 2 * lda;
  323. ao2 += 2 * lda; */
  324. b += 16;
  325. }
  326. if (m & 1) {
  327. // ao1 += lda;
  328. b += 8;
  329. }
  330. } else {
  331. #ifdef UNIT
  332. data09 = *(ao2 + 0);
  333. data10 = *(ao2 + 1);
  334. data17 = *(ao3 + 0);
  335. data18 = *(ao3 + 1);
  336. data25 = *(ao4 + 0);
  337. data26 = *(ao4 + 1);
  338. if (i >= 2) {
  339. data19 = *(ao3 + 2);
  340. data20 = *(ao3 + 3);
  341. data27 = *(ao4 + 2);
  342. data28 = *(ao4 + 3);
  343. }
  344. if (i >= 3) {
  345. data29 = *(ao4 + 4);
  346. data30 = *(ao4 + 5);
  347. }
  348. b[ 0] = ONE;
  349. b[ 1] = ZERO;
  350. b[ 2] = data09;
  351. b[ 3] = data10;
  352. b[ 4] = data17;
  353. b[ 5] = data18;
  354. b[ 6] = data25;
  355. b[ 7] = data26;
  356. b += 8;
  357. if (i >= 2) {
  358. b[ 0] = ZERO;
  359. b[ 1] = ZERO;
  360. b[ 2] = ONE;
  361. b[ 3] = ZERO;
  362. b[ 4] = data19;
  363. b[ 5] = data20;
  364. b[ 6] = data27;
  365. b[ 7] = data28;
  366. b += 8;
  367. }
  368. if (i >= 3) {
  369. b[ 0] = ZERO;
  370. b[ 1] = ZERO;
  371. b[ 2] = ZERO;
  372. b[ 3] = ZERO;
  373. b[ 4] = ONE;
  374. b[ 5] = ZERO;
  375. b[ 6] = data29;
  376. b[ 7] = data30;
  377. b += 8;
  378. }
  379. #else
  380. data01 = *(ao1 + 0);
  381. data02 = *(ao1 + 1);
  382. data09 = *(ao2 + 0);
  383. data10 = *(ao2 + 1);
  384. data17 = *(ao3 + 0);
  385. data18 = *(ao3 + 1);
  386. data25 = *(ao4 + 0);
  387. data26 = *(ao4 + 1);
  388. if (i >= 2) {
  389. data11 = *(ao2 + 2);
  390. data12 = *(ao2 + 3);
  391. data19 = *(ao3 + 2);
  392. data20 = *(ao3 + 3);
  393. data27 = *(ao4 + 2);
  394. data28 = *(ao4 + 3);
  395. }
  396. if (i >= 3) {
  397. data21 = *(ao3 + 4);
  398. data22 = *(ao3 + 5);
  399. data29 = *(ao4 + 4);
  400. data30 = *(ao4 + 5);
  401. }
  402. b[ 0] = data01;
  403. b[ 1] = data02;
  404. b[ 2] = data09;
  405. b[ 3] = data10;
  406. b[ 4] = data17;
  407. b[ 5] = data18;
  408. b[ 6] = data25;
  409. b[ 7] = data26;
  410. b += 8;
  411. if (i >= 2) {
  412. b[ 0] = ZERO;
  413. b[ 1] = ZERO;
  414. b[ 2] = data11;
  415. b[ 3] = data12;
  416. b[ 4] = data19;
  417. b[ 5] = data20;
  418. b[ 6] = data27;
  419. b[ 7] = data28;
  420. b += 8;
  421. }
  422. if (i >= 3) {
  423. b[ 0] = ZERO;
  424. b[ 1] = ZERO;
  425. b[ 2] = ZERO;
  426. b[ 3] = ZERO;
  427. b[ 4] = data21;
  428. b[ 5] = data22;
  429. b[ 6] = data29;
  430. b[ 7] = data30;
  431. b += 8;
  432. }
  433. #endif
  434. }
  435. }
  436. posY += 4;
  437. js --;
  438. } while (js > 0);
  439. } /* End of main loop */
  440. if (n & 2){
  441. X = posX;
  442. if (posX <= posY) {
  443. ao1 = a + posX * 2 + (posY + 0) * lda;
  444. ao2 = a + posX * 2 + (posY + 1) * lda;
  445. } else {
  446. ao1 = a + posY * 2 + (posX + 0) * lda;
  447. ao2 = a + posY * 2 + (posX + 1) * lda;
  448. }
  449. i = (m >> 1);
  450. if (i > 0) {
  451. do {
  452. if (X < posY) {
  453. data01 = *(ao1 + 0);
  454. data02 = *(ao1 + 1);
  455. data03 = *(ao1 + 2);
  456. data04 = *(ao1 + 3);
  457. data09 = *(ao2 + 0);
  458. data10 = *(ao2 + 1);
  459. data11 = *(ao2 + 2);
  460. data12 = *(ao2 + 3);
  461. b[ 0] = data01;
  462. b[ 1] = data02;
  463. b[ 2] = data09;
  464. b[ 3] = data10;
  465. b[ 4] = data03;
  466. b[ 5] = data04;
  467. b[ 6] = data11;
  468. b[ 7] = data12;
  469. ao1 += 4;
  470. ao2 += 4;
  471. b += 8;
  472. } else
  473. if (X > posY) {
  474. ao1 += 2 * lda;
  475. ao2 += 2 * lda;
  476. b += 8;
  477. } else {
  478. #ifdef UNIT
  479. data09 = *(ao2 + 0);
  480. data10 = *(ao2 + 1);
  481. b[ 0] = ONE;
  482. b[ 1] = ZERO;
  483. b[ 2] = data09;
  484. b[ 3] = data10;
  485. b[ 4] = ZERO;
  486. b[ 5] = ZERO;
  487. b[ 6] = ONE;
  488. b[ 7] = ZERO;
  489. #else
  490. data01 = *(ao1 + 0);
  491. data02 = *(ao1 + 1);
  492. data09 = *(ao2 + 0);
  493. data10 = *(ao2 + 1);
  494. data11 = *(ao2 + 2);
  495. data12 = *(ao2 + 3);
  496. b[ 0] = data01;
  497. b[ 1] = data02;
  498. b[ 2] = data09;
  499. b[ 3] = data10;
  500. b[ 4] = ZERO;
  501. b[ 5] = ZERO;
  502. b[ 6] = data11;
  503. b[ 7] = data12;
  504. #endif
  505. ao1 += 4;
  506. ao2 += 4;
  507. b += 8;
  508. }
  509. X += 2;
  510. i --;
  511. } while (i > 0);
  512. }
  513. i = (m & 1);
  514. if (i) {
  515. if (X < posY) {
  516. data01 = *(ao1 + 0);
  517. data02 = *(ao1 + 1);
  518. data09 = *(ao2 + 0);
  519. data10 = *(ao2 + 1);
  520. b[ 0] = data01;
  521. b[ 1] = data02;
  522. b[ 2] = data09;
  523. b[ 3] = data10;
  524. /* ao1 += 2;
  525. ao2 += 2; */
  526. b += 4;
  527. } else
  528. if (X > posY) {
  529. /* ao1 += 2 * lda;
  530. ao2 += 2 * lda; */
  531. b += 4;
  532. } else {
  533. #ifdef UNIT
  534. data09 = *(ao2 + 0);
  535. data10 = *(ao2 + 1);
  536. b[ 0] = ONE;
  537. b[ 1] = ZERO;
  538. b[ 2] = data09;
  539. b[ 3] = data10;
  540. #else
  541. data01 = *(ao1 + 0);
  542. data02 = *(ao1 + 1);
  543. data09 = *(ao2 + 0);
  544. data10 = *(ao2 + 1);
  545. b[ 0] = data01;
  546. b[ 1] = data02;
  547. b[ 2] = data09;
  548. b[ 3] = data10;
  549. #endif
  550. /* ao1 += 2;
  551. ao2 += 2; */
  552. b += 4;
  553. }
  554. }
  555. posY += 2;
  556. }
  557. if (n & 1){
  558. X = posX;
  559. if (posX <= posY) {
  560. ao1 = a + posX * 2 + (posY + 0) * lda;
  561. } else {
  562. ao1 = a + posY * 2 + (posX + 0) * lda;
  563. }
  564. i = m;
  565. if (m > 0) {
  566. do {
  567. if (X < posY) {
  568. data01 = *(ao1 + 0);
  569. data02 = *(ao1 + 1);
  570. b[ 0] = data01;
  571. b[ 1] = data02;
  572. ao1 += 2;
  573. b += 2;
  574. } else
  575. if (X > posY) {
  576. ao1 += lda;
  577. b += 2;
  578. } else {
  579. #ifdef UNIT
  580. b[ 0] = ONE;
  581. b[ 1] = ZERO;
  582. #else
  583. data01 = *(ao1 + 0);
  584. data02 = *(ao1 + 1);
  585. b[ 0] = data01;
  586. b[ 1] = data02;
  587. #endif
  588. ao1 += 2;
  589. b += 2;
  590. }
  591. X += 1;
  592. i --;
  593. } while (i > 0);
  594. }
  595. }
  596. return 0;
  597. }