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.

ztrmv_L.c 5.3 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  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. static FLOAT dp1 = 1.;
  42. int CNAME(BLASLONG m, FLOAT *a, BLASLONG lda, FLOAT *b, BLASLONG incb, FLOAT *buffer){
  43. BLASLONG i, is, min_i;
  44. #if (TRANSA == 2) || (TRANSA == 4)
  45. OPENBLAS_COMPLEX_FLOAT temp;
  46. #endif
  47. #ifndef UNIT
  48. FLOAT atemp1, atemp2, btemp1, btemp2;
  49. #endif
  50. FLOAT *gemvbuffer = (FLOAT *)buffer;
  51. FLOAT *B = b;
  52. if (incb != 1) {
  53. B = buffer;
  54. gemvbuffer = (FLOAT *)(((BLASLONG)buffer + m * sizeof(FLOAT) * 2 + 15) & ~15);
  55. COPY_K(m, b, incb, buffer, 1);
  56. }
  57. for (is = m; is > 0; is -= DTB_ENTRIES){
  58. min_i = MIN(is, DTB_ENTRIES);
  59. #if (TRANSA == 1) || (TRANSA == 3)
  60. if (m - is > 0){
  61. #if TRANSA == 1
  62. GEMV_N(m - is, min_i, 0, dp1, ZERO,
  63. a + (is + (is - min_i) * lda) * 2, lda,
  64. B + (is - min_i) * 2, 1,
  65. B + is * 2, 1, gemvbuffer);
  66. #else
  67. GEMV_R(m - is, min_i, 0, dp1, ZERO,
  68. a + (is + (is - min_i) * lda) * 2, lda,
  69. B + (is - min_i) * 2, 1,
  70. B + is * 2, 1, gemvbuffer);
  71. #endif
  72. }
  73. #endif
  74. for (i = 0; i < min_i; i++) {
  75. FLOAT *AA = a + ((is - i - 1) + (is - i - 1) * lda) * 2;
  76. FLOAT *BB = B + (is - i - 1) * 2;
  77. #if (TRANSA == 1) || (TRANSA == 3)
  78. #if TRANSA == 1
  79. if (i > 0) AXPYU_K (i, 0, 0, BB[0], BB[1], AA + 2, 1, BB + 2, 1, NULL, 0);
  80. #else
  81. if (i > 0) AXPYC_K(i, 0, 0, BB[0], BB[1], AA + 2, 1, BB + 2, 1, NULL, 0);
  82. #endif
  83. #endif
  84. #ifndef UNIT
  85. atemp1 = AA[0];
  86. atemp2 = AA[1];
  87. btemp1 = BB[0];
  88. btemp2 = BB[1];
  89. #if (TRANSA == 1) || (TRANSA == 2)
  90. BB[0] = atemp1 * btemp1 - atemp2 * btemp2;
  91. BB[1] = atemp1 * btemp2 + atemp2 * btemp1;
  92. #else
  93. BB[0] = atemp1 * btemp1 + atemp2 * btemp2;
  94. BB[1] = atemp1 * btemp2 - atemp2 * btemp1;
  95. #endif
  96. #endif
  97. #if (TRANSA == 2) || (TRANSA == 4)
  98. if (i < min_i - 1) {
  99. #if TRANSA == 2
  100. temp = DOTU_K(min_i - i - 1, AA - (min_i - i - 1) * 2, 1, BB - (min_i - i - 1) * 2, 1);
  101. #else
  102. temp = DOTC_K(min_i - i - 1, AA - (min_i - i - 1) * 2, 1, BB - (min_i - i - 1) * 2, 1);
  103. #endif
  104. BB[0] += CREAL(temp);
  105. BB[1] += CIMAG(temp);
  106. }
  107. #endif
  108. }
  109. #if (TRANSA == 2) || (TRANSA == 4)
  110. if (is - min_i > 0){
  111. #if TRANSA == 2
  112. GEMV_T(is - min_i, min_i, 0, dp1, ZERO,
  113. a + (is - min_i) * lda * 2, lda,
  114. B, 1,
  115. B + (is - min_i) * 2, 1, gemvbuffer);
  116. #else
  117. GEMV_C(is - min_i, min_i, 0, dp1, ZERO,
  118. a + (is - min_i) * lda * 2, lda,
  119. B, 1,
  120. B + (is - min_i) * 2, 1, gemvbuffer);
  121. #endif
  122. }
  123. #endif
  124. }
  125. if (incb != 1) {
  126. COPY_K(m, buffer, 1, b, incb);
  127. }
  128. return 0;
  129. }