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.

gbmv_k.c 4.0 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105
  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. #ifndef TRANS
  42. #define M m
  43. #define N n
  44. #else
  45. #define N m
  46. #define M n
  47. #endif
  48. void CNAME(BLASLONG m, BLASLONG n, BLASLONG ku, BLASLONG kl, FLOAT alpha,
  49. FLOAT *a, BLASLONG lda,
  50. FLOAT *x, BLASLONG incx, FLOAT *y, BLASLONG incy, void *buffer){
  51. BLASLONG i, offset_u, offset_l, start, end, length;
  52. FLOAT *X = x;
  53. FLOAT *Y = y;
  54. FLOAT *gemvbuffer = (FLOAT *)buffer;
  55. FLOAT *bufferY = gemvbuffer;
  56. FLOAT *bufferX = gemvbuffer;
  57. if (incy != 1) {
  58. Y = bufferY;
  59. bufferX = (FLOAT *)(((BLASLONG)bufferY + M * sizeof(FLOAT) + 4095) & ~4095);
  60. gemvbuffer = bufferX;
  61. COPY_K(M, y, incy, Y, 1);
  62. }
  63. if (incx != 1) {
  64. X = bufferX;
  65. gemvbuffer = (FLOAT *)(((BLASLONG)bufferX + N * sizeof(FLOAT) + 4095) & ~4095);
  66. COPY_K(N, x, incx, X, 1);
  67. }
  68. offset_u = ku;
  69. offset_l = ku + m;
  70. for (i = 0; i < MIN(n, m + ku); i++) {
  71. start = MAX(offset_u, 0);
  72. end = MIN(offset_l, ku + kl + 1);
  73. length = end - start;
  74. #ifndef TRANS
  75. AXPYU_K(length, 0, 0,
  76. alpha * X[i],
  77. a + start, 1, Y + start - offset_u, 1, NULL, 0);
  78. #else
  79. Y[i] += alpha * DOTU_K(length, a + start, 1, X + start - offset_u, 1);
  80. #endif
  81. offset_u --;
  82. offset_l --;
  83. a += lda;
  84. }
  85. if (incy != 1) {
  86. COPY_K(M, Y, 1, y, incy);
  87. }
  88. return;
  89. }