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.

cgemv_n_4.c 16 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624
  1. /***************************************************************************
  2. Copyright (c) 2014, 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 <stdlib.h>
  28. #include <stdio.h>
  29. #include "common.h"
  30. #if defined(HASWELL) || defined(ZEN) || defined (SKYLAKEX) || defined (COOPERLAKE) || defined (SAPPHIRERAPIDS)
  31. #include "cgemv_n_microk_haswell-4.c"
  32. #elif defined(BULLDOZER) || defined(PILEDRIVER) || defined(STEAMROLLER) || defined(EXCAVATOR)
  33. #include "cgemv_n_microk_bulldozer-4.c"
  34. #endif
  35. #define NBMAX 2048
  36. #ifndef HAVE_KERNEL_4x4
  37. static void cgemv_kernel_4x4(BLASLONG n, FLOAT **ap, FLOAT *x, FLOAT *y)
  38. {
  39. BLASLONG i;
  40. FLOAT *a0,*a1,*a2,*a3;
  41. a0 = ap[0];
  42. a1 = ap[1];
  43. a2 = ap[2];
  44. a3 = ap[3];
  45. for ( i=0; i< 2*n; i+=2 )
  46. {
  47. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  48. y[i] += a0[i]*x[0] - a0[i+1] * x[1];
  49. y[i+1] += a0[i]*x[1] + a0[i+1] * x[0];
  50. y[i] += a1[i]*x[2] - a1[i+1] * x[3];
  51. y[i+1] += a1[i]*x[3] + a1[i+1] * x[2];
  52. y[i] += a2[i]*x[4] - a2[i+1] * x[5];
  53. y[i+1] += a2[i]*x[5] + a2[i+1] * x[4];
  54. y[i] += a3[i]*x[6] - a3[i+1] * x[7];
  55. y[i+1] += a3[i]*x[7] + a3[i+1] * x[6];
  56. #else
  57. y[i] += a0[i]*x[0] + a0[i+1] * x[1];
  58. y[i+1] += a0[i]*x[1] - a0[i+1] * x[0];
  59. y[i] += a1[i]*x[2] + a1[i+1] * x[3];
  60. y[i+1] += a1[i]*x[3] - a1[i+1] * x[2];
  61. y[i] += a2[i]*x[4] + a2[i+1] * x[5];
  62. y[i+1] += a2[i]*x[5] - a2[i+1] * x[4];
  63. y[i] += a3[i]*x[6] + a3[i+1] * x[7];
  64. y[i+1] += a3[i]*x[7] - a3[i+1] * x[6];
  65. #endif
  66. }
  67. }
  68. #endif
  69. #ifndef HAVE_KERNEL_4x2
  70. static void cgemv_kernel_4x2(BLASLONG n, FLOAT **ap, FLOAT *x, FLOAT *y)
  71. {
  72. BLASLONG i;
  73. FLOAT *a0,*a1;
  74. a0 = ap[0];
  75. a1 = ap[1];
  76. for ( i=0; i< 2*n; i+=2 )
  77. {
  78. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  79. y[i] += a0[i]*x[0] - a0[i+1] * x[1];
  80. y[i+1] += a0[i]*x[1] + a0[i+1] * x[0];
  81. y[i] += a1[i]*x[2] - a1[i+1] * x[3];
  82. y[i+1] += a1[i]*x[3] + a1[i+1] * x[2];
  83. #else
  84. y[i] += a0[i]*x[0] + a0[i+1] * x[1];
  85. y[i+1] += a0[i]*x[1] - a0[i+1] * x[0];
  86. y[i] += a1[i]*x[2] + a1[i+1] * x[3];
  87. y[i+1] += a1[i]*x[3] - a1[i+1] * x[2];
  88. #endif
  89. }
  90. }
  91. #endif
  92. #ifndef HAVE_KERNEL_4x1
  93. static void cgemv_kernel_4x1(BLASLONG n, FLOAT *ap, FLOAT *x, FLOAT *y)
  94. {
  95. BLASLONG i;
  96. FLOAT *a0;
  97. a0 = ap;
  98. for ( i=0; i< 2*n; i+=2 )
  99. {
  100. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  101. y[i] += a0[i]*x[0] - a0[i+1] * x[1];
  102. y[i+1] += a0[i]*x[1] + a0[i+1] * x[0];
  103. #else
  104. y[i] += a0[i]*x[0] + a0[i+1] * x[1];
  105. y[i+1] += a0[i]*x[1] - a0[i+1] * x[0];
  106. #endif
  107. }
  108. }
  109. #endif
  110. #ifndef HAVE_KERNEL_ADDY
  111. static void add_y(BLASLONG n, FLOAT *src, FLOAT *dest, BLASLONG inc_dest,FLOAT alpha_r, FLOAT alpha_i) __attribute__ ((noinline));
  112. static void add_y(BLASLONG n, FLOAT *src, FLOAT *dest, BLASLONG inc_dest,FLOAT alpha_r, FLOAT alpha_i)
  113. {
  114. BLASLONG i;
  115. if ( inc_dest != 2 )
  116. {
  117. FLOAT temp_r;
  118. FLOAT temp_i;
  119. for ( i=0; i<n; i++ )
  120. {
  121. #if !defined(XCONJ)
  122. temp_r = alpha_r * src[0] - alpha_i * src[1];
  123. temp_i = alpha_r * src[1] + alpha_i * src[0];
  124. #else
  125. temp_r = alpha_r * src[0] + alpha_i * src[1];
  126. temp_i = -alpha_r * src[1] + alpha_i * src[0];
  127. #endif
  128. *dest += temp_r;
  129. *(dest+1) += temp_i;
  130. src+=2;
  131. dest += inc_dest;
  132. }
  133. return;
  134. }
  135. FLOAT temp_r0;
  136. FLOAT temp_i0;
  137. FLOAT temp_r1;
  138. FLOAT temp_i1;
  139. FLOAT temp_r2;
  140. FLOAT temp_i2;
  141. FLOAT temp_r3;
  142. FLOAT temp_i3;
  143. for ( i=0; i<n; i+=4 )
  144. {
  145. #if !defined(XCONJ)
  146. temp_r0 = alpha_r * src[0] - alpha_i * src[1];
  147. temp_i0 = alpha_r * src[1] + alpha_i * src[0];
  148. temp_r1 = alpha_r * src[2] - alpha_i * src[3];
  149. temp_i1 = alpha_r * src[3] + alpha_i * src[2];
  150. temp_r2 = alpha_r * src[4] - alpha_i * src[5];
  151. temp_i2 = alpha_r * src[5] + alpha_i * src[4];
  152. temp_r3 = alpha_r * src[6] - alpha_i * src[7];
  153. temp_i3 = alpha_r * src[7] + alpha_i * src[6];
  154. #else
  155. temp_r0 = alpha_r * src[0] + alpha_i * src[1];
  156. temp_i0 = -alpha_r * src[1] + alpha_i * src[0];
  157. temp_r1 = alpha_r * src[2] + alpha_i * src[3];
  158. temp_i1 = -alpha_r * src[3] + alpha_i * src[2];
  159. temp_r2 = alpha_r * src[4] + alpha_i * src[5];
  160. temp_i2 = -alpha_r * src[5] + alpha_i * src[4];
  161. temp_r3 = alpha_r * src[6] + alpha_i * src[7];
  162. temp_i3 = -alpha_r * src[7] + alpha_i * src[6];
  163. #endif
  164. dest[0] += temp_r0;
  165. dest[1] += temp_i0;
  166. dest[2] += temp_r1;
  167. dest[3] += temp_i1;
  168. dest[4] += temp_r2;
  169. dest[5] += temp_i2;
  170. dest[6] += temp_r3;
  171. dest[7] += temp_i3;
  172. src += 8;
  173. dest += 8;
  174. }
  175. return;
  176. }
  177. #endif
  178. int CNAME(BLASLONG m, BLASLONG n, BLASLONG dummy1, FLOAT alpha_r,FLOAT alpha_i, FLOAT *a, BLASLONG lda, FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y, FLOAT *buffer)
  179. {
  180. BLASLONG i;
  181. FLOAT *a_ptr;
  182. FLOAT *x_ptr;
  183. FLOAT *y_ptr;
  184. FLOAT *ap[4];
  185. BLASLONG n1;
  186. BLASLONG m1;
  187. BLASLONG m2;
  188. BLASLONG m3;
  189. BLASLONG n2;
  190. BLASLONG lda4;
  191. FLOAT xbuffer[8],*ybuffer;
  192. #if 0
  193. printf("%s %d %d %.16f %.16f %d %d %d\n","zgemv_n",m,n,alpha_r,alpha_i,lda,inc_x,inc_y);
  194. #endif
  195. if ( m < 1 ) return(0);
  196. if ( n < 1 ) return(0);
  197. ybuffer = buffer;
  198. inc_x *= 2;
  199. inc_y *= 2;
  200. lda *= 2;
  201. lda4 = 4 * lda;
  202. n1 = n / 4 ;
  203. n2 = n % 4 ;
  204. m3 = m % 4;
  205. m1 = m - ( m % 4 );
  206. m2 = (m % NBMAX) - (m % 4) ;
  207. y_ptr = y;
  208. BLASLONG NB = NBMAX;
  209. while ( NB == NBMAX )
  210. {
  211. m1 -= NB;
  212. if ( m1 < 0)
  213. {
  214. if ( m2 == 0 ) break;
  215. NB = m2;
  216. }
  217. a_ptr = a;
  218. ap[0] = a_ptr;
  219. ap[1] = a_ptr + lda;
  220. ap[2] = ap[1] + lda;
  221. ap[3] = ap[2] + lda;
  222. x_ptr = x;
  223. //zero_y(NB,ybuffer);
  224. memset(ybuffer,0,NB*8);
  225. if ( inc_x == 2 )
  226. {
  227. for( i = 0; i < n1 ; i++)
  228. {
  229. cgemv_kernel_4x4(NB,ap,x_ptr,ybuffer);
  230. ap[0] += lda4;
  231. ap[1] += lda4;
  232. ap[2] += lda4;
  233. ap[3] += lda4;
  234. a_ptr += lda4;
  235. x_ptr += 8;
  236. }
  237. if ( n2 & 2 )
  238. {
  239. cgemv_kernel_4x2(NB,ap,x_ptr,ybuffer);
  240. x_ptr += 4;
  241. a_ptr += 2 * lda;
  242. }
  243. if ( n2 & 1 )
  244. {
  245. cgemv_kernel_4x1(NB,a_ptr,x_ptr,ybuffer);
  246. /* x_ptr += 2;
  247. a_ptr += lda; */
  248. }
  249. }
  250. else
  251. {
  252. for( i = 0; i < n1 ; i++)
  253. {
  254. xbuffer[0] = x_ptr[0];
  255. xbuffer[1] = x_ptr[1];
  256. x_ptr += inc_x;
  257. xbuffer[2] = x_ptr[0];
  258. xbuffer[3] = x_ptr[1];
  259. x_ptr += inc_x;
  260. xbuffer[4] = x_ptr[0];
  261. xbuffer[5] = x_ptr[1];
  262. x_ptr += inc_x;
  263. xbuffer[6] = x_ptr[0];
  264. xbuffer[7] = x_ptr[1];
  265. x_ptr += inc_x;
  266. cgemv_kernel_4x4(NB,ap,xbuffer,ybuffer);
  267. ap[0] += lda4;
  268. ap[1] += lda4;
  269. ap[2] += lda4;
  270. ap[3] += lda4;
  271. a_ptr += lda4;
  272. }
  273. for( i = 0; i < n2 ; i++)
  274. {
  275. xbuffer[0] = x_ptr[0];
  276. xbuffer[1] = x_ptr[1];
  277. x_ptr += inc_x;
  278. cgemv_kernel_4x1(NB,a_ptr,xbuffer,ybuffer);
  279. a_ptr += 1 * lda;
  280. }
  281. }
  282. add_y(NB,ybuffer,y_ptr,inc_y,alpha_r,alpha_i);
  283. a += 2 * NB;
  284. y_ptr += NB * inc_y;
  285. }
  286. if ( m3 == 0 ) return(0);
  287. if ( m3 == 1 )
  288. {
  289. a_ptr = a;
  290. x_ptr = x;
  291. FLOAT temp_r = 0.0;
  292. FLOAT temp_i = 0.0;
  293. if ( lda == 2 && inc_x == 2 )
  294. {
  295. for( i=0 ; i < (n & -2); i+=2 )
  296. {
  297. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  298. temp_r += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  299. temp_i += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  300. temp_r += a_ptr[2] * x_ptr[2] - a_ptr[3] * x_ptr[3];
  301. temp_i += a_ptr[2] * x_ptr[3] + a_ptr[3] * x_ptr[2];
  302. #else
  303. temp_r += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  304. temp_i += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  305. temp_r += a_ptr[2] * x_ptr[2] + a_ptr[3] * x_ptr[3];
  306. temp_i += a_ptr[2] * x_ptr[3] - a_ptr[3] * x_ptr[2];
  307. #endif
  308. a_ptr += 4;
  309. x_ptr += 4;
  310. }
  311. for( ; i < n; i++ )
  312. {
  313. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  314. temp_r += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  315. temp_i += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  316. #else
  317. temp_r += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  318. temp_i += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  319. #endif
  320. a_ptr += 2;
  321. x_ptr += 2;
  322. }
  323. }
  324. else
  325. {
  326. for( i = 0; i < n; i++ )
  327. {
  328. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  329. temp_r += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  330. temp_i += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  331. #else
  332. temp_r += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  333. temp_i += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  334. #endif
  335. a_ptr += lda;
  336. x_ptr += inc_x;
  337. }
  338. }
  339. #if !defined(XCONJ)
  340. y_ptr[0] += alpha_r * temp_r - alpha_i * temp_i;
  341. y_ptr[1] += alpha_r * temp_i + alpha_i * temp_r;
  342. #else
  343. y_ptr[0] += alpha_r * temp_r + alpha_i * temp_i;
  344. y_ptr[1] -= alpha_r * temp_i - alpha_i * temp_r;
  345. #endif
  346. return(0);
  347. }
  348. if ( m3 == 2 )
  349. {
  350. a_ptr = a;
  351. x_ptr = x;
  352. FLOAT temp_r0 = 0.0;
  353. FLOAT temp_i0 = 0.0;
  354. FLOAT temp_r1 = 0.0;
  355. FLOAT temp_i1 = 0.0;
  356. if ( lda == 4 && inc_x == 2 )
  357. {
  358. for( i = 0; i < (n & -2); i+=2 )
  359. {
  360. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  361. temp_r0 += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  362. temp_i0 += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  363. temp_r1 += a_ptr[2] * x_ptr[0] - a_ptr[3] * x_ptr[1];
  364. temp_i1 += a_ptr[2] * x_ptr[1] + a_ptr[3] * x_ptr[0];
  365. temp_r0 += a_ptr[4] * x_ptr[2] - a_ptr[5] * x_ptr[3];
  366. temp_i0 += a_ptr[4] * x_ptr[3] + a_ptr[5] * x_ptr[2];
  367. temp_r1 += a_ptr[6] * x_ptr[2] - a_ptr[7] * x_ptr[3];
  368. temp_i1 += a_ptr[6] * x_ptr[3] + a_ptr[7] * x_ptr[2];
  369. #else
  370. temp_r0 += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  371. temp_i0 += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  372. temp_r1 += a_ptr[2] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  373. temp_i1 += a_ptr[2] * x_ptr[1] - a_ptr[3] * x_ptr[0];
  374. temp_r0 += a_ptr[4] * x_ptr[2] + a_ptr[5] * x_ptr[3];
  375. temp_i0 += a_ptr[4] * x_ptr[3] - a_ptr[5] * x_ptr[2];
  376. temp_r1 += a_ptr[6] * x_ptr[2] + a_ptr[7] * x_ptr[3];
  377. temp_i1 += a_ptr[6] * x_ptr[3] - a_ptr[7] * x_ptr[2];
  378. #endif
  379. a_ptr += 8;
  380. x_ptr += 4;
  381. }
  382. for( ; i < n; i++ )
  383. {
  384. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  385. temp_r0 += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  386. temp_i0 += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  387. temp_r1 += a_ptr[2] * x_ptr[0] - a_ptr[3] * x_ptr[1];
  388. temp_i1 += a_ptr[2] * x_ptr[1] + a_ptr[3] * x_ptr[0];
  389. #else
  390. temp_r0 += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  391. temp_i0 += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  392. temp_r1 += a_ptr[2] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  393. temp_i1 += a_ptr[2] * x_ptr[1] - a_ptr[3] * x_ptr[0];
  394. #endif
  395. a_ptr += 4;
  396. x_ptr += 2;
  397. }
  398. }
  399. else
  400. {
  401. for( i=0 ; i < n; i++ )
  402. {
  403. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  404. temp_r0 += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  405. temp_i0 += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  406. temp_r1 += a_ptr[2] * x_ptr[0] - a_ptr[3] * x_ptr[1];
  407. temp_i1 += a_ptr[2] * x_ptr[1] + a_ptr[3] * x_ptr[0];
  408. #else
  409. temp_r0 += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  410. temp_i0 += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  411. temp_r1 += a_ptr[2] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  412. temp_i1 += a_ptr[2] * x_ptr[1] - a_ptr[3] * x_ptr[0];
  413. #endif
  414. a_ptr += lda;
  415. x_ptr += inc_x;
  416. }
  417. }
  418. #if !defined(XCONJ)
  419. y_ptr[0] += alpha_r * temp_r0 - alpha_i * temp_i0;
  420. y_ptr[1] += alpha_r * temp_i0 + alpha_i * temp_r0;
  421. y_ptr += inc_y;
  422. y_ptr[0] += alpha_r * temp_r1 - alpha_i * temp_i1;
  423. y_ptr[1] += alpha_r * temp_i1 + alpha_i * temp_r1;
  424. #else
  425. y_ptr[0] += alpha_r * temp_r0 + alpha_i * temp_i0;
  426. y_ptr[1] -= alpha_r * temp_i0 - alpha_i * temp_r0;
  427. y_ptr += inc_y;
  428. y_ptr[0] += alpha_r * temp_r1 + alpha_i * temp_i1;
  429. y_ptr[1] -= alpha_r * temp_i1 - alpha_i * temp_r1;
  430. #endif
  431. return(0);
  432. }
  433. if ( m3 == 3 )
  434. {
  435. a_ptr = a;
  436. x_ptr = x;
  437. FLOAT temp_r0 = 0.0;
  438. FLOAT temp_i0 = 0.0;
  439. FLOAT temp_r1 = 0.0;
  440. FLOAT temp_i1 = 0.0;
  441. FLOAT temp_r2 = 0.0;
  442. FLOAT temp_i2 = 0.0;
  443. if ( lda == 6 && inc_x == 2 )
  444. {
  445. for( i=0 ; i < n; i++ )
  446. {
  447. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  448. temp_r0 += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  449. temp_i0 += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  450. temp_r1 += a_ptr[2] * x_ptr[0] - a_ptr[3] * x_ptr[1];
  451. temp_i1 += a_ptr[2] * x_ptr[1] + a_ptr[3] * x_ptr[0];
  452. temp_r2 += a_ptr[4] * x_ptr[0] - a_ptr[5] * x_ptr[1];
  453. temp_i2 += a_ptr[4] * x_ptr[1] + a_ptr[5] * x_ptr[0];
  454. #else
  455. temp_r0 += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  456. temp_i0 += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  457. temp_r1 += a_ptr[2] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  458. temp_i1 += a_ptr[2] * x_ptr[1] - a_ptr[3] * x_ptr[0];
  459. temp_r2 += a_ptr[4] * x_ptr[0] + a_ptr[5] * x_ptr[1];
  460. temp_i2 += a_ptr[4] * x_ptr[1] - a_ptr[5] * x_ptr[0];
  461. #endif
  462. a_ptr += 6;
  463. x_ptr += 2;
  464. }
  465. }
  466. else
  467. {
  468. for( i = 0; i < n; i++ )
  469. {
  470. #if ( !defined(CONJ) && !defined(XCONJ) ) || ( defined(CONJ) && defined(XCONJ) )
  471. temp_r0 += a_ptr[0] * x_ptr[0] - a_ptr[1] * x_ptr[1];
  472. temp_i0 += a_ptr[0] * x_ptr[1] + a_ptr[1] * x_ptr[0];
  473. temp_r1 += a_ptr[2] * x_ptr[0] - a_ptr[3] * x_ptr[1];
  474. temp_i1 += a_ptr[2] * x_ptr[1] + a_ptr[3] * x_ptr[0];
  475. temp_r2 += a_ptr[4] * x_ptr[0] - a_ptr[5] * x_ptr[1];
  476. temp_i2 += a_ptr[4] * x_ptr[1] + a_ptr[5] * x_ptr[0];
  477. #else
  478. temp_r0 += a_ptr[0] * x_ptr[0] + a_ptr[1] * x_ptr[1];
  479. temp_i0 += a_ptr[0] * x_ptr[1] - a_ptr[1] * x_ptr[0];
  480. temp_r1 += a_ptr[2] * x_ptr[0] + a_ptr[3] * x_ptr[1];
  481. temp_i1 += a_ptr[2] * x_ptr[1] - a_ptr[3] * x_ptr[0];
  482. temp_r2 += a_ptr[4] * x_ptr[0] + a_ptr[5] * x_ptr[1];
  483. temp_i2 += a_ptr[4] * x_ptr[1] - a_ptr[5] * x_ptr[0];
  484. #endif
  485. a_ptr += lda;
  486. x_ptr += inc_x;
  487. }
  488. }
  489. #if !defined(XCONJ)
  490. y_ptr[0] += alpha_r * temp_r0 - alpha_i * temp_i0;
  491. y_ptr[1] += alpha_r * temp_i0 + alpha_i * temp_r0;
  492. y_ptr += inc_y;
  493. y_ptr[0] += alpha_r * temp_r1 - alpha_i * temp_i1;
  494. y_ptr[1] += alpha_r * temp_i1 + alpha_i * temp_r1;
  495. y_ptr += inc_y;
  496. y_ptr[0] += alpha_r * temp_r2 - alpha_i * temp_i2;
  497. y_ptr[1] += alpha_r * temp_i2 + alpha_i * temp_r2;
  498. #else
  499. y_ptr[0] += alpha_r * temp_r0 + alpha_i * temp_i0;
  500. y_ptr[1] -= alpha_r * temp_i0 - alpha_i * temp_r0;
  501. y_ptr += inc_y;
  502. y_ptr[0] += alpha_r * temp_r1 + alpha_i * temp_i1;
  503. y_ptr[1] -= alpha_r * temp_i1 - alpha_i * temp_r1;
  504. y_ptr += inc_y;
  505. y_ptr[0] += alpha_r * temp_r2 + alpha_i * temp_i2;
  506. y_ptr[1] -= alpha_r * temp_i2 - alpha_i * temp_r2;
  507. #endif
  508. return(0);
  509. }
  510. return(0);
  511. }