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.

trsv.c 6.7 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214
  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 "QTRSV "
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "DTRSV "
  48. #else
  49. #define ERROR_NAME "STRSV "
  50. #endif
  51. static int (*trsv[])(BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, void *) = {
  52. #ifdef XDOUBLE
  53. qtrsv_NUU, qtrsv_NUN, qtrsv_NLU, qtrsv_NLN,
  54. qtrsv_TUU, qtrsv_TUN, qtrsv_TLU, qtrsv_TLN,
  55. #elif defined(DOUBLE)
  56. dtrsv_NUU, dtrsv_NUN, dtrsv_NLU, dtrsv_NLN,
  57. dtrsv_TUU, dtrsv_TUN, dtrsv_TLU, dtrsv_TLN,
  58. #else
  59. strsv_NUU, strsv_NUN, strsv_NLU, strsv_NLN,
  60. strsv_TUU, strsv_TUN, strsv_TLU, strsv_TLN,
  61. #endif
  62. };
  63. #ifndef CBLAS
  64. void NAME(char *UPLO, char *TRANS, char *DIAG,
  65. blasint *N, FLOAT *a, blasint *LDA, FLOAT *x, blasint *INCX){
  66. char uplo_arg = *UPLO;
  67. char trans_arg = *TRANS;
  68. char diag_arg = *DIAG;
  69. blasint n = *N;
  70. blasint lda = *LDA;
  71. blasint incx = *INCX;
  72. blasint info;
  73. int uplo;
  74. int unit;
  75. int trans;
  76. FLOAT *buffer;
  77. PRINT_DEBUG_NAME;
  78. TOUPPER(uplo_arg);
  79. TOUPPER(trans_arg);
  80. TOUPPER(diag_arg);
  81. trans = -1;
  82. unit = -1;
  83. uplo = -1;
  84. if (trans_arg == 'N') trans = 0;
  85. if (trans_arg == 'T') trans = 1;
  86. if (trans_arg == 'R') trans = 0;
  87. if (trans_arg == 'C') trans = 1;
  88. if (diag_arg == 'U') unit = 0;
  89. if (diag_arg == 'N') unit = 1;
  90. if (uplo_arg == 'U') uplo = 0;
  91. if (uplo_arg == 'L') uplo = 1;
  92. info = 0;
  93. if (incx == 0) info = 8;
  94. if (lda < MAX(1, n)) info = 6;
  95. if (n < 0) info = 4;
  96. if (unit < 0) info = 3;
  97. if (trans < 0) info = 2;
  98. if (uplo < 0) info = 1;
  99. if (info != 0) {
  100. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  101. return;
  102. }
  103. #else
  104. void CNAME(enum CBLAS_ORDER order, enum CBLAS_UPLO Uplo,
  105. enum CBLAS_TRANSPOSE TransA, enum CBLAS_DIAG Diag,
  106. blasint n, FLOAT *a, blasint lda, FLOAT *x, blasint incx) {
  107. int trans, uplo, unit;
  108. blasint info;
  109. FLOAT *buffer;
  110. PRINT_DEBUG_CNAME;
  111. unit = -1;
  112. uplo = -1;
  113. trans = -1;
  114. info = 0;
  115. if (order == CblasColMajor) {
  116. if (Uplo == CblasUpper) uplo = 0;
  117. if (Uplo == CblasLower) uplo = 1;
  118. if (TransA == CblasNoTrans) trans = 0;
  119. if (TransA == CblasTrans) trans = 1;
  120. if (TransA == CblasConjNoTrans) trans = 0;
  121. if (TransA == CblasConjTrans) trans = 1;
  122. if (Diag == CblasUnit) unit = 0;
  123. if (Diag == CblasNonUnit) unit = 1;
  124. info = -1;
  125. if (incx == 0) info = 8;
  126. if (lda < MAX(1, n)) info = 6;
  127. if (n < 0) info = 4;
  128. if (unit < 0) info = 3;
  129. if (trans < 0) info = 2;
  130. if (uplo < 0) info = 1;
  131. }
  132. if (order == CblasRowMajor) {
  133. if (Uplo == CblasUpper) uplo = 1;
  134. if (Uplo == CblasLower) uplo = 0;
  135. if (TransA == CblasNoTrans) trans = 1;
  136. if (TransA == CblasTrans) trans = 0;
  137. if (TransA == CblasConjNoTrans) trans = 1;
  138. if (TransA == CblasConjTrans) trans = 0;
  139. if (Diag == CblasUnit) unit = 0;
  140. if (Diag == CblasNonUnit) unit = 1;
  141. info = -1;
  142. if (incx == 0) info = 8;
  143. if (lda < MAX(1, n)) info = 6;
  144. if (n < 0) info = 4;
  145. if (unit < 0) info = 3;
  146. if (trans < 0) info = 2;
  147. if (uplo < 0) info = 1;
  148. }
  149. if (info >= 0) {
  150. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME));
  151. return;
  152. }
  153. #endif
  154. if (n == 0) return;
  155. if (incx == 1 && trans == 0 && n < 50) {
  156. buffer = NULL;
  157. (trsv[(trans<<2) | (uplo<<1) | unit])(n, a, lda, x, incx, buffer);
  158. return;
  159. }
  160. IDEBUG_START;
  161. FUNCTION_PROFILE_START();
  162. if (incx < 0 ) x -= (n - 1) * incx;
  163. buffer = (FLOAT *)blas_memory_alloc(1);
  164. (trsv[(trans<<2) | (uplo<<1) | unit])(n, a, lda, x, incx, buffer);
  165. blas_memory_free(buffer);
  166. FUNCTION_PROFILE_END(1, n * n / 2 + n, n * n);
  167. IDEBUG_END;
  168. return;
  169. }