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.

zhpmv.c 6.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219
  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. #ifdef XDOUBLE
  45. #define ERROR_NAME "XHPMV "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "ZHPMV "
  48. #else
  49. #define ERROR_NAME "CHPMV "
  50. #endif
  51. static int (*hpmv[])(BLASLONG, FLOAT, FLOAT, FLOAT *, FLOAT *, BLASLONG, FLOAT *, BLASLONG, void *) = {
  52. #ifdef XDOUBLE
  53. xhpmv_U, xhpmv_L, xhpmv_V, xhpmv_M,
  54. #elif defined(DOUBLE)
  55. zhpmv_U, zhpmv_L, zhpmv_V, zhpmv_M,
  56. #else
  57. chpmv_U, chpmv_L, chpmv_V, chpmv_M,
  58. #endif
  59. };
  60. #ifdef SMP
  61. static int (*hpmv_thread[])(BLASLONG, FLOAT *, FLOAT *, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  62. #ifdef XDOUBLE
  63. xhpmv_thread_U, xhpmv_thread_L, xhpmv_thread_V, xhpmv_thread_M,
  64. #elif defined(DOUBLE)
  65. zhpmv_thread_U, zhpmv_thread_L, zhpmv_thread_V, zhpmv_thread_M,
  66. #else
  67. chpmv_thread_U, chpmv_thread_L, chpmv_thread_V, chpmv_thread_M,
  68. #endif
  69. };
  70. #endif
  71. #ifndef CBLAS
  72. void NAME(char *UPLO, blasint *N, FLOAT *ALPHA, FLOAT *a,
  73. FLOAT *x, blasint *INCX, FLOAT *BETA, FLOAT *y, blasint *INCY){
  74. char uplo_arg = *UPLO;
  75. blasint n = *N;
  76. FLOAT alpha_r = ALPHA[0];
  77. FLOAT alpha_i = ALPHA[1];
  78. blasint incx = *INCX;
  79. FLOAT beta_r = BETA[0];
  80. FLOAT beta_i = BETA[1];
  81. blasint incy = *INCY;
  82. blasint info;
  83. int uplo;
  84. FLOAT *buffer;
  85. #ifdef SMP
  86. int nthreads;
  87. #endif
  88. PRINT_DEBUG_NAME;
  89. TOUPPER(uplo_arg);
  90. uplo = -1;
  91. if (uplo_arg == 'U') uplo = 0;
  92. if (uplo_arg == 'L') uplo = 1;
  93. info = 0;
  94. if (incy == 0) info = 9;
  95. if (incx == 0) info = 6;
  96. if (n < 0) info = 2;
  97. if (uplo < 0) info = 1;
  98. if (info != 0) {
  99. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  100. return;
  101. }
  102. #else
  103. void CNAME(enum CBLAS_ORDER order,
  104. enum CBLAS_UPLO Uplo,
  105. blasint n,
  106. void *VALPHA,
  107. void *va,
  108. void *vx, blasint incx,
  109. void *VBETA,
  110. void *vy, blasint incy){
  111. FLOAT* ALPHA = (FLOAT*) VALPHA;
  112. FLOAT* BETA = (FLOAT*) VBETA;
  113. FLOAT* a = (FLOAT*) va;
  114. FLOAT* x = (FLOAT*) vx;
  115. FLOAT* y = (FLOAT*) vy;
  116. FLOAT alpha_r = ALPHA[0];
  117. FLOAT alpha_i = ALPHA[1];
  118. FLOAT beta_r = BETA[0];
  119. FLOAT beta_i = BETA[1];
  120. FLOAT *buffer;
  121. int uplo;
  122. blasint info;
  123. #ifdef SMP
  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 = 9;
  134. if (incx == 0) info = 6;
  135. if (n < 0) info = 2;
  136. if (uplo < 0) info = 1;
  137. }
  138. if (order == CblasRowMajor) {
  139. if (Uplo == CblasUpper) uplo = 3;
  140. if (Uplo == CblasLower) uplo = 2;
  141. info = -1;
  142. if (incy == 0) info = 9;
  143. if (incx == 0) info = 6;
  144. if (n < 0) info = 2;
  145. if (uplo < 0) info = 1;
  146. }
  147. if (info >= 0) {
  148. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  149. return;
  150. }
  151. #endif
  152. if (n == 0) return;
  153. if ((beta_r != ONE) || (beta_i != ZERO)) SCAL_K(n, 0, 0, beta_r, beta_i, y, blasabs(incy), NULL, 0, NULL, 0);
  154. if ((alpha_r == ZERO) && (alpha_i == ZERO)) return;
  155. IDEBUG_START;
  156. FUNCTION_PROFILE_START();
  157. if (incx < 0 ) x -= (n - 1) * incx * 2;
  158. if (incy < 0 ) y -= (n - 1) * incy * 2;
  159. buffer = (FLOAT *)blas_memory_alloc(1);
  160. #ifdef SMP
  161. nthreads = num_cpu_avail(2);
  162. if (nthreads == 1) {
  163. #endif
  164. (hpmv[uplo])(n, alpha_r, alpha_i, a, x, incx, y, incy, buffer);
  165. #ifdef SMP
  166. } else {
  167. (hpmv_thread[uplo])(n, ALPHA, a, x, incx, y, incy, buffer, nthreads);
  168. }
  169. #endif
  170. blas_memory_free(buffer);
  171. FUNCTION_PROFILE_END(4, n * n / 2 + n, n * n);
  172. IDEBUG_END;
  173. return;
  174. }