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.

zgemm3m_tcopy_2.c 4.9 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162
  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,
  55. #ifdef USE_ALPHA
  56. FLOAT alpha_r, FLOAT alpha_i,
  57. #endif
  58. FLOAT *b){
  59. BLASLONG i, j;
  60. FLOAT *a_offset, *a_offset1, *a_offset2;
  61. FLOAT *b_offset, *b_offset1, *b_offset2;
  62. FLOAT a1, a2, a3, a4, a5, a6, a7, a8;
  63. a_offset = a;
  64. b_offset = b;
  65. lda *= 2;
  66. b_offset2 = b + m * (n & ~1);
  67. j = (m >> 1);
  68. if (j > 0){
  69. do{
  70. a_offset1 = a_offset;
  71. a_offset2 = a_offset1 + lda;
  72. a_offset += 2 * lda;
  73. b_offset1 = b_offset;
  74. b_offset += 4;
  75. i = (n >> 1);
  76. if (i > 0){
  77. do{
  78. a1 = *(a_offset1 + 0);
  79. a2 = *(a_offset1 + 1);
  80. a3 = *(a_offset1 + 2);
  81. a4 = *(a_offset1 + 3);
  82. a5 = *(a_offset2 + 0);
  83. a6 = *(a_offset2 + 1);
  84. a7 = *(a_offset2 + 2);
  85. a8 = *(a_offset2 + 3);
  86. *(b_offset1 + 0) = CMULT(a1, a2);
  87. *(b_offset1 + 1) = CMULT(a3, a4);
  88. *(b_offset1 + 2) = CMULT(a5, a6);
  89. *(b_offset1 + 3) = CMULT(a7, a8);
  90. a_offset1 += 4;
  91. a_offset2 += 4;
  92. b_offset1 += m * 2;
  93. i --;
  94. }while(i > 0);
  95. }
  96. if (n & 1) {
  97. a1 = *(a_offset1 + 0);
  98. a2 = *(a_offset1 + 1);
  99. a3 = *(a_offset2 + 0);
  100. a4 = *(a_offset2 + 1);
  101. *(b_offset2 + 0) = CMULT(a1, a2);
  102. *(b_offset2 + 1) = CMULT(a3, a4);
  103. b_offset2 += 2;
  104. }
  105. j--;
  106. }while(j > 0);
  107. }
  108. if (m & 1){
  109. a_offset1 = a_offset;
  110. b_offset1 = b_offset;
  111. i = (n >> 1);
  112. if (i > 0){
  113. do{
  114. a1 = *(a_offset1 + 0);
  115. a2 = *(a_offset1 + 1);
  116. a3 = *(a_offset1 + 2);
  117. a4 = *(a_offset1 + 3);
  118. *(b_offset1 + 0) = CMULT(a1, a2);
  119. *(b_offset1 + 1) = CMULT(a3, a4);
  120. a_offset1 += 4;
  121. b_offset1 += 2 * m;
  122. i --;
  123. }while(i > 0);
  124. }
  125. if (n & 1) {
  126. a1 = *(a_offset1 + 0);
  127. a2 = *(a_offset1 + 1);
  128. *(b_offset2 + 0) = CMULT(a1, a2);
  129. }
  130. }
  131. return 0;
  132. }