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.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220
  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 "QSYR "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "DSYR "
  48. #else
  49. #define ERROR_NAME "SSYR "
  50. #endif
  51. static int (*syr[])(BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  52. #ifdef XDOUBLE
  53. qsyr_U, qsyr_L,
  54. #elif defined(DOUBLE)
  55. dsyr_U, dsyr_L,
  56. #else
  57. ssyr_U, ssyr_L,
  58. #endif
  59. };
  60. #ifdef SMP
  61. static int (*syr_thread[])(BLASLONG, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  62. #ifdef XDOUBLE
  63. qsyr_thread_U, qsyr_thread_L,
  64. #elif defined(DOUBLE)
  65. dsyr_thread_U, dsyr_thread_L,
  66. #else
  67. ssyr_thread_U, ssyr_thread_L,
  68. #endif
  69. };
  70. #endif
  71. #ifndef CBLAS
  72. void NAME(char *UPLO, blasint *N, FLOAT *ALPHA,
  73. FLOAT *x, blasint *INCX, FLOAT *a, blasint *LDA){
  74. char uplo_arg = *UPLO;
  75. blasint n = *N;
  76. FLOAT alpha = *ALPHA;
  77. blasint lda = *LDA;
  78. blasint incx = *INCX;
  79. blasint info;
  80. int uplo;
  81. FLOAT *buffer;
  82. #ifdef SMP
  83. int nthreads;
  84. #endif
  85. PRINT_DEBUG_NAME;
  86. TOUPPER(uplo_arg);
  87. uplo = -1;
  88. if (uplo_arg == 'U') uplo = 0;
  89. if (uplo_arg == 'L') uplo = 1;
  90. info = 0;
  91. if (lda < MAX(1, n)) info = 7;
  92. if (incx == 0) info = 5;
  93. if (n < 0) info = 2;
  94. if (uplo < 0) info = 1;
  95. if (info != 0) {
  96. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  97. return;
  98. }
  99. #else
  100. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo, blasint n, FLOAT alpha, FLOAT *x, blasint incx, FLOAT *a, blasint lda) {
  101. FLOAT *buffer;
  102. int uplo;
  103. blasint info;
  104. #ifdef SMP
  105. int nthreads;
  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 (lda < MAX(1, n)) info = 7;
  115. if (incx == 0) info = 5;
  116. if (n < 0) info = 2;
  117. if (uplo < 0) info = 1;
  118. }
  119. if (order == CblasRowMajor) {
  120. if (Uplo == CblasUpper) uplo = 1;
  121. if (Uplo == CblasLower) uplo = 0;
  122. info = -1;
  123. if (lda < MAX(1, n)) info = 7;
  124. if (incx == 0) info = 5;
  125. if (n < 0) info = 2;
  126. if (uplo < 0) info = 1;
  127. }
  128. if (info >= 0) {
  129. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  130. return;
  131. }
  132. #endif
  133. if (n == 0) return;
  134. if (alpha == ZERO) return;
  135. IDEBUG_START;
  136. FUNCTION_PROFILE_START();
  137. #if 1
  138. if (incx == 1 && n < 100) {
  139. BLASLONG i;
  140. if (uplo == 0) {
  141. for (i = 0; i < n; i++){
  142. if (x[i] != ZERO) {
  143. AXPYU_K(i + 1, 0, 0, alpha * x[i], x, 1, a, 1, NULL, 0);
  144. }
  145. a += lda;
  146. }
  147. } else {
  148. for (i = 0; i < n; i++){
  149. if (x[i] != ZERO) {
  150. AXPYU_K(n - i, 0, 0, alpha * x[i], x + i, 1, a, 1, NULL, 0);
  151. }
  152. a += 1 + lda;
  153. }
  154. }
  155. return;
  156. }
  157. #endif
  158. if (incx < 0 ) x -= (n - 1) * incx;
  159. buffer = (FLOAT *)blas_memory_alloc(1);
  160. #ifdef SMP
  161. nthreads = num_cpu_avail(2);
  162. if (nthreads == 1) {
  163. #endif
  164. (syr[uplo])(n, alpha, x, incx, a, lda, buffer);
  165. #ifdef SMP
  166. } else {
  167. (syr_thread[uplo])(n, alpha, x, incx, a, lda, buffer, nthreads);
  168. }
  169. #endif
  170. blas_memory_free(buffer);
  171. FUNCTION_PROFILE_END(1, n * n / 2 + n, n * n);
  172. IDEBUG_END;
  173. return;
  174. }