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.

trmm_utcopy_4.c 10 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472
  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 *ao1, *ao2, *ao3, *ao4;
  46. js = (n >> 2);
  47. if (js > 0){
  48. do {
  49. X = posX;
  50. if (posX <= posY) {
  51. ao1 = a + posX + (posY + 0) * lda;
  52. ao2 = a + posX + (posY + 1) * lda;
  53. ao3 = a + posX + (posY + 2) * lda;
  54. ao4 = a + posX + (posY + 3) * lda;
  55. } else {
  56. ao1 = a + posY + (posX + 0) * lda;
  57. ao2 = a + posY + (posX + 1) * lda;
  58. ao3 = a + posY + (posX + 2) * lda;
  59. ao4 = a + posY + (posX + 3) * lda;
  60. }
  61. i = (m >> 2);
  62. if (i > 0) {
  63. do {
  64. if (X < posY) {
  65. ao1 += 4;
  66. ao2 += 4;
  67. ao3 += 4;
  68. ao4 += 4;
  69. b += 16;
  70. } else
  71. if (X > posY) {
  72. data01 = *(ao1 + 0);
  73. data02 = *(ao1 + 1);
  74. data03 = *(ao1 + 2);
  75. data04 = *(ao1 + 3);
  76. data05 = *(ao2 + 0);
  77. data06 = *(ao2 + 1);
  78. data07 = *(ao2 + 2);
  79. data08 = *(ao2 + 3);
  80. data09 = *(ao3 + 0);
  81. data10 = *(ao3 + 1);
  82. data11 = *(ao3 + 2);
  83. data12 = *(ao3 + 3);
  84. data13 = *(ao4 + 0);
  85. data14 = *(ao4 + 1);
  86. data15 = *(ao4 + 2);
  87. data16 = *(ao4 + 3);
  88. b[ 0] = data01;
  89. b[ 1] = data02;
  90. b[ 2] = data03;
  91. b[ 3] = data04;
  92. b[ 4] = data05;
  93. b[ 5] = data06;
  94. b[ 6] = data07;
  95. b[ 7] = data08;
  96. b[ 8] = data09;
  97. b[ 9] = data10;
  98. b[10] = data11;
  99. b[11] = data12;
  100. b[12] = data13;
  101. b[13] = data14;
  102. b[14] = data15;
  103. b[15] = data16;
  104. ao1 += 4 * lda;
  105. ao2 += 4 * lda;
  106. ao3 += 4 * lda;
  107. ao4 += 4 * lda;
  108. b += 16;
  109. } else {
  110. #ifdef UNIT
  111. data05 = *(ao2 + 0);
  112. data09 = *(ao3 + 0);
  113. data10 = *(ao3 + 1);
  114. data13 = *(ao4 + 0);
  115. data14 = *(ao4 + 1);
  116. data15 = *(ao4 + 2);
  117. b[ 0] = ONE;
  118. b[ 1] = ZERO;
  119. b[ 2] = ZERO;
  120. b[ 3] = ZERO;
  121. b[ 4] = data05;
  122. b[ 5] = ONE;
  123. b[ 6] = ZERO;
  124. b[ 7] = ZERO;
  125. b[ 8] = data09;
  126. b[ 9] = data10;
  127. b[10] = ONE;
  128. b[11] = ZERO;
  129. b[12] = data13;
  130. b[13] = data14;
  131. b[14] = data15;
  132. b[15] = ONE;
  133. #else
  134. data01 = *(ao1 + 0);
  135. data05 = *(ao2 + 0);
  136. data06 = *(ao2 + 1);
  137. data09 = *(ao3 + 0);
  138. data10 = *(ao3 + 1);
  139. data11 = *(ao3 + 2);
  140. data13 = *(ao4 + 0);
  141. data14 = *(ao4 + 1);
  142. data15 = *(ao4 + 2);
  143. data16 = *(ao4 + 3);
  144. b[ 0] = data01;
  145. b[ 1] = ZERO;
  146. b[ 2] = ZERO;
  147. b[ 3] = ZERO;
  148. b[ 4] = data05;
  149. b[ 5] = data06;
  150. b[ 6] = ZERO;
  151. b[ 7] = ZERO;
  152. b[ 8] = data09;
  153. b[ 9] = data10;
  154. b[10] = data11;
  155. b[11] = ZERO;
  156. b[12] = data13;
  157. b[13] = data14;
  158. b[14] = data15;
  159. b[15] = data16;
  160. #endif
  161. ao1 += 4 * lda;
  162. ao2 += 4 * lda;
  163. ao3 += 4 * lda;
  164. ao4 += 4 * lda;
  165. b += 16;
  166. }
  167. X += 4;
  168. i --;
  169. } while (i > 0);
  170. }
  171. i = (m & 3);
  172. if (i) {
  173. if (X < posY) {
  174. if (m & 2) {
  175. ao1 += 2;
  176. ao2 += 2;
  177. ao3 += 2;
  178. ao4 += 2;
  179. b += 8;
  180. }
  181. if (m & 1) {
  182. ao1 += 1;
  183. ao2 += 1;
  184. ao3 += 1;
  185. ao4 += 1;
  186. b += 4;
  187. }
  188. } else
  189. if (X > posY) {
  190. if (m & 2) {
  191. data01 = *(ao1 + 0);
  192. data02 = *(ao1 + 1);
  193. data03 = *(ao1 + 2);
  194. data04 = *(ao1 + 3);
  195. data05 = *(ao2 + 0);
  196. data06 = *(ao2 + 1);
  197. data07 = *(ao2 + 2);
  198. data08 = *(ao2 + 3);
  199. b[ 0] = data01;
  200. b[ 1] = data02;
  201. b[ 2] = data03;
  202. b[ 3] = data04;
  203. b[ 4] = data05;
  204. b[ 5] = data06;
  205. b[ 6] = data07;
  206. b[ 7] = data08;
  207. ao1 += 2 * lda;
  208. ao2 += 2 * lda;
  209. b += 8;
  210. }
  211. if (m & 1) {
  212. data01 = *(ao1 + 0);
  213. data02 = *(ao1 + 1);
  214. data03 = *(ao1 + 2);
  215. data04 = *(ao1 + 3);
  216. b[ 0] = data01;
  217. b[ 1] = data02;
  218. b[ 2] = data03;
  219. b[ 3] = data04;
  220. ao1 += lda;
  221. b += 4;
  222. }
  223. } else {
  224. #ifdef UNIT
  225. if (i >= 2) {
  226. data05 = *(ao2 + 0);
  227. }
  228. if (i >= 3) {
  229. data09 = *(ao3 + 0);
  230. data10 = *(ao3 + 1);
  231. }
  232. b[ 0] = ONE;
  233. b[ 1] = ZERO;
  234. b[ 2] = ZERO;
  235. b[ 3] = ZERO;
  236. b += 4;
  237. if(i >= 2) {
  238. b[ 0] = data05;
  239. b[ 1] = ONE;
  240. b[ 2] = ZERO;
  241. b[ 3] = ZERO;
  242. b += 4;
  243. }
  244. if (i >= 3) {
  245. b[ 0] = data09;
  246. b[ 1] = data10;
  247. b[ 2] = ONE;
  248. b[ 3] = ZERO;
  249. b += 4;
  250. }
  251. #else
  252. data01 = *(ao1 + 0);
  253. if (i >= 2) {
  254. data05 = *(ao2 + 0);
  255. data06 = *(ao2 + 1);
  256. }
  257. if (i >= 3) {
  258. data09 = *(ao3 + 0);
  259. data10 = *(ao3 + 1);
  260. data11 = *(ao3 + 2);
  261. }
  262. b[ 0] = data01;
  263. b[ 1] = ZERO;
  264. b[ 2] = ZERO;
  265. b[ 3] = ZERO;
  266. b += 4;
  267. if(i >= 2) {
  268. b[ 0] = data05;
  269. b[ 1] = data06;
  270. b[ 2] = ZERO;
  271. b[ 3] = ZERO;
  272. b += 4;
  273. }
  274. if (i >= 3) {
  275. b[ 0] = data09;
  276. b[ 1] = data10;
  277. b[ 2] = data11;
  278. b[ 3] = ZERO;
  279. b += 4;
  280. }
  281. #endif
  282. }
  283. }
  284. posY += 4;
  285. js --;
  286. } while (js > 0);
  287. } /* End of main loop */
  288. if (n & 2){
  289. X = posX;
  290. if (posX <= posY) {
  291. ao1 = a + posX + (posY + 0) * lda;
  292. ao2 = a + posX + (posY + 1) * lda;
  293. } else {
  294. ao1 = a + posY + (posX + 0) * lda;
  295. ao2 = a + posY + (posX + 1) * lda;
  296. }
  297. i = (m >> 1);
  298. if (i > 0) {
  299. do {
  300. if (X < posY) {
  301. ao1 += 2;
  302. ao2 += 2;
  303. b += 4;
  304. } else
  305. if (X > posY) {
  306. data01 = *(ao1 + 0);
  307. data02 = *(ao1 + 1);
  308. data05 = *(ao2 + 0);
  309. data06 = *(ao2 + 1);
  310. b[ 0] = data01;
  311. b[ 1] = data02;
  312. b[ 2] = data05;
  313. b[ 3] = data06;
  314. ao1 += 2 * lda;
  315. ao2 += 2 * lda;
  316. b += 4;
  317. } else {
  318. #ifdef UNIT
  319. data05 = *(ao2 + 0);
  320. b[ 0] = ONE;
  321. b[ 1] = ZERO;
  322. b[ 2] = data05;
  323. b[ 3] = ONE;
  324. #else
  325. data01 = *(ao1 + 0);
  326. data05 = *(ao2 + 0);
  327. data06 = *(ao2 + 1);
  328. b[ 0] = data01;
  329. b[ 1] = ZERO;
  330. b[ 2] = data05;
  331. b[ 3] = data06;
  332. #endif
  333. ao1 += 2 * lda;
  334. ao2 += 2 * lda;
  335. b += 4;
  336. }
  337. X += 2;
  338. i --;
  339. } while (i > 0);
  340. }
  341. i = (m & 1);
  342. if (i) {
  343. if (X < posY) {
  344. ao1 += 2;
  345. b += 2;
  346. } else
  347. if (X > posY) {
  348. data01 = *(ao1 + 0);
  349. data02 = *(ao1 + 1);
  350. b[ 0] = data01;
  351. b[ 1] = data02;
  352. ao1 += lda;
  353. b += 2;
  354. } else {
  355. #ifdef UNIT
  356. b[ 0] = ONE;
  357. b[ 1] = ZERO;
  358. #else
  359. data01 = *(ao1 + 0);
  360. b[ 0] = data01;
  361. b[ 1] = ZERO;
  362. #endif
  363. b += 2;
  364. }
  365. }
  366. posY += 2;
  367. }
  368. if (n & 1){
  369. X = posX;
  370. if (posX <= posY) {
  371. ao1 = a + posX + (posY + 0) * lda;
  372. } else {
  373. ao1 = a + posY + (posX + 0) * lda;
  374. }
  375. i = m;
  376. if (m > 0) {
  377. do {
  378. if (X < posY) {
  379. b += 1;
  380. ao1 += 1;
  381. } else
  382. if (X > posY) {
  383. data01 = *(ao1 + 0);
  384. b[ 0] = data01;
  385. ao1 += lda;
  386. b += 1;
  387. } else {
  388. #ifdef UNIT
  389. b[ 0] = ONE;
  390. #else
  391. data01 = *(ao1 + 0);
  392. b[ 0] = data01;
  393. #endif
  394. ao1 += lda;
  395. b += 1;
  396. }
  397. X += 1;
  398. i --;
  399. } while (i > 0);
  400. }
  401. }
  402. return 0;
  403. }