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.

trsm_ltcopy_sve.c 4.3 kB

4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  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 "common.h"
  40. #include "arm_sve.h"
  41. #ifndef UNIT
  42. #define INV(a) (ONE / (a))
  43. #else
  44. #define INV(a) (ONE)
  45. #endif
  46. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG offset, FLOAT *b){
  47. BLASLONG i, ii, jj;
  48. FLOAT *ao;
  49. jj = offset;
  50. #ifdef DOUBLE
  51. int64_t js = 0;
  52. svbool_t pn = svwhilelt_b64(js, n);
  53. int n_active = svcntp_b64(svptrue_b64(), pn);
  54. #else
  55. int32_t N = n;
  56. int32_t js = 0;
  57. svbool_t pn = svwhilelt_b32(js, N);
  58. int n_active = svcntp_b32(svptrue_b32(), pn);
  59. #endif
  60. do {
  61. ao = a;
  62. i = 0;
  63. ii = 0;
  64. do {
  65. if (ii == jj) {
  66. for (int j = 0; j < n_active; j++) {
  67. *(b + j * n_active + j) = INV(*(ao + j * lda + j));
  68. for (int k = j+1; k < n_active; k++) {
  69. *(b + j * n_active + k) = *(ao + j * lda + k);
  70. }
  71. }
  72. b += n_active * n_active;
  73. ao += lda * n_active;
  74. i += n_active;
  75. ii += n_active;
  76. } else {
  77. if (ii < jj) {
  78. #ifdef DOUBLE
  79. svfloat64_t aj_vec = svld1(pn, ao);
  80. #else
  81. svfloat32_t aj_vec = svld1(pn, ao);
  82. #endif
  83. svst1(pn, b, aj_vec);
  84. }
  85. ao += lda;
  86. b += n_active;
  87. i ++;
  88. ii ++;
  89. }
  90. } while (i < m);
  91. a += n_active;
  92. jj += n_active;
  93. js += n_active;
  94. #ifdef DOUBLE
  95. pn = svwhilelt_b64(js, n);
  96. n_active = svcntp_b64(svptrue_b64(), pn);
  97. } while (svptest_any(svptrue_b64(), pn));
  98. #else
  99. pn = svwhilelt_b32(js, N);
  100. n_active = svcntp_b32(svptrue_b32(), pn);
  101. } while (svptest_any(svptrue_b32(), pn));
  102. #endif
  103. return 0;
  104. }