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.

tpmv.c 7.4 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246
  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 "QTPMV "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "DTPMV "
  48. #else
  49. #define ERROR_NAME "STPMV "
  50. #endif
  51. static int (*tpmv[])(BLASLONG, FLOAT *, FLOAT *, BLASLONG, void *) = {
  52. #ifdef XDOUBLE
  53. qtpmv_NUU, qtpmv_NUN, qtpmv_NLU, qtpmv_NLN,
  54. qtpmv_TUU, qtpmv_TUN, qtpmv_TLU, qtpmv_TLN,
  55. #elif defined(DOUBLE)
  56. dtpmv_NUU, dtpmv_NUN, dtpmv_NLU, dtpmv_NLN,
  57. dtpmv_TUU, dtpmv_TUN, dtpmv_TLU, dtpmv_TLN,
  58. #else
  59. stpmv_NUU, stpmv_NUN, stpmv_NLU, stpmv_NLN,
  60. stpmv_TUU, stpmv_TUN, stpmv_TLU, stpmv_TLN,
  61. #endif
  62. };
  63. #ifdef SMP
  64. static int (*tpmv_thread[])(BLASLONG, FLOAT *, FLOAT *, BLASLONG, FLOAT *, int) = {
  65. #ifdef XDOUBLE
  66. qtpmv_thread_NUU, qtpmv_thread_NUN, qtpmv_thread_NLU, qtpmv_thread_NLN,
  67. qtpmv_thread_TUU, qtpmv_thread_TUN, qtpmv_thread_TLU, qtpmv_thread_TLN,
  68. #elif defined(DOUBLE)
  69. dtpmv_thread_NUU, dtpmv_thread_NUN, dtpmv_thread_NLU, dtpmv_thread_NLN,
  70. dtpmv_thread_TUU, dtpmv_thread_TUN, dtpmv_thread_TLU, dtpmv_thread_TLN,
  71. #else
  72. stpmv_thread_NUU, stpmv_thread_NUN, stpmv_thread_NLU, stpmv_thread_NLN,
  73. stpmv_thread_TUU, stpmv_thread_TUN, stpmv_thread_TLU, stpmv_thread_TLN,
  74. #endif
  75. };
  76. #endif
  77. #ifndef CBLAS
  78. void NAME(char *UPLO, char *TRANS, char *DIAG,
  79. blasint *N, FLOAT *a, 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 incx = *INCX;
  85. blasint info;
  86. int uplo;
  87. int unit;
  88. int trans;
  89. FLOAT *buffer;
  90. #ifdef SMP
  91. int nthreads;
  92. #endif
  93. PRINT_DEBUG_NAME;
  94. TOUPPER(uplo_arg);
  95. TOUPPER(trans_arg);
  96. TOUPPER(diag_arg);
  97. trans = -1;
  98. unit = -1;
  99. uplo = -1;
  100. if (trans_arg == 'N') trans = 0;
  101. if (trans_arg == 'T') trans = 1;
  102. if (trans_arg == 'R') trans = 0;
  103. if (trans_arg == 'C') trans = 1;
  104. if (diag_arg == 'U') unit = 0;
  105. if (diag_arg == 'N') unit = 1;
  106. if (uplo_arg == 'U') uplo = 0;
  107. if (uplo_arg == 'L') uplo = 1;
  108. info = 0;
  109. if (incx == 0) info = 7;
  110. if (n < 0) info = 4;
  111. if (unit < 0) info = 3;
  112. if (trans < 0) info = 2;
  113. if (uplo < 0) info = 1;
  114. if (info != 0) {
  115. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  116. return;
  117. }
  118. #else
  119. #ifndef COMPLEX
  120. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo,
  121. enum CBLAS_TRANSPOSE TransA, enum CBLAS_DIAG Diag,
  122. blasint n, FLOAT *a, FLOAT *x, blasint incx) {
  123. #else
  124. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo,
  125. enum CBLAS_TRANSPOSE TransA, enum CBLAS_DIAG Diag,
  126. blasint n, void *va, void *vx, blasint incx) {
  127. FLOAT *a = (FLOAT*) va;
  128. FLOAT *x = (FLOAT*) vx;
  129. #endif
  130. int trans, uplo, unit;
  131. blasint info;
  132. FLOAT *buffer;
  133. #ifdef SMP
  134. int nthreads;
  135. #endif
  136. PRINT_DEBUG_CNAME;
  137. unit = -1;
  138. uplo = -1;
  139. trans = -1;
  140. info = 0;
  141. if (order == CblasColMajor) {
  142. if (Uplo == CblasUpper) uplo = 0;
  143. if (Uplo == CblasLower) uplo = 1;
  144. if (TransA == CblasNoTrans) trans = 0;
  145. if (TransA == CblasTrans) trans = 1;
  146. if (TransA == CblasConjNoTrans) trans = 0;
  147. if (TransA == CblasConjTrans) trans = 1;
  148. if (Diag == CblasUnit) unit = 0;
  149. if (Diag == CblasNonUnit) unit = 1;
  150. info = -1;
  151. if (incx == 0) info = 7;
  152. if (n < 0) info = 4;
  153. if (unit < 0) info = 3;
  154. if (trans < 0) info = 2;
  155. if (uplo < 0) info = 1;
  156. }
  157. if (order == CblasRowMajor) {
  158. if (Uplo == CblasUpper) uplo = 1;
  159. if (Uplo == CblasLower) uplo = 0;
  160. if (TransA == CblasNoTrans) trans = 1;
  161. if (TransA == CblasTrans) trans = 0;
  162. if (TransA == CblasConjNoTrans) trans = 1;
  163. if (TransA == CblasConjTrans) trans = 0;
  164. if (Diag == CblasUnit) unit = 0;
  165. if (Diag == CblasNonUnit) unit = 1;
  166. info = -1;
  167. if (incx == 0) info = 7;
  168. if (n < 0) info = 4;
  169. if (unit < 0) info = 3;
  170. if (trans < 0) info = 2;
  171. if (uplo < 0) info = 1;
  172. }
  173. if (info >= 0) {
  174. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  175. return;
  176. }
  177. #endif
  178. if (n == 0) return;
  179. IDEBUG_START;
  180. FUNCTION_PROFILE_START();
  181. if (incx < 0 ) x -= (n - 1) * incx;
  182. buffer = (FLOAT *)blas_memory_alloc(1);
  183. #ifdef SMP
  184. nthreads = num_cpu_avail(2);
  185. if (nthreads == 1) {
  186. #endif
  187. (tpmv[(trans<<2) | (uplo<<1) | unit])(n, a, x, incx, buffer);
  188. #ifdef SMP
  189. } else {
  190. (tpmv_thread[(trans<<2) | (uplo<<1) | unit])(n, a, x, incx, buffer, nthreads);
  191. }
  192. #endif
  193. blas_memory_free(buffer);
  194. FUNCTION_PROFILE_END(1, n * n / 2 + n, n * n);
  195. IDEBUG_END;
  196. return;
  197. }