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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191
  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 *ao1, *ao2;
  45. js = (n >> 1);
  46. if (js > 0){
  47. do {
  48. X = posX;
  49. if (posX <= posY) {
  50. ao1 = a + posX + (posY + 0) * lda;
  51. ao2 = a + posX + (posY + 1) * lda;
  52. } else {
  53. ao1 = a + posY + (posX + 0) * lda;
  54. ao2 = a + posY + (posX + 1) * lda;
  55. }
  56. i = (m >> 1);
  57. if (i > 0) {
  58. do {
  59. if (X < posY) {
  60. ao1 += 2;
  61. ao2 += 2;
  62. b += 4;
  63. } else
  64. if (X > posY) {
  65. data01 = *(ao1 + 0);
  66. data02 = *(ao1 + 1);
  67. data03 = *(ao2 + 0);
  68. data04 = *(ao2 + 1);
  69. b[ 0] = data01;
  70. b[ 1] = data02;
  71. b[ 2] = data03;
  72. b[ 3] = data04;
  73. ao1 += 2 * lda;
  74. ao2 += 2 * lda;
  75. b += 4;
  76. } else {
  77. #ifdef UNIT
  78. data03 = *(ao2 + 0);
  79. b[ 0] = ONE;
  80. b[ 1] = ZERO;
  81. b[ 2] = data03;
  82. b[ 3] = ONE;
  83. #else
  84. data01 = *(ao1 + 0);
  85. data03 = *(ao2 + 0);
  86. data04 = *(ao2 + 1);
  87. b[ 0] = data01;
  88. b[ 1] = ZERO;
  89. b[ 2] = data03;
  90. b[ 3] = data04;
  91. #endif
  92. ao1 += 2 * lda;
  93. ao2 += 2 * lda;
  94. b += 4;
  95. }
  96. X += 2;
  97. i --;
  98. } while (i > 0);
  99. }
  100. if (m & 1) {
  101. if (X < posY) {
  102. ao1 += 1;
  103. ao2 += 1;
  104. b += 2;
  105. } else
  106. if (X > posY) {
  107. data01 = *(ao1 + 0);
  108. data02 = *(ao1 + 1);
  109. b[ 0] = data01;
  110. b[ 1] = data02;
  111. ao1 += lda;
  112. b += 2;
  113. } else {
  114. #ifdef UNIT
  115. b[ 0] = ONE;
  116. b[ 1] = ZERO;
  117. #else
  118. data01 = *(ao1 + 0);
  119. b[ 0] = data01;
  120. b[ 1] = ZERO;
  121. #endif
  122. ao1 += lda;
  123. b += 2;
  124. }
  125. }
  126. posY += 2;
  127. js --;
  128. } while (js > 0);
  129. } /* End of main loop */
  130. if (n & 1){
  131. X = posX;
  132. if (posX <= posY) {
  133. ao1 = a + posX + (posY + 0) * lda;
  134. } else {
  135. ao1 = a + posY + (posX + 0) * lda;
  136. }
  137. i = m;
  138. if (m > 0) {
  139. do {
  140. if (X < posY) {
  141. b += 1;
  142. ao1 += 1;
  143. } else
  144. if (X > posY) {
  145. data01 = *(ao1 + 0);
  146. b[ 0] = data01;
  147. b += 1;
  148. ao1 += lda;
  149. } else {
  150. #ifdef UNIT
  151. b[ 0] = ONE;
  152. #else
  153. data01 = *(ao1 + 0);
  154. b[ 0] = data01;
  155. #endif
  156. b += 1;
  157. ao1 += lda;
  158. }
  159. X += 1;
  160. i --;
  161. } while (i > 0);
  162. }
  163. }
  164. return 0;
  165. }