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

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