OSchip
/
OpenBLAS
Not watched
1
0
Fork 0
Code
Releases 66 Wiki evaluate Activity
Issues 0 Pull Requests 0 Datasets Model Cloudbrain HPC
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.
Tree: 2c3cdaf74e
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '2c3cdaf74e'
${ noResults }
OpenBLAS/kernel/zarch/cscal.c

474 lines
12 kB
Raw Blame History 

  1. /***************************************************************************

  2. Copyright (c) 2013-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 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. 

  28. /*

  29.  * Avoid contraction of floating point operations, specifically fused

  30.  * multiply-add, because they can cause unexpected results in complex

  31.  * multiplication.

  32.  */

  33. #if defined(__GNUC__) && !defined(__clang__)

  34. #pragma GCC optimize ("fp-contract=off")

  35. #endif

  36. 

  37. #if defined(__clang__)

  38. #pragma clang fp contract(off)

  39. #endif

  40. 

  41. #include "common.h"

  42. #include "vector-common.h"

  43. 

  44. static void cscal_kernel_16(BLASLONG n, FLOAT da_r, FLOAT da_i, FLOAT *x) {

  45.     vector_float da_r_vec = vec_splats(da_r);

  46.     vector_float da_i_vec = { -da_i, da_i, -da_i, da_i };

  47. 

  48.     vector_float *x_vec_ptr = (vector_float *)x;

  49. 

  50. #pragma GCC unroll 16

  51.     for (size_t i = 0; i < n/2; i++) {

  52. 	vector_float x_vec = vec_load_hinted(x + i * VLEN_FLOATS);

  53. 	vector_float x_swapped = {x_vec[1], x_vec[0], x_vec[3], x_vec[2]};

  54. 

  55. 	x_vec_ptr[i] =  x_vec * da_r_vec + x_swapped * da_i_vec;

  56.     }

  57. }

  58. 

  59. static void cscal_kernel_16_zero_r(BLASLONG n, FLOAT *alpha, FLOAT *x) {

  60.   __asm__("vlef   %%v0,4(%[alpha]),0\n\t"

  61.     "vlef   %%v0,4(%[alpha]),2\n\t"

  62.     "vflcsb %%v0,%%v0\n\t"

  63.     "vlef   %%v0,4(%[alpha]),1\n\t"

  64.     "vlef   %%v0,4(%[alpha]),3\n\t"

  65.     "srlg %[n],%[n],4\n\t"

  66.     "xgr   %%r1,%%r1\n\t"

  67.     "0:\n\t"

  68.     "pfd 2, 1024(%%r1,%[x])\n\t"

  69.     "vl   %%v16,0(%%r1,%[x])\n\t"

  70.     "vl   %%v17,16(%%r1,%[x])\n\t"

  71.     "vl   %%v18,32(%%r1,%[x])\n\t"

  72.     "vl   %%v19,48(%%r1,%[x])\n\t"

  73.     "vl   %%v20,64(%%r1,%[x])\n\t"

  74.     "vl   %%v21,80(%%r1,%[x])\n\t"

  75.     "vl   %%v22,96(%%r1,%[x])\n\t"

  76.     "vl   %%v23,112(%%r1,%[x])\n\t"

  77.     "verllg   %%v16,%%v16,32\n\t"

  78.     "verllg   %%v17,%%v17,32\n\t"

  79.     "verllg   %%v18,%%v18,32\n\t"

  80.     "verllg   %%v19,%%v19,32\n\t"

  81.     "verllg   %%v20,%%v20,32\n\t"

  82.     "verllg   %%v21,%%v21,32\n\t"

  83.     "verllg   %%v22,%%v22,32\n\t"

  84.     "verllg   %%v23,%%v23,32\n\t"

  85.     "vfmsb %%v16,%%v16,%%v0\n\t"

  86.     "vfmsb %%v17,%%v17,%%v0\n\t"

  87.     "vfmsb %%v18,%%v18,%%v0\n\t"

  88.     "vfmsb %%v19,%%v19,%%v0\n\t"

  89.     "vfmsb %%v20,%%v20,%%v0\n\t"

  90.     "vfmsb %%v21,%%v21,%%v0\n\t"

  91.     "vfmsb %%v22,%%v22,%%v0\n\t"

  92.     "vfmsb %%v23,%%v23,%%v0\n\t"

  93.     "vst %%v16,0(%%r1,%[x])\n\t"

  94.     "vst %%v17,16(%%r1,%[x])\n\t"

  95.     "vst %%v18,32(%%r1,%[x])\n\t"

  96.     "vst %%v19,48(%%r1,%[x])\n\t"

  97.     "vst %%v20,64(%%r1,%[x])\n\t"

  98.     "vst %%v21,80(%%r1,%[x])\n\t"

  99.     "vst %%v22,96(%%r1,%[x])\n\t"

  100.     "vst %%v23,112(%%r1,%[x])\n\t"

  101.     "agfi  %%r1,128\n\t"

  102.     "brctg %[n],0b"

  103.     : "+m"(*(FLOAT (*)[n * 2]) x),[n] "+&r"(n)

  104.     : [x] "a"(x), "m"(*(const FLOAT (*)[2]) alpha),

  105.        [alpha] "a"(alpha)

  106.     : "cc", "r1", "v0", "v16", "v17", "v18", "v19", "v20", "v21", "v22",

  107.        "v23");

  108. }

  109. 

  110. static void cscal_kernel_16_zero_i(BLASLONG n, FLOAT *alpha, FLOAT *x) {

  111.   __asm__("vlrepf %%v0,0(%[alpha])\n\t"

  112.     "srlg %[n],%[n],4\n\t"

  113.     "xgr   %%r1,%%r1\n\t"

  114.     "0:\n\t"

  115.     "pfd 2, 1024(%%r1,%[x])\n\t"

  116.     "vl   %%v16,0(%%r1,%[x])\n\t"

  117.     "vl   %%v17,16(%%r1,%[x])\n\t"

  118.     "vl   %%v18,32(%%r1,%[x])\n\t"

  119.     "vl   %%v19,48(%%r1,%[x])\n\t"

  120.     "vl   %%v20,64(%%r1,%[x])\n\t"

  121.     "vl   %%v21,80(%%r1,%[x])\n\t"

  122.     "vl   %%v22,96(%%r1,%[x])\n\t"

  123.     "vl   %%v23,112(%%r1,%[x])\n\t"

  124.     "vfmsb %%v16,%%v16,%%v0\n\t"

  125.     "vfmsb %%v17,%%v17,%%v0\n\t"

  126.     "vfmsb %%v18,%%v18,%%v0\n\t"

  127.     "vfmsb %%v19,%%v19,%%v0\n\t"

  128.     "vfmsb %%v20,%%v20,%%v0\n\t"

  129.     "vfmsb %%v21,%%v21,%%v0\n\t"

  130.     "vfmsb %%v22,%%v22,%%v0\n\t"

  131.     "vfmsb %%v23,%%v23,%%v0\n\t"

  132.     "vst %%v16,0(%%r1,%[x])\n\t"

  133.     "vst %%v17,16(%%r1,%[x])\n\t"

  134.     "vst %%v18,32(%%r1,%[x])\n\t"

  135.     "vst %%v19,48(%%r1,%[x])\n\t"

  136.     "vst %%v20,64(%%r1,%[x])\n\t"

  137.     "vst %%v21,80(%%r1,%[x])\n\t"

  138.     "vst %%v22,96(%%r1,%[x])\n\t"

  139.     "vst %%v23,112(%%r1,%[x])\n\t"

  140.     "agfi  %%r1,128\n\t"

  141.     "brctg %[n],0b"

  142.     : "+m"(*(FLOAT (*)[n * 2]) x),[n] "+&r"(n)

  143.     : [x] "a"(x), "m"(*(const FLOAT (*)[2]) alpha),

  144.        [alpha] "a"(alpha)

  145.     : "cc", "r1", "v0", "v16", "v17", "v18", "v19", "v20", "v21", "v22",

  146.        "v23");

  147. }

  148. 

  149. static void cscal_kernel_16_zero(BLASLONG n, FLOAT *x) {

  150.   __asm__("vzero %%v0\n\t"

  151.     "srlg %[n],%[n],4\n\t"

  152.     "xgr   %%r1,%%r1\n\t"

  153.     "0:\n\t"

  154.     "pfd 2, 1024(%%r1,%[x])\n\t"

  155.     "vst  %%v0,0(%%r1,%[x])\n\t"

  156.     "vst  %%v0,16(%%r1,%[x])\n\t"

  157.     "vst  %%v0,32(%%r1,%[x])\n\t"

  158.     "vst  %%v0,48(%%r1,%[x])\n\t"

  159.     "vst  %%v0,64(%%r1,%[x])\n\t"

  160.     "vst  %%v0,80(%%r1,%[x])\n\t"

  161.     "vst  %%v0,96(%%r1,%[x])\n\t"

  162.     "vst  %%v0,112(%%r1,%[x])\n\t"

  163.     "agfi  %%r1,128\n\t"

  164.     "brctg %[n],0b"

  165.     : "=m"(*(FLOAT (*)[n * 2]) x),[n] "+&r"(n)

  166.     : [x] "a"(x)

  167.     : "cc", "r1", "v0");

  168. }

  169. 

  170. static void cscal_kernel_inc_8(BLASLONG n, FLOAT da_r, FLOAT da_i, FLOAT *x,

  171.                                BLASLONG inc_x) {

  172.   BLASLONG i;

  173.   BLASLONG inc_x2 = 2 * inc_x;

  174.   BLASLONG inc_x3 = inc_x2 + inc_x;

  175.   FLOAT t0, t1, t2, t3;

  176. 

  177.   for (i = 0; i < n; i += 4) {

  178.     t0 = da_r * x[0] - da_i * x[1];

  179.     t1 = da_r * x[inc_x] - da_i * x[inc_x + 1];

  180.     t2 = da_r * x[inc_x2] - da_i * x[inc_x2 + 1];

  181.     t3 = da_r * x[inc_x3] - da_i * x[inc_x3 + 1];

  182. 

  183.     x[1] = da_i * x[0] + da_r * x[1];

  184.     x[inc_x + 1] = da_i * x[inc_x] + da_r * x[inc_x + 1];

  185.     x[inc_x2 + 1] = da_i * x[inc_x2] + da_r * x[inc_x2 + 1];

  186.     x[inc_x3 + 1] = da_i * x[inc_x3] + da_r * x[inc_x3 + 1];

  187. 

  188.     x[0] = t0;

  189.     x[inc_x] = t1;

  190.     x[inc_x2] = t2;

  191.     x[inc_x3] = t3;

  192. 

  193.     x += 4 * inc_x;

  194.   }

  195. }

  196. 

  197. int CNAME(BLASLONG n, BLASLONG dummy0, BLASLONG dummy1, FLOAT da_r, FLOAT da_i,

  198.           FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y, FLOAT *dummy,

  199.           BLASLONG dummy2) {

  200.   BLASLONG i = 0, j = 0;

  201.   FLOAT temp0;

  202.   FLOAT temp1;

  203.   FLOAT alpha[2] __attribute__ ((aligned(16)));

  204. 

  205.   if (inc_x != 1) {

  206.     inc_x <<= 1;

  207. 

  208.     if (da_r == 0.0) {

  209. 

  210.       BLASLONG n1 = n & -2;

  211. 

  212.       if (da_i == 0.0) {

  213.        if (dummy2 == 0) {

  214.         while (j < n1) {

  215. 

  216.           x[i] = 0.0;

  217.           x[i + 1] = 0.0;

  218.           x[i + inc_x] = 0.0;

  219.           x[i + 1 + inc_x] = 0.0;

  220.           i += 2 * inc_x;

  221.           j += 2;

  222. 

  223.         }

  224. 

  225.         while (j < n) {

  226. 

  227.           x[i] = 0.0;

  228.           x[i + 1] = 0.0;

  229.           i += inc_x;

  230.           j++;

  231. 

  232.         }

  233.        } else {

  234. 	  while (j < n1) {

  235. 	  if (isnan(x[i]) || isinf(x[i]) || isnan(x[i+1])) {

  236. 	  x[i] = NAN;

  237. 	  x[i+1] = NAN;

  238. 	  }else{

  239.           x[i] = 0.0;

  240.           x[i + 1] = 0.0;

  241. 	  }

  242. 	  if (isnan(x[i+inc_x]) || isinf(x[i+inc_x]) || isnan(x[i+1+inc_x])) {

  243.           x[i + inc_x] = NAN;

  244.           x[i + 1 + inc_x] = NAN;

  245. 	  } else {

  246.           x[i + inc_x] = 0.0;

  247.           x[i + 1 + inc_x] = 0.0;

  248. 	  }

  249.           i += 2 * inc_x;

  250.           j += 2;

  251. 

  252.         }

  253. 

  254.         while (j < n) {

  255. 	  if (isnan(x[i]) || isinf(x[i]) || isnan(x[i+1])) {

  256. 	  x[i] = NAN;

  257. 	  x[i+1] = NAN;

  258. 	  }else{

  259.           x[i] = 0.0;

  260.           x[i + 1] = 0.0;

  261. 	  }

  262.           i += inc_x;

  263.           j++;

  264. 	 }

  265.         }

  266.       } else {

  267. 

  268.         while (j < n1) {

  269.           if (isnan(x[i]) || isinf(x[i])) 

  270.             temp0   = NAN;

  271. 	  else

  272. 	    temp0 = -da_i * x[i + 1];

  273. 	  if (!isinf(x[i + 1]))

  274.             x[i + 1] = da_i * x[i];

  275. 	  else

  276. 	    x[i + 1] = NAN;

  277.           x[i] = temp0;

  278. 	  if (isnan(x[i+inc_x]) || isinf(x[i+inc_x]))

  279. 	    temp1 = NAN;

  280. 	  else

  281. 	    temp1 = -da_i * x[i + 1 + inc_x];

  282. 	  if (!isinf(x[i + 1 + inc_x]))

  283.             x[i + 1 + inc_x] = da_i * x[i + inc_x];

  284. 	  else

  285. 	    x[i + 1 + inc_x] = NAN;

  286.           x[i + inc_x] = temp1;

  287.           i += 2 * inc_x;

  288.           j += 2;

  289. 

  290.         }

  291. 

  292.         while (j < n) {

  293. 	  if (isnan(x[i]) || isinf(x[i]))

  294. 	    temp0 = NAN;

  295. 	  else

  296.             temp0 = -da_i * x[i + 1];

  297. 	  if (isinf(x[i + 1]))

  298. 	    x[i + 1] = NAN;

  299. 	  else

  300.             x[i + 1] = da_i * x[i];

  301.           x[i] = temp0;

  302.           i += inc_x;

  303.           j++;

  304. 

  305.         }

  306. 

  307.       }

  308. 

  309.     } else {

  310. 

  311.       if (da_i == 0.0 && dummy2) {

  312.         BLASLONG n1 = n & -2;

  313. 

  314.         while (j < n1) {

  315. 

  316.           temp0 = da_r * x[i];

  317.           x[i + 1] = da_r * x[i + 1];

  318.           x[i] = temp0;

  319.           temp1 = da_r * x[i + inc_x];

  320.           x[i + 1 + inc_x] = da_r * x[i + 1 + inc_x];

  321.           x[i + inc_x] = temp1;

  322.           i += 2 * inc_x;

  323.           j += 2;

  324. 

  325.         }

  326. 

  327.         while (j < n) {

  328. 

  329.           temp0 = da_r * x[i];

  330.           x[i + 1] = da_r * x[i + 1];

  331.           x[i] = temp0;

  332.           i += inc_x;

  333.           j++;

  334. 

  335.         }

  336. 

  337.       } else {

  338. 

  339.         BLASLONG n1 = n & -8;

  340.         if (n1 > 0) {

  341.           cscal_kernel_inc_8(n1, da_r, da_i, x, inc_x);

  342.           j = n1;

  343.           i = n1 * inc_x;

  344.         }

  345. 

  346.         while (j < n) {

  347. 

  348.           temp0 = da_r * x[i] - da_i * x[i + 1];

  349.           x[i + 1] = da_r * x[i + 1] + da_i * x[i];

  350.           x[i] = temp0;

  351.           i += inc_x;

  352.           j++;

  353. 

  354.         }

  355. 

  356.       }

  357. 

  358.     }

  359. 

  360.     return (0);

  361.   }

  362. 

  363.   BLASLONG n1 = n & -16;

  364.   if (n1 > 0) {

  365. 

  366.     alpha[0] = da_r;

  367.     alpha[1] = da_i;

  368. 

  369.     if (da_r == 0.0)

  370.       if (da_i == 0 && dummy2 == 0)

  371.         cscal_kernel_16_zero(n1, x);

  372.       else {

  373. /*	if (dummy2 == 0)

  374.         cscal_kernel_16_zero_r(n1, alpha, x);

  375. 	else*/

  376. 	cscal_kernel_16(n1, da_r, da_i, x);

  377.       }

  378. /*    else if (da_i == 0 && !isnan(da_r))

  379.       cscal_kernel_16/*_zero_i(n1, alpha, x);*/

  380.     else

  381.       cscal_kernel_16(n1, da_r, da_i, x);

  382. 

  383.     i = n1 << 1;

  384.     j = n1;

  385.   }

  386. 

  387.   if (da_r == 0.0 || isnan(da_r)) {

  388. 

  389.     if (da_i == 0.0) {

  390.       float res = 0.0;

  391.       if (isnan(da_r)) res = da_r;

  392.       while (j < n) {

  393. 	if (dummy2)

  394. 		if (isnan(x[i])|| isnan(x[i+1])) res=NAN;

  395.         x[i] = res;

  396.         x[i + 1] = res;

  397.         i += 2;

  398.         j++;

  399. 

  400.       }

  401.     } else if (isinf(da_r)) {

  402.         while(j < n)

  403.         {

  404. 

  405. 	  x[i]= NAN;

  406.           x[i+1] = da_r;

  407.           i += 2 ;

  408.           j++;

  409. 

  410.         }

  411. 

  412.     } else {

  413. 

  414.       while (j < n) {

  415. 

  416.         temp0 = -da_i * x[i + 1];

  417. 	if (isinf(x[i])) temp0 = NAN;

  418. 	if (!isinf(x[i + 1]))

  419.           x[i + 1] = da_i * x[i];

  420. 	else

  421. 	  x[i + 1] = NAN;

  422. 	if (!isnan(x[i]))

  423.           x[i] = temp0;

  424.         i += 2;

  425.         j++;

  426. 

  427.       }

  428. 

  429.     }

  430. 

  431.   } else {

  432. 

  433.     if (da_i == 0.0) {

  434. 

  435.       while (j < n) {

  436. 

  437.         temp0 = da_r * x[i];

  438. 	if (dummy2) {

  439. 	if (isnan(x[i])||isinf(x[i]))temp0 = NAN;

  440. 	if (isnan(x[i+1])||isinf(x[i+1])) 

  441. 		x[i+1] = NAN;

  442. 	else

  443. 		x[i+1] = da_r * x[i + 1];

  444. 	} else {

  445. 		if (isnan(x[i]))

  446. 			x[i + 1] = NAN;

  447. 		else

  448.         		x[i + 1] = da_r * x[i + 1];

  449. 	}

  450.         x[i] = temp0;

  451.         i += 2;

  452.         j++;

  453. 

  454.       }

  455. 

  456.     } else {

  457. 

  458.       while (j < n) {

  459. 

  460.         temp0 = da_r * x[i] - da_i * x[i + 1];

  461.         x[i + 1] = da_r * x[i + 1] + da_i * x[i];

  462.         if (!isnan(x[i])) x[i] = temp0;

  463.         i += 2;

  464.         j++;

  465. 

  466.       }

  467. 

  468.     }

  469. 

  470.   }

  471. 

  472.   return (0);

  473. }