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.

zher2_k.c 4.8 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  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. int CNAME(BLASLONG m, FLOAT alpha_r, FLOAT alpha_i,
  42. FLOAT *x, BLASLONG incx,
  43. FLOAT *y, BLASLONG incy, FLOAT *a, BLASLONG lda, FLOAT *buffer){
  44. BLASLONG i;
  45. FLOAT *X, *Y;
  46. X = x;
  47. Y = y;
  48. lda *= 2;
  49. if (incx != 1) {
  50. COPY_K(m, x, incx, buffer, 1);
  51. X = buffer;
  52. }
  53. if (incy != 1) {
  54. COPY_K(m, y, incy, (FLOAT *)((BLASLONG)buffer + (BUFFER_SIZE / 2)), 1);
  55. Y = (FLOAT *)((BLASLONG)buffer + (BUFFER_SIZE / 2));
  56. }
  57. for (i = 0; i < m; i++){
  58. #ifndef HEMVREV
  59. #ifndef LOWER
  60. AXPYU_K(i + 1, 0, 0,
  61. alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1],
  62. - alpha_i * X[i * 2 + 0] - alpha_r * X[i * 2 + 1],
  63. Y, 1, a, 1, NULL, 0);
  64. AXPYU_K(i + 1, 0, 0,
  65. alpha_r * Y[i * 2 + 0] + alpha_i * Y[i * 2 + 1],
  66. alpha_i * Y[i * 2 + 0] - alpha_r * Y[i * 2 + 1],
  67. X, 1, a, 1, NULL, 0);
  68. a[i * 2 + 1] = ZERO;
  69. a += lda;
  70. #else
  71. AXPYU_K(m - i, 0, 0,
  72. alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1],
  73. - alpha_i * X[i * 2 + 0] - alpha_r * X[i * 2 + 1],
  74. Y + i * 2, 1, a, 1, NULL, 0);
  75. AXPYU_K(m - i, 0, 0,
  76. alpha_r * Y[i * 2 + 0] + alpha_i * Y[i * 2 + 1],
  77. alpha_i * Y[i * 2 + 0] - alpha_r * Y[i * 2 + 1],
  78. X + i * 2, 1, a, 1, NULL, 0);
  79. a[1] = ZERO;
  80. a += 2 + lda;
  81. #endif
  82. #else
  83. #ifndef LOWER
  84. AXPYC_K(i + 1, 0, 0,
  85. alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1],
  86. alpha_i * X[i * 2 + 0] + alpha_r * X[i * 2 + 1],
  87. Y, 1, a, 1, NULL, 0);
  88. AXPYC_K(i + 1, 0, 0,
  89. alpha_r * Y[i * 2 + 0] + alpha_i * Y[i * 2 + 1],
  90. - alpha_i * Y[i * 2 + 0] + alpha_r * Y[i * 2 + 1],
  91. X, 1, a, 1, NULL, 0);
  92. a[i * 2 + 1] = ZERO;
  93. a += lda;
  94. #else
  95. AXPYC_K(m - i, 0, 0,
  96. alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1],
  97. alpha_i * X[i * 2 + 0] + alpha_r * X[i * 2 + 1],
  98. Y + i * 2, 1, a, 1, NULL, 0);
  99. AXPYC_K(m - i, 0, 0,
  100. alpha_r * Y[i * 2 + 0] + alpha_i * Y[i * 2 + 1],
  101. - alpha_i * Y[i * 2 + 0] + alpha_r * Y[i * 2 + 1],
  102. X + i * 2, 1, a, 1, NULL, 0);
  103. a[1] = ZERO;
  104. a += 2 + lda;
  105. #endif
  106. #endif
  107. }
  108. return 0;
  109. }