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_2.c 6.0 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239
  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;
  44. FLOAT data05, data06, data07, data08;
  45. FLOAT *ao1, *ao2;
  46. lda += lda;
  47. js = (n >> 1);
  48. if (js > 0){
  49. do {
  50. X = posX;
  51. if (posX <= posY) {
  52. ao1 = a + posX * 2 + (posY + 0) * lda;
  53. ao2 = a + posX * 2 + (posY + 1) * lda;
  54. } else {
  55. ao1 = a + posY * 2 + (posX + 0) * lda;
  56. ao2 = a + posY * 2 + (posX + 1) * lda;
  57. }
  58. i = (m >> 1);
  59. if (i > 0) {
  60. do {
  61. if (X < posY) {
  62. data01 = *(ao1 + 0);
  63. data02 = *(ao1 + 1);
  64. data03 = *(ao1 + 2);
  65. data04 = *(ao1 + 3);
  66. data05 = *(ao2 + 0);
  67. data06 = *(ao2 + 1);
  68. data07 = *(ao2 + 2);
  69. data08 = *(ao2 + 3);
  70. b[ 0] = data01;
  71. b[ 1] = data02;
  72. b[ 2] = data05;
  73. b[ 3] = data06;
  74. b[ 4] = data03;
  75. b[ 5] = data04;
  76. b[ 6] = data07;
  77. b[ 7] = data08;
  78. ao1 += 4;
  79. ao2 += 4;
  80. b += 8;
  81. } else
  82. if (X > posY) {
  83. ao1 += 2 * lda;
  84. ao2 += 2 * lda;
  85. b += 8;
  86. } else {
  87. #ifdef UNIT
  88. data05 = *(ao2 + 0);
  89. data06 = *(ao2 + 1);
  90. b[ 0] = ONE;
  91. b[ 1] = ZERO;
  92. b[ 2] = data05;
  93. b[ 3] = data06;
  94. b[ 4] = ZERO;
  95. b[ 5] = ZERO;
  96. b[ 6] = ONE;
  97. b[ 7] = ZERO;
  98. #else
  99. data01 = *(ao1 + 0);
  100. data02 = *(ao1 + 1);
  101. /* data03 = *(ao1 + 2);
  102. data04 = *(ao1 + 3); */
  103. data05 = *(ao2 + 0);
  104. data06 = *(ao2 + 1);
  105. data07 = *(ao2 + 2);
  106. data08 = *(ao2 + 3);
  107. b[ 0] = data01;
  108. b[ 1] = data02;
  109. b[ 2] = data05;
  110. b[ 3] = data06;
  111. b[ 4] = ZERO;
  112. b[ 5] = ZERO;
  113. b[ 6] = data07;
  114. b[ 7] = data08;
  115. #endif
  116. ao1 += 2 * lda;
  117. ao2 += 2 * lda;
  118. b += 8;
  119. }
  120. X += 2;
  121. i --;
  122. } while (i > 0);
  123. }
  124. if (m & 1) {
  125. if (X < posY) {
  126. data01 = *(ao1 + 0);
  127. data02 = *(ao1 + 1);
  128. data03 = *(ao2 + 0);
  129. data04 = *(ao2 + 1);
  130. b[ 0] = data01;
  131. b[ 1] = data02;
  132. b[ 2] = data03;
  133. b[ 3] = data04;
  134. /* ao1 += 2;
  135. ao2 += 2; */
  136. b += 4;
  137. } else
  138. if (X > posY) {
  139. // ao1 += lda;
  140. b += 4;
  141. } else {
  142. #ifdef UNIT
  143. data03 = *(ao2 + 0);
  144. data04 = *(ao2 + 1);
  145. b[ 0] = ONE;
  146. b[ 1] = ZERO;
  147. b[ 2] = data03;
  148. b[ 3] = data04;
  149. #else
  150. data01 = *(ao1 + 0);
  151. data02 = *(ao1 + 1);
  152. data03 = *(ao2 + 0);
  153. data04 = *(ao2 + 1);
  154. b[ 0] = data01;
  155. b[ 1] = data02;
  156. b[ 2] = data03;
  157. b[ 3] = data04;
  158. #endif
  159. b += 4;
  160. }
  161. }
  162. posY += 2;
  163. js --;
  164. } while (js > 0);
  165. } /* End of main loop */
  166. if (n & 1){
  167. X = posX;
  168. if (posX <= posY) {
  169. ao1 = a + posX * 2 + (posY + 0) * lda;
  170. } else {
  171. ao1 = a + posY * 2 + (posX + 0) * lda;
  172. }
  173. i = m;
  174. if (m > 0) {
  175. do {
  176. if (X < posY) {
  177. data01 = *(ao1 + 0);
  178. data02 = *(ao1 + 1);
  179. b[ 0] = data01;
  180. b[ 1] = data02;
  181. ao1 += 2;
  182. b += 2;
  183. } else
  184. if (X > posY) {
  185. b += 2;
  186. ao1 += lda;
  187. } else {
  188. #ifdef UNIT
  189. b[ 0] = ONE;
  190. b[ 1] = ZERO;
  191. #else
  192. data01 = *(ao1 + 0);
  193. data02 = *(ao1 + 1);
  194. b[ 0] = data01;
  195. b[ 1] = data02;
  196. #endif
  197. b += 2;
  198. ao1 += lda;
  199. }
  200. X += 1;
  201. i --;
  202. } while (i > 0);
  203. }
  204. }
  205. return 0;
  206. }