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.

scal_vector.c 6.1 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138
  1. /***************************************************************************
  2. Copyright (c) 2020, The OpenBLAS Project
  3. All rights reserved.
  4. Redistribution and use in source and binary forms, with or without
  5. modification, are permitted provided that the following conditions are
  6. met:
  7. 1. Redistributions of source code must retain the above copyright
  8. notice, this list of conditions and the following disclaimer.
  9. 2. Redistributions in binary form must reproduce the above copyright
  10. notice, this list of conditions and the following disclaimer in
  11. the documentation and/or other materials provided with the
  12. distribution.
  13. 3. Neither the name of the OpenBLAS project nor the names of
  14. its contributors may be used to endorse or promote products
  15. derived from this software without specific prior written permission.
  16. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  17. AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  19. ARE DISCLAIMED. IN NO EVENT SHALL THE OPENBLAS PROJECT OR CONTRIBUTORS BE
  20. LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  22. SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  23. CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  24. OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
  25. USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. *****************************************************************************/
  27. #include "common.h"
  28. #if !defined(DOUBLE)
  29. #define VSETVL(n) vsetvl_e32m8(n)
  30. #define VSETVL_MAX vsetvlmax_e32m1()
  31. #define FLOAT_V_T vfloat32m8_t
  32. #define VLEV_FLOAT vle32_v_f32m8
  33. #define VLSEV_FLOAT vlse32_v_f32m8
  34. #define VSEV_FLOAT vse32_v_f32m8
  35. #define VSSEV_FLOAT vsse32_v_f32m8
  36. #define VFMULVF_FLOAT vfmul_vf_f32m8
  37. #define VFMVVF_FLOAT vfmv_v_f_f32m8
  38. #else
  39. #define VSETVL(n) vsetvl_e64m8(n)
  40. #define VSETVL_MAX vsetvlmax_e64m1()
  41. #define FLOAT_V_T vfloat64m8_t
  42. #define VLEV_FLOAT vle64_v_f64m8
  43. #define VLSEV_FLOAT vlse64_v_f64m8
  44. #define VSEV_FLOAT vse64_v_f64m8
  45. #define VSSEV_FLOAT vsse64_v_f64m8
  46. #define VFMULVF_FLOAT vfmul_vf_f64m8
  47. #define VFMVVF_FLOAT vfmv_v_f_f64m8
  48. #endif
  49. int CNAME(BLASLONG n, BLASLONG dummy0, BLASLONG dummy1, FLOAT da, FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y, FLOAT *dummy, BLASLONG dummy2)
  50. {
  51. BLASLONG i=0,j=0;
  52. if ( (n <= 0) || (inc_x <= 0))
  53. return(0);
  54. FLOAT_V_T v0, v1;
  55. unsigned int gvl = 0;
  56. if(inc_x == 1){
  57. if(da == 0.0){
  58. memset(&x[0], 0, n * sizeof(FLOAT));
  59. }else{
  60. gvl = VSETVL(n);
  61. if(gvl <= n / 2){
  62. for(i = 0, j = 0; i < n/(2*gvl); i++, j+=2*gvl){
  63. v0 = VLEV_FLOAT(&x[j], gvl);
  64. v0 = VFMULVF_FLOAT(v0, da,gvl);
  65. VSEV_FLOAT(&x[j], v0, gvl);
  66. v1 = VLEV_FLOAT(&x[j+gvl], gvl);
  67. v1 = VFMULVF_FLOAT(v1, da, gvl);
  68. VSEV_FLOAT(&x[j+gvl], v1, gvl);
  69. }
  70. }
  71. //tail
  72. for(; j <n; ){
  73. gvl = VSETVL(n-j);
  74. v0 = VLEV_FLOAT(&x[j], gvl);
  75. v0 = VFMULVF_FLOAT(v0, da, gvl);
  76. VSEV_FLOAT(&x[j], v0, gvl);
  77. j += gvl;
  78. }
  79. }
  80. }else{
  81. if(da == 0.0){
  82. gvl = VSETVL(n);
  83. BLASLONG stride_x = inc_x * sizeof(FLOAT);
  84. BLASLONG ix = 0;
  85. if(gvl <= n / 2){
  86. long int inc_xv = gvl * inc_x;
  87. v0 = VFMVVF_FLOAT(0, gvl);
  88. for(i = 0, j = 0; i < n/(2*gvl); i++, j+=2*gvl){
  89. VSSEV_FLOAT(&x[ix], stride_x, v0, gvl);
  90. VSSEV_FLOAT(&x[ix + inc_xv], stride_x, v0, gvl);
  91. ix += inc_xv * 2;
  92. }
  93. }
  94. //tail
  95. for(; j <n; ){
  96. gvl = VSETVL(n-j);
  97. v0 = VFMVVF_FLOAT(0, gvl);
  98. VSSEV_FLOAT(&x[ix], stride_x, v0, gvl);
  99. j += gvl;
  100. ix += inc_x * gvl;
  101. }
  102. }else{
  103. gvl = VSETVL(n);
  104. BLASLONG stride_x = inc_x * sizeof(FLOAT);
  105. BLASLONG ix = 0;
  106. if(gvl < n / 2){
  107. BLASLONG inc_xv = gvl * inc_x;
  108. for(i = 0, j = 0; i < n/(2*gvl); i++, j+=2*gvl){
  109. v0 = VLSEV_FLOAT(&x[ix], stride_x, gvl);
  110. v0 = VFMULVF_FLOAT(v0, da,gvl);
  111. VSSEV_FLOAT(&x[ix], stride_x, v0, gvl);
  112. v1 = VLSEV_FLOAT(&x[ix+inc_xv], stride_x, gvl);
  113. v1 = VFMULVF_FLOAT(v1, da, gvl);
  114. VSSEV_FLOAT(&x[ix+inc_xv], stride_x, v1, gvl);
  115. ix += inc_xv * 2;
  116. }
  117. }
  118. //tail
  119. for(; j <n; ){
  120. gvl = VSETVL(n-j);
  121. v0 = VLSEV_FLOAT(&x[ix], stride_x, gvl);
  122. v0 = VFMULVF_FLOAT(v0, da, gvl);
  123. VSSEV_FLOAT(&x[ix], stride_x, v0, gvl);
  124. j += gvl;
  125. ix += inc_x * gvl;
  126. }
  127. }
  128. }
  129. return 0;
  130. }