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.

ztpsv_L.c 4.6 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140
  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. int CNAME(BLASLONG m, FLOAT *a, FLOAT *b, BLASLONG incb, void *buffer){
  43. BLASLONG i;
  44. #if (TRANSA == 2) || (TRANSA == 4)
  45. OPENBLAS_COMPLEX_FLOAT result;
  46. #endif
  47. #ifndef UNIT
  48. FLOAT ar, ai, br, bi, ratio, den;
  49. #endif
  50. FLOAT *B = b;
  51. if (incb != 1) {
  52. B = buffer;
  53. COPY_K(m, b, incb, buffer, 1);
  54. }
  55. for (i = 0; i < m; i++) {
  56. #if (TRANSA == 2) || (TRANSA == 4)
  57. if (i > 0) {
  58. #if TRANSA == 2
  59. result = DOTU_K(i, a, 1, B, 1);
  60. #else
  61. result = DOTC_K(i, a, 1, B, 1);
  62. #endif
  63. B[i * COMPSIZE + 0] -= CREAL(result);
  64. B[i * COMPSIZE + 1] -= CIMAG(result);
  65. }
  66. #endif
  67. #ifndef UNIT
  68. #if (TRANSA == 1) || (TRANSA == 3)
  69. ar = a[0];
  70. ai = a[1];
  71. #else
  72. ar = a[i * COMPSIZE + 0];
  73. ai = a[i * COMPSIZE + 1];
  74. #endif
  75. if (fabs(ar) >= fabs(ai)){
  76. ratio = ai / ar;
  77. den = 1./(ar * ( 1 + ratio * ratio));
  78. ar = den;
  79. #if TRANSA < 3
  80. ai = -ratio * den;
  81. #else
  82. ai = ratio * den;
  83. #endif
  84. } else {
  85. ratio = ar / ai;
  86. den = 1./(ai * ( 1 + ratio * ratio));
  87. ar = ratio * den;
  88. #if TRANSA < 3
  89. ai = -den;
  90. #else
  91. ai = den;
  92. #endif
  93. }
  94. br = B[i * COMPSIZE + 0];
  95. bi = B[i * COMPSIZE + 1];
  96. B[i * COMPSIZE + 0] = ar*br - ai*bi;
  97. B[i * COMPSIZE + 1] = ar*bi + ai*br;
  98. #endif
  99. #if (TRANSA == 1) || (TRANSA == 3)
  100. if (i < m - 1) {
  101. #if TRANSA == 1
  102. AXPYU_K(m - i - 1 , 0, 0,
  103. - B[i * COMPSIZE + 0], - B[i * COMPSIZE + 1],
  104. a + COMPSIZE, 1, B + (i + 1) * COMPSIZE, 1, NULL, 0);
  105. #else
  106. AXPYC_K(m - i - 1 , 0, 0,
  107. - B[i * COMPSIZE + 0], - B[i * COMPSIZE + 1],
  108. a + COMPSIZE, 1, B + (i + 1) * COMPSIZE, 1, NULL, 0);
  109. #endif
  110. }
  111. #endif
  112. #if (TRANSA == 1) || (TRANSA == 3)
  113. a += (m - i) * 2;
  114. #else
  115. a += (i + 1) * 2;
  116. #endif
  117. }
  118. if (incb != 1) {
  119. COPY_K(m, buffer, 1, b, incb);
  120. }
  121. return 0;
  122. }