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.

zsymv_k.c 4.9 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  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. #include "symcopy.h"
  42. int CNAME(BLASLONG m, BLASLONG offset, FLOAT alpha_r, FLOAT alpha_i,
  43. FLOAT *a, BLASLONG lda, FLOAT *x, BLASLONG incx, FLOAT *y, BLASLONG incy, FLOAT *buffer){
  44. BLASLONG is, min_i;
  45. FLOAT *X = x;
  46. FLOAT *Y = y;
  47. FLOAT *symbuffer = buffer;
  48. FLOAT *gemvbuffer = (FLOAT *)(((BLASLONG)buffer + SYMV_P * SYMV_P * sizeof(FLOAT) * 2 + 4095) & ~4095);
  49. FLOAT *bufferY = gemvbuffer;
  50. FLOAT *bufferX = gemvbuffer;
  51. if (incy != 1) {
  52. Y = bufferY;
  53. bufferX = (FLOAT *)(((BLASLONG)bufferY + m * sizeof(FLOAT) * 2 + 4095) & ~4095);
  54. gemvbuffer = bufferX;
  55. COPY_K(m, y, incy, Y, 1);
  56. }
  57. if (incx != 1) {
  58. X = bufferX;
  59. gemvbuffer = (FLOAT *)(((BLASLONG)bufferX + m * sizeof(FLOAT) * 2 + 4095) & ~4095);
  60. COPY_K(m, x, incx, X, 1);
  61. }
  62. #ifndef LOWER
  63. for(is = m - offset; is < m; is += SYMV_P){
  64. min_i = MIN(m - is, SYMV_P);
  65. #else
  66. for(is = 0; is < offset; is += SYMV_P){
  67. min_i = MIN(offset - is, SYMV_P);
  68. #endif
  69. #ifndef LOWER
  70. if (is >0){
  71. GEMV_T(is, min_i, 0, alpha_r, alpha_i,
  72. a + is * lda * COMPSIZE, lda,
  73. X, 1,
  74. Y + is * COMPSIZE, 1, gemvbuffer);
  75. GEMV_N(is, min_i, 0, alpha_r, alpha_i,
  76. a + is * lda * COMPSIZE, lda,
  77. X + is * COMPSIZE, 1,
  78. Y, 1, gemvbuffer);
  79. }
  80. #endif
  81. #ifdef LOWER
  82. ZSYMCOPY_L(min_i, a + (is + is * lda) * COMPSIZE, lda, symbuffer);
  83. #else
  84. ZSYMCOPY_U(min_i, a + (is + is * lda) * COMPSIZE, lda, symbuffer);
  85. #endif
  86. GEMV_N(min_i, min_i, 0, alpha_r, alpha_i,
  87. symbuffer, min_i,
  88. X + is * COMPSIZE, 1,
  89. Y + is * COMPSIZE, 1, gemvbuffer);
  90. #ifdef LOWER
  91. if (m - is > min_i){
  92. GEMV_T(m - is - min_i, min_i, 0, alpha_r, alpha_i,
  93. a + ((is + min_i) + is * lda) * COMPSIZE, lda,
  94. X + (is + min_i) * COMPSIZE, 1,
  95. Y + is * COMPSIZE, 1, gemvbuffer);
  96. GEMV_N(m - is - min_i, min_i, 0, alpha_r, alpha_i,
  97. a + ((is + min_i) + is * lda) * COMPSIZE, lda,
  98. X + is * COMPSIZE, 1,
  99. Y + (is + min_i) * COMPSIZE, 1, gemvbuffer);
  100. }
  101. #endif
  102. } /* end of is */
  103. if (incy != 1) {
  104. COPY_K(m, Y, 1, y, incy);
  105. }
  106. return 0;
  107. }