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.

sgemv_n.c 12 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385
  1. /***************************************************************************
  2. Copyright (c) 2019, 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
  21. CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
  22. GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  23. HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  24. LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
  25. THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. *****************************************************************************/
  27. #if !defined(__VEC__) || !defined(__ALTIVEC__)
  28. #include "../arm/gemv_n.c"
  29. #else
  30. #include <altivec.h>
  31. #include "common.h"
  32. #define NBMAX 4096
  33. static void sgemv_kernel_4x8(BLASLONG n, FLOAT **ap, FLOAT *xo, FLOAT *y,
  34. BLASLONG lda4, FLOAT *alpha) {
  35. BLASLONG i;
  36. FLOAT *a0, *a1, *a2, *a3, *b0, *b1, *b2, *b3;
  37. FLOAT x0, x1, x2, x3, x4, x5, x6, x7;
  38. a0 = ap[0];
  39. a1 = ap[1];
  40. a2 = ap[2];
  41. a3 = ap[3];
  42. b0 = a0 + lda4;
  43. b1 = a1 + lda4;
  44. b2 = a2 + lda4;
  45. b3 = a3 + lda4;
  46. x0 = xo[0] * (*alpha);
  47. x1 = xo[1] * (*alpha);
  48. x2 = xo[2] * (*alpha);
  49. x3 = xo[3] * (*alpha);
  50. x4 = xo[4] * (*alpha);
  51. x5 = xo[5] * (*alpha);
  52. x6 = xo[6] * (*alpha);
  53. x7 = xo[7] * (*alpha);
  54. __vector float v_x0 = {x0, x0, x0, x0};
  55. __vector float v_x1 = {x1, x1, x1, x1};
  56. __vector float v_x2 = {x2, x2, x2, x2};
  57. __vector float v_x3 = {x3, x3, x3, x3};
  58. __vector float v_x4 = {x4, x4, x4, x4};
  59. __vector float v_x5 = {x5, x5, x5, x5};
  60. __vector float v_x6 = {x6, x6, x6, x6};
  61. __vector float v_x7 = {x7, x7, x7, x7};
  62. for (i = 0; i < n; i += 4) {
  63. __vector float vy = vec_vsx_ld(0, &y[i]);
  64. __vector float va0 = vec_vsx_ld(0, &a0[i]);
  65. __vector float va1 = vec_vsx_ld(0, &a1[i]);
  66. __vector float va2 = vec_vsx_ld(0, &a2[i]);
  67. __vector float va3 = vec_vsx_ld(0, &a3[i]);
  68. __vector float vb0 = vec_vsx_ld(0, &b0[i]);
  69. __vector float vb1 = vec_vsx_ld(0, &b1[i]);
  70. __vector float vb2 = vec_vsx_ld(0, &b2[i]);
  71. __vector float vb3 = vec_vsx_ld(0, &b3[i]);
  72. vy += v_x0 * va0 + v_x1 * va1 + v_x2 * va2 + v_x3 * va3;
  73. vy += v_x4 * vb0 + v_x5 * vb1 + v_x6 * vb2 + v_x7 * vb3;
  74. vec_vsx_st(vy, 0, &y[i]);
  75. }
  76. }
  77. static void sgemv_kernel_4x4(BLASLONG n, FLOAT **ap, FLOAT *xo, FLOAT *y,
  78. FLOAT *alpha) {
  79. BLASLONG i;
  80. FLOAT x0, x1, x2, x3;
  81. FLOAT *a0, *a1, *a2, *a3;
  82. a0 = ap[0];
  83. a1 = ap[1];
  84. a2 = ap[2];
  85. a3 = ap[3];
  86. x0 = xo[0] * (*alpha);
  87. x1 = xo[1] * (*alpha);
  88. x2 = xo[2] * (*alpha);
  89. x3 = xo[3] * (*alpha);
  90. __vector float v_x0 = {x0, x0, x0, x0};
  91. __vector float v_x1 = {x1, x1, x1, x1};
  92. __vector float v_x2 = {x2, x2, x2, x2};
  93. __vector float v_x3 = {x3, x3, x3, x3};
  94. for (i = 0; i < n; i += 4) {
  95. __vector float vy = vec_vsx_ld(0, &y[i]);
  96. __vector float va0 = vec_vsx_ld(0, &a0[i]);
  97. __vector float va1 = vec_vsx_ld(0, &a1[i]);
  98. __vector float va2 = vec_vsx_ld(0, &a2[i]);
  99. __vector float va3 = vec_vsx_ld(0, &a3[i]);
  100. vy += v_x0 * va0 + v_x1 * va1 + v_x2 * va2 + v_x3 * va3;
  101. vec_vsx_st(vy, 0, &y[i]);
  102. }
  103. }
  104. static void sgemv_kernel_4x2(BLASLONG n, FLOAT **ap, FLOAT *x, FLOAT *y,
  105. FLOAT *alpha) {
  106. BLASLONG i;
  107. FLOAT x0, x1;
  108. FLOAT *a0, *a1;
  109. a0 = ap[0];
  110. a1 = ap[1];
  111. x0 = x[0] * (*alpha);
  112. x1 = x[1] * (*alpha);
  113. __vector float v_x0 = {x0, x0, x0, x0};
  114. __vector float v_x1 = {x1, x1, x1, x1};
  115. for (i = 0; i < n; i += 4) {
  116. __vector float vy = vec_vsx_ld(0, &y[i]);
  117. __vector float va0 = vec_vsx_ld(0, &a0[i]);
  118. __vector float va1 = vec_vsx_ld(0, &a1[i]);
  119. vy += v_x0 * va0 + v_x1 * va1;
  120. vec_vsx_st(vy, 0, &y[i]);
  121. }
  122. }
  123. static void sgemv_kernel_4x1(BLASLONG n, FLOAT *ap, FLOAT *x, FLOAT *y,
  124. FLOAT *alpha) {
  125. BLASLONG i;
  126. FLOAT x0 = x[0] * (*alpha);
  127. __vector float v_x0 = {x0, x0, x0, x0};
  128. for (i = 0; i < n; i += 4) {
  129. __vector float vy = vec_vsx_ld(0, &y[i]);
  130. __vector float va0 = vec_vsx_ld(0, &ap[i]);
  131. vy += v_x0 * va0;
  132. vec_vsx_st(vy, 0, &y[i]);
  133. }
  134. }
  135. static void add_y(BLASLONG n, FLOAT *src, FLOAT *dest, BLASLONG inc_dest) {
  136. BLASLONG i;
  137. for (i = 0; i < n; i++) {
  138. *dest += *src;
  139. src++;
  140. dest += inc_dest;
  141. }
  142. return;
  143. }
  144. int CNAME(BLASLONG m, BLASLONG n, BLASLONG dummy1, FLOAT alpha, FLOAT *a,
  145. BLASLONG lda, FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y,
  146. FLOAT *buffer) {
  147. BLASLONG i, n1, m1, m2, m3, n2, lda4, lda8;
  148. FLOAT *a_ptr, *x_ptr, *y_ptr, *ap[4];
  149. lda4 = lda << 2;
  150. lda8 = lda << 3;
  151. FLOAT xbuffer[8] __attribute__((aligned(16)));
  152. FLOAT *ybuffer = buffer;
  153. if (m < 1) return (0);
  154. if (n < 1) return (0);
  155. if (inc_x == 1) {
  156. n1 = n >> 3;
  157. n2 = n & 7;
  158. } else {
  159. n1 = n >> 2;
  160. n2 = n & 3;
  161. }
  162. m3 = m & 3;
  163. m1 = m & -4;
  164. m2 = (m & (NBMAX - 1)) - m3;
  165. y_ptr = y;
  166. BLASLONG NB = NBMAX;
  167. while (NB == NBMAX) {
  168. m1 -= NB;
  169. if (m1 < 0) {
  170. if (m2 == 0) break;
  171. NB = m2;
  172. }
  173. a_ptr = a;
  174. x_ptr = x;
  175. ap[0] = a_ptr;
  176. ap[1] = a_ptr + lda;
  177. ap[2] = ap[1] + lda;
  178. ap[3] = ap[2] + lda;
  179. if (inc_y != 1)
  180. memset(ybuffer, 0, NB * 4);
  181. else
  182. ybuffer = y_ptr;
  183. if (inc_x == 1) {
  184. for (i = 0; i < n1; i++) {
  185. sgemv_kernel_4x8(NB, ap, x_ptr, ybuffer, lda4, &alpha);
  186. ap[0] += lda8;
  187. ap[1] += lda8;
  188. ap[2] += lda8;
  189. ap[3] += lda8;
  190. a_ptr += lda8;
  191. x_ptr += 8;
  192. }
  193. if (n2 & 4) {
  194. sgemv_kernel_4x4(NB, ap, x_ptr, ybuffer, &alpha);
  195. ap[0] += lda4;
  196. ap[1] += lda4;
  197. ap[2] += lda4;
  198. ap[3] += lda4;
  199. a_ptr += lda4;
  200. x_ptr += 4;
  201. }
  202. if (n2 & 2) {
  203. sgemv_kernel_4x2(NB, ap, x_ptr, ybuffer, &alpha);
  204. a_ptr += lda * 2;
  205. x_ptr += 2;
  206. }
  207. if (n2 & 1) {
  208. sgemv_kernel_4x1(NB, a_ptr, x_ptr, ybuffer, &alpha);
  209. a_ptr += lda;
  210. x_ptr += 1;
  211. }
  212. } else {
  213. for (i = 0; i < n1; i++) {
  214. xbuffer[0] = x_ptr[0];
  215. x_ptr += inc_x;
  216. xbuffer[1] = x_ptr[0];
  217. x_ptr += inc_x;
  218. xbuffer[2] = x_ptr[0];
  219. x_ptr += inc_x;
  220. xbuffer[3] = x_ptr[0];
  221. x_ptr += inc_x;
  222. sgemv_kernel_4x4(NB, ap, xbuffer, ybuffer, &alpha);
  223. ap[0] += lda4;
  224. ap[1] += lda4;
  225. ap[2] += lda4;
  226. ap[3] += lda4;
  227. a_ptr += lda4;
  228. }
  229. for (i = 0; i < n2; i++) {
  230. xbuffer[0] = x_ptr[0];
  231. x_ptr += inc_x;
  232. sgemv_kernel_4x1(NB, a_ptr, xbuffer, ybuffer, &alpha);
  233. a_ptr += lda;
  234. }
  235. }
  236. a += NB;
  237. if (inc_y != 1) {
  238. add_y(NB, ybuffer, y_ptr, inc_y);
  239. y_ptr += NB * inc_y;
  240. } else
  241. y_ptr += NB;
  242. }
  243. if (m3 == 0) return (0);
  244. if (m3 == 3) {
  245. a_ptr = a;
  246. x_ptr = x;
  247. FLOAT temp0 = 0.0;
  248. FLOAT temp1 = 0.0;
  249. FLOAT temp2 = 0.0;
  250. if (lda == 3 && inc_x == 1) {
  251. for (i = 0; i < (n & -4); i += 4) {
  252. temp0 += a_ptr[0] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  253. temp1 += a_ptr[1] * x_ptr[0] + a_ptr[4] * x_ptr[1];
  254. temp2 += a_ptr[2] * x_ptr[0] + a_ptr[5] * x_ptr[1];
  255. temp0 += a_ptr[6] * x_ptr[2] + a_ptr[9] * x_ptr[3];
  256. temp1 += a_ptr[7] * x_ptr[2] + a_ptr[10] * x_ptr[3];
  257. temp2 += a_ptr[8] * x_ptr[2] + a_ptr[11] * x_ptr[3];
  258. a_ptr += 12;
  259. x_ptr += 4;
  260. }
  261. for (; i < n; i++) {
  262. temp0 += a_ptr[0] * x_ptr[0];
  263. temp1 += a_ptr[1] * x_ptr[0];
  264. temp2 += a_ptr[2] * x_ptr[0];
  265. a_ptr += 3;
  266. x_ptr++;
  267. }
  268. } else {
  269. for (i = 0; i < n; i++) {
  270. temp0 += a_ptr[0] * x_ptr[0];
  271. temp1 += a_ptr[1] * x_ptr[0];
  272. temp2 += a_ptr[2] * x_ptr[0];
  273. a_ptr += lda;
  274. x_ptr += inc_x;
  275. }
  276. }
  277. y_ptr[0] += alpha * temp0;
  278. y_ptr += inc_y;
  279. y_ptr[0] += alpha * temp1;
  280. y_ptr += inc_y;
  281. y_ptr[0] += alpha * temp2;
  282. return (0);
  283. }
  284. if (m3 == 2) {
  285. a_ptr = a;
  286. x_ptr = x;
  287. FLOAT temp0 = 0.0;
  288. FLOAT temp1 = 0.0;
  289. if (lda == 2 && inc_x == 1) {
  290. for (i = 0; i < (n & -4); i += 4) {
  291. temp0 += a_ptr[0] * x_ptr[0] + a_ptr[2] * x_ptr[1];
  292. temp1 += a_ptr[1] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  293. temp0 += a_ptr[4] * x_ptr[2] + a_ptr[6] * x_ptr[3];
  294. temp1 += a_ptr[5] * x_ptr[2] + a_ptr[7] * x_ptr[3];
  295. a_ptr += 8;
  296. x_ptr += 4;
  297. }
  298. for (; i < n; i++) {
  299. temp0 += a_ptr[0] * x_ptr[0];
  300. temp1 += a_ptr[1] * x_ptr[0];
  301. a_ptr += 2;
  302. x_ptr++;
  303. }
  304. } else {
  305. for (i = 0; i < n; i++) {
  306. temp0 += a_ptr[0] * x_ptr[0];
  307. temp1 += a_ptr[1] * x_ptr[0];
  308. a_ptr += lda;
  309. x_ptr += inc_x;
  310. }
  311. }
  312. y_ptr[0] += alpha * temp0;
  313. y_ptr += inc_y;
  314. y_ptr[0] += alpha * temp1;
  315. return (0);
  316. }
  317. if (m3 == 1) {
  318. a_ptr = a;
  319. x_ptr = x;
  320. FLOAT temp = 0.0;
  321. if (lda == 1 && inc_x == 1) {
  322. for (i = 0; i < (n & -4); i += 4) {
  323. temp += a_ptr[i] * x_ptr[i] + a_ptr[i + 1] * x_ptr[i + 1] +
  324. a_ptr[i + 2] * x_ptr[i + 2] +
  325. a_ptr[i + 3] * x_ptr[i + 3];
  326. }
  327. for (; i < n; i++) {
  328. temp += a_ptr[i] * x_ptr[i];
  329. }
  330. } else {
  331. for (i = 0; i < n; i++) {
  332. temp += a_ptr[0] * x_ptr[0];
  333. a_ptr += lda;
  334. x_ptr += inc_x;
  335. }
  336. }
  337. y_ptr[0] += alpha * temp;
  338. return (0);
  339. }
  340. return (0);
  341. }
  342. #endif