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.

zgetf2_k.c 4.8 kB

2 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142
  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. double fabs(double);
  42. static FLOAT dp1 = 1.;
  43. static FLOAT dm1 = -1.;
  44. blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG myid) {
  45. BLASLONG m, n, lda, offset;
  46. blasint *ipiv;
  47. FLOAT *a;
  48. FLOAT temp1, temp2, temp3, temp4, ratio, den;
  49. blasint i, j;
  50. blasint ip, jp;
  51. blasint info;
  52. BLASLONG len;
  53. FLOAT *b;
  54. m = args -> m;
  55. n = args -> n;
  56. a = (FLOAT *)args -> a;
  57. lda = args -> lda;
  58. ipiv = (blasint *)args -> c;
  59. offset = 0;
  60. if (range_n) {
  61. m -= range_n[0];
  62. n = range_n[1] - range_n[0];
  63. offset = range_n[0];
  64. a += range_n[0] * (lda + 1) * COMPSIZE;
  65. }
  66. info = 0;
  67. b = a;
  68. for (j = 0; j < n; j++) {
  69. len = MIN(j, m);
  70. for (i = 0; i < len; i++) {
  71. ip = ipiv[i + offset] - 1 - offset;
  72. if (ip != i) {
  73. temp1 = *(b + i * 2 + 0);
  74. temp2 = *(b + i * 2 + 1);
  75. temp3 = *(b + ip * 2 + 0);
  76. temp4 = *(b + ip * 2 + 1);
  77. *(b + i * 2 + 0) = temp3;
  78. *(b + i * 2 + 1) = temp4;
  79. *(b + ip * 2 + 0) = temp1;
  80. *(b + ip * 2 + 1) = temp2;
  81. }
  82. }
  83. ZTRSV_NLU(len, a, lda, b, 1, sb);
  84. if (j < m) {
  85. GEMV_N(m - j, j, 0, dm1, ZERO, a + j * 2, lda, b, 1, b + j * 2, 1, sb);
  86. jp = j + IAMAX_K(m - j, b + j * 2, 1);
  87. if (jp>m) jp = m; //avoid out of boundary
  88. ipiv[j + offset] = jp + offset;
  89. jp--;
  90. temp1 = *(b + jp * 2 + 0);
  91. temp2 = *(b + jp * 2 + 1);
  92. // if ((temp1 != ZERO) || (temp2 != ZERO)) {
  93. if ((fabs(temp1) >= DBL_MIN) || (fabs(temp2) >= DBL_MIN)) {
  94. if (jp != j) {
  95. SWAP_K(j + 1, 0, 0, ZERO, ZERO, a + j * 2, lda,
  96. a + jp * 2, lda, NULL, 0);
  97. }
  98. if (fabs(temp1) >= fabs(temp2)){
  99. ratio = temp2 / temp1;
  100. den = dp1 /(temp1 * ( 1 + ratio * ratio));
  101. temp3 = den;
  102. temp4 = -ratio * den;
  103. } else {
  104. ratio = temp1 / temp2;
  105. den = dp1 /(temp2 * ( 1 + ratio * ratio));
  106. temp3 = ratio * den;
  107. temp4 = -den;
  108. }
  109. if (j + 1 < m) {
  110. SCAL_K(m - j - 1, 0, 0, temp3, temp4,
  111. b + (j + 1) * 2, 1, NULL, 0, NULL, 0);
  112. }
  113. } else {
  114. if (!info) info = j + 1;
  115. }
  116. }
  117. b += lda * 2;
  118. }
  119. return info;
  120. }