OSchip
/
OpenBLAS
Not watched
1
0
Fork 0
Code
Releases 66 Wiki evaluate Activity
Issues 0 Pull Requests 0 Datasets Model Cloudbrain HPC
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.
Branch: develop
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'develop'
${ noResults }
OpenBLAS/kernel/generic/ztrmm_utcopy_8.c

882 lines
19 kB
Raw Permalink Blame History 

  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. 

  39. #include <stdio.h>

  40. #include "common.h"

  41. 

  42. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG posX, BLASLONG posY, FLOAT *b){

  43. 

  44.   BLASLONG i, js, ii;

  45.   BLASLONG X;

  46. 

  47.   FLOAT *a01, *a02, *a03 ,*a04, *a05, *a06, *a07, *a08;

  48. 

  49.   lda *= 2;

  50. 

  51.   js = (n >> 3);

  52. 

  53.   if (js > 0){

  54.     do {

  55.       X = posX;

  56. 

  57.       if (posX <= posY) {

  58. 	a01 = a + posX * 2 + (posY +  0) * lda;

  59. 	a02 = a + posX * 2 + (posY +  1) * lda;

  60. 	a03 = a + posX * 2 + (posY +  2) * lda;

  61. 	a04 = a + posX * 2 + (posY +  3) * lda;

  62. 	a05 = a + posX * 2 + (posY +  4) * lda;

  63. 	a06 = a + posX * 2 + (posY +  5) * lda;

  64. 	a07 = a + posX * 2 + (posY +  6) * lda;

  65. 	a08 = a + posX * 2 + (posY +  7) * lda;

  66.       } else {

  67. 	a01 = a + posY * 2 + (posX +  0) * lda;

  68. 	a02 = a + posY * 2 + (posX +  1) * lda;

  69. 	a03 = a + posY * 2 + (posX +  2) * lda;

  70. 	a04 = a + posY * 2 + (posX +  3) * lda;

  71. 	a05 = a + posY * 2 + (posX +  4) * lda;

  72. 	a06 = a + posY * 2 + (posX +  5) * lda;

  73. 	a07 = a + posY * 2 + (posX +  6) * lda;

  74. 	a08 = a + posY * 2 + (posX +  7) * lda;

  75.       }

  76. 

  77.       i = (m >> 3);

  78.       if (i > 0) {

  79. 	do {

  80. 	  if (X < posY) {

  81. 	    a01 += 16;

  82. 	    a02 += 16;

  83. 	    a03 += 16;

  84. 	    a04 += 16;

  85. 	    a05 += 16;

  86. 	    a06 += 16;

  87. 	    a07 += 16;

  88. 	    a08 += 16;

  89. 	    b += 128;

  90. 	  } else

  91. 	    if (X > posY) {

  92. 

  93. 	      for (ii = 0; ii < 8; ii++){

  94. 

  95. 		b[  0] = *(a01 +  0);

  96. 		b[  1] = *(a01 +  1);

  97. 		b[  2] = *(a01 +  2);

  98. 		b[  3] = *(a01 +  3);

  99. 		b[  4] = *(a01 +  4);

  100. 		b[  5] = *(a01 +  5);

  101. 		b[  6] = *(a01 +  6);

  102. 		b[  7] = *(a01 +  7);

  103. 

  104. 		b[  8] = *(a01 +  8);

  105. 		b[  9] = *(a01 +  9);

  106. 		b[ 10] = *(a01 + 10);

  107. 		b[ 11] = *(a01 + 11);

  108. 		b[ 12] = *(a01 + 12);

  109. 		b[ 13] = *(a01 + 13);

  110. 		b[ 14] = *(a01 + 14);

  111. 		b[ 15] = *(a01 + 15);

  112. 

  113. 		a01 += lda;

  114. 		b += 16;

  115. 	      }

  116. 

  117. 	      a02 += 8 * lda;

  118. 	      a03 += 8 * lda;

  119. 	      a04 += 8 * lda;

  120. 	      a05 += 8 * lda;

  121. 	      a06 += 8 * lda;

  122. 	      a07 += 8 * lda;

  123. 	      a08 += 8 * lda;

  124. 

  125. 	    } else {

  126. #ifdef UNIT

  127. 	      b[  0] = ONE;

  128. 	      b[  1] = ZERO;

  129. #else

  130. 	      b[  0] = *(a01 +  0);

  131. 	      b[  1] = *(a01 +  1);

  132. #endif

  133. 	      b[  2] = ZERO;

  134. 	      b[  3] = ZERO;

  135. 	      b[  4] = ZERO;

  136. 	      b[  5] = ZERO;

  137. 	      b[  6] = ZERO;

  138. 	      b[  7] = ZERO;

  139. 

  140. 	      b[  8] = ZERO;

  141. 	      b[  9] = ZERO;

  142. 	      b[ 10] = ZERO;

  143. 	      b[ 11] = ZERO;

  144. 	      b[ 12] = ZERO;

  145. 	      b[ 13] = ZERO;

  146. 	      b[ 14] = ZERO;

  147. 	      b[ 15] = ZERO;

  148. 

  149. 	      b[ 16] = *(a02 +  0);

  150. 	      b[ 17] = *(a02 +  1);

  151. #ifdef UNIT

  152. 	      b[ 18] = ONE;

  153. 	      b[ 19] = ZERO;

  154. #else

  155. 	      b[ 18] = *(a02 +  2);

  156. 	      b[ 19] = *(a02 +  3);

  157. #endif

  158. 	      b[ 20] = ZERO;

  159. 	      b[ 21] = ZERO;

  160. 	      b[ 22] = ZERO;

  161. 	      b[ 23] = ZERO;

  162. 	      b[ 24] = ZERO;

  163. 	      b[ 25] = ZERO;

  164. 	      b[ 26] = ZERO;

  165. 	      b[ 27] = ZERO;

  166. 	      b[ 28] = ZERO;

  167. 	      b[ 29] = ZERO;

  168. 	      b[ 30] = ZERO;

  169. 	      b[ 31] = ZERO;

  170. 

  171. 	      b[ 32] = *(a03 +  0);

  172. 	      b[ 33] = *(a03 +  1);

  173. 	      b[ 34] = *(a03 +  2);

  174. 	      b[ 35] = *(a03 +  3);

  175. #ifdef UNIT

  176. 	      b[ 36] = ONE;

  177. 	      b[ 37] = ZERO;

  178. #else

  179. 	      b[ 36] = *(a03 +  4);

  180. 	      b[ 37] = *(a03 +  5);

  181. #endif

  182. 	      b[ 38] = ZERO;

  183. 	      b[ 39] = ZERO;

  184. 	      b[ 40] = ZERO;

  185. 	      b[ 41] = ZERO;

  186. 	      b[ 42] = ZERO;

  187. 	      b[ 43] = ZERO;

  188. 	      b[ 44] = ZERO;

  189. 	      b[ 45] = ZERO;

  190. 	      b[ 46] = ZERO;

  191. 	      b[ 47] = ZERO;

  192. 

  193. 	      b[ 48] = *(a04 +  0);

  194. 	      b[ 49] = *(a04 +  1);

  195. 	      b[ 50] = *(a04 +  2);

  196. 	      b[ 51] = *(a04 +  3);

  197. 	      b[ 52] = *(a04 +  4);

  198. 	      b[ 53] = *(a04 +  5);

  199. #ifdef UNIT

  200. 	      b[ 54] = ONE;

  201. 	      b[ 55] = ZERO;

  202. #else

  203. 	      b[ 54] = *(a04 +  6);

  204. 	      b[ 55] = *(a04 +  7);

  205. #endif

  206. 	      b[ 56] = ZERO;

  207. 	      b[ 57] = ZERO;

  208. 	      b[ 58] = ZERO;

  209. 	      b[ 59] = ZERO;

  210. 	      b[ 60] = ZERO;

  211. 	      b[ 61] = ZERO;

  212. 	      b[ 62] = ZERO;

  213. 	      b[ 63] = ZERO;

  214. 

  215. 	      b[ 64] = *(a05 +  0);

  216. 	      b[ 65] = *(a05 +  1);

  217. 	      b[ 66] = *(a05 +  2);

  218. 	      b[ 67] = *(a05 +  3);

  219. 	      b[ 68] = *(a05 +  4);

  220. 	      b[ 69] = *(a05 +  5);

  221. 	      b[ 70] = *(a05 +  6);

  222. 	      b[ 71] = *(a05 +  7);

  223. #ifdef UNIT

  224. 	      b[ 72] = ONE;

  225. 	      b[ 73] = ZERO;

  226. #else

  227. 	      b[ 72] = *(a05 +  8);

  228. 	      b[ 73] = *(a05 +  9);

  229. #endif

  230. 	      b[ 74] = ZERO;

  231. 	      b[ 75] = ZERO;

  232. 	      b[ 76] = ZERO;

  233. 	      b[ 77] = ZERO;

  234. 	      b[ 78] = ZERO;

  235. 	      b[ 79] = ZERO;

  236. 

  237. 	      b[ 80] = *(a06 +  0);

  238. 	      b[ 81] = *(a06 +  1);

  239. 	      b[ 82] = *(a06 +  2);

  240. 	      b[ 83] = *(a06 +  3);

  241. 	      b[ 84] = *(a06 +  4);

  242. 	      b[ 85] = *(a06 +  5);

  243. 	      b[ 86] = *(a06 +  6);

  244. 	      b[ 87] = *(a06 +  7);

  245. 	      b[ 88] = *(a06 +  8);

  246. 	      b[ 89] = *(a06 +  9);

  247. #ifdef UNIT

  248. 	      b[ 90] = ONE;

  249. 	      b[ 91] = ZERO;

  250. #else

  251. 	      b[ 90] = *(a06 + 10);

  252. 	      b[ 91] = *(a06 + 11);

  253. #endif

  254. 	      b[ 92] = ZERO;

  255. 	      b[ 93] = ZERO;

  256. 	      b[ 94] = ZERO;

  257. 	      b[ 95] = ZERO;

  258. 

  259. 	      b[ 96] = *(a07 +  0);

  260. 	      b[ 97] = *(a07 +  1);

  261. 	      b[ 98] = *(a07 +  2);

  262. 	      b[ 99] = *(a07 +  3);

  263. 	      b[100] = *(a07 +  4);

  264. 	      b[101] = *(a07 +  5);

  265. 	      b[102] = *(a07 +  6);

  266. 	      b[103] = *(a07 +  7);

  267. 	      b[104] = *(a07 +  8);

  268. 	      b[105] = *(a07 +  9);

  269. 	      b[106] = *(a07 + 10);

  270. 	      b[107] = *(a07 + 11);

  271. #ifdef UNIT

  272. 	      b[108] = ONE;

  273. 	      b[109] = ZERO;

  274. #else

  275. 	      b[108] = *(a07 + 12);

  276. 	      b[109] = *(a07 + 13);

  277. #endif

  278. 	      b[110] = ZERO;

  279. 	      b[111] = ZERO;

  280. 

  281. 	      b[112] = *(a08 +  0);

  282. 	      b[113] = *(a08 +  1);

  283. 	      b[114] = *(a08 +  2);

  284. 	      b[115] = *(a08 +  3);

  285. 	      b[116] = *(a08 +  4);

  286. 	      b[117] = *(a08 +  5);

  287. 	      b[118] = *(a08 +  6);

  288. 	      b[119] = *(a08 +  7);

  289. 	      b[120] = *(a08 +  8);

  290. 	      b[121] = *(a08 +  9);

  291. 	      b[122] = *(a08 + 10);

  292. 	      b[123] = *(a08 + 11);

  293. 	      b[124] = *(a08 + 12);

  294. 	      b[125] = *(a08 + 13);

  295. #ifdef UNIT

  296. 	      b[126] = ONE;

  297. 	      b[127] = ZERO;

  298. #else

  299. 	      b[126] = *(a08 + 14);

  300. 	      b[127] = *(a08 + 15);

  301. #endif

  302. 	      a01 += 8 * lda;

  303. 	      a02 += 8 * lda;

  304. 	      a03 += 8 * lda;

  305. 	      a04 += 8 * lda;

  306. 	      a05 += 8 * lda;

  307. 	      a06 += 8 * lda;

  308. 	      a07 += 8 * lda;

  309. 	      a08 += 8 * lda;

  310. 	      b += 128;

  311. 	    }

  312. 

  313. 	  X += 8;

  314. 	  i --;

  315. 	} while (i > 0);

  316.       }

  317. 

  318.       i = (m & 7);

  319.       if (i) {

  320. 

  321. 	if (X < posY) {

  322. 

  323. 	    /* a01 += 2 * i;

  324. 	    a02 += 2 * i;

  325. 	    a03 += 2 * i;

  326. 	    a04 += 2 * i;

  327. 	    a05 += 2 * i;

  328. 	    a06 += 2 * i;

  329. 	    a07 += 2 * i;

  330. 	    a08 += 2 * i; */

  331. 	    b += 16 * i;

  332. 	} else

  333. 	  if (X > posY) {

  334. 

  335. 	    for (ii = 0; ii < i; ii++){

  336. 

  337. 	      b[  0] = *(a01 +  0);

  338. 	      b[  1] = *(a01 +  1);

  339. 	      b[  2] = *(a01 +  2);

  340. 	      b[  3] = *(a01 +  3);

  341. 	      b[  4] = *(a01 +  4);

  342. 	      b[  5] = *(a01 +  5);

  343. 	      b[  6] = *(a01 +  6);

  344. 	      b[  7] = *(a01 +  7);

  345. 

  346. 	      b[  8] = *(a01 +  8);

  347. 	      b[  9] = *(a01 +  9);

  348. 	      b[ 10] = *(a01 + 10);

  349. 	      b[ 11] = *(a01 + 11);

  350. 	      b[ 12] = *(a01 + 12);

  351. 	      b[ 13] = *(a01 + 13);

  352. 	      b[ 14] = *(a01 + 14);

  353. 	      b[ 15] = *(a01 + 15);

  354. 

  355. 	      a01 += lda;

  356. 	      a02 += lda;

  357. 	      a03 += lda;

  358. 	      a04 += lda;

  359. 	      a05 += lda;

  360. 	      a06 += lda;

  361. 	      a07 += lda;

  362. 	      a08 += lda;

  363. 	      b += 16;

  364. 	    }

  365. 	  } else {

  366. 

  367. #ifdef UNIT

  368. 	    b[ 0] = ONE;

  369. 	    b[ 1] = ZERO;

  370. #else

  371. 	    b[ 0] = *(a01 +  0);

  372. 	    b[ 1] = *(a01 +  1);

  373. #endif

  374. 	    b[ 2] = ZERO;

  375. 	    b[ 3] = ZERO;

  376. 	    b[ 4] = ZERO;

  377. 	    b[ 5] = ZERO;

  378. 	    b[ 6] = ZERO;

  379. 	    b[ 7] = ZERO;

  380. 	    b[ 8] = ZERO;

  381. 	    b[ 9] = ZERO;

  382. 	    b[10] = ZERO;

  383. 	    b[11] = ZERO;

  384. 	    b[12] = ZERO;

  385. 	    b[13] = ZERO;

  386. 	    b[14] = ZERO;

  387. 	    b[15] = ZERO;

  388. 	    b += 16;

  389. 

  390. 	    if(i >= 2) {

  391. 	      b[ 0] = *(a02 +  0);

  392. 	      b[ 1] = *(a02 +  1);

  393. #ifdef UNIT

  394. 	      b[ 2] = ONE;

  395. 	      b[ 3] = ZERO;

  396. #else

  397. 	      b[ 2] = *(a02 +  2);

  398. 	      b[ 3] = *(a02 +  3);

  399. #endif

  400. 	      b[ 4] = ZERO;

  401. 	      b[ 5] = ZERO;

  402. 	      b[ 6] = ZERO;

  403. 	      b[ 7] = ZERO;

  404. 	      b[ 8] = ZERO;

  405. 	      b[ 9] = ZERO;

  406. 	      b[10] = ZERO;

  407. 	      b[11] = ZERO;

  408. 	      b[12] = ZERO;

  409. 	      b[13] = ZERO;

  410. 	      b[14] = ZERO;

  411. 	      b[15] = ZERO;

  412. 	      b += 16;

  413. 	    }

  414. 

  415. 	    if (i >= 3) {

  416. 	      b[ 0] = *(a03 +  0);

  417. 	      b[ 1] = *(a03 +  1);

  418. 	      b[ 2] = *(a03 +  2);

  419. 	      b[ 3] = *(a03 +  3);

  420. #ifdef UNIT

  421. 	      b[ 4] = ONE;

  422. 	      b[ 5] = ZERO;

  423. #else

  424. 	      b[ 4] = *(a03 +  4);

  425. 	      b[ 5] = *(a03 +  5);

  426. #endif

  427. 	      b[ 6] = ZERO;

  428. 	      b[ 7] = ZERO;

  429. 	      b[ 8] = ZERO;

  430. 	      b[ 9] = ZERO;

  431. 	      b[10] = ZERO;

  432. 	      b[11] = ZERO;

  433. 	      b[12] = ZERO;

  434. 	      b[13] = ZERO;

  435. 	      b[14] = ZERO;

  436. 	      b[15] = ZERO;

  437. 	      b += 16;

  438. 	    }

  439. 

  440. 	    if (i >= 4) {

  441. 	      b[ 0] = *(a04 +  0);

  442. 	      b[ 1] = *(a04 +  1);

  443. 	      b[ 2] = *(a04 +  2);

  444. 	      b[ 3] = *(a04 +  3);

  445. 	      b[ 4] = *(a04 +  4);

  446. 	      b[ 5] = *(a04 +  5);

  447. #ifdef UNIT

  448. 	      b[ 6] = ONE;

  449. 	      b[ 7] = ZERO;

  450. #else

  451. 	      b[ 6] = *(a04 +  6);

  452. 	      b[ 7] = *(a04 +  7);

  453. #endif

  454. 	      b[ 8] = ZERO;

  455. 	      b[ 9] = ZERO;

  456. 	      b[10] = ZERO;

  457. 	      b[11] = ZERO;

  458. 	      b[12] = ZERO;

  459. 	      b[13] = ZERO;

  460. 	      b[14] = ZERO;

  461. 	      b[15] = ZERO;

  462. 	      b += 16;

  463. 	    }

  464. 

  465. 	    if (i >= 5) {

  466. 	      b[ 0] = *(a05 +  0);

  467. 	      b[ 1] = *(a05 +  1);

  468. 	      b[ 2] = *(a05 +  2);

  469. 	      b[ 3] = *(a05 +  3);

  470. 	      b[ 4] = *(a05 +  4);

  471. 	      b[ 5] = *(a05 +  5);

  472. 	      b[ 6] = *(a05 +  6);

  473. 	      b[ 7] = *(a05 +  7);

  474. #ifdef UNIT

  475. 	      b[ 8] = ONE;

  476. 	      b[ 9] = ZERO;

  477. #else

  478. 	      b[ 8] = *(a05 +  8);

  479. 	      b[ 9] = *(a05 +  9);

  480. #endif

  481. 	      b[10] = ZERO;

  482. 	      b[11] = ZERO;

  483. 	      b[12] = ZERO;

  484. 	      b[13] = ZERO;

  485. 	      b[14] = ZERO;

  486. 	      b[15] = ZERO;

  487. 	      b += 16;

  488. 	    }

  489. 

  490. 	    if (i >= 6) {

  491. 	      b[ 0] = *(a06 +  0);

  492. 	      b[ 1] = *(a06 +  1);

  493. 	      b[ 2] = *(a06 +  2);

  494. 	      b[ 3] = *(a06 +  3);

  495. 	      b[ 4] = *(a06 +  4);

  496. 	      b[ 5] = *(a06 +  5);

  497. 	      b[ 6] = *(a06 +  6);

  498. 	      b[ 7] = *(a06 +  7);

  499. 	      b[ 8] = *(a06 +  8);

  500. 	      b[ 9] = *(a06 +  9);

  501. #ifdef UNIT

  502. 	      b[10] = ONE;

  503. 	      b[11] = ZERO;

  504. #else

  505. 	      b[10] = *(a06 + 10);

  506. 	      b[11] = *(a06 + 11);

  507. #endif

  508. 	      b[12] = ZERO;

  509. 	      b[13] = ZERO;

  510. 	      b[14] = ZERO;

  511. 	      b[15] = ZERO;

  512. 	      b += 16;

  513. 	    }

  514. 

  515. 	    if (i >= 7) {

  516. 	      b[ 0] = *(a07 +  0);

  517. 	      b[ 1] = *(a07 +  1);

  518. 	      b[ 2] = *(a07 +  2);

  519. 	      b[ 3] = *(a07 +  3);

  520. 	      b[ 4] = *(a07 +  4);

  521. 	      b[ 5] = *(a07 +  5);

  522. 	      b[ 6] = *(a07 +  6);

  523. 	      b[ 7] = *(a07 +  7);

  524. 	      b[ 8] = *(a07 +  8);

  525. 	      b[ 9] = *(a07 +  9);

  526. 	      b[10] = *(a07 + 10);

  527. 	      b[11] = *(a07 + 11);

  528. #ifdef UNIT

  529. 	      b[12] = ONE;

  530. 	      b[13] = ZERO;

  531. #else

  532. 	      b[12] = *(a07 + 12);

  533. 	      b[13] = *(a07 + 13);

  534. #endif

  535. 	      b[14] = ZERO;

  536. 	      b[15] = ZERO;

  537. 	      b += 16;

  538. 	    }

  539. 	  }

  540.       }

  541. 

  542.       posY += 8;

  543.       js --;

  544.     } while (js > 0);

  545.   } /* End of main loop */

  546. 

  547. 

  548.   if (n & 4){

  549.     X = posX;

  550. 

  551.     if (posX <= posY) {

  552.       a01 = a + posX * 2 + (posY +  0) * lda;

  553.       a02 = a + posX * 2 + (posY +  1) * lda;

  554.       a03 = a + posX * 2 + (posY +  2) * lda;

  555.       a04 = a + posX * 2 + (posY +  3) * lda;

  556.     } else {

  557.       a01 = a + posY * 2 + (posX +  0) * lda;

  558.       a02 = a + posY * 2 + (posX +  1) * lda;

  559.       a03 = a + posY * 2 + (posX +  2) * lda;

  560.       a04 = a + posY * 2 + (posX +  3) * lda;

  561.     }

  562. 

  563.     i = (m >> 2);

  564.     if (i > 0) {

  565.       do {

  566. 	if (X < posY) {

  567. 	  a01 += 8;

  568. 	  a02 += 8;

  569. 	  a03 += 8;

  570. 	  a04 += 8;

  571. 	  b += 32;

  572. 	} else

  573. 	  if (X > posY) {

  574. 

  575. 	    for (ii = 0; ii < 4; ii++){

  576. 

  577. 	      b[  0] = *(a01 +  0);

  578. 	      b[  1] = *(a01 +  1);

  579. 	      b[  2] = *(a01 +  2);

  580. 	      b[  3] = *(a01 +  3);

  581. 	      b[  4] = *(a01 +  4);

  582. 	      b[  5] = *(a01 +  5);

  583. 	      b[  6] = *(a01 +  6);

  584. 	      b[  7] = *(a01 +  7);

  585. 

  586. 	      a01 += lda;

  587. 	      b += 8;

  588. 	    }

  589. 

  590. 	    a02 += 4 * lda;

  591. 	    a03 += 4 * lda;

  592. 	    a04 += 4 * lda;

  593. 

  594. 	  } else {

  595. #ifdef UNIT

  596. 	    b[  0] = ONE;

  597. 	    b[  1] = ZERO;

  598. #else

  599. 	    b[  0] = *(a01 +  0);

  600. 	    b[  1] = *(a01 +  1);

  601. #endif

  602. 	    b[  2] = ZERO;

  603. 	    b[  3] = ZERO;

  604. 	    b[  4] = ZERO;

  605. 	    b[  5] = ZERO;

  606. 	    b[  6] = ZERO;

  607. 	    b[  7] = ZERO;

  608. 

  609. 	    b[  8] = *(a02 +  0);

  610. 	    b[  9] = *(a02 +  1);

  611. #ifdef UNIT

  612. 	    b[ 10] = ONE;

  613. 	    b[ 11] = ZERO;

  614. #else

  615. 	    b[ 10] = *(a02 +  2);

  616. 	    b[ 11] = *(a02 +  3);

  617. #endif

  618. 	    b[ 12] = ZERO;

  619. 	    b[ 13] = ZERO;

  620. 	    b[ 14] = ZERO;

  621. 	    b[ 15] = ZERO;

  622. 

  623. 	    b[ 16] = *(a03 +  0);

  624. 	    b[ 17] = *(a03 +  1);

  625. 	    b[ 18] = *(a03 +  2);

  626. 	    b[ 19] = *(a03 +  3);

  627. #ifdef UNIT

  628. 	    b[ 20] = ONE;

  629. 	    b[ 21] = ZERO;

  630. #else

  631. 	    b[ 20] = *(a03 +  4);

  632. 	    b[ 21] = *(a03 +  5);

  633. #endif

  634. 	    b[ 22] = ZERO;

  635. 	    b[ 23] = ZERO;

  636. 

  637. 	    b[ 24] = *(a04 +  0);

  638. 	    b[ 25] = *(a04 +  1);

  639. 	    b[ 26] = *(a04 +  2);

  640. 	    b[ 27] = *(a04 +  3);

  641. 	    b[ 28] = *(a04 +  4);

  642. 	    b[ 29] = *(a04 +  5);

  643. #ifdef UNIT

  644. 	    b[ 30] = ONE;

  645. 	    b[ 31] = ZERO;

  646. #else

  647. 	    b[ 30] = *(a04 +  6);

  648. 	    b[ 31] = *(a04 +  7);

  649. #endif

  650. 

  651. 	    a01 += 4 * lda;

  652. 	    a02 += 4 * lda;

  653. 	    a03 += 4 * lda;

  654. 	    a04 += 4 * lda;

  655. 	    b += 32;

  656. 	  }

  657. 

  658. 	X += 4;

  659. 	i --;

  660.       } while (i > 0);

  661.     }

  662. 

  663.     i = (m & 3);

  664.     if (i) {

  665. 

  666.       if (X < posY) {

  667. 	/* a01 += 2 * i;

  668. 	a02 += 2 * i;

  669. 	a03 += 2 * i;

  670. 	a04 += 2 * i; */

  671. 	b += 8 * i;

  672.       } else

  673. 	if (X > posY) {

  674. 

  675. 	  for (ii = 0; ii < i; ii++){

  676. 

  677. 	    b[  0] = *(a01 +  0);

  678. 	    b[  1] = *(a01 +  1);

  679. 	    b[  2] = *(a01 +  2);

  680. 	    b[  3] = *(a01 +  3);

  681. 	    b[  4] = *(a01 +  4);

  682. 	    b[  5] = *(a01 +  5);

  683. 	    b[  6] = *(a01 +  6);

  684. 	    b[  7] = *(a01 +  7);

  685. 

  686. 	    a01 += lda;

  687. 	    a02 += lda;

  688. 	    a03 += lda;

  689. 	    a04 += lda;

  690. 	    b += 8;

  691. 	  }

  692. 	} else {

  693. 

  694. #ifdef UNIT

  695. 	  b[ 0] = ONE;

  696. 	  b[ 1] = ZERO;

  697. #else

  698. 	  b[ 0] = *(a01 +  0);

  699. 	  b[ 1] = *(a01 +  1);

  700. #endif

  701. 	  b[ 2] = ZERO;

  702. 	  b[ 3] = ZERO;

  703. 	  b[ 4] = ZERO;

  704. 	  b[ 5] = ZERO;

  705. 	  b[ 6] = ZERO;

  706. 	  b[ 7] = ZERO;

  707. 	  b += 8;

  708. 

  709. 	  if(i >= 2) {

  710. 	    b[ 0] = *(a02 +  0);

  711. 	    b[ 1] = *(a02 +  1);

  712. #ifdef UNIT

  713. 	    b[ 2] = ONE;

  714. 	    b[ 3] = ZERO;

  715. #else

  716. 	    b[ 2] = *(a02 +  2);

  717. 	    b[ 3] = *(a02 +  3);

  718. #endif

  719. 	    b[ 4] = ZERO;

  720. 	    b[ 5] = ZERO;

  721. 	    b[ 6] = ZERO;

  722. 	    b[ 7] = ZERO;

  723. 	    b += 8;

  724. 	  }

  725. 

  726. 	  if (i >= 3) {

  727. 	    b[ 0] = *(a03 +  0);

  728. 	    b[ 1] = *(a03 +  1);

  729. 	    b[ 2] = *(a03 +  2);

  730. 	    b[ 3] = *(a03 +  3);

  731. #ifdef UNIT

  732. 	    b[ 4] = ONE;

  733. 	    b[ 5] = ZERO;

  734. #else

  735. 	    b[ 4] = *(a03 +  4);

  736. 	    b[ 5] = *(a03 +  5);

  737. #endif

  738. 	    b[ 6] = ZERO;

  739. 	    b[ 7] = ZERO;

  740. 	    b += 8;

  741. 	  }

  742. 	}

  743.     }

  744. 

  745.     posY += 4;

  746.   }

  747. 

  748. 

  749.   if (n & 2){

  750.     X = posX;

  751. 

  752.     if (posX <= posY) {

  753.       a01 = a + posX * 2 + (posY +  0) * lda;

  754.       a02 = a + posX * 2 + (posY +  1) * lda;

  755.     } else {

  756.       a01 = a + posY * 2 + (posX +  0) * lda;

  757.       a02 = a + posY * 2 + (posX +  1) * lda;

  758.     }

  759. 

  760.     i = (m >> 1);

  761.     if (i > 0) {

  762.       do {

  763. 	if (X < posY) {

  764. 	    a01 += 4;

  765. 	    a02 += 4;

  766. 	    b += 8;

  767. 	} else

  768. 	  if (X > posY) {

  769. 	    b[  0] = *(a01 +  0);

  770. 	    b[  1] = *(a01 +  1);

  771. 	    b[  2] = *(a01 +  2);

  772. 	    b[  3] = *(a01 +  3);

  773. 	    b[  4] = *(a02 +  0);

  774. 	    b[  5] = *(a02 +  1);

  775. 	    b[  6] = *(a02 +  2);

  776. 	    b[  7] = *(a02 +  3);

  777. 

  778. 	    a01 += 2 * lda;

  779. 	    a02 += 2 * lda;

  780. 	    b += 8;

  781. 	  } else {

  782. 

  783. #ifdef UNIT

  784. 	    b[  0] = ONE;

  785. 	    b[  1] = ZERO;

  786. #else

  787. 	    b[  0] = *(a01 +  0);

  788. 	    b[  1] = *(a01 +  1);

  789. #endif

  790. 	    b[  2] = ZERO;

  791. 	    b[  3] = ZERO;

  792. 

  793. 	    b[  4] = *(a02 +  0);

  794. 	    b[  5] = *(a02 +  1);

  795. #ifdef UNIT

  796. 	    b[  6] = ONE;

  797. 	    b[  7] = ZERO;

  798. #else

  799. 	    b[  6] = *(a02 +  2);

  800. 	    b[  7] = *(a02 +  3);

  801. #endif

  802. 

  803. 	    a01 += 2 * lda;

  804. 	    a02 += 2 * lda;

  805. 	    b += 8;

  806. 	  }

  807. 

  808. 	X += 2;

  809. 	i --;

  810.       } while (i > 0);

  811.     }

  812. 

  813.     i = (m & 1);

  814.     if (i) {

  815. 

  816.       if (X < posY) {

  817. 	b += 4;

  818.       } else

  819. 	if (X > posY) {

  820. 	  b[  0] = *(a01 +  0);

  821. 	  b[  1] = *(a01 +  1);

  822. 	  b[  2] = *(a01 +  2);

  823. 	  b[  3] = *(a01 +  3);

  824. 	  b += 4;

  825. 	  }

  826. #if 1

  827. 	} 

  828. #else

  829. 	} else {	

  830. #ifdef UNIT

  831. 	  b[ 0] = ONE;

  832. 	  b[ 1] = ZERO;

  833. #else

  834. 	  b[ 0] = *(a01 +  0);

  835. 	  b[ 1] = *(a01 +  1);

  836. #endif

  837. 	  b[ 2] = *(a02 +  0);

  838. 	  b[ 3] = *(a02 +  1);

  839. 	  b += 4;

  840. 	}

  841. #endif	

  842.     posY += 2;

  843.   }

  844. 

  845.   if (n & 1){

  846.     X = posX;

  847. 

  848.     if (posX <= posY) {

  849.       a01 = a + posX * 2 + (posY +  0) * lda;

  850.     } else {

  851.       a01 = a + posY * 2 + (posX +  0) * lda;

  852.     }

  853. 

  854.     i = m;

  855.     if (m > 0) {

  856.       do {

  857. 	if (X < posY) {

  858. 	  a01 += 2;

  859. 	} else {

  860. #ifdef UNIT

  861. 	  if (X > posY) {

  862. #endif

  863. 	    b[  0] = *(a01 +  0);

  864. 	    b[  1] = *(a01 +  1);

  865. #ifdef UNIT

  866. 	  } else {

  867. 	    b[  0] = ONE;

  868. 	    b[  1] = ZERO;

  869. 	  }

  870. #endif

  871. 	  a01 += lda;

  872. 	}

  873. 	b += 2;

  874. 	X ++;

  875. 	i --;

  876.       } while (i > 0);

  877.     }

  878.   }

  879. 

  880.   return 0;

  881. }