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.

dgemv_n_power10.c 13 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565
  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. #include <altivec.h>
  29. typedef __vector unsigned char vec_t;
  30. typedef FLOAT v4sf_t __attribute__ ((vector_size (16)));
  31. typedef __vector_pair __attribute__((aligned(8))) vecp_t;
  32. #include "dgemv_n_microk_power10.c"
  33. #define MMA(X, APTR, ACC) \
  34. rX = (vec_t *) & X; \
  35. rowA = *((vecp_t*)((void*)&APTR)); \
  36. __builtin_mma_xvf64gerpp (ACC, rowA, rX[0]);
  37. #define SAVE(ACC, Z) \
  38. rowC = (v4sf_t *) &y[Z]; \
  39. __builtin_mma_disassemble_acc ((void *)result, ACC); \
  40. result[0][1] = result[1][0]; \
  41. result[2][1] = result[3][0]; \
  42. rowC[0] += valpha * result[0]; \
  43. rowC[1] += valpha * result[2];
  44. void
  45. dgemv_kernel_4x128 (BLASLONG n, FLOAT * a_ptr, BLASLONG lda, FLOAT * xo,
  46. FLOAT * y, FLOAT alpha)
  47. {
  48. BLASLONG i, j, tmp;
  49. FLOAT *a0 = a_ptr;
  50. FLOAT *x1 = xo;
  51. vector double valpha = { alpha, alpha };
  52. v4sf_t *rowC;
  53. __vector_quad acc0, acc1, acc2, acc3, acc4, acc5, acc6, acc7;
  54. v4sf_t result[4];
  55. vecp_t rowA;
  56. vec_t *rX;
  57. tmp = (n / 32) * 32;
  58. for (i = 0; i < tmp; i += 32)
  59. {
  60. xo = x1;
  61. a0 = a_ptr;
  62. __builtin_mma_xxsetaccz (&acc0);
  63. __builtin_mma_xxsetaccz (&acc1);
  64. __builtin_mma_xxsetaccz (&acc2);
  65. __builtin_mma_xxsetaccz (&acc3);
  66. __builtin_mma_xxsetaccz (&acc4);
  67. __builtin_mma_xxsetaccz (&acc5);
  68. __builtin_mma_xxsetaccz (&acc6);
  69. __builtin_mma_xxsetaccz (&acc7);
  70. for (j = 0; j < 32; j++)
  71. {
  72. __builtin_prefetch (xo+j);
  73. __builtin_prefetch (a0+i+j+lda);
  74. MMA (xo[j], a0[i + 0 + j * lda], &acc0);
  75. MMA (xo[j], a0[i + 4 + j * lda], &acc1);
  76. MMA (xo[j], a0[i + 8 + j * lda], &acc2);
  77. MMA (xo[j], a0[i + 12 + j * lda], &acc3);
  78. MMA (xo[j], a0[i + 16 + j * lda], &acc4);
  79. MMA (xo[j], a0[i + 20 + j * lda], &acc5);
  80. MMA (xo[j], a0[i + 24 + j * lda], &acc6);
  81. MMA (xo[j], a0[i + 28 + j * lda], &acc7);
  82. }
  83. xo += 32;
  84. a0 += lda << 5;
  85. for (j = 0; j < 32; j++)
  86. {
  87. __builtin_prefetch (xo+j);
  88. __builtin_prefetch (a0+i+j+lda);
  89. MMA (xo[j], a0[i + 0 + j * lda], &acc0);
  90. MMA (xo[j], a0[i + 4 + j * lda], &acc1);
  91. MMA (xo[j], a0[i + 8 + j * lda], &acc2);
  92. MMA (xo[j], a0[i + 12 + j * lda], &acc3);
  93. MMA (xo[j], a0[i + 16 + j * lda], &acc4);
  94. MMA (xo[j], a0[i + 20 + j * lda], &acc5);
  95. MMA (xo[j], a0[i + 24 + j * lda], &acc6);
  96. MMA (xo[j], a0[i + 28 + j * lda], &acc7);
  97. }
  98. xo += 32;
  99. a0 += lda << 5;
  100. for (j = 0; j < 32; j++)
  101. {
  102. __builtin_prefetch (xo+j);
  103. __builtin_prefetch (a0+i+j+lda);
  104. MMA (xo[j], a0[i + 0 + j * lda], &acc0);
  105. MMA (xo[j], a0[i + 4 + j * lda], &acc1);
  106. MMA (xo[j], a0[i + 8 + j * lda], &acc2);
  107. MMA (xo[j], a0[i + 12 + j * lda], &acc3);
  108. MMA (xo[j], a0[i + 16 + j * lda], &acc4);
  109. MMA (xo[j], a0[i + 20 + j * lda], &acc5);
  110. MMA (xo[j], a0[i + 24 + j * lda], &acc6);
  111. MMA (xo[j], a0[i + 28 + j * lda], &acc7);
  112. }
  113. xo += 32;
  114. a0 += lda << 5;
  115. for (j = 0; j < 32; j++)
  116. {
  117. __builtin_prefetch (xo+j);
  118. __builtin_prefetch (a0+i+j+lda);
  119. MMA (xo[j], a0[i + 0 + j * lda], &acc0);
  120. MMA (xo[j], a0[i + 4 + j * lda], &acc1);
  121. MMA (xo[j], a0[i + 8 + j * lda], &acc2);
  122. MMA (xo[j], a0[i + 12 + j * lda], &acc3);
  123. MMA (xo[j], a0[i + 16 + j * lda], &acc4);
  124. MMA (xo[j], a0[i + 20 + j * lda], &acc5);
  125. MMA (xo[j], a0[i + 24 + j * lda], &acc6);
  126. MMA (xo[j], a0[i + 28 + j * lda], &acc7);
  127. }
  128. xo += 32;
  129. a0 += lda << 5;
  130. SAVE (&acc0, i + 0);
  131. SAVE (&acc1, i + 4);
  132. SAVE (&acc2, i + 8);
  133. SAVE (&acc3, i + 12);
  134. SAVE (&acc4, i + 16);
  135. SAVE (&acc5, i + 20);
  136. SAVE (&acc6, i + 24);
  137. SAVE (&acc7, i + 28);
  138. }
  139. for (i = tmp; i < n; i += 4)
  140. {
  141. xo = x1;
  142. a0 = a_ptr;
  143. __builtin_mma_xxsetaccz (&acc0);
  144. for (j = 0; j < 32; j++)
  145. {
  146. __builtin_prefetch (xo+j);
  147. __builtin_prefetch (a0+i+j+lda);
  148. MMA (xo[j], a0[i + j * lda], &acc0);
  149. }
  150. xo += 32;
  151. a0 += lda << 5;
  152. for (j = 0; j < 32; j++)
  153. {
  154. __builtin_prefetch (xo+j);
  155. __builtin_prefetch (a0+i+j+lda);
  156. MMA (xo[j], a0[i + j * lda], &acc0);
  157. }
  158. xo += 32;
  159. a0 += lda << 5;
  160. for (j = 0; j < 32; j++)
  161. {
  162. __builtin_prefetch (xo+j);
  163. __builtin_prefetch (a0+i+j+lda);
  164. MMA (xo[j], a0[i + j * lda], &acc0);
  165. }
  166. xo += 32;
  167. a0 += lda << 5;
  168. for (j = 0; j < 32; j++)
  169. {
  170. __builtin_prefetch (xo+j);
  171. __builtin_prefetch (a0+i+j+lda);
  172. MMA (xo[j], a0[i + j * lda], &acc0);
  173. }
  174. xo += 32;
  175. a0 += lda << 5;
  176. SAVE (&acc0, i);
  177. }
  178. }
  179. #define NBMAX 4096
  180. #ifndef HAVE_KERNEL_4x4
  181. static void dgemv_kernel_4x4(BLASLONG n, FLOAT *a_ptr, BLASLONG lda, FLOAT *xo, FLOAT *y, FLOAT alpha)
  182. {
  183. BLASLONG i;
  184. FLOAT x[4] __attribute__ ((aligned (16)));;
  185. FLOAT *a0 = a_ptr;
  186. FLOAT *a1 = a0 + lda;
  187. FLOAT *a2 = a1 + lda;
  188. FLOAT *a3 = a2 + lda;
  189. for ( i=0; i<4; i++)
  190. x[i] = xo[i] * alpha;
  191. for ( i=0; i< n; i+=4 )
  192. {
  193. y[i] += a0[i]*x[0] + a1[i]*x[1] + a2[i]*x[2] + a3[i]*x[3];
  194. y[i+1] += a0[i+1]*x[0] + a1[i+1]*x[1] + a2[i+1]*x[2] + a3[i+1]*x[3];
  195. y[i+2] += a0[i+2]*x[0] + a1[i+2]*x[1] + a2[i+2]*x[2] + a3[i+2]*x[3];
  196. y[i+3] += a0[i+3]*x[0] + a1[i+3]*x[1] + a2[i+3]*x[2] + a3[i+3]*x[3];
  197. }
  198. }
  199. #endif
  200. #ifndef HAVE_KERNEL_4x2
  201. static void dgemv_kernel_4x2(BLASLONG n, FLOAT *a0, FLOAT *a1, FLOAT *xo, FLOAT *y, FLOAT alpha)
  202. {
  203. BLASLONG i;
  204. FLOAT x[4] __attribute__ ((aligned (16)));;
  205. for ( i=0; i<2; i++)
  206. x[i] = xo[i] * alpha;
  207. for ( i=0; i< n; i+=4 )
  208. {
  209. y[i] += a0[i]*x[0] + a1[i]*x[1];
  210. y[i+1] += a0[i+1]*x[0] + a1[i+1]*x[1];
  211. y[i+2] += a0[i+2]*x[0] + a1[i+2]*x[1];
  212. y[i+3] += a0[i+3]*x[0] + a1[i+3]*x[1];
  213. }
  214. }
  215. #endif
  216. #ifndef HAVE_KERNEL_4x1
  217. static void dgemv_kernel_4x1(BLASLONG n, FLOAT *a0, FLOAT *xo, FLOAT *y, FLOAT alpha)
  218. {
  219. BLASLONG i;
  220. FLOAT x[4] __attribute__ ((aligned (16)));;
  221. for ( i=0; i<1; i++)
  222. x[i] = xo[i] * alpha;
  223. for ( i=0; i< n; i+=4 )
  224. {
  225. y[i] += a0[i]*x[0];
  226. y[i+1] += a0[i+1]*x[0];
  227. y[i+2] += a0[i+2]*x[0];
  228. y[i+3] += a0[i+3]*x[0];
  229. }
  230. }
  231. #endif
  232. static void add_y(BLASLONG n, FLOAT *src, FLOAT *dest, BLASLONG inc_dest)
  233. {
  234. BLASLONG i;
  235. if ( inc_dest != 1 )
  236. {
  237. for ( i=0; i<n; i++ )
  238. {
  239. *dest += *src;
  240. src++;
  241. dest += inc_dest;
  242. }
  243. return;
  244. }
  245. }
  246. int CNAME(BLASLONG m, BLASLONG n, BLASLONG dummy1, FLOAT alpha, FLOAT *a, BLASLONG lda, FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y, FLOAT *buffer)
  247. {
  248. BLASLONG i;
  249. FLOAT *a_ptr;
  250. FLOAT *x_ptr;
  251. FLOAT *y_ptr;
  252. BLASLONG n1;
  253. BLASLONG m1;
  254. BLASLONG m2;
  255. BLASLONG m3;
  256. BLASLONG n2;
  257. BLASLONG lda4 = lda << 2;
  258. BLASLONG lda128 = lda << 7;
  259. FLOAT xbuffer[8] __attribute__ ((aligned (16)));
  260. FLOAT *ybuffer;
  261. if ( m < 1 ) return(0);
  262. if ( n < 1 ) return(0);
  263. ybuffer = buffer;
  264. BLASLONG n128 = n >> 7;
  265. n1 = (n - (n128 * 128)) >> 2;
  266. n2 = (n - (n128 * 128)) & 3;
  267. m3 = m & 3 ;
  268. m1 = m & -4 ;
  269. m2 = (m & (NBMAX-1)) - m3 ;
  270. y_ptr = y;
  271. BLASLONG NB = NBMAX;
  272. while ( NB == NBMAX )
  273. {
  274. m1 -= NB;
  275. if ( m1 < 0)
  276. {
  277. if ( m2 == 0 ) break;
  278. NB = m2;
  279. }
  280. a_ptr = a;
  281. x_ptr = x;
  282. if ( inc_y != 1 )
  283. memset(ybuffer,0,NB*8);
  284. else
  285. ybuffer = y_ptr;
  286. if ( inc_x == 1 )
  287. {
  288. for( i = 0; i < n128 ; i++)
  289. {
  290. dgemv_kernel_4x128(NB,a_ptr,lda,x_ptr,ybuffer,alpha);
  291. a_ptr += lda128;
  292. x_ptr += 128;
  293. }
  294. for( i = 0; i < n1 ; i++)
  295. {
  296. dgemv_kernel_4x4(NB,a_ptr,lda,x_ptr,ybuffer,alpha);
  297. a_ptr += lda4;
  298. x_ptr += 4;
  299. }
  300. if ( n2 & 2 )
  301. {
  302. dgemv_kernel_4x2(NB,a_ptr,a_ptr+lda,x_ptr,ybuffer,alpha);
  303. a_ptr += lda*2;
  304. x_ptr += 2;
  305. }
  306. if ( n2 & 1 )
  307. {
  308. dgemv_kernel_4x1(NB,a_ptr,x_ptr,ybuffer,alpha);
  309. a_ptr += lda;
  310. x_ptr += 1;
  311. }
  312. }
  313. else
  314. {
  315. for( i = 0; i < n128 ; i++)
  316. {
  317. FLOAT xbuffer[128] __attribute__ ((aligned (16)));
  318. BLASLONG j;
  319. for ( j = 0; j < 128 ; j++)
  320. {
  321. xbuffer[j] = x_ptr[0];
  322. x_ptr += inc_x;
  323. }
  324. dgemv_kernel_4x128(NB,a_ptr,lda,xbuffer,ybuffer,alpha);
  325. a_ptr += lda128;
  326. }
  327. for( i = 0; i < n1 ; i++)
  328. {
  329. xbuffer[0] = x_ptr[0];
  330. x_ptr += inc_x;
  331. xbuffer[1] = x_ptr[0];
  332. x_ptr += inc_x;
  333. xbuffer[2] = x_ptr[0];
  334. x_ptr += inc_x;
  335. xbuffer[3] = x_ptr[0];
  336. x_ptr += inc_x;
  337. dgemv_kernel_4x4(NB,a_ptr,lda,xbuffer,ybuffer,alpha);
  338. a_ptr += lda4;
  339. }
  340. for( i = 0; i < n2 ; i++)
  341. {
  342. xbuffer[0] = x_ptr[0];
  343. x_ptr += inc_x;
  344. dgemv_kernel_4x1(NB,a_ptr,xbuffer,ybuffer,alpha);
  345. a_ptr += lda;
  346. }
  347. }
  348. a += NB;
  349. if ( inc_y != 1 )
  350. {
  351. add_y(NB,ybuffer,y_ptr,inc_y);
  352. y_ptr += NB * inc_y;
  353. }
  354. else
  355. y_ptr += NB ;
  356. }
  357. if ( m3 == 0 ) return(0);
  358. if ( m3 == 3 )
  359. {
  360. a_ptr = a;
  361. x_ptr = x;
  362. FLOAT temp0 = 0.0;
  363. FLOAT temp1 = 0.0;
  364. FLOAT temp2 = 0.0;
  365. if ( lda == 3 && inc_x ==1 )
  366. {
  367. for( i = 0; i < ( n & -4 ); i+=4 )
  368. {
  369. temp0 += a_ptr[0] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  370. temp1 += a_ptr[1] * x_ptr[0] + a_ptr[4] * x_ptr[1];
  371. temp2 += a_ptr[2] * x_ptr[0] + a_ptr[5] * x_ptr[1];
  372. temp0 += a_ptr[6] * x_ptr[2] + a_ptr[9] * x_ptr[3];
  373. temp1 += a_ptr[7] * x_ptr[2] + a_ptr[10] * x_ptr[3];
  374. temp2 += a_ptr[8] * x_ptr[2] + a_ptr[11] * x_ptr[3];
  375. a_ptr += 12;
  376. x_ptr += 4;
  377. }
  378. for( ; i < n; i++ )
  379. {
  380. temp0 += a_ptr[0] * x_ptr[0];
  381. temp1 += a_ptr[1] * x_ptr[0];
  382. temp2 += a_ptr[2] * x_ptr[0];
  383. a_ptr += 3;
  384. x_ptr ++;
  385. }
  386. }
  387. else
  388. {
  389. for( i = 0; i < n; i++ )
  390. {
  391. temp0 += a_ptr[0] * x_ptr[0];
  392. temp1 += a_ptr[1] * x_ptr[0];
  393. temp2 += a_ptr[2] * x_ptr[0];
  394. a_ptr += lda;
  395. x_ptr += inc_x;
  396. }
  397. }
  398. y_ptr[0] += alpha * temp0;
  399. y_ptr += inc_y;
  400. y_ptr[0] += alpha * temp1;
  401. y_ptr += inc_y;
  402. y_ptr[0] += alpha * temp2;
  403. return(0);
  404. }
  405. if ( m3 == 2 )
  406. {
  407. a_ptr = a;
  408. x_ptr = x;
  409. FLOAT temp0 = 0.0;
  410. FLOAT temp1 = 0.0;
  411. if ( lda == 2 && inc_x ==1 )
  412. {
  413. for( i = 0; i < (n & -4) ; i+=4 )
  414. {
  415. temp0 += a_ptr[0] * x_ptr[0] + a_ptr[2] * x_ptr[1];
  416. temp1 += a_ptr[1] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  417. temp0 += a_ptr[4] * x_ptr[2] + a_ptr[6] * x_ptr[3];
  418. temp1 += a_ptr[5] * x_ptr[2] + a_ptr[7] * x_ptr[3];
  419. a_ptr += 8;
  420. x_ptr += 4;
  421. }
  422. for( ; i < n; i++ )
  423. {
  424. temp0 += a_ptr[0] * x_ptr[0];
  425. temp1 += a_ptr[1] * x_ptr[0];
  426. a_ptr += 2;
  427. x_ptr ++;
  428. }
  429. }
  430. else
  431. {
  432. for( i = 0; i < n; i++ )
  433. {
  434. temp0 += a_ptr[0] * x_ptr[0];
  435. temp1 += a_ptr[1] * x_ptr[0];
  436. a_ptr += lda;
  437. x_ptr += inc_x;
  438. }
  439. }
  440. y_ptr[0] += alpha * temp0;
  441. y_ptr += inc_y;
  442. y_ptr[0] += alpha * temp1;
  443. return(0);
  444. }
  445. if ( m3 == 1 )
  446. {
  447. a_ptr = a;
  448. x_ptr = x;
  449. FLOAT temp = 0.0;
  450. if ( lda == 1 && inc_x ==1 )
  451. {
  452. for( i = 0; i < (n & -4); i+=4 )
  453. {
  454. temp += a_ptr[i] * x_ptr[i] + a_ptr[i+1] * x_ptr[i+1] + a_ptr[i+2] * x_ptr[i+2] + a_ptr[i+3] * x_ptr[i+3];
  455. }
  456. for( ; i < n; i++ )
  457. {
  458. temp += a_ptr[i] * x_ptr[i];
  459. }
  460. }
  461. else
  462. {
  463. for( i = 0; i < n; i++ )
  464. {
  465. temp += a_ptr[0] * x_ptr[0];
  466. a_ptr += lda;
  467. x_ptr += inc_x;
  468. }
  469. }
  470. y_ptr[0] += alpha * temp;
  471. return(0);
  472. }
  473. return(0);
  474. }