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.

sbgemv_common.c 6.7 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223
  1. /***************************************************************************
  2. Copyright (c) 2024, 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. #ifndef SBGEMV_COMMON_C
  28. #define SBGEMV_COMMON_C
  29. #include "gemm_common.c"
  30. #if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
  31. #define BF16_HI(data, zero) (vec_f32)vec_mergeh(data, zero)
  32. #define BF16_LO(data, zero) (vec_f32)vec_mergel(data, zero)
  33. #else
  34. #define BF16_HI(data, zero) (vec_f32)vec_mergeh(zero, data)
  35. #define BF16_LO(data, zero) (vec_f32)vec_mergel(zero, data)
  36. #endif
  37. FORCEINLINE vec_f32 vec_loadNHi(void *src, BLASLONG n, vec_bf16 zero)
  38. {
  39. vec_bf16 data = vec_loadN(src, n);
  40. return BF16_HI(data, zero);
  41. }
  42. FORCEINLINE vec_f32 vec_mult(vec_f32 *inp, vec_bf16 in0, vec_bf16 zero)
  43. {
  44. vec_f32 v_in00 = BF16_HI(in0, zero);
  45. vec_f32 v_in01 = BF16_LO(in0, zero);
  46. return (inp[0] * v_in00) + (inp[1] * v_in01);
  47. }
  48. FORCEINLINE vec_f32 vec_load_mult(vec_bf16 *in, vec_f32 *inp, vec_bf16 zero)
  49. {
  50. vec_bf16 in0 = (vec_bf16)vec_load_vec(in);
  51. return vec_mult(inp, in0, zero);
  52. }
  53. FORCEINLINE void vec_load_vec2(vec_bf16 *in, vec_f32 *v_x0, vec_bf16 zero)
  54. {
  55. vec_bf16 inp = (vec_bf16)vec_load_vec(in);
  56. v_x0[0] = BF16_HI(inp, zero);
  57. v_x0[1] = BF16_LO(inp, zero);
  58. }
  59. FORCEINLINE void vec_mult2(vec_f32 v_x0, vec_bf16 in0, vec_bf16 zero, vec_f32 *vy0)
  60. {
  61. vec_f32 v_in00 = BF16_HI(in0, zero);
  62. vec_f32 v_in01 = BF16_LO(in0, zero);
  63. vy0[0] += (v_x0 * v_in00);
  64. vy0[1] += (v_x0 * v_in01);
  65. }
  66. FORCEINLINE void vec_load_mult2(vec_f32 v_x0, vec_bf16 *in, vec_bf16 zero, vec_f32 *vy0)
  67. {
  68. vec_bf16 in0 = (vec_bf16)vec_load_vec(in);
  69. vec_mult2(v_x0, in0, zero, vy0);
  70. }
  71. FORCEINLINE vec_f32 vec_loadN_mult(vec_bf16 *in, vec_f32 *inp, BLASLONG n, vec_bf16 zero)
  72. {
  73. vec_bf16 in0 = vec_loadN(in, n);
  74. return vec_mult(inp, in0, zero);
  75. }
  76. FORCEINLINE void vec_loadN_vec2(vec_bf16 *in, vec_f32 *v_x0, BLASLONG n, vec_bf16 zero)
  77. {
  78. vec_bf16 inp = vec_loadN(in, n);
  79. v_x0[0] = BF16_HI(inp, zero);
  80. v_x0[1] = BF16_LO(inp, zero);
  81. }
  82. FORCEINLINE void vec_loadN_mult2(vec_f32 v_x0, vec_bf16 *in, BLASLONG n, vec_bf16 zero, vec_f32 *vy0)
  83. {
  84. vec_bf16 in0 = vec_loadN(in, n);
  85. vec_mult2(v_x0, in0, zero, vy0);
  86. }
  87. FORCEINLINE vec_f32 vec_loadNHi_mult(vec_bf16 *in, vec_f32 v_inp0, BLASLONG n, vec_bf16 zero)
  88. {
  89. vec_f32 v_in00 = vec_loadNHi(in, n, zero);
  90. return (v_inp0 * v_in00);
  91. }
  92. FORCEINLINE void copy_x(BLASLONG n, IFLOAT *src, IFLOAT *dest, BLASLONG inc_src)
  93. {
  94. for (BLASLONG i = 0; i < n; i++) {
  95. *dest++ = *src;
  96. src += inc_src;
  97. }
  98. }
  99. FORCEINLINE void copy_y_beta(BLASLONG n, FLOAT *src, FLOAT *dest, BLASLONG inc_src, FLOAT beta)
  100. {
  101. if (beta == (FLOAT)0) {
  102. memset(dest, 0, n * sizeof(FLOAT));
  103. } else if (beta == (FLOAT)1) {
  104. for (BLASLONG i = 0; i < n; i++) {
  105. *dest++ = *src;
  106. src += inc_src;
  107. }
  108. } else {
  109. for (BLASLONG i = 0; i < n; i++) {
  110. *dest++ = *src * beta;
  111. src += inc_src;
  112. }
  113. }
  114. }
  115. FORCEINLINE void move_y(BLASLONG n, FLOAT *src, FLOAT *dest, BLASLONG inc_dest)
  116. {
  117. for (BLASLONG i = 0; i < n; i++) {
  118. *dest = *src++;
  119. dest += inc_dest;
  120. }
  121. }
  122. FORCEINLINE void copy_y(BLASLONG n, FLOAT *src, FLOAT *dest, BLASLONG inc_src, FLOAT beta)
  123. {
  124. if (beta == (FLOAT)0) {
  125. move_y(n, src, dest, inc_src);
  126. } else if (beta == (FLOAT)1) {
  127. for (BLASLONG i = 0; i < n; i++) {
  128. *dest += *src++;
  129. dest += inc_src;
  130. }
  131. } else {
  132. for (BLASLONG i = 0; i < n; i++) {
  133. *dest = *src++ + (beta * *dest);
  134. dest += inc_src;
  135. }
  136. }
  137. }
  138. static void BF16GEMV_N_beta(BLASLONG n, FLOAT *output_vector, FLOAT *input_vector, FLOAT beta)
  139. {
  140. if (beta == (FLOAT)0) {
  141. memset(output_vector, 0, sizeof(FLOAT) * n);
  142. } else if (beta == (FLOAT)1) {
  143. if (output_vector != input_vector) {
  144. memcpy(output_vector, input_vector, sizeof(FLOAT) * n);
  145. }
  146. } else {
  147. vec_f32 b = { beta, beta, beta, beta };
  148. vec_f32 *in = (vec_f32 *)input_vector;
  149. vec_f32 *out = (vec_f32 *)output_vector;
  150. BLASLONG n8 = n / 8;
  151. BLASLONG i = 0;
  152. vec_f32 v_inp0[2];
  153. for (; i + 4 <= n8; i += 4) {
  154. vec_f32 v_inp1[2], v_inp2[2], v_inp3[2];
  155. vec_load_pair(v_inp0, &in[(i * 2) + 0]);
  156. vec_load_pair(v_inp1, &in[(i * 2) + 2]);
  157. vec_load_pair(v_inp2, &in[(i * 2) + 4]);
  158. vec_load_pair(v_inp3, &in[(i * 2) + 6]);
  159. v_inp0[0] *= b;
  160. v_inp0[1] *= b;
  161. v_inp1[0] *= b;
  162. v_inp1[1] *= b;
  163. v_inp2[0] *= b;
  164. v_inp2[1] *= b;
  165. v_inp3[0] *= b;
  166. v_inp3[1] *= b;
  167. vec_store_pair(&out[(i * 2) + 0], v_inp0);
  168. vec_store_pair(&out[(i * 2) + 2], v_inp1);
  169. vec_store_pair(&out[(i * 2) + 4], v_inp2);
  170. vec_store_pair(&out[(i * 2) + 6], v_inp3);
  171. }
  172. for (; i < n8; i++) {
  173. vec_load_pair(v_inp0, &in[(i * 2) + 0]);
  174. v_inp0[0] *= b;
  175. v_inp0[1] *= b;
  176. vec_store_pair(&out[(i * 2) + 0], v_inp0);
  177. }
  178. n &= 7;
  179. if (n > 4) {
  180. BLASLONG n3 = n & 3;
  181. vec_loadN2_f32(v_inp0, &in[(i * 2) + 0], n3);
  182. v_inp0[0] *= b;
  183. v_inp0[1] *= b;
  184. vec_storeN2_f32(v_inp0, &out[(i * 2) + 0], n3);
  185. } else if (n) {
  186. v_inp0[0] = vec_loadN_f32(&in[(i * 2) + 0], n);
  187. v_inp0[0] *= b;
  188. vec_storeN_f32(v_inp0[0], &out[(i * 2) + 0], n);
  189. }
  190. }
  191. }
  192. #endif