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.

cscal.c 8.3 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452
  1. /***************************************************************************
  2. Copyright (c) 2013 - 2015, 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(HASWELL)
  29. #include "cscal_microk_haswell-2.c"
  30. #elif defined(BULLDOZER) || defined(PILEDRIVER)
  31. #include "cscal_microk_bulldozer-2.c"
  32. #elif defined(STEAMROLLER)
  33. #include "cscal_microk_steamroller-2.c"
  34. #elif defined(SANDYBRIDGE)
  35. #include "cscal_microk_bulldozer-2.c"
  36. #endif
  37. #if !defined(HAVE_KERNEL_16)
  38. static void cscal_kernel_16( BLASLONG n, FLOAT *alpha , FLOAT *x ) __attribute__ ((noinline));
  39. static void cscal_kernel_16_zero( BLASLONG n, FLOAT *alpha , FLOAT *x ) __attribute__ ((noinline));
  40. static void cscal_kernel_16_zero_r( BLASLONG n, FLOAT *alpha , FLOAT *x ) __attribute__ ((noinline));
  41. static void cscal_kernel_16_zero_i( BLASLONG n, FLOAT *alpha , FLOAT *x ) __attribute__ ((noinline));
  42. static void cscal_kernel_16( BLASLONG n, FLOAT *alpha , FLOAT *x )
  43. {
  44. BLASLONG i;
  45. FLOAT da_r = alpha[0];
  46. FLOAT da_i = alpha[1];
  47. FLOAT t0,t1,t2,t3;
  48. for( i=0; i<n; i+=4 )
  49. {
  50. t0 = da_r *x[0] - da_i *x[1];
  51. t1 = da_r *x[2] - da_i *x[3];
  52. t2 = da_r *x[4] - da_i *x[5];
  53. t3 = da_r *x[6] - da_i *x[7];
  54. x[1] = da_r * x[1] + da_i * x[0];
  55. x[3] = da_r * x[3] + da_i * x[2];
  56. x[5] = da_r * x[5] + da_i * x[4];
  57. x[7] = da_r * x[7] + da_i * x[6];
  58. x[0] = t0;
  59. x[2] = t1;
  60. x[4] = t2;
  61. x[6] = t3;
  62. x+=8;
  63. }
  64. }
  65. static void cscal_kernel_16_zero_r( BLASLONG n, FLOAT *alpha , FLOAT *x )
  66. {
  67. BLASLONG i;
  68. FLOAT da_i = alpha[1];
  69. FLOAT t0,t1,t2,t3;
  70. for( i=0; i<n; i+=4 )
  71. {
  72. t0 = - da_i *x[1];
  73. t1 = - da_i *x[3];
  74. t2 = - da_i *x[5];
  75. t3 = - da_i *x[7];
  76. x[1] = da_i * x[0];
  77. x[3] = da_i * x[2];
  78. x[5] = da_i * x[4];
  79. x[7] = da_i * x[6];
  80. x[0] = t0;
  81. x[2] = t1;
  82. x[4] = t2;
  83. x[6] = t3;
  84. x+=8;
  85. }
  86. }
  87. static void cscal_kernel_16_zero_i( BLASLONG n, FLOAT *alpha , FLOAT *x )
  88. {
  89. BLASLONG i;
  90. FLOAT da_r = alpha[0];
  91. FLOAT t0,t1,t2,t3;
  92. for( i=0; i<n; i+=4 )
  93. {
  94. t0 = da_r *x[0];
  95. t1 = da_r *x[2];
  96. t2 = da_r *x[4];
  97. t3 = da_r *x[6];
  98. x[1] = da_r * x[1];
  99. x[3] = da_r * x[3];
  100. x[5] = da_r * x[5];
  101. x[7] = da_r * x[7];
  102. x[0] = t0;
  103. x[2] = t1;
  104. x[4] = t2;
  105. x[6] = t3;
  106. x+=8;
  107. }
  108. }
  109. static void cscal_kernel_16_zero( BLASLONG n, FLOAT *alpha , FLOAT *x )
  110. {
  111. BLASLONG i;
  112. for( i=0; i<n; i+=4 )
  113. {
  114. x[0] = 0.0;
  115. x[1] = 0.0;
  116. x[2] = 0.0;
  117. x[3] = 0.0;
  118. x[4] = 0.0;
  119. x[5] = 0.0;
  120. x[6] = 0.0;
  121. x[7] = 0.0;
  122. x+=8;
  123. }
  124. }
  125. #endif
  126. static void cscal_kernel_inc_8(BLASLONG n, FLOAT *alpha, FLOAT *x, BLASLONG inc_x) __attribute__ ((noinline));
  127. static void cscal_kernel_inc_8(BLASLONG n, FLOAT *alpha, FLOAT *x, BLASLONG inc_x)
  128. {
  129. BLASLONG i;
  130. BLASLONG inc_x2 = 2 * inc_x;
  131. BLASLONG inc_x3 = inc_x2 + inc_x;
  132. FLOAT t0,t1,t2,t3;
  133. FLOAT da_r = alpha[0];
  134. FLOAT da_i = alpha[1];
  135. for ( i=0; i<n; i+=4 )
  136. {
  137. t0 = da_r * x[0] - da_i *x[1];
  138. t1 = da_r * x[inc_x] - da_i *x[inc_x + 1];
  139. t2 = da_r * x[inc_x2] - da_i *x[inc_x2 + 1];
  140. t3 = da_r * x[inc_x3] - da_i *x[inc_x3 + 1];
  141. x[1] = da_i * x[0] + da_r * x[1];
  142. x[inc_x +1] = da_i * x[inc_x] + da_r * x[inc_x +1];
  143. x[inc_x2 +1] = da_i * x[inc_x2] + da_r * x[inc_x2 +1];
  144. x[inc_x3 +1] = da_i * x[inc_x3] + da_r * x[inc_x3 +1];
  145. x[0] = t0;
  146. x[inc_x] = t1;
  147. x[inc_x2] = t2;
  148. x[inc_x3] = t3;
  149. x+=4*inc_x;
  150. }
  151. }
  152. int CNAME(BLASLONG n, BLASLONG dummy0, BLASLONG dummy1, FLOAT da_r, FLOAT da_i, FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y, FLOAT *dummy, BLASLONG dummy2)
  153. {
  154. BLASLONG i=0,j=0;
  155. FLOAT temp0;
  156. FLOAT temp1;
  157. FLOAT alpha[2];
  158. if ( inc_x != 1 )
  159. {
  160. inc_x <<= 1;
  161. if ( da_r == 0.0 )
  162. {
  163. BLASLONG n1 = n & -2;
  164. if ( da_i == 0.0 )
  165. {
  166. while(j < n1)
  167. {
  168. x[i]=0.0;
  169. x[i+1]=0.0;
  170. x[i+inc_x]=0.0;
  171. x[i+1+inc_x]=0.0;
  172. i += 2*inc_x ;
  173. j+=2;
  174. }
  175. while(j < n)
  176. {
  177. x[i]=0.0;
  178. x[i+1]=0.0;
  179. i += inc_x ;
  180. j++;
  181. }
  182. }
  183. else
  184. {
  185. while(j < n1)
  186. {
  187. temp0 = -da_i * x[i+1];
  188. x[i+1] = da_i * x[i];
  189. x[i] = temp0;
  190. temp1 = -da_i * x[i+1+inc_x];
  191. x[i+1+inc_x] = da_i * x[i+inc_x];
  192. x[i+inc_x] = temp1;
  193. i += 2*inc_x ;
  194. j+=2;
  195. }
  196. while(j < n)
  197. {
  198. temp0 = -da_i * x[i+1];
  199. x[i+1] = da_i * x[i];
  200. x[i] = temp0;
  201. i += inc_x ;
  202. j++;
  203. }
  204. }
  205. }
  206. else
  207. {
  208. if ( da_i == 0.0 )
  209. {
  210. BLASLONG n1 = n & -2;
  211. while(j < n1)
  212. {
  213. temp0 = da_r * x[i];
  214. x[i+1] = da_r * x[i+1];
  215. x[i] = temp0;
  216. temp1 = da_r * x[i+inc_x];
  217. x[i+1+inc_x] = da_r * x[i+1+inc_x];
  218. x[i+inc_x] = temp1;
  219. i += 2*inc_x ;
  220. j+=2;
  221. }
  222. while(j < n)
  223. {
  224. temp0 = da_r * x[i];
  225. x[i+1] = da_r * x[i+1];
  226. x[i] = temp0;
  227. i += inc_x ;
  228. j++;
  229. }
  230. }
  231. else
  232. {
  233. BLASLONG n1 = n & -8;
  234. if ( n1 > 0 )
  235. {
  236. alpha[0] = da_r;
  237. alpha[1] = da_i;
  238. cscal_kernel_inc_8(n1, alpha, x, inc_x);
  239. j = n1 ;
  240. i = n1 * inc_x;
  241. }
  242. while(j < n)
  243. {
  244. temp0 = da_r * x[i] - da_i * x[i+1];
  245. x[i+1] = da_r * x[i+1] + da_i * x[i];
  246. x[i] = temp0;
  247. i += inc_x ;
  248. j++;
  249. }
  250. }
  251. }
  252. return(0);
  253. }
  254. BLASLONG n1 = n & -16;
  255. if ( n1 > 0 )
  256. {
  257. alpha[0] = da_r;
  258. alpha[1] = da_i;
  259. if ( da_r == 0.0 )
  260. if ( da_i == 0 )
  261. cscal_kernel_16_zero(n1 , alpha , x);
  262. else
  263. cscal_kernel_16_zero_r(n1 , alpha , x);
  264. else
  265. if ( da_i == 0 )
  266. cscal_kernel_16_zero_i(n1 , alpha , x);
  267. else
  268. cscal_kernel_16(n1 , alpha , x);
  269. i = n1 << 1;
  270. j = n1;
  271. }
  272. if ( da_r == 0.0 )
  273. {
  274. if ( da_i == 0.0 )
  275. {
  276. while(j < n)
  277. {
  278. x[i]=0.0;
  279. x[i+1]=0.0;
  280. i += 2 ;
  281. j++;
  282. }
  283. }
  284. else
  285. {
  286. while(j < n)
  287. {
  288. temp0 = -da_i * x[i+1];
  289. x[i+1] = da_i * x[i];
  290. x[i] = temp0;
  291. i += 2 ;
  292. j++;
  293. }
  294. }
  295. }
  296. else
  297. {
  298. if ( da_i == 0.0 )
  299. {
  300. while(j < n)
  301. {
  302. temp0 = da_r * x[i];
  303. x[i+1] = da_r * x[i+1];
  304. x[i] = temp0;
  305. i += 2 ;
  306. j++;
  307. }
  308. }
  309. else
  310. {
  311. BLASLONG n2 = n & -2;
  312. while(j < n2)
  313. {
  314. temp0 = da_r * x[i] - da_i * x[i+1];
  315. temp1 = da_r * x[i+2] - da_i * x[i+3];
  316. x[i+1] = da_r * x[i+1] + da_i * x[i];
  317. x[i+3] = da_r * x[i+3] + da_i * x[i+2];
  318. x[i] = temp0;
  319. x[i+2] = temp1;
  320. i += 4 ;
  321. j+=2;
  322. }
  323. while(j < n)
  324. {
  325. temp0 = da_r * x[i] - da_i * x[i+1];
  326. x[i+1] = da_r * x[i+1] + da_i * x[i];
  327. x[i] = temp0;
  328. i += 2 ;
  329. j++;
  330. }
  331. }
  332. }
  333. return(0);
  334. }