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.

sbmv.c 6.3 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223
  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 <ctype.h>
  40. #include "common.h"
  41. #ifdef FUNCTION_PROFILE
  42. #include "functable.h"
  43. #endif
  44. /*
  45. #ifdef SMP
  46. #ifdef __64BIT__
  47. #define SMPTEST 1
  48. #endif
  49. #endif
  50. */
  51. #ifdef XDOUBLE
  52. #define ERROR_NAME "QSBMV "
  53. #elif defined(DOUBLE)
  54. #define ERROR_NAME "DSBMV "
  55. #else
  56. #define ERROR_NAME "SSBMV "
  57. #endif
  58. static int (*sbmv[])(BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, void *) = {
  59. #ifdef XDOUBLE
  60. qsbmv_U, qsbmv_L,
  61. #elif defined(DOUBLE)
  62. dsbmv_U, dsbmv_L,
  63. #else
  64. ssbmv_U, ssbmv_L,
  65. #endif
  66. };
  67. #ifdef SMPTEST
  68. static int (*sbmv_thread[])(BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  69. #ifdef XDOUBLE
  70. qsbmv_thread_U, qsbmv_thread_L,
  71. #elif defined(DOUBLE)
  72. dsbmv_thread_U, dsbmv_thread_L,
  73. #else
  74. ssbmv_thread_U, ssbmv_thread_L,
  75. #endif
  76. };
  77. #endif
  78. #ifndef CBLAS
  79. void NAME(char *UPLO, blasint *N, blasint *K, FLOAT *ALPHA, FLOAT *a, blasint *LDA,
  80. FLOAT *x, blasint *INCX, FLOAT *BETA, FLOAT *y, blasint *INCY){
  81. char uplo_arg = *UPLO;
  82. blasint n = *N;
  83. blasint k = *K;
  84. FLOAT alpha = *ALPHA;
  85. blasint lda = *LDA;
  86. blasint incx = *INCX;
  87. FLOAT beta = *BETA;
  88. blasint incy = *INCY;
  89. blasint info;
  90. int uplo;
  91. FLOAT *buffer;
  92. #ifdef SMPTEST
  93. int nthreads;
  94. #endif
  95. PRINT_DEBUG_NAME;
  96. TOUPPER(uplo_arg);
  97. uplo = -1;
  98. if (uplo_arg == 'U') uplo = 0;
  99. if (uplo_arg == 'L') uplo = 1;
  100. info = 0;
  101. if (incy == 0) info = 11;
  102. if (incx == 0) info = 8;
  103. if (lda < k + 1) info = 6;
  104. if (k < 0) info = 3;
  105. if (n < 0) info = 2;
  106. if (uplo < 0) info = 1;
  107. if (info != 0) {
  108. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  109. return;
  110. }
  111. #else
  112. void CNAME(enum CBLAS_ORDER order,
  113. enum CBLAS_UPLO Uplo,
  114. blasint n, blasint k,
  115. FLOAT alpha,
  116. FLOAT *a, blasint lda,
  117. FLOAT *x, blasint incx,
  118. FLOAT beta,
  119. FLOAT *y, blasint incy){
  120. FLOAT *buffer;
  121. int uplo;
  122. blasint info;
  123. #ifdef SMPTEST
  124. int nthreads;
  125. #endif
  126. PRINT_DEBUG_CNAME;
  127. uplo = -1;
  128. info = 0;
  129. if (order == CblasColMajor) {
  130. if (Uplo == CblasUpper) uplo = 0;
  131. if (Uplo == CblasLower) uplo = 1;
  132. info = -1;
  133. if (incy == 0) info = 11;
  134. if (incx == 0) info = 8;
  135. if (lda < k + 1) info = 6;
  136. if (k < 0) info = 3;
  137. if (n < 0) info = 2;
  138. if (uplo < 0) info = 1;
  139. }
  140. if (order == CblasRowMajor) {
  141. if (Uplo == CblasUpper) uplo = 1;
  142. if (Uplo == CblasLower) uplo = 0;
  143. info = -1;
  144. if (incy == 0) info = 11;
  145. if (incx == 0) info = 8;
  146. if (lda < k + 1) info = 6;
  147. if (k < 0) info = 3;
  148. if (n < 0) info = 2;
  149. if (uplo < 0) info = 1;
  150. }
  151. if (info >= 0) {
  152. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  153. return;
  154. }
  155. #endif
  156. if (n == 0) return;
  157. if (beta != ONE) SCAL_K(n, 0, 0, beta, y, blasabs(incy), NULL, 0, NULL, 0);
  158. if (alpha == ZERO) return;
  159. IDEBUG_START;
  160. FUNCTION_PROFILE_START();
  161. if (incx < 0 ) x -= (n - 1) * incx;
  162. if (incy < 0 ) y -= (n - 1) * incy;
  163. buffer = (FLOAT *)blas_memory_alloc(1);
  164. #ifdef SMPTEST
  165. nthreads = num_cpu_avail(2);
  166. if (nthreads == 1) {
  167. #endif
  168. (sbmv[uplo])(n, k, alpha, a, lda, x, incx, y, incy, buffer);
  169. #ifdef SMPTEST
  170. } else {
  171. (sbmv_thread[uplo])(n, k, alpha, a, lda, x, incx, y, incy, buffer, nthreads);
  172. }
  173. #endif
  174. blas_memory_free(buffer);
  175. FUNCTION_PROFILE_END(1, n * k / 2 + n, n * k);
  176. IDEBUG_END;
  177. return;
  178. }