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.

trmm_uncopy_sve_v1.c 5.5 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136
  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. #ifdef __ARM_FEATURE_SVE
  41. #include <arm_sve.h>
  42. #endif
  43. int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG posX, BLASLONG posY, FLOAT *b){
  44. BLASLONG i, js;
  45. BLASLONG X;
  46. js = 0;
  47. FLOAT *ao;
  48. #ifdef DOUBLE
  49. svint64_t index = svindex_s64(0LL, lda);
  50. svbool_t pn = svwhilelt_b64((uint64_t)js, (uint64_t)n);
  51. int n_active = svcntp_b64(svptrue_b64(), pn);
  52. #else
  53. svint32_t index = svindex_s32(0, lda);
  54. svbool_t pn = svwhilelt_b32((uint64_t)js, (uint64_t)n);
  55. int n_active = svcntp_b32(svptrue_b32(), pn);
  56. #endif
  57. do
  58. {
  59. X = posX;
  60. if (posX <= posY) {
  61. ao = a + posX + posY * lda;
  62. } else {
  63. ao = a + posY + posX * lda;
  64. }
  65. i = 0;
  66. do
  67. {
  68. if (X < posY) {
  69. #ifdef DOUBLE
  70. svfloat64_t aj_vec = svld1_gather_index(pn, ao, index);
  71. #else
  72. svfloat32_t aj_vec = svld1_gather_index(pn, ao, index);
  73. #endif
  74. svst1(pn, b, aj_vec);
  75. ao ++;
  76. b += n_active;
  77. X ++;
  78. i ++;
  79. } else
  80. if (X > posY) {
  81. ao += lda;
  82. b += n_active;
  83. X ++;
  84. i ++;
  85. } else {
  86. /* I did not find a way to unroll this while preserving vector-length-agnostic code. */
  87. #ifdef UNIT
  88. int temp = 0;
  89. for (int j = 0; j < n_active; j++) {
  90. for (int k = 0 ; k < j; k++) {
  91. b[temp++] = ZERO;
  92. }
  93. b[temp++] = ONE;
  94. for (int k = j+1; k < n_active; k++) {
  95. b[temp++] = *(ao+k*lda+j);
  96. }
  97. }
  98. #else
  99. int temp = 0;
  100. for (int j = 0; j < n_active; j++) {
  101. for (int k = 0 ; k < j; k++) {
  102. b[temp++] = ZERO;
  103. }
  104. for (int k = j; k < n_active; k++) {
  105. b[temp++] = *(ao+k*lda+j);
  106. }
  107. }
  108. #endif
  109. ao += n_active;
  110. b += n_active*n_active;
  111. X += n_active;
  112. i += n_active;
  113. }
  114. } while (i < m);
  115. posY += n_active;
  116. js += n_active;
  117. #ifdef DOUBLE
  118. pn = svwhilelt_b64((uint64_t)js, (uint64_t)n);
  119. n_active = svcntp_b64(svptrue_b64(), pn);
  120. } while (svptest_any(svptrue_b64(), pn));
  121. #else
  122. pn = svwhilelt_b32((uint64_t)js, (uint64_t)n);
  123. n_active = svcntp_b32(svptrue_b32(), pn);
  124. } while (svptest_any(svptrue_b32(), pn));
  125. #endif
  126. return 0;
  127. }