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.

zhemm3m_ucopy_4.c 7.0 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217
  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. #ifndef USE_ALPHA
  41. #define REAL_PART(a, b) (a)
  42. #define IMAGE_PART(a, b) (b)
  43. #else
  44. #define REAL_PART(a, b) (alpha_r * (a) + alpha_i * (b))
  45. #define IMAGE_PART(a, b) (alpha_i * (a) - alpha_r * (b))
  46. #endif
  47. #if defined(REAL_ONLY)
  48. #define CMULT(a, b) (REAL_PART(a, b))
  49. #elif defined(IMAGE_ONLY)
  50. #define CMULT(a, b) (IMAGE_PART(a, b))
  51. #else
  52. #define CMULT(a, b) (REAL_PART(a, b) + IMAGE_PART(a, b))
  53. #endif
  54. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG posX, BLASLONG posY,
  55. #ifdef USE_ALPHA
  56. FLOAT alpha_r, FLOAT alpha_i,
  57. #endif
  58. FLOAT *b){
  59. BLASLONG i, js, offset;
  60. FLOAT data01, data02, data03, data04;
  61. FLOAT *ao1, *ao2, *ao3, *ao4;
  62. lda *= 2;
  63. js = (n >> 2);
  64. while (js > 0){
  65. offset = posX - posY;
  66. if (offset > 0) ao1 = a + posY * 2 + (posX + 0) * lda; else ao1 = a + (posX + 0) * 2 + posY * lda;
  67. if (offset > -1) ao2 = a + posY * 2 + (posX + 1) * lda; else ao2 = a + (posX + 1) * 2 + posY * lda;
  68. if (offset > -2) ao3 = a + posY * 2 + (posX + 2) * lda; else ao3 = a + (posX + 2) * 2 + posY * lda;
  69. if (offset > -3) ao4 = a + posY * 2 + (posX + 3) * lda; else ao4 = a + (posX + 3) * 2 + posY * lda;
  70. i = m;
  71. while (i > 0) {
  72. if (offset > 0) {
  73. data01 = CMULT(*(ao1 + 0), -*(ao1 + 1));
  74. data02 = CMULT(*(ao2 + 0), -*(ao2 + 1));
  75. data03 = CMULT(*(ao3 + 0), -*(ao3 + 1));
  76. data04 = CMULT(*(ao4 + 0), -*(ao4 + 1));
  77. } else
  78. if (offset < -3) {
  79. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  80. data02 = CMULT(*(ao2 + 0), *(ao2 + 1));
  81. data03 = CMULT(*(ao3 + 0), *(ao3 + 1));
  82. data04 = CMULT(*(ao4 + 0), *(ao4 + 1));
  83. } else {
  84. switch (offset) {
  85. case 0 :
  86. data01 = CMULT(*(ao1 + 0), ZERO);
  87. data02 = CMULT(*(ao2 + 0), -*(ao2 + 1));
  88. data03 = CMULT(*(ao3 + 0), -*(ao3 + 1));
  89. data04 = CMULT(*(ao4 + 0), -*(ao4 + 1));
  90. break;
  91. case -1 :
  92. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  93. data02 = CMULT(*(ao2 + 0), ZERO);
  94. data03 = CMULT(*(ao3 + 0), -*(ao3 + 1));
  95. data04 = CMULT(*(ao4 + 0), -*(ao4 + 1));
  96. break;
  97. case -2 :
  98. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  99. data02 = CMULT(*(ao2 + 0), *(ao2 + 1));
  100. data03 = CMULT(*(ao3 + 0), ZERO);
  101. data04 = CMULT(*(ao4 + 0), -*(ao4 + 1));
  102. break;
  103. case -3 :
  104. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  105. data02 = CMULT(*(ao2 + 0), *(ao2 + 1));
  106. data03 = CMULT(*(ao3 + 0), *(ao3 + 1));
  107. data04 = CMULT(*(ao4 + 0), ZERO);
  108. break;
  109. }
  110. }
  111. if (offset > 0) ao1 += 2; else ao1 += lda;
  112. if (offset > -1) ao2 += 2; else ao2 += lda;
  113. if (offset > -2) ao3 += 2; else ao3 += lda;
  114. if (offset > -3) ao4 += 2; else ao4 += lda;
  115. b[ 0] = data01;
  116. b[ 1] = data02;
  117. b[ 2] = data03;
  118. b[ 3] = data04;
  119. b += 4;
  120. offset --;
  121. i --;
  122. }
  123. posX += 4;
  124. js --;
  125. }
  126. if (n & 2) {
  127. offset = posX - posY;
  128. if (offset > 0) ao1 = a + posY * 2 + (posX + 0) * lda; else ao1 = a + (posX + 0) * 2 + posY * lda;
  129. if (offset > -1) ao2 = a + posY * 2 + (posX + 1) * lda; else ao2 = a + (posX + 1) * 2 + posY * lda;
  130. i = m;
  131. while (i > 0) {
  132. if (offset > 0) {
  133. data01 = CMULT(*(ao1 + 0), -*(ao1 + 1));
  134. data02 = CMULT(*(ao2 + 0), -*(ao2 + 1));
  135. } else
  136. if (offset < -1) {
  137. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  138. data02 = CMULT(*(ao2 + 0), *(ao2 + 1));
  139. } else {
  140. switch (offset) {
  141. case 0 :
  142. data01 = CMULT(*(ao1 + 0), ZERO);
  143. data02 = CMULT(*(ao2 + 0), -*(ao2 + 1));
  144. break;
  145. case -1 :
  146. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  147. data02 = CMULT(*(ao2 + 0), ZERO);
  148. break;
  149. }
  150. }
  151. if (offset > 0) ao1 += 2; else ao1 += lda;
  152. if (offset > -1) ao2 += 2; else ao2 += lda;
  153. b[ 0] = data01;
  154. b[ 1] = data02;
  155. b += 2;
  156. offset --;
  157. i --;
  158. }
  159. posX += 2;
  160. }
  161. if (n & 1) {
  162. offset = posX - posY;
  163. if (offset > 0) ao1 = a + posY * 2 + (posX + 0) * lda; else ao1 = a + (posX + 0) * 2 + posY * lda;
  164. i = m;
  165. while (i > 0) {
  166. if (offset > 0) {
  167. data01 = CMULT(*(ao1 + 0), -*(ao1 + 1));
  168. } else
  169. if (offset < 0) {
  170. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  171. } else {
  172. data01 = CMULT(*(ao1 + 0), ZERO);
  173. }
  174. if (offset > 0) ao1 += 2; else ao1 += lda;
  175. b[ 0] = data01;
  176. b ++;
  177. offset --;
  178. i --;
  179. }
  180. }
  181. return 0;
  182. }