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.

gemv.c 8.8 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307
  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. #include "l1param.h"
  41. #ifdef FUNCTION_PROFILE
  42. #include "functable.h"
  43. #endif
  44. #ifdef XDOUBLE
  45. #define ERROR_NAME "QGEMV "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "DGEMV "
  48. #else
  49. #define ERROR_NAME "SGEMV "
  50. #endif
  51. #ifdef SMP
  52. static int (*gemv_thread[])(BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT * , BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  53. #ifdef XDOUBLE
  54. qgemv_thread_n, qgemv_thread_t,
  55. #elif defined DOUBLE
  56. dgemv_thread_n, dgemv_thread_t,
  57. #else
  58. sgemv_thread_n, sgemv_thread_t,
  59. #endif
  60. };
  61. #endif
  62. #ifdef SMP
  63. #ifdef DYNAMIC_ARCH
  64. extern char* gotoblas_corename(void);
  65. #endif
  66. #if defined(DYNAMIC_ARCH) || defined(NEOVERSEV1)
  67. static inline int get_gemv_optimal_nthreads_neoversev1(BLASLONG MN, int ncpu) {
  68. #ifdef DOUBLE
  69. return (MN < 8100L) ? 1
  70. : (MN < 12100L) ? MIN(ncpu, 2)
  71. : (MN < 36100L) ? MIN(ncpu, 4)
  72. : (MN < 84100L) ? MIN(ncpu, 8)
  73. : (MN < 348100L) ? MIN(ncpu, 16)
  74. : (MN < 435600L) ? MIN(ncpu, 24)
  75. : (MN < 810000L) ? MIN(ncpu, 32)
  76. : (MN < 1050625L) ? MIN(ncpu, 40)
  77. : ncpu;
  78. #else
  79. return (MN < 25600L) ? 1
  80. : (MN < 63001L) ? MIN(ncpu, 4)
  81. : (MN < 459684L) ? MIN(ncpu, 16)
  82. : ncpu;
  83. #endif
  84. }
  85. #endif
  86. #if defined(DYNAMIC_ARCH) || defined(NEOVERSEV2)
  87. static inline int get_gemv_optimal_nthreads_neoversev2(BLASLONG MN, int ncpu) {
  88. return
  89. MN < 24964L ? 1
  90. : MN < 65536L ? MIN(ncpu, 8)
  91. : MN < 262144L ? MIN(ncpu, 32)
  92. : MN < 1638400L ? MIN(ncpu, 64)
  93. : ncpu;
  94. }
  95. #endif
  96. static inline int get_gemv_optimal_nthreads(BLASLONG MN) {
  97. int ncpu = num_cpu_avail(3);
  98. #if defined(_WIN64) && defined(_M_ARM64)
  99. if (MN > 100000000L)
  100. return num_cpu_avail(4);
  101. return 1;
  102. #endif
  103. #if defined(NEOVERSEV1) && !defined(COMPLEX) && !defined(BFLOAT16)
  104. return get_gemv_optimal_nthreads_neoversev1(MN, ncpu);
  105. #elif defined(NEOVERSEV2) && !defined(COMPLEX) && !defined(DOUBLE) && !defined(BFLOAT16)
  106. return get_gemv_optimal_nthreads_neoversev2(MN, ncpu);
  107. #elif defined(DYNAMIC_ARCH) && !defined(COMPLEX) && !defined(BFLOAT16)
  108. if (strcmp(gotoblas_corename(), "neoversev1") == 0) {
  109. return get_gemv_optimal_nthreads_neoversev1(MN, ncpu);
  110. }
  111. if (strcmp(gotoblas_corename(), "neoversev2") == 0) {
  112. return get_gemv_optimal_nthreads_neoversev2(MN, ncpu);
  113. }
  114. #endif
  115. if ( MN < 115200L * GEMM_MULTITHREAD_THRESHOLD )
  116. return 1;
  117. else
  118. return num_cpu_avail(2);
  119. }
  120. #endif
  121. #ifndef CBLAS
  122. void NAME(char *TRANS, blasint *M, blasint *N,
  123. FLOAT *ALPHA, FLOAT *a, blasint *LDA,
  124. FLOAT *x, blasint *INCX,
  125. FLOAT *BETA, FLOAT *y, blasint *INCY){
  126. char trans = *TRANS;
  127. blasint m = *M;
  128. blasint n = *N;
  129. blasint lda = *LDA;
  130. blasint incx = *INCX;
  131. blasint incy = *INCY;
  132. FLOAT alpha = *ALPHA;
  133. FLOAT beta = *BETA;
  134. FLOAT *buffer;
  135. int buffer_size;
  136. #ifdef SMP
  137. int nthreads;
  138. #endif
  139. int (*gemv[])(BLASLONG, BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT * , BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  140. GEMV_N, GEMV_T,
  141. };
  142. blasint info;
  143. blasint lenx, leny;
  144. blasint i;
  145. PRINT_DEBUG_NAME;
  146. TOUPPER(trans);
  147. info = 0;
  148. i = -1;
  149. if (trans == 'N') i = 0;
  150. if (trans == 'T') i = 1;
  151. if (trans == 'R') i = 0;
  152. if (trans == 'C') i = 1;
  153. if (incy == 0) info = 11;
  154. if (incx == 0) info = 8;
  155. if (lda < MAX(1, m)) info = 6;
  156. if (n < 0) info = 3;
  157. if (m < 0) info = 2;
  158. if (i < 0) info = 1;
  159. trans = i;
  160. if (info != 0){
  161. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  162. return;
  163. }
  164. #else
  165. void CNAME(enum CBLAS_ORDER order,
  166. enum CBLAS_TRANSPOSE TransA,
  167. blasint m, blasint n,
  168. FLOAT alpha,
  169. FLOAT *a, blasint lda,
  170. FLOAT *x, blasint incx,
  171. FLOAT beta,
  172. FLOAT *y, blasint incy){
  173. FLOAT *buffer;
  174. blasint lenx, leny;
  175. int trans, buffer_size;
  176. blasint info, t;
  177. #ifdef SMP
  178. int nthreads;
  179. #endif
  180. int (*gemv[])(BLASLONG, BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT * , BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  181. GEMV_N, GEMV_T,
  182. };
  183. PRINT_DEBUG_CNAME;
  184. trans = -1;
  185. info = 0;
  186. if (order == CblasColMajor) {
  187. if (TransA == CblasNoTrans) trans = 0;
  188. if (TransA == CblasTrans) trans = 1;
  189. if (TransA == CblasConjNoTrans) trans = 0;
  190. if (TransA == CblasConjTrans) trans = 1;
  191. info = -1;
  192. if (incy == 0) info = 11;
  193. if (incx == 0) info = 8;
  194. if (lda < MAX(1, m)) info = 6;
  195. if (n < 0) info = 3;
  196. if (m < 0) info = 2;
  197. if (trans < 0) info = 1;
  198. }
  199. if (order == CblasRowMajor) {
  200. if (TransA == CblasNoTrans) trans = 1;
  201. if (TransA == CblasTrans) trans = 0;
  202. if (TransA == CblasConjNoTrans) trans = 1;
  203. if (TransA == CblasConjTrans) trans = 0;
  204. info = -1;
  205. t = n;
  206. n = m;
  207. m = t;
  208. if (incy == 0) info = 11;
  209. if (incx == 0) info = 8;
  210. if (lda < MAX(1, m)) info = 6;
  211. if (n < 0) info = 3;
  212. if (m < 0) info = 2;
  213. if (trans < 0) info = 1;
  214. }
  215. if (info >= 0) {
  216. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  217. return;
  218. }
  219. #endif
  220. if ((m==0) || (n==0)) return;
  221. lenx = n;
  222. leny = m;
  223. if (trans) lenx = m;
  224. if (trans) leny = n;
  225. if (beta != ONE) SCAL_K(leny, 0, 0, beta, y, blasabs(incy), NULL, 0, NULL, 0);
  226. if (alpha == ZERO) return;
  227. IDEBUG_START;
  228. FUNCTION_PROFILE_START();
  229. if (incx < 0) x -= (lenx - 1) * incx;
  230. if (incy < 0) y -= (leny - 1) * incy;
  231. buffer_size = m + n + 128 / sizeof(FLOAT);
  232. #ifdef WINDOWS_ABI
  233. buffer_size += 160 / sizeof(FLOAT) ;
  234. #endif
  235. // for alignment
  236. buffer_size = (buffer_size + 3) & ~3;
  237. STACK_ALLOC(buffer_size, FLOAT, buffer);
  238. #ifdef SMP
  239. nthreads = get_gemv_optimal_nthreads(1L * m * n);
  240. if (nthreads == 1) {
  241. #endif
  242. (gemv[(int)trans])(m, n, 0, alpha, a, lda, x, incx, y, incy, buffer);
  243. #ifdef SMP
  244. } else {
  245. (gemv_thread[(int)trans])(m, n, alpha, a, lda, x, incx, y, incy, buffer, nthreads);
  246. }
  247. #endif
  248. STACK_FREE(buffer);
  249. FUNCTION_PROFILE_END(1, m * n + m + n, 2 * m * n);
  250. IDEBUG_END;
  251. return;
  252. }