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.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205
  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 "QSYMV "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "DSYMV "
  48. #else
  49. #define ERROR_NAME "SSYMV "
  50. #endif
  51. #ifndef CBLAS
  52. void NAME(char *UPLO, blasint *N, FLOAT *ALPHA, FLOAT *a, blasint *LDA,
  53. FLOAT *x, blasint *INCX, FLOAT *BETA, FLOAT *y, blasint *INCY){
  54. char uplo_arg = *UPLO;
  55. blasint n = *N;
  56. FLOAT alpha = *ALPHA;
  57. blasint lda = *LDA;
  58. blasint incx = *INCX;
  59. FLOAT beta = *BETA;
  60. blasint incy = *INCY;
  61. int (*symv[])(BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  62. SYMV_U, SYMV_L,
  63. };
  64. #ifdef SMP
  65. int (*symv_thread[])(BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  66. SYMV_THREAD_U, SYMV_THREAD_L,
  67. };
  68. #endif
  69. blasint info;
  70. int uplo;
  71. FLOAT *buffer;
  72. #ifdef SMP
  73. int nthreads;
  74. #endif
  75. PRINT_DEBUG_NAME;
  76. TOUPPER(uplo_arg);
  77. uplo = -1;
  78. if (uplo_arg == 'U') uplo = 0;
  79. if (uplo_arg == 'L') uplo = 1;
  80. info = 0;
  81. if (incy == 0) info = 10;
  82. if (incx == 0) info = 7;
  83. if (lda < MAX(1, n)) info = 5;
  84. if (n < 0) info = 2;
  85. if (uplo < 0) info = 1;
  86. if (info != 0) {
  87. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  88. return;
  89. }
  90. #else
  91. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo, blasint n, FLOAT alpha,
  92. FLOAT *a, blasint lda, FLOAT *x, blasint incx, FLOAT beta, FLOAT *y, blasint incy) {
  93. FLOAT *buffer;
  94. int uplo;
  95. blasint info;
  96. #ifdef SMP
  97. int nthreads;
  98. #endif
  99. int (*symv[])(BLASLONG, BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  100. SYMV_U, SYMV_L,
  101. };
  102. #ifdef SMP
  103. int (*symv_thread[])(BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  104. SYMV_THREAD_U, SYMV_THREAD_L,
  105. };
  106. #endif
  107. PRINT_DEBUG_CNAME;
  108. uplo = -1;
  109. info = 0;
  110. if (order == CblasColMajor) {
  111. if (Uplo == CblasUpper) uplo = 0;
  112. if (Uplo == CblasLower) uplo = 1;
  113. info = -1;
  114. if (incy == 0) info = 10;
  115. if (incx == 0) info = 7;
  116. if (lda < MAX(1, n)) info = 5;
  117. if (n < 0) info = 2;
  118. if (uplo < 0) info = 1;
  119. }
  120. if (order == CblasRowMajor) {
  121. if (Uplo == CblasUpper) uplo = 1;
  122. if (Uplo == CblasLower) uplo = 0;
  123. info = -1;
  124. if (incy == 0) info = 10;
  125. if (incx == 0) info = 7;
  126. if (lda < MAX(1, n)) info = 5;
  127. if (n < 0) info = 2;
  128. if (uplo < 0) info = 1;
  129. }
  130. if (info >= 0) {
  131. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  132. return;
  133. }
  134. #endif
  135. if (n == 0) return;
  136. if (beta != ONE) SCAL_K(n, 0, 0, beta, y, abs(incy), NULL, 0, NULL, 0);
  137. if (alpha == ZERO) return;
  138. IDEBUG_START;
  139. FUNCTION_PROFILE_START();
  140. if (incx < 0 ) x -= (n - 1) * incx;
  141. if (incy < 0 ) y -= (n - 1) * incy;
  142. buffer = (FLOAT *)blas_memory_alloc(1);
  143. #ifdef SMP
  144. nthreads = num_cpu_avail(2);
  145. if (nthreads == 1) {
  146. #endif
  147. (symv[uplo])(n, n, alpha, a, lda, x, incx, y, incy, buffer);
  148. #ifdef SMP
  149. } else {
  150. (symv_thread[uplo])(n, alpha, a, lda, x, incx, y, incy, buffer, nthreads);
  151. }
  152. #endif
  153. blas_memory_free(buffer);
  154. FUNCTION_PROFILE_END(1, n * n / 2 + 2 * n, 2 * n * n);
  155. IDEBUG_END;
  156. return;
  157. }