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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  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, *a_offset3, *a_offset4;
  61. FLOAT *b_offset;
  62. FLOAT a1, a2, a3, a4, a5, a6, a7, a8;
  63. /* silence compiler warnings about unused-but-set variables:
  64. depending on compile-time arguments either the odd or the
  65. even-numbered variables will not be used */
  66. (void)a1;
  67. (void)a2;
  68. (void)a3;
  69. (void)a4;
  70. (void)a5;
  71. (void)a6;
  72. (void)a7;
  73. (void)a8;
  74. lda *= 2;
  75. a_offset = a;
  76. b_offset = b;
  77. j = (n >> 2);
  78. if (j > 0){
  79. do{
  80. a_offset1 = a_offset;
  81. a_offset2 = a_offset1 + lda;
  82. a_offset3 = a_offset2 + lda;
  83. a_offset4 = a_offset3 + lda;
  84. a_offset += 4 * lda;
  85. for (i = 0; i < m; i ++) {
  86. a1 = *(a_offset1 + 0);
  87. a2 = *(a_offset1 + 1);
  88. a3 = *(a_offset2 + 0);
  89. a4 = *(a_offset2 + 1);
  90. a5 = *(a_offset3 + 0);
  91. a6 = *(a_offset3 + 1);
  92. a7 = *(a_offset4 + 0);
  93. a8 = *(a_offset4 + 1);
  94. *(b_offset + 0) = CMULT(a1, a2);
  95. *(b_offset + 1) = CMULT(a3, a4);
  96. *(b_offset + 2) = CMULT(a5, a6);
  97. *(b_offset + 3) = CMULT(a7, a8);
  98. a_offset1 += 2;
  99. a_offset2 += 2;
  100. a_offset3 += 2;
  101. a_offset4 += 2;
  102. b_offset += 4;
  103. }
  104. j--;
  105. }while(j > 0);
  106. } /* end of if(j > 0) */
  107. if (n & 2) {
  108. a_offset1 = a_offset;
  109. a_offset2 = a_offset1 + lda;
  110. a_offset += 2 * lda;
  111. for (i = 0; i < m; i ++) {
  112. a1 = *(a_offset1 + 0);
  113. a2 = *(a_offset1 + 1);
  114. a3 = *(a_offset2 + 0);
  115. a4 = *(a_offset2 + 1);
  116. *(b_offset + 0) = CMULT(a1, a2);
  117. *(b_offset + 1) = CMULT(a3, a4);
  118. a_offset1 += 2;
  119. a_offset2 += 2;
  120. b_offset += 2;
  121. }
  122. }
  123. if (n & 1) {
  124. a_offset1 = a_offset;
  125. for (i = 0; i < m; i ++) {
  126. a1 = *(a_offset1 + 0);
  127. a2 = *(a_offset1 + 1);
  128. *(b_offset + 0) = CMULT(a1, a2);
  129. a_offset1 += 2;
  130. b_offset += 1;
  131. }
  132. }
  133. return 0;
  134. }