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_L.c 4.0 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109
  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. const static FLOAT dm1 = -1.;
  42. #undef GEMV_UNROLL
  43. #define GEMV_UNROLL DTB_ENTRIES
  44. int CNAME(BLASLONG m, FLOAT *a, BLASLONG lda, FLOAT *b, BLASLONG incb, void *buffer){
  45. BLASLONG i, is, min_i;
  46. FLOAT *gemvbuffer = (FLOAT *)buffer;
  47. FLOAT *B = b;
  48. if (incb != 1) {
  49. B = buffer;
  50. gemvbuffer = (FLOAT *)(((BLASLONG)buffer + m * sizeof(FLOAT) + 4095) & ~4095);
  51. COPY_K(m, b, incb, buffer, 1);
  52. }
  53. for (is = 0; is < m; is += GEMV_UNROLL){
  54. min_i = MIN(m - is, GEMV_UNROLL);
  55. #ifdef TRANSA
  56. if (is > 0){
  57. GEMV_T(is, min_i, 0, dm1,
  58. a + is * lda , lda,
  59. B, 1,
  60. B + is, 1, gemvbuffer);
  61. }
  62. #endif
  63. for (i = 0; i < min_i; i++) {
  64. FLOAT *AA = a + is + (i + is) * lda;
  65. FLOAT *BB = B + is;
  66. #ifdef TRANSA
  67. if (i > 0) BB[i] -= DOTU_K(i, AA, 1, BB, 1);
  68. #endif
  69. #ifndef UNIT
  70. BB[i] /= AA[i];
  71. #endif
  72. #ifndef TRANSA
  73. if (i < min_i - 1) {
  74. AXPYU_K(min_i - i - 1 , 0, 0, - BB[i],
  75. AA + i + 1, 1, BB + i + 1, 1, NULL, 0);
  76. }
  77. #endif
  78. }
  79. #ifndef TRANSA
  80. if (m - is > min_i){
  81. GEMV_N(m - is - min_i, min_i, 0, dm1,
  82. a + is + min_i + is * lda, lda,
  83. B + is, 1,
  84. B + (is + min_i), 1, gemvbuffer);
  85. }
  86. #endif
  87. }
  88. if (incb != 1) {
  89. COPY_K(m, buffer, 1, b, incb);
  90. }
  91. return 0;
  92. }