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.

zsbmv.c 5.2 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165
  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 "XSBMV "
  53. #elif defined(DOUBLE)
  54. #define ERROR_NAME "ZSBMV "
  55. #else
  56. #define ERROR_NAME "CSBMV "
  57. #endif
  58. static int (*sbmv[])(BLASLONG, BLASLONG, FLOAT, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, void *) = {
  59. #ifdef XDOUBLE
  60. xsbmv_U, xsbmv_L,
  61. #elif defined(DOUBLE)
  62. zsbmv_U, zsbmv_L,
  63. #else
  64. csbmv_U, csbmv_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. xsbmv_thread_U, xsbmv_thread_L,
  71. #elif defined(DOUBLE)
  72. zsbmv_thread_U, zsbmv_thread_L,
  73. #else
  74. csbmv_thread_U, csbmv_thread_L,
  75. #endif
  76. };
  77. #endif
  78. void NAME(char *UPLO, blasint *N, blasint *K, FLOAT *ALPHA, FLOAT *a, blasint *LDA,
  79. FLOAT *b, blasint *INCX, FLOAT *BETA, FLOAT *c, blasint *INCY){
  80. char uplo_arg = *UPLO;
  81. blasint n = *N;
  82. blasint k = *K;
  83. FLOAT alpha_r = ALPHA[0];
  84. FLOAT alpha_i = ALPHA[1];
  85. blasint lda = *LDA;
  86. blasint incx = *INCX;
  87. FLOAT beta_r = BETA[0];
  88. FLOAT beta_i = BETA[1];
  89. blasint incy = *INCY;
  90. blasint info;
  91. int uplo;
  92. FLOAT *buffer;
  93. #ifdef SMPTEST
  94. int nthreads;
  95. #endif
  96. PRINT_DEBUG_NAME;
  97. TOUPPER(uplo_arg);
  98. uplo = -1;
  99. if (uplo_arg == 'U') uplo = 0;
  100. if (uplo_arg == 'L') uplo = 1;
  101. info = 0;
  102. if (incy == 0) info = 11;
  103. if (incx == 0) info = 8;
  104. if (lda < k + 1) info = 6;
  105. if (k < 0) info = 3;
  106. if (n < 0) info = 2;
  107. if (uplo < 0) info = 1;
  108. if (info != 0) {
  109. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  110. return;
  111. }
  112. if (n == 0) return;
  113. if ((beta_r != ONE) || (beta_i != ZERO)) SCAL_K(n, 0, 0, beta_r, beta_i, c, blasabs(incy), NULL, 0, NULL, 0);
  114. if ((alpha_r == ZERO) && (alpha_i == ZERO)) return;
  115. IDEBUG_START;
  116. FUNCTION_PROFILE_START();
  117. if (incx < 0 ) b -= (n - 1) * incx * COMPSIZE;
  118. if (incy < 0 ) c -= (n - 1) * incy * COMPSIZE;
  119. buffer = (FLOAT *)blas_memory_alloc(1);
  120. #ifdef SMPTEST
  121. nthreads = num_cpu_avail(2);
  122. if (nthreads == 1) {
  123. #endif
  124. (sbmv[uplo])(n, k, alpha_r, alpha_i, a, lda, b, incx, c, incy, buffer);
  125. #ifdef SMPTEST
  126. } else {
  127. (sbmv_thread[uplo])(n, k, ALPHA, a, lda, b, incx, c, incy, buffer, nthreads);
  128. }
  129. #endif
  130. blas_memory_free(buffer);
  131. FUNCTION_PROFILE_END(4, n * k / 2 + n, n * k);
  132. IDEBUG_END;
  133. return;
  134. }