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.

zspmv_k.c 4.4 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. int CNAME(BLASLONG m, FLOAT alpha_r, FLOAT alpha_i,
  42. FLOAT *a, FLOAT *x, BLASLONG incx, FLOAT *y, BLASLONG incy, void *buffer){
  43. BLASLONG i;
  44. FLOAT *X = x;
  45. FLOAT *Y = y;
  46. FLOAT *gemvbuffer = (FLOAT *)buffer;
  47. FLOAT *bufferY = gemvbuffer;
  48. FLOAT *bufferX = gemvbuffer;
  49. OPENBLAS_COMPLEX_FLOAT result;
  50. if (incy != 1) {
  51. Y = bufferY;
  52. bufferX = (FLOAT *)(((BLASLONG)bufferY + m * sizeof(FLOAT) * 2 + 4095) & ~4095);
  53. // gemvbuffer = bufferX;
  54. COPY_K(m, y, incy, Y, 1);
  55. }
  56. if (incx != 1) {
  57. X = bufferX;
  58. // gemvbuffer = (FLOAT *)(((BLASLONG)bufferX + m * sizeof(FLOAT) * 2 + 4095) & ~4095);
  59. COPY_K(m, x, incx, X, 1);
  60. }
  61. for (i = 0; i < m; i++) {
  62. #ifndef LOWER
  63. if (i > 0) {
  64. result = DOTU_K(i, a, 1, X, 1);
  65. Y[i * 2 + 0] += alpha_r * CREAL(result) - alpha_i * CIMAG(result);
  66. Y[i * 2 + 1] += alpha_r * CIMAG(result) + alpha_i * CREAL(result);
  67. }
  68. AXPYU_K(i + 1, 0, 0,
  69. alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1],
  70. alpha_r * X[i * 2 + 1] + alpha_i * X[i * 2 + 0],
  71. a, 1, Y, 1, NULL, 0);
  72. a += (i + 1) * 2;
  73. #else
  74. result = DOTU_K(m - i, a + i * 2, 1, X + i * 2, 1);
  75. Y[i * 2 + 0] += alpha_r * CREAL(result) - alpha_i * CIMAG(result);
  76. Y[i * 2 + 1] += alpha_r * CIMAG(result) + alpha_i * CREAL(result);
  77. if (m - i > 1)
  78. AXPYU_K(m - i - 1, 0, 0,
  79. alpha_r * X[i * 2 + 0] - alpha_i * X[i * 2 + 1],
  80. alpha_r * X[i * 2 + 1] + alpha_i * X[i * 2 + 0],
  81. a + (i + 1) * 2, 1, Y + (i + 1) * 2, 1, NULL, 0);
  82. a += (m - i - 1) * 2;
  83. #endif
  84. }
  85. if (incy != 1) {
  86. COPY_K(m, Y, 1, y, incy);
  87. }
  88. return 0;
  89. }