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.

gesv.c 5.3 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175
  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 "common.h"
  40. #ifdef FUNCTION_PROFILE
  41. #include "functable.h"
  42. #endif
  43. #ifndef COMPLEX
  44. #ifdef XDOUBLE
  45. #define ERROR_NAME "QGESV"
  46. #elif defined(DOUBLE)
  47. #define ERROR_NAME "DGESV"
  48. #else
  49. #define ERROR_NAME "SGESV"
  50. #endif
  51. #else
  52. #ifdef XDOUBLE
  53. #define ERROR_NAME "XGESV"
  54. #elif defined(DOUBLE)
  55. #define ERROR_NAME "ZGESV"
  56. #else
  57. #define ERROR_NAME "CGESV"
  58. #endif
  59. #endif
  60. int NAME(blasint *N, blasint *NRHS, FLOAT *a, blasint *ldA, blasint *ipiv,
  61. FLOAT *b, blasint *ldB, blasint *Info){
  62. blas_arg_t args;
  63. blasint info;
  64. FLOAT *buffer;
  65. #ifdef PPC440
  66. extern
  67. #endif
  68. FLOAT *sa, *sb;
  69. PRINT_DEBUG_NAME;
  70. args.m = *N;
  71. args.n = *NRHS;
  72. args.a = (void *)a;
  73. args.lda = *ldA;
  74. args.b = (void *)b;
  75. args.ldb = *ldB;
  76. args.c = (void *)ipiv;
  77. info = 0;
  78. if (args.ldb < MAX(1,args.m)) info = 7;
  79. if (args.lda < MAX(1,args.m)) info = 4;
  80. if (args.n < 0) info = 2;
  81. if (args.m < 0) info = 1;
  82. if (info) {
  83. BLASFUNC(xerbla)(ERROR_NAME, &info, sizeof(ERROR_NAME) - 1);
  84. *Info = - info;
  85. return 0;
  86. }
  87. args.alpha = NULL;
  88. args.beta = NULL;
  89. *Info = 0;
  90. if (args.m == 0 || args.n == 0) return 0;
  91. IDEBUG_START;
  92. FUNCTION_PROFILE_START();
  93. #ifndef PPC440
  94. buffer = (FLOAT *)blas_memory_alloc(1);
  95. sa = (FLOAT *)((BLASLONG)buffer + GEMM_OFFSET_A);
  96. sb = (FLOAT *)(((BLASLONG)sa + ((GEMM_P * GEMM_Q * COMPSIZE * SIZE + GEMM_ALIGN) & ~GEMM_ALIGN)) + GEMM_OFFSET_B);
  97. #endif
  98. #ifdef SMP
  99. args.common = NULL;
  100. #if defined(_WIN64) && defined(_M_ARM64)
  101. #ifdef COMPLEX
  102. if (args.m * args.n <= 300)
  103. #else
  104. if (args.m * args.n <= 500)
  105. #endif
  106. args.nthreads = 1;
  107. else if (args.m * args.n <= 1000)
  108. args.nthreads = 4;
  109. else
  110. args.nthreads = num_cpu_avail(4);
  111. #else
  112. #ifndef DOUBLE
  113. if (args.m * args.n < 40000)
  114. #else
  115. if (args.m * args.n < 10000)
  116. #endif
  117. args.nthreads = 1;
  118. else
  119. args.nthreads = num_cpu_avail(4);
  120. #endif
  121. if (args.nthreads == 1) {
  122. #endif
  123. args.n = *N;
  124. info = GETRF_SINGLE(&args, NULL, NULL, sa, sb, 0);
  125. if (info == 0){
  126. args.n = *NRHS;
  127. GETRS_N_SINGLE(&args, NULL, NULL, sa, sb, 0);
  128. }
  129. #ifdef SMP
  130. } else {
  131. args.n = *N;
  132. info = GETRF_PARALLEL(&args, NULL, NULL, sa, sb, 0);
  133. if (info == 0){
  134. args.n = *NRHS;
  135. GETRS_N_PARALLEL(&args, NULL, NULL, sa, sb, 0);
  136. }
  137. }
  138. #endif
  139. #ifndef PPC440
  140. blas_memory_free(buffer);
  141. #endif
  142. *Info = info;
  143. FUNCTION_PROFILE_END(COMPSIZE * COMPSIZE, *N * *N, 2. / 3. * *N * *N * *N + *N * *N);
  144. IDEBUG_END;
  145. return 0;
  146. }