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.

getf2_k.c 4.5 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  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 <float.h>
  40. #include "common.h"
  41. static FLOAT dp1 = 1.;
  42. static FLOAT dm1 = -1.;
  43. blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG myid) {
  44. BLASLONG m, n, lda;
  45. blasint *ipiv, offset;
  46. FLOAT *a;
  47. FLOAT temp1, temp2;
  48. blasint i, j;
  49. blasint ip, jp;
  50. blasint info;
  51. BLASLONG len;
  52. FLOAT *b;
  53. m = args -> m;
  54. n = args -> n;
  55. a = (FLOAT *)args -> a;
  56. lda = args -> lda;
  57. ipiv = (blasint *)args -> c;
  58. offset = 0;
  59. if (range_n) {
  60. m -= range_n[0];
  61. n = range_n[1] - range_n[0];
  62. offset = range_n[0];
  63. a += range_n[0] * (lda + 1) * COMPSIZE;
  64. }
  65. info = 0;
  66. b = a;
  67. for (j = 0; j < n; j++) {
  68. len = MIN(j, m);
  69. for (i = 0; i < len; i++) {
  70. ip = ipiv[i + offset] - 1 - offset;
  71. if (ip != i) {
  72. temp1 = *(b + i);
  73. temp2 = *(b + ip);
  74. *(b + i) = temp2;
  75. *(b + ip) = temp1;
  76. }
  77. }
  78. for (i = 1; i < len; i++) {
  79. b[i] -= DOTU_K(i, a + i, lda, b, 1);
  80. }
  81. if (j < m) {
  82. GEMV_N(m - j, j, 0, dm1, a + j, lda, b, 1, b + j, 1, sb);
  83. jp = j + IAMAX_K(m - j, b + j, 1);
  84. if (jp>m) jp = m; //avoid out of boundary when the iamax kernel does not cope with NaN in input, see gh issue 723
  85. ipiv[j + offset] = jp + offset;
  86. jp--;
  87. temp1 = *(b + jp);
  88. if (temp1 != ZERO) {
  89. #if defined(DOUBLE)
  90. if (fabs(temp1) >= DBL_MIN ) {
  91. #else
  92. if (fabs(temp1) >= FLT_MIN ) {
  93. #endif
  94. temp1 = dp1 / temp1;
  95. if (jp != j) {
  96. SWAP_K(j + 1, 0, 0, ZERO, a + j, lda, a + jp, lda, NULL, 0);
  97. }
  98. if (j + 1 < m) {
  99. SCAL_K(m - j - 1, 0, 0, temp1, b + j + 1, 1, NULL, 0, NULL, 0);
  100. }
  101. }
  102. } else {
  103. if (!info) info = j + 1;
  104. }
  105. }
  106. b += lda;
  107. }
  108. return info;
  109. }