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.

zsymm3m_ucopy_4.c 5.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158
  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. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  73. data02 = CMULT(*(ao2 + 0), *(ao2 + 1));
  74. data03 = CMULT(*(ao3 + 0), *(ao3 + 1));
  75. data04 = CMULT(*(ao4 + 0), *(ao4 + 1));
  76. if (offset > 0) ao1 += 2; else ao1 += lda;
  77. if (offset > -1) ao2 += 2; else ao2 += lda;
  78. if (offset > -2) ao3 += 2; else ao3 += lda;
  79. if (offset > -3) ao4 += 2; else ao4 += lda;
  80. b[ 0] = data01;
  81. b[ 1] = data02;
  82. b[ 2] = data03;
  83. b[ 3] = data04;
  84. b += 4;
  85. offset --;
  86. i --;
  87. }
  88. posX += 4;
  89. js --;
  90. }
  91. if (n & 2) {
  92. offset = posX - posY;
  93. if (offset > 0) ao1 = a + posY * 2 + (posX + 0) * lda; else ao1 = a + (posX + 0) * 2 + posY * lda;
  94. if (offset > -1) ao2 = a + posY * 2 + (posX + 1) * lda; else ao2 = a + (posX + 1) * 2 + posY * lda;
  95. i = m;
  96. while (i > 0) {
  97. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  98. data02 = CMULT(*(ao2 + 0), *(ao2 + 1));
  99. if (offset > 0) ao1 += 2; else ao1 += lda;
  100. if (offset > -1) ao2 += 2; else ao2 += lda;
  101. b[ 0] = data01;
  102. b[ 1] = data02;
  103. b += 2;
  104. offset --;
  105. i --;
  106. }
  107. posX += 2;
  108. }
  109. if (n & 1) {
  110. offset = posX - posY;
  111. if (offset > 0) ao1 = a + posY * 2 + (posX + 0) * lda; else ao1 = a + (posX + 0) * 2 + posY * lda;
  112. i = m;
  113. while (i > 0) {
  114. data01 = CMULT(*(ao1 + 0), *(ao1 + 1));
  115. if (offset > 0) ao1 += 2; else ao1 += lda;
  116. b[ 0] = data01;
  117. b ++;
  118. offset --;
  119. i --;
  120. }
  121. }
  122. return 0;
  123. }