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_8.c 6.6 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216
  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 *a_offset5, *a_offset6, *a_offset7, *a_offset8;
  62. FLOAT *b_offset;
  63. FLOAT a1, a2, a3, a4, a5, a6, a7, a8;
  64. FLOAT a9, a10, a11, a12, a13, a14, a15, a16;
  65. #if 0
  66. #ifdef REAL_ONLY
  67. fprintf(stderr, "NON Real ");
  68. #elif defined(IMAGE_ONLY)
  69. fprintf(stderr, "NON Image ");
  70. #else
  71. fprintf(stderr, "NON Both ");
  72. #endif
  73. #ifdef ICOPY
  74. fprintf(stderr, " ICOPY %ld x %ld\n", m, n);
  75. #else
  76. fprintf(stderr, " OCOPY %ld x %ld\n", m, n);
  77. #endif
  78. #endif
  79. lda *= 2;
  80. a_offset = a;
  81. b_offset = b;
  82. j = (n >> 3);
  83. if (j > 0){
  84. do{
  85. a_offset1 = a_offset;
  86. a_offset2 = a_offset1 + lda;
  87. a_offset3 = a_offset2 + lda;
  88. a_offset4 = a_offset3 + lda;
  89. a_offset5 = a_offset4 + lda;
  90. a_offset6 = a_offset5 + lda;
  91. a_offset7 = a_offset6 + lda;
  92. a_offset8 = a_offset7 + lda;
  93. a_offset += 8 * lda;
  94. for (i = 0; i < m; i ++) {
  95. a1 = *(a_offset1 + 0);
  96. a2 = *(a_offset1 + 1);
  97. a3 = *(a_offset2 + 0);
  98. a4 = *(a_offset2 + 1);
  99. a5 = *(a_offset3 + 0);
  100. a6 = *(a_offset3 + 1);
  101. a7 = *(a_offset4 + 0);
  102. a8 = *(a_offset4 + 1);
  103. a9 = *(a_offset5 + 0);
  104. a10 = *(a_offset5 + 1);
  105. a11 = *(a_offset6 + 0);
  106. a12 = *(a_offset6 + 1);
  107. a13 = *(a_offset7 + 0);
  108. a14 = *(a_offset7 + 1);
  109. a15 = *(a_offset8 + 0);
  110. a16 = *(a_offset8 + 1);
  111. *(b_offset + 0) = CMULT(a1, a2);
  112. *(b_offset + 1) = CMULT(a3, a4);
  113. *(b_offset + 2) = CMULT(a5, a6);
  114. *(b_offset + 3) = CMULT(a7, a8);
  115. *(b_offset + 4) = CMULT(a9, a10);
  116. *(b_offset + 5) = CMULT(a11, a12);
  117. *(b_offset + 6) = CMULT(a13, a14);
  118. *(b_offset + 7) = CMULT(a15, a16);
  119. a_offset1 += 2;
  120. a_offset2 += 2;
  121. a_offset3 += 2;
  122. a_offset4 += 2;
  123. a_offset5 += 2;
  124. a_offset6 += 2;
  125. a_offset7 += 2;
  126. a_offset8 += 2;
  127. b_offset += 8;
  128. }
  129. j--;
  130. }while(j > 0);
  131. }
  132. if (n & 4){
  133. a_offset1 = a_offset;
  134. a_offset2 = a_offset1 + lda;
  135. a_offset3 = a_offset2 + lda;
  136. a_offset4 = a_offset3 + lda;
  137. a_offset += 4 * lda;
  138. for (i = 0; i < m; i ++) {
  139. a1 = *(a_offset1 + 0);
  140. a2 = *(a_offset1 + 1);
  141. a3 = *(a_offset2 + 0);
  142. a4 = *(a_offset2 + 1);
  143. a5 = *(a_offset3 + 0);
  144. a6 = *(a_offset3 + 1);
  145. a7 = *(a_offset4 + 0);
  146. a8 = *(a_offset4 + 1);
  147. *(b_offset + 0) = CMULT(a1, a2);
  148. *(b_offset + 1) = CMULT(a3, a4);
  149. *(b_offset + 2) = CMULT(a5, a6);
  150. *(b_offset + 3) = CMULT(a7, a8);
  151. a_offset1 += 2;
  152. a_offset2 += 2;
  153. a_offset3 += 2;
  154. a_offset4 += 2;
  155. b_offset += 4;
  156. }
  157. }
  158. if (n & 2){
  159. a_offset1 = a_offset;
  160. a_offset2 = a_offset1 + lda;
  161. a_offset += 2 * lda;
  162. for (i = 0; i < m; i ++) {
  163. a1 = *(a_offset1 + 0);
  164. a2 = *(a_offset1 + 1);
  165. a3 = *(a_offset2 + 0);
  166. a4 = *(a_offset2 + 1);
  167. *(b_offset + 0) = CMULT(a1, a2);
  168. *(b_offset + 1) = CMULT(a3, a4);
  169. a_offset1 += 2;
  170. a_offset2 += 2;
  171. b_offset += 2;
  172. }
  173. }
  174. if (n & 1){
  175. a_offset1 = a_offset;
  176. for (i = 0; i < m; i ++) {
  177. a1 = *(a_offset1 + 0);
  178. a2 = *(a_offset1 + 1);
  179. *(b_offset + 0) = CMULT(a1, a2);
  180. a_offset1 += 2;
  181. b_offset += 1;
  182. }
  183. }
  184. return 0;
  185. }