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.2 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  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. static FLOAT dp1 = 1.;
  41. static FLOAT dm1 = -1.;
  42. blasint CNAME(blas_arg_t *args, BLASLONG *range_m, BLASLONG *range_n, FLOAT *sa, FLOAT *sb, BLASLONG myid) {
  43. BLASLONG m, n, lda;
  44. blasint *ipiv, offset;
  45. FLOAT *a;
  46. FLOAT temp1, temp2;
  47. blasint i, j;
  48. blasint ip, jp;
  49. blasint info;
  50. BLASLONG len;
  51. FLOAT *b;
  52. m = args -> m;
  53. n = args -> n;
  54. a = (FLOAT *)args -> a;
  55. lda = args -> lda;
  56. ipiv = (blasint *)args -> c;
  57. offset = 0;
  58. if (range_n) {
  59. m -= range_n[0];
  60. n = range_n[1] - range_n[0];
  61. offset = range_n[0];
  62. a += range_n[0] * (lda + 1) * COMPSIZE;
  63. }
  64. info = 0;
  65. b = a;
  66. for (j = 0; j < n; j++) {
  67. len = MIN(j, m);
  68. for (i = 0; i < len; i++) {
  69. ip = ipiv[i + offset] - 1 - offset;
  70. if (ip != i) {
  71. temp1 = *(b + i);
  72. temp2 = *(b + ip);
  73. *(b + i) = temp2;
  74. *(b + ip) = temp1;
  75. }
  76. }
  77. for (i = 1; i < len; i++) {
  78. b[i] -= DOTU_K(i, a + i, lda, b, 1);
  79. }
  80. if (j < m) {
  81. GEMV_N(m - j, j, 0, dm1, a + j, lda, b, 1, b + j, 1, sb);
  82. jp = j + IAMAX_K(m - j, b + j, 1);
  83. ipiv[j + offset] = jp + offset;
  84. jp--;
  85. temp1 = *(b + jp);
  86. if (temp1 != ZERO) {
  87. temp1 = dp1 / temp1;
  88. if (jp != j) {
  89. SWAP_K(j + 1, 0, 0, ZERO, a + j, lda, a + jp, lda, NULL, 0);
  90. }
  91. if (j + 1 < m) {
  92. SCAL_K(m - j - 1, 0, 0, temp1, b + j + 1, 1, NULL, 0, NULL, 0);
  93. }
  94. } else {
  95. if (!info) info = j + 1;
  96. }
  97. }
  98. b += lda;
  99. }
  100. return info;
  101. }