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.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243
  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 "QTRMV "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "DTRMV "
  48. #else
  49. #define ERROR_NAME "STRMV "
  50. #endif
  51. static int (*trmv[])(BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *) = {
  52. #ifdef XDOUBLE
  53. qtrmv_NUU, qtrmv_NUN, qtrmv_NLU, qtrmv_NLN,
  54. qtrmv_TUU, qtrmv_TUN, qtrmv_TLU, qtrmv_TLN,
  55. #elif defined(DOUBLE)
  56. dtrmv_NUU, dtrmv_NUN, dtrmv_NLU, dtrmv_NLN,
  57. dtrmv_TUU, dtrmv_TUN, dtrmv_TLU, dtrmv_TLN,
  58. #else
  59. strmv_NUU, strmv_NUN, strmv_NLU, strmv_NLN,
  60. strmv_TUU, strmv_TUN, strmv_TLU, strmv_TLN,
  61. #endif
  62. };
  63. #ifdef SMP
  64. static int (*trmv_thread[])(BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
  65. #ifdef XDOUBLE
  66. qtrmv_thread_NUU, qtrmv_thread_NUN, qtrmv_thread_NLU, qtrmv_thread_NLN,
  67. qtrmv_thread_TUU, qtrmv_thread_TUN, qtrmv_thread_TLU, qtrmv_thread_TLN,
  68. #elif defined(DOUBLE)
  69. dtrmv_thread_NUU, dtrmv_thread_NUN, dtrmv_thread_NLU, dtrmv_thread_NLN,
  70. dtrmv_thread_TUU, dtrmv_thread_TUN, dtrmv_thread_TLU, dtrmv_thread_TLN,
  71. #else
  72. strmv_thread_NUU, strmv_thread_NUN, strmv_thread_NLU, strmv_thread_NLN,
  73. strmv_thread_TUU, strmv_thread_TUN, strmv_thread_TLU, strmv_thread_TLN,
  74. #endif
  75. };
  76. #endif
  77. #ifndef CBLAS
  78. void NAME(char *UPLO, char *TRANS, char *DIAG,
  79. blasint *N, FLOAT *a, blasint *LDA, FLOAT *x, blasint *INCX){
  80. char uplo_arg = *UPLO;
  81. char trans_arg = *TRANS;
  82. char diag_arg = *DIAG;
  83. blasint n = *N;
  84. blasint lda = *LDA;
  85. blasint incx = *INCX;
  86. blasint info;
  87. int uplo;
  88. int unit;
  89. int trans;
  90. FLOAT *buffer;
  91. #ifdef SMP
  92. int nthreads;
  93. #endif
  94. PRINT_DEBUG_NAME;
  95. TOUPPER(uplo_arg);
  96. TOUPPER(trans_arg);
  97. TOUPPER(diag_arg);
  98. trans = -1;
  99. unit = -1;
  100. uplo = -1;
  101. if (trans_arg == 'N') trans = 0;
  102. if (trans_arg == 'T') trans = 1;
  103. if (trans_arg == 'R') trans = 0;
  104. if (trans_arg == 'C') trans = 1;
  105. if (diag_arg == 'U') unit = 0;
  106. if (diag_arg == 'N') unit = 1;
  107. if (uplo_arg == 'U') uplo = 0;
  108. if (uplo_arg == 'L') uplo = 1;
  109. info = 0;
  110. if (incx == 0) info = 8;
  111. if (lda < MAX(1, n)) info = 6;
  112. if (n < 0) info = 4;
  113. if (unit < 0) info = 3;
  114. if (trans < 0) info = 2;
  115. if (uplo < 0) info = 1;
  116. if (info != 0) {
  117. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  118. return;
  119. }
  120. #else
  121. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo,
  122. enum CBLAS_TRANSPOSE TransA, enum CBLAS_DIAG Diag,
  123. blasint n, FLOAT *a, blasint lda, FLOAT *x, blasint incx) {
  124. int trans, uplo, unit;
  125. blasint info;
  126. FLOAT *buffer;
  127. #ifdef SMP
  128. int nthreads;
  129. #endif
  130. PRINT_DEBUG_CNAME;
  131. unit = -1;
  132. uplo = -1;
  133. trans = -1;
  134. info = 0;
  135. if (order == CblasColMajor) {
  136. if (Uplo == CblasUpper) uplo = 0;
  137. if (Uplo == CblasLower) uplo = 1;
  138. if (TransA == CblasNoTrans) trans = 0;
  139. if (TransA == CblasTrans) trans = 1;
  140. if (TransA == CblasConjNoTrans) trans = 0;
  141. if (TransA == CblasConjTrans) trans = 1;
  142. if (Diag == CblasUnit) unit = 0;
  143. if (Diag == CblasNonUnit) unit = 1;
  144. info = -1;
  145. if (incx == 0) info = 8;
  146. if (lda < MAX(1, n)) info = 6;
  147. if (n < 0) info = 4;
  148. if (unit < 0) info = 3;
  149. if (trans < 0) info = 2;
  150. if (uplo < 0) info = 1;
  151. }
  152. if (order == CblasRowMajor) {
  153. if (Uplo == CblasUpper) uplo = 1;
  154. if (Uplo == CblasLower) uplo = 0;
  155. if (TransA == CblasNoTrans) trans = 1;
  156. if (TransA == CblasTrans) trans = 0;
  157. if (TransA == CblasConjNoTrans) trans = 1;
  158. if (TransA == CblasConjTrans) trans = 0;
  159. if (Diag == CblasUnit) unit = 0;
  160. if (Diag == CblasNonUnit) unit = 1;
  161. info = -1;
  162. if (incx == 0) info = 8;
  163. if (lda < MAX(1, n)) info = 6;
  164. if (n < 0) info = 4;
  165. if (unit < 0) info = 3;
  166. if (trans < 0) info = 2;
  167. if (uplo < 0) info = 1;
  168. }
  169. if (info >= 0) {
  170. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  171. return;
  172. }
  173. #endif
  174. if (n == 0) return;
  175. IDEBUG_START;
  176. FUNCTION_PROFILE_START();
  177. if (incx < 0 ) x -= (n - 1) * incx;
  178. buffer = (FLOAT *)blas_memory_alloc(1);
  179. #ifdef SMP
  180. nthreads = num_cpu_avail(2);
  181. if (nthreads == 1) {
  182. #endif
  183. (trmv[(trans<<2) | (uplo<<1) | unit])(n, a, lda, x, incx, buffer);
  184. #ifdef SMP
  185. } else {
  186. (trmv_thread[(trans<<2) | (uplo<<1) | unit])(n, a, lda, x, incx, buffer, nthreads);
  187. }
  188. #endif
  189. blas_memory_free(buffer);
  190. FUNCTION_PROFILE_END(1, n * n / 2 + n, n * n);
  191. IDEBUG_END;
  192. return;
  193. }