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.9 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237
  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. /* silence compiler warnings about unused-but-set variables:
  66. depending on compile-time arguments either the odd or the
  67. even-numbered variables will not be used */
  68. (void)a1;
  69. (void)a2;
  70. (void)a3;
  71. (void)a4;
  72. (void)a5;
  73. (void)a6;
  74. (void)a7;
  75. (void)a8;
  76. (void)a9;
  77. (void)a10;
  78. (void)a11;
  79. (void)a12;
  80. (void)a13;
  81. (void)a14;
  82. (void)a15;
  83. (void)a16;
  84. #if 0
  85. #ifdef REAL_ONLY
  86. fprintf(stderr, "NON Real ");
  87. #elif defined(IMAGE_ONLY)
  88. fprintf(stderr, "NON Image ");
  89. #else
  90. fprintf(stderr, "NON Both ");
  91. #endif
  92. #ifdef ICOPY
  93. fprintf(stderr, " ICOPY %ld x %ld\n", m, n);
  94. #else
  95. fprintf(stderr, " OCOPY %ld x %ld\n", m, n);
  96. #endif
  97. #endif
  98. lda *= 2;
  99. a_offset = a;
  100. b_offset = b;
  101. j = (n >> 3);
  102. if (j > 0){
  103. do{
  104. a_offset1 = a_offset;
  105. a_offset2 = a_offset1 + lda;
  106. a_offset3 = a_offset2 + lda;
  107. a_offset4 = a_offset3 + lda;
  108. a_offset5 = a_offset4 + lda;
  109. a_offset6 = a_offset5 + lda;
  110. a_offset7 = a_offset6 + lda;
  111. a_offset8 = a_offset7 + lda;
  112. a_offset += 8 * lda;
  113. for (i = 0; i < m; i ++) {
  114. a1 = *(a_offset1 + 0);
  115. a2 = *(a_offset1 + 1);
  116. a3 = *(a_offset2 + 0);
  117. a4 = *(a_offset2 + 1);
  118. a5 = *(a_offset3 + 0);
  119. a6 = *(a_offset3 + 1);
  120. a7 = *(a_offset4 + 0);
  121. a8 = *(a_offset4 + 1);
  122. a9 = *(a_offset5 + 0);
  123. a10 = *(a_offset5 + 1);
  124. a11 = *(a_offset6 + 0);
  125. a12 = *(a_offset6 + 1);
  126. a13 = *(a_offset7 + 0);
  127. a14 = *(a_offset7 + 1);
  128. a15 = *(a_offset8 + 0);
  129. a16 = *(a_offset8 + 1);
  130. *(b_offset + 0) = CMULT(a1, a2);
  131. *(b_offset + 1) = CMULT(a3, a4);
  132. *(b_offset + 2) = CMULT(a5, a6);
  133. *(b_offset + 3) = CMULT(a7, a8);
  134. *(b_offset + 4) = CMULT(a9, a10);
  135. *(b_offset + 5) = CMULT(a11, a12);
  136. *(b_offset + 6) = CMULT(a13, a14);
  137. *(b_offset + 7) = CMULT(a15, a16);
  138. a_offset1 += 2;
  139. a_offset2 += 2;
  140. a_offset3 += 2;
  141. a_offset4 += 2;
  142. a_offset5 += 2;
  143. a_offset6 += 2;
  144. a_offset7 += 2;
  145. a_offset8 += 2;
  146. b_offset += 8;
  147. }
  148. j--;
  149. }while(j > 0);
  150. }
  151. if (n & 4){
  152. a_offset1 = a_offset;
  153. a_offset2 = a_offset1 + lda;
  154. a_offset3 = a_offset2 + lda;
  155. a_offset4 = a_offset3 + lda;
  156. a_offset += 4 * lda;
  157. for (i = 0; i < m; i ++) {
  158. a1 = *(a_offset1 + 0);
  159. a2 = *(a_offset1 + 1);
  160. a3 = *(a_offset2 + 0);
  161. a4 = *(a_offset2 + 1);
  162. a5 = *(a_offset3 + 0);
  163. a6 = *(a_offset3 + 1);
  164. a7 = *(a_offset4 + 0);
  165. a8 = *(a_offset4 + 1);
  166. *(b_offset + 0) = CMULT(a1, a2);
  167. *(b_offset + 1) = CMULT(a3, a4);
  168. *(b_offset + 2) = CMULT(a5, a6);
  169. *(b_offset + 3) = CMULT(a7, a8);
  170. a_offset1 += 2;
  171. a_offset2 += 2;
  172. a_offset3 += 2;
  173. a_offset4 += 2;
  174. b_offset += 4;
  175. }
  176. }
  177. if (n & 2){
  178. a_offset1 = a_offset;
  179. a_offset2 = a_offset1 + lda;
  180. a_offset += 2 * lda;
  181. for (i = 0; i < m; i ++) {
  182. a1 = *(a_offset1 + 0);
  183. a2 = *(a_offset1 + 1);
  184. a3 = *(a_offset2 + 0);
  185. a4 = *(a_offset2 + 1);
  186. *(b_offset + 0) = CMULT(a1, a2);
  187. *(b_offset + 1) = CMULT(a3, a4);
  188. a_offset1 += 2;
  189. a_offset2 += 2;
  190. b_offset += 2;
  191. }
  192. }
  193. if (n & 1){
  194. a_offset1 = a_offset;
  195. for (i = 0; i < m; i ++) {
  196. a1 = *(a_offset1 + 0);
  197. a2 = *(a_offset1 + 1);
  198. *(b_offset + 0) = CMULT(a1, a2);
  199. a_offset1 += 2;
  200. b_offset += 1;
  201. }
  202. }
  203. return 0;
  204. }