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.

zhemv.c 6.9 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228
  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. // this is smallest dimension N of square input a to permit threading
  45. // see graph in issue #1820 for explanation
  46. #define MULTI_THREAD_MINIMAL 362
  47. #ifdef XDOUBLE
  48. #define ERROR_NAME "XHEMV "
  49. #elif defined(DOUBLE)
  50. #define ERROR_NAME "ZHEMV "
  51. #else
  52. #define ERROR_NAME "CHEMV "
  53. #endif
  54. #ifndef CBLAS
  55. void NAME(char *UPLO, blasint *N, FLOAT *ALPHA, FLOAT *a, blasint *LDA,
  56. FLOAT *x, blasint *INCX, FLOAT *BETA, FLOAT *y, blasint *INCY){
  57. char uplo_arg = *UPLO;
  58. blasint n = *N;
  59. FLOAT alpha_r = ALPHA[0];
  60. FLOAT alpha_i = ALPHA[1];
  61. blasint lda = *LDA;
  62. blasint incx = *INCX;
  63. FLOAT beta_r = BETA[0];
  64. FLOAT beta_i = BETA[1];
  65. blasint incy = *INCY;
  66. #ifdef SMP
  67. int nthreads;
  68. #endif
  69. int (*hemv[])(BLASLONG, BLASLONG, FLOAT, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  70. HEMV_U, HEMV_L, HEMV_V, HEMV_M,
  71. };
  72. #ifdef SMP
  73. int (*hemv_thread[])(BLASLONG, FLOAT *, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  74. HEMV_THREAD_U, HEMV_THREAD_L, HEMV_THREAD_V, HEMV_THREAD_M,
  75. };
  76. #endif
  77. blasint info;
  78. int uplo;
  79. FLOAT *buffer;
  80. PRINT_DEBUG_NAME;
  81. TOUPPER(uplo_arg);
  82. uplo = -1;
  83. if (uplo_arg == 'U') uplo = 0;
  84. if (uplo_arg == 'L') uplo = 1;
  85. if (uplo_arg == 'V') uplo = 2;
  86. if (uplo_arg == 'M') uplo = 3;
  87. info = 0;
  88. if (incy == 0) info = 10;
  89. if (incx == 0) info = 7;
  90. if (lda < MAX(1, n)) info = 5;
  91. if (n < 0) info = 2;
  92. if (uplo < 0) info = 1;
  93. if (info != 0) {
  94. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  95. return;
  96. }
  97. #else
  98. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo, blasint n, void *VALPHA,
  99. void *va, blasint lda, void *vx, blasint incx, void *VBETA, void *vy, blasint incy) {
  100. FLOAT* ALPHA = (FLOAT*) VALPHA;
  101. FLOAT* BETA = (FLOAT*) VBETA;
  102. FLOAT* a = (FLOAT*) va;
  103. FLOAT* x = (FLOAT*) vx;
  104. FLOAT* y = (FLOAT*) vy;
  105. FLOAT alpha_r = ALPHA[0];
  106. FLOAT alpha_i = ALPHA[1];
  107. FLOAT beta_r = BETA[0];
  108. FLOAT beta_i = BETA[1];
  109. FLOAT *buffer;
  110. int uplo;
  111. blasint info;
  112. #ifdef SMP
  113. int nthreads;
  114. #endif
  115. int (*hemv[])(BLASLONG, BLASLONG, FLOAT, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  116. HEMV_U, HEMV_L, HEMV_V, HEMV_M,
  117. };
  118. #ifdef SMP
  119. int (*hemv_thread[])(BLASLONG, FLOAT *, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  120. HEMV_THREAD_U, HEMV_THREAD_L, HEMV_THREAD_V, HEMV_THREAD_M,
  121. };
  122. #endif
  123. PRINT_DEBUG_CNAME;
  124. uplo = -1;
  125. info = 0;
  126. if (order == CblasColMajor) {
  127. if (Uplo == CblasUpper) uplo = 0;
  128. if (Uplo == CblasLower) uplo = 1;
  129. info = -1;
  130. if (incy == 0) info = 10;
  131. if (incx == 0) info = 7;
  132. if (lda < MAX(1, n)) info = 5;
  133. if (n < 0) info = 2;
  134. if (uplo < 0) info = 1;
  135. }
  136. if (order == CblasRowMajor) {
  137. if (Uplo == CblasUpper) uplo = 3;
  138. if (Uplo == CblasLower) uplo = 2;
  139. info = -1;
  140. if (incy == 0) info = 10;
  141. if (incx == 0) info = 7;
  142. if (lda < MAX(1, n)) info = 5;
  143. if (n < 0) info = 2;
  144. if (uplo < 0) info = 1;
  145. }
  146. if (info >= 0) {
  147. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  148. return;
  149. }
  150. #endif
  151. if (n == 0) return;
  152. if ((beta_r != ONE) || (beta_i != ZERO)) SCAL_K(n, 0, 0, beta_r, beta_i, y, blasabs(incy), NULL, 0, NULL, 0);
  153. if ((alpha_r == ZERO) && (alpha_i == ZERO)) return;
  154. IDEBUG_START;
  155. FUNCTION_PROFILE_START();
  156. if (incx < 0 ) x -= (n - 1) * incx * 2;
  157. if (incy < 0 ) y -= (n - 1) * incy * 2;
  158. buffer = (FLOAT *)blas_memory_alloc(1);
  159. #ifdef SMP
  160. if (n<MULTI_THREAD_MINIMAL) {
  161. nthreads = 1 ;
  162. } else {
  163. nthreads = num_cpu_avail(2);
  164. };
  165. if (nthreads == 1) {
  166. #endif
  167. (hemv[uplo])(n, n, alpha_r, alpha_i, a, lda, x, incx, y, incy, buffer);
  168. #ifdef SMP
  169. } else {
  170. (hemv_thread[uplo])(n, ALPHA, a, lda, x, incx, y, incy, buffer, nthreads);
  171. }
  172. #endif
  173. blas_memory_free(buffer);
  174. FUNCTION_PROFILE_END(4, n * n / 2 + n, 2 * n * n);
  175. IDEBUG_END;
  176. return;
  177. }