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.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231
  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 "XSYR "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "ZSYR "
  48. #else
  49. #define ERROR_NAME "CSYR "
  50. #endif
  51. static int (*syr[])(BLASLONG, FLOAT, FLOAT, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  52. #ifdef XDOUBLE
  53. xsyr_U, xsyr_L,
  54. #elif defined(DOUBLE)
  55. zsyr_U, zsyr_L,
  56. #else
  57. csyr_U, csyr_L,
  58. #endif
  59. };
  60. #ifdef SMP
  61. static int (*syr_thread[])(BLASLONG, FLOAT *, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  62. #ifdef XDOUBLE
  63. xsyr_thread_U, xsyr_thread_L,
  64. #elif defined(DOUBLE)
  65. zsyr_thread_U, zsyr_thread_L,
  66. #else
  67. csyr_thread_U, csyr_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_r = ALPHA[0];
  77. FLOAT alpha_i = ALPHA[1];
  78. blasint lda = *LDA;
  79. blasint incx = *INCX;
  80. blasint info;
  81. int uplo;
  82. FLOAT *buffer;
  83. #ifdef SMP
  84. int nthreads;
  85. #endif
  86. PRINT_DEBUG_NAME;
  87. TOUPPER(uplo_arg);
  88. uplo = -1;
  89. if (uplo_arg == 'U') uplo = 0;
  90. if (uplo_arg == 'L') uplo = 1;
  91. info = 0;
  92. if (lda < MAX(1, n)) info = 7;
  93. if (incx == 0) info = 5;
  94. if (n < 0) info = 2;
  95. if (uplo < 0) info = 1;
  96. if (info != 0) {
  97. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  98. return;
  99. }
  100. #else
  101. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo, int n, FLOAT alpha, FLOAT *x, int incx, FLOAT *a, int lda) {
  102. FLOAT *buffer;
  103. int uplo;
  104. blasint info;
  105. FLOAT * ALPHA = &alpha;
  106. FLOAT alpha_r = ALPHA[0];
  107. FLOAT alpha_i = ALPHA[1];
  108. #ifdef SMP
  109. int nthreads;
  110. #endif
  111. PRINT_DEBUG_CNAME;
  112. uplo = -1;
  113. info = 0;
  114. if (order == CblasColMajor) {
  115. if (Uplo == CblasUpper) uplo = 0;
  116. if (Uplo == CblasLower) uplo = 1;
  117. info = -1;
  118. if (lda < MAX(1, n)) info = 7;
  119. if (incx == 0) info = 5;
  120. if (n < 0) info = 2;
  121. if (uplo < 0) info = 1;
  122. }
  123. if (order == CblasRowMajor) {
  124. if (Uplo == CblasUpper) uplo = 1;
  125. if (Uplo == CblasLower) uplo = 0;
  126. info = -1;
  127. if (lda < MAX(1, n)) info = 7;
  128. if (incx == 0) info = 5;
  129. if (n < 0) info = 2;
  130. if (uplo < 0) info = 1;
  131. }
  132. if (info >= 0) {
  133. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  134. return;
  135. }
  136. #endif
  137. if (n == 0) return;
  138. if ((alpha_r == ZERO) && (alpha_i == ZERO)) return;
  139. if (incx == 1 && n < 50) {
  140. blasint i;
  141. if (!uplo) {
  142. for (i = 0; i < n; i++){
  143. if ((x[i * 2 + 0] != ZERO) || (x[i * 2 + 1] != ZERO)) {
  144. AXPYU_K(i + 1, 0, 0,
  145. alpha_r * x[i * 2 + 0] - alpha_i * x[i * 2 + 1],
  146. alpha_i * x[i * 2 + 0] + alpha_r * x[i * 2 + 1],
  147. x, 1, a, 1, NULL, 0);
  148. }
  149. a += lda * 2;
  150. }
  151. } else {
  152. for (i = 0; i < n; i++){
  153. if ((x[i * 2 + 0] != ZERO) || (x[i * 2 + 1] != ZERO)) {
  154. AXPYU_K(n - i, 0, 0,
  155. alpha_r * x[i * 2 + 0] - alpha_i * x[i * 2 + 1],
  156. alpha_i * x[i * 2 + 0] + alpha_r * x[i * 2 + 1],
  157. x + i * 2, 1, a, 1, NULL, 0);
  158. }
  159. a += 2 + lda * 2;
  160. }
  161. }
  162. return;
  163. }
  164. IDEBUG_START;
  165. FUNCTION_PROFILE_START();
  166. if (incx < 0 ) x -= (n - 1) * incx * 2;
  167. buffer = (FLOAT *)blas_memory_alloc(1);
  168. #ifdef SMP
  169. nthreads = num_cpu_avail(2);
  170. if (nthreads == 1) {
  171. #endif
  172. (syr[uplo])(n, alpha_r, alpha_i, x, incx, a, lda, buffer);
  173. #ifdef SMP
  174. } else {
  175. (syr_thread[uplo])(n, ALPHA, x, incx, a, lda, buffer, nthreads);
  176. }
  177. #endif
  178. blas_memory_free(buffer);
  179. FUNCTION_PROFILE_END(4, n * n / 2 + n, n * n);
  180. IDEBUG_END;
  181. return;
  182. }