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.

c_sblas2.c 17 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579
  1. /*
  2. * Written by D.P. Manley, Digital Equipment Corporation.
  3. * Prefixed "C_" to BLAS routines and their declarations.
  4. *
  5. * Modified by T. H. Do, 1/23/98, SGI/CRAY Research.
  6. */
  7. #include <stdlib.h>
  8. #include "common.h"
  9. #include "cblas_test.h"
  10. void F77_sgemv(int *order, char *transp, int *m, int *n, float *alpha,
  11. float *a, int *lda, float *x, int *incx, float *beta,
  12. float *y, int *incy ) {
  13. float *A;
  14. int i,j,LDA;
  15. enum CBLAS_TRANSPOSE trans;
  16. get_transpose_type(transp, &trans);
  17. if (*order == TEST_ROW_MJR) {
  18. LDA = *n+1;
  19. A = ( float* )malloc( (*m)*LDA*sizeof( float ) );
  20. for( i=0; i<*m; i++ )
  21. for( j=0; j<*n; j++ )
  22. A[ LDA*i+j ]=a[ (*lda)*j+i ];
  23. cblas_sgemv( CblasRowMajor, trans,
  24. *m, *n, *alpha, A, LDA, x, *incx, *beta, y, *incy );
  25. free(A);
  26. }
  27. else if (*order == TEST_COL_MJR)
  28. cblas_sgemv( CblasColMajor, trans,
  29. *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
  30. else
  31. cblas_sgemv( UNDEFINED, trans,
  32. *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
  33. }
  34. void F77_sger(int *order, int *m, int *n, float *alpha, float *x, int *incx,
  35. float *y, int *incy, float *a, int *lda ) {
  36. float *A;
  37. int i,j,LDA;
  38. if (*order == TEST_ROW_MJR) {
  39. LDA = *n+1;
  40. A = ( float* )malloc( (*m)*LDA*sizeof( float ) );
  41. for( i=0; i<*m; i++ ) {
  42. for( j=0; j<*n; j++ )
  43. A[ LDA*i+j ]=a[ (*lda)*j+i ];
  44. }
  45. cblas_sger(CblasRowMajor, *m, *n, *alpha, x, *incx, y, *incy, A, LDA );
  46. for( i=0; i<*m; i++ )
  47. for( j=0; j<*n; j++ )
  48. a[ (*lda)*j+i ]=A[ LDA*i+j ];
  49. free(A);
  50. }
  51. else
  52. cblas_sger( CblasColMajor, *m, *n, *alpha, x, *incx, y, *incy, a, *lda );
  53. }
  54. void F77_strmv(int *order, char *uplow, char *transp, char *diagn,
  55. int *n, float *a, int *lda, float *x, int *incx) {
  56. float *A;
  57. int i,j,LDA;
  58. enum CBLAS_TRANSPOSE trans;
  59. enum CBLAS_UPLO uplo;
  60. enum CBLAS_DIAG diag;
  61. get_transpose_type(transp,&trans);
  62. get_uplo_type(uplow,&uplo);
  63. get_diag_type(diagn,&diag);
  64. if (*order == TEST_ROW_MJR) {
  65. LDA = *n+1;
  66. A = ( float* )malloc( (*n)*LDA*sizeof( float ) );
  67. for( i=0; i<*n; i++ )
  68. for( j=0; j<*n; j++ )
  69. A[ LDA*i+j ]=a[ (*lda)*j+i ];
  70. cblas_strmv(CblasRowMajor, uplo, trans, diag, *n, A, LDA, x, *incx);
  71. free(A);
  72. }
  73. else if (*order == TEST_COL_MJR)
  74. cblas_strmv(CblasColMajor, uplo, trans, diag, *n, a, *lda, x, *incx);
  75. else {
  76. cblas_strmv(UNDEFINED, uplo, trans, diag, *n, a, *lda, x, *incx);
  77. }
  78. }
  79. void F77_strsv(int *order, char *uplow, char *transp, char *diagn,
  80. int *n, float *a, int *lda, float *x, int *incx ) {
  81. float *A;
  82. int i,j,LDA;
  83. enum CBLAS_TRANSPOSE trans;
  84. enum CBLAS_UPLO uplo;
  85. enum CBLAS_DIAG diag;
  86. get_transpose_type(transp,&trans);
  87. get_uplo_type(uplow,&uplo);
  88. get_diag_type(diagn,&diag);
  89. if (*order == TEST_ROW_MJR) {
  90. LDA = *n+1;
  91. A = ( float* )malloc( (*n)*LDA*sizeof( float ) );
  92. for( i=0; i<*n; i++ )
  93. for( j=0; j<*n; j++ )
  94. A[ LDA*i+j ]=a[ (*lda)*j+i ];
  95. cblas_strsv(CblasRowMajor, uplo, trans, diag, *n, A, LDA, x, *incx );
  96. free(A);
  97. }
  98. else
  99. cblas_strsv(CblasColMajor, uplo, trans, diag, *n, a, *lda, x, *incx );
  100. }
  101. void F77_ssymv(int *order, char *uplow, int *n, float *alpha, float *a,
  102. int *lda, float *x, int *incx, float *beta, float *y,
  103. int *incy) {
  104. float *A;
  105. int i,j,LDA;
  106. enum CBLAS_UPLO uplo;
  107. get_uplo_type(uplow,&uplo);
  108. if (*order == TEST_ROW_MJR) {
  109. LDA = *n+1;
  110. A = ( float* )malloc( (*n)*LDA*sizeof( float ) );
  111. for( i=0; i<*n; i++ )
  112. for( j=0; j<*n; j++ )
  113. A[ LDA*i+j ]=a[ (*lda)*j+i ];
  114. cblas_ssymv(CblasRowMajor, uplo, *n, *alpha, A, LDA, x, *incx,
  115. *beta, y, *incy );
  116. free(A);
  117. }
  118. else
  119. cblas_ssymv(CblasColMajor, uplo, *n, *alpha, a, *lda, x, *incx,
  120. *beta, y, *incy );
  121. }
  122. void F77_ssyr(int *order, char *uplow, int *n, float *alpha, float *x,
  123. int *incx, float *a, int *lda) {
  124. float *A;
  125. int i,j,LDA;
  126. enum CBLAS_UPLO uplo;
  127. get_uplo_type(uplow,&uplo);
  128. if (*order == TEST_ROW_MJR) {
  129. LDA = *n+1;
  130. A = ( float* )malloc( (*n)*LDA*sizeof( float ) );
  131. for( i=0; i<*n; i++ )
  132. for( j=0; j<*n; j++ )
  133. A[ LDA*i+j ]=a[ (*lda)*j+i ];
  134. cblas_ssyr(CblasRowMajor, uplo, *n, *alpha, x, *incx, A, LDA);
  135. for( i=0; i<*n; i++ )
  136. for( j=0; j<*n; j++ )
  137. a[ (*lda)*j+i ]=A[ LDA*i+j ];
  138. free(A);
  139. }
  140. else
  141. cblas_ssyr(CblasColMajor, uplo, *n, *alpha, x, *incx, a, *lda);
  142. }
  143. void F77_ssyr2(int *order, char *uplow, int *n, float *alpha, float *x,
  144. int *incx, float *y, int *incy, float *a, int *lda) {
  145. float *A;
  146. int i,j,LDA;
  147. enum CBLAS_UPLO uplo;
  148. get_uplo_type(uplow,&uplo);
  149. if (*order == TEST_ROW_MJR) {
  150. LDA = *n+1;
  151. A = ( float* )malloc( (*n)*LDA*sizeof( float ) );
  152. for( i=0; i<*n; i++ )
  153. for( j=0; j<*n; j++ )
  154. A[ LDA*i+j ]=a[ (*lda)*j+i ];
  155. cblas_ssyr2(CblasRowMajor, uplo, *n, *alpha, x, *incx, y, *incy, A, LDA);
  156. for( i=0; i<*n; i++ )
  157. for( j=0; j<*n; j++ )
  158. a[ (*lda)*j+i ]=A[ LDA*i+j ];
  159. free(A);
  160. }
  161. else
  162. cblas_ssyr2(CblasColMajor, uplo, *n, *alpha, x, *incx, y, *incy, a, *lda);
  163. }
  164. void F77_sgbmv(int *order, char *transp, int *m, int *n, int *kl, int *ku,
  165. float *alpha, float *a, int *lda, float *x, int *incx,
  166. float *beta, float *y, int *incy ) {
  167. float *A;
  168. int i,irow,j,jcol,LDA;
  169. enum CBLAS_TRANSPOSE trans;
  170. get_transpose_type(transp, &trans);
  171. if (*order == TEST_ROW_MJR) {
  172. LDA = *ku+*kl+2;
  173. A = ( float* )malloc( (*n+*kl)*LDA*sizeof( float ) );
  174. for( i=0; i<*ku; i++ ){
  175. irow=*ku+*kl-i;
  176. jcol=(*ku)-i;
  177. for( j=jcol; j<*n; j++ )
  178. A[ LDA*(j-jcol)+irow ]=a[ (*lda)*j+i ];
  179. }
  180. i=*ku;
  181. irow=*ku+*kl-i;
  182. for( j=0; j<*n; j++ )
  183. A[ LDA*j+irow ]=a[ (*lda)*j+i ];
  184. for( i=*ku+1; i<*ku+*kl+1; i++ ){
  185. irow=*ku+*kl-i;
  186. jcol=i-(*ku);
  187. for( j=jcol; j<(*n+*kl); j++ )
  188. A[ LDA*j+irow ]=a[ (*lda)*(j-jcol)+i ];
  189. }
  190. cblas_sgbmv( CblasRowMajor, trans, *m, *n, *kl, *ku, *alpha,
  191. A, LDA, x, *incx, *beta, y, *incy );
  192. free(A);
  193. }
  194. else
  195. cblas_sgbmv( CblasColMajor, trans, *m, *n, *kl, *ku, *alpha,
  196. a, *lda, x, *incx, *beta, y, *incy );
  197. }
  198. void F77_stbmv(int *order, char *uplow, char *transp, char *diagn,
  199. int *n, int *k, float *a, int *lda, float *x, int *incx) {
  200. float *A;
  201. int irow, jcol, i, j, LDA;
  202. enum CBLAS_TRANSPOSE trans;
  203. enum CBLAS_UPLO uplo;
  204. enum CBLAS_DIAG diag;
  205. get_transpose_type(transp,&trans);
  206. get_uplo_type(uplow,&uplo);
  207. get_diag_type(diagn,&diag);
  208. if (*order == TEST_ROW_MJR) {
  209. LDA = *k+1;
  210. A = ( float* )malloc( (*n+*k)*LDA*sizeof( float ) );
  211. if (uplo == CblasUpper) {
  212. for( i=0; i<*k; i++ ){
  213. irow=*k-i;
  214. jcol=(*k)-i;
  215. for( j=jcol; j<*n; j++ )
  216. A[ LDA*(j-jcol)+irow ]=a[ (*lda)*j+i ];
  217. }
  218. i=*k;
  219. irow=*k-i;
  220. for( j=0; j<*n; j++ )
  221. A[ LDA*j+irow ]=a[ (*lda)*j+i ];
  222. }
  223. else {
  224. i=0;
  225. irow=*k-i;
  226. for( j=0; j<*n; j++ )
  227. A[ LDA*j+irow ]=a[ (*lda)*j+i ];
  228. for( i=1; i<*k+1; i++ ){
  229. irow=*k-i;
  230. jcol=i;
  231. for( j=jcol; j<(*n+*k); j++ )
  232. A[ LDA*j+irow ]=a[ (*lda)*(j-jcol)+i ];
  233. }
  234. }
  235. cblas_stbmv(CblasRowMajor, uplo, trans, diag, *n, *k, A, LDA, x, *incx);
  236. free(A);
  237. }
  238. else
  239. cblas_stbmv(CblasColMajor, uplo, trans, diag, *n, *k, a, *lda, x, *incx);
  240. }
  241. void F77_stbsv(int *order, char *uplow, char *transp, char *diagn,
  242. int *n, int *k, float *a, int *lda, float *x, int *incx) {
  243. float *A;
  244. int irow, jcol, i, j, LDA;
  245. enum CBLAS_TRANSPOSE trans;
  246. enum CBLAS_UPLO uplo;
  247. enum CBLAS_DIAG diag;
  248. get_transpose_type(transp,&trans);
  249. get_uplo_type(uplow,&uplo);
  250. get_diag_type(diagn,&diag);
  251. if (*order == TEST_ROW_MJR) {
  252. LDA = *k+1;
  253. A = ( float* )malloc( (*n+*k)*LDA*sizeof( float ) );
  254. if (uplo == CblasUpper) {
  255. for( i=0; i<*k; i++ ){
  256. irow=*k-i;
  257. jcol=(*k)-i;
  258. for( j=jcol; j<*n; j++ )
  259. A[ LDA*(j-jcol)+irow ]=a[ (*lda)*j+i ];
  260. }
  261. i=*k;
  262. irow=*k-i;
  263. for( j=0; j<*n; j++ )
  264. A[ LDA*j+irow ]=a[ (*lda)*j+i ];
  265. }
  266. else {
  267. i=0;
  268. irow=*k-i;
  269. for( j=0; j<*n; j++ )
  270. A[ LDA*j+irow ]=a[ (*lda)*j+i ];
  271. for( i=1; i<*k+1; i++ ){
  272. irow=*k-i;
  273. jcol=i;
  274. for( j=jcol; j<(*n+*k); j++ )
  275. A[ LDA*j+irow ]=a[ (*lda)*(j-jcol)+i ];
  276. }
  277. }
  278. cblas_stbsv(CblasRowMajor, uplo, trans, diag, *n, *k, A, LDA, x, *incx);
  279. free(A);
  280. }
  281. else
  282. cblas_stbsv(CblasColMajor, uplo, trans, diag, *n, *k, a, *lda, x, *incx);
  283. }
  284. void F77_ssbmv(int *order, char *uplow, int *n, int *k, float *alpha,
  285. float *a, int *lda, float *x, int *incx, float *beta,
  286. float *y, int *incy) {
  287. float *A;
  288. int i,j,irow,jcol,LDA;
  289. enum CBLAS_UPLO uplo;
  290. get_uplo_type(uplow,&uplo);
  291. if (*order == TEST_ROW_MJR) {
  292. LDA = *k+1;
  293. A = ( float* )malloc( (*n+*k)*LDA*sizeof( float ) );
  294. if (uplo == CblasUpper) {
  295. for( i=0; i<*k; i++ ){
  296. irow=*k-i;
  297. jcol=(*k)-i;
  298. for( j=jcol; j<*n; j++ )
  299. A[ LDA*(j-jcol)+irow ]=a[ (*lda)*j+i ];
  300. }
  301. i=*k;
  302. irow=*k-i;
  303. for( j=0; j<*n; j++ )
  304. A[ LDA*j+irow ]=a[ (*lda)*j+i ];
  305. }
  306. else {
  307. i=0;
  308. irow=*k-i;
  309. for( j=0; j<*n; j++ )
  310. A[ LDA*j+irow ]=a[ (*lda)*j+i ];
  311. for( i=1; i<*k+1; i++ ){
  312. irow=*k-i;
  313. jcol=i;
  314. for( j=jcol; j<(*n+*k); j++ )
  315. A[ LDA*j+irow ]=a[ (*lda)*(j-jcol)+i ];
  316. }
  317. }
  318. cblas_ssbmv(CblasRowMajor, uplo, *n, *k, *alpha, A, LDA, x, *incx,
  319. *beta, y, *incy );
  320. free(A);
  321. }
  322. else
  323. cblas_ssbmv(CblasColMajor, uplo, *n, *k, *alpha, a, *lda, x, *incx,
  324. *beta, y, *incy );
  325. }
  326. void F77_sspmv(int *order, char *uplow, int *n, float *alpha, float *ap,
  327. float *x, int *incx, float *beta, float *y, int *incy) {
  328. float *A,*AP;
  329. int i,j,k,LDA;
  330. enum CBLAS_UPLO uplo;
  331. get_uplo_type(uplow,&uplo);
  332. if (*order == TEST_ROW_MJR) {
  333. LDA = *n;
  334. A = ( float* )malloc( LDA*LDA*sizeof( float ) );
  335. AP = ( float* )malloc( (((LDA+1)*LDA)/2)*sizeof( float ) );
  336. if (uplo == CblasUpper) {
  337. for( j=0, k=0; j<*n; j++ )
  338. for( i=0; i<j+1; i++, k++ )
  339. A[ LDA*i+j ]=ap[ k ];
  340. for( i=0, k=0; i<*n; i++ )
  341. for( j=i; j<*n; j++, k++ )
  342. AP[ k ]=A[ LDA*i+j ];
  343. }
  344. else {
  345. for( j=0, k=0; j<*n; j++ )
  346. for( i=j; i<*n; i++, k++ )
  347. A[ LDA*i+j ]=ap[ k ];
  348. for( i=0, k=0; i<*n; i++ )
  349. for( j=0; j<i+1; j++, k++ )
  350. AP[ k ]=A[ LDA*i+j ];
  351. }
  352. cblas_sspmv( CblasRowMajor, uplo, *n, *alpha, AP, x, *incx, *beta, y,
  353. *incy );
  354. free(A); free(AP);
  355. }
  356. else
  357. cblas_sspmv( CblasColMajor, uplo, *n, *alpha, ap, x, *incx, *beta, y,
  358. *incy );
  359. }
  360. void F77_stpmv(int *order, char *uplow, char *transp, char *diagn,
  361. int *n, float *ap, float *x, int *incx) {
  362. float *A, *AP;
  363. int i, j, k, LDA;
  364. enum CBLAS_TRANSPOSE trans;
  365. enum CBLAS_UPLO uplo;
  366. enum CBLAS_DIAG diag;
  367. get_transpose_type(transp,&trans);
  368. get_uplo_type(uplow,&uplo);
  369. get_diag_type(diagn,&diag);
  370. if (*order == TEST_ROW_MJR) {
  371. LDA = *n;
  372. A = ( float* )malloc( LDA*LDA*sizeof( float ) );
  373. AP = ( float* )malloc( (((LDA+1)*LDA)/2)*sizeof( float ) );
  374. if (uplo == CblasUpper) {
  375. for( j=0, k=0; j<*n; j++ )
  376. for( i=0; i<j+1; i++, k++ )
  377. A[ LDA*i+j ]=ap[ k ];
  378. for( i=0, k=0; i<*n; i++ )
  379. for( j=i; j<*n; j++, k++ )
  380. AP[ k ]=A[ LDA*i+j ];
  381. }
  382. else {
  383. for( j=0, k=0; j<*n; j++ )
  384. for( i=j; i<*n; i++, k++ )
  385. A[ LDA*i+j ]=ap[ k ];
  386. for( i=0, k=0; i<*n; i++ )
  387. for( j=0; j<i+1; j++, k++ )
  388. AP[ k ]=A[ LDA*i+j ];
  389. }
  390. cblas_stpmv( CblasRowMajor, uplo, trans, diag, *n, AP, x, *incx );
  391. free(A); free(AP);
  392. }
  393. else
  394. cblas_stpmv( CblasColMajor, uplo, trans, diag, *n, ap, x, *incx );
  395. }
  396. void F77_stpsv(int *order, char *uplow, char *transp, char *diagn,
  397. int *n, float *ap, float *x, int *incx) {
  398. float *A, *AP;
  399. int i, j, k, LDA;
  400. enum CBLAS_TRANSPOSE trans;
  401. enum CBLAS_UPLO uplo;
  402. enum CBLAS_DIAG diag;
  403. get_transpose_type(transp,&trans);
  404. get_uplo_type(uplow,&uplo);
  405. get_diag_type(diagn,&diag);
  406. if (*order == TEST_ROW_MJR) {
  407. LDA = *n;
  408. A = ( float* )malloc( LDA*LDA*sizeof( float ) );
  409. AP = ( float* )malloc( (((LDA+1)*LDA)/2)*sizeof( float ) );
  410. if (uplo == CblasUpper) {
  411. for( j=0, k=0; j<*n; j++ )
  412. for( i=0; i<j+1; i++, k++ )
  413. A[ LDA*i+j ]=ap[ k ];
  414. for( i=0, k=0; i<*n; i++ )
  415. for( j=i; j<*n; j++, k++ )
  416. AP[ k ]=A[ LDA*i+j ];
  417. }
  418. else {
  419. for( j=0, k=0; j<*n; j++ )
  420. for( i=j; i<*n; i++, k++ )
  421. A[ LDA*i+j ]=ap[ k ];
  422. for( i=0, k=0; i<*n; i++ )
  423. for( j=0; j<i+1; j++, k++ )
  424. AP[ k ]=A[ LDA*i+j ];
  425. }
  426. cblas_stpsv( CblasRowMajor, uplo, trans, diag, *n, AP, x, *incx );
  427. free(A); free(AP);
  428. }
  429. else
  430. cblas_stpsv( CblasColMajor, uplo, trans, diag, *n, ap, x, *incx );
  431. }
  432. void F77_sspr(int *order, char *uplow, int *n, float *alpha, float *x,
  433. int *incx, float *ap ){
  434. float *A, *AP;
  435. int i,j,k,LDA;
  436. enum CBLAS_UPLO uplo;
  437. get_uplo_type(uplow,&uplo);
  438. if (*order == TEST_ROW_MJR) {
  439. LDA = *n;
  440. A = ( float* )malloc( LDA*LDA*sizeof( float ) );
  441. AP = ( float* )malloc( (((LDA+1)*LDA)/2)*sizeof( float ) );
  442. if (uplo == CblasUpper) {
  443. for( j=0, k=0; j<*n; j++ )
  444. for( i=0; i<j+1; i++, k++ )
  445. A[ LDA*i+j ]=ap[ k ];
  446. for( i=0, k=0; i<*n; i++ )
  447. for( j=i; j<*n; j++, k++ )
  448. AP[ k ]=A[ LDA*i+j ];
  449. }
  450. else {
  451. for( j=0, k=0; j<*n; j++ )
  452. for( i=j; i<*n; i++, k++ )
  453. A[ LDA*i+j ]=ap[ k ];
  454. for( i=0, k=0; i<*n; i++ )
  455. for( j=0; j<i+1; j++, k++ )
  456. AP[ k ]=A[ LDA*i+j ];
  457. }
  458. cblas_sspr( CblasRowMajor, uplo, *n, *alpha, x, *incx, AP );
  459. if (uplo == CblasUpper) {
  460. for( i=0, k=0; i<*n; i++ )
  461. for( j=i; j<*n; j++, k++ )
  462. A[ LDA*i+j ]=AP[ k ];
  463. for( j=0, k=0; j<*n; j++ )
  464. for( i=0; i<j+1; i++, k++ )
  465. ap[ k ]=A[ LDA*i+j ];
  466. }
  467. else {
  468. for( i=0, k=0; i<*n; i++ )
  469. for( j=0; j<i+1; j++, k++ )
  470. A[ LDA*i+j ]=AP[ k ];
  471. for( j=0, k=0; j<*n; j++ )
  472. for( i=j; i<*n; i++, k++ )
  473. ap[ k ]=A[ LDA*i+j ];
  474. }
  475. free(A); free(AP);
  476. }
  477. else
  478. cblas_sspr( CblasColMajor, uplo, *n, *alpha, x, *incx, ap );
  479. }
  480. void F77_sspr2(int *order, char *uplow, int *n, float *alpha, float *x,
  481. int *incx, float *y, int *incy, float *ap ){
  482. float *A, *AP;
  483. int i,j,k,LDA;
  484. enum CBLAS_UPLO uplo;
  485. get_uplo_type(uplow,&uplo);
  486. if (*order == TEST_ROW_MJR) {
  487. LDA = *n;
  488. A = ( float* )malloc( LDA*LDA*sizeof( float ) );
  489. AP = ( float* )malloc( (((LDA+1)*LDA)/2)*sizeof( float ) );
  490. if (uplo == CblasUpper) {
  491. for( j=0, k=0; j<*n; j++ )
  492. for( i=0; i<j+1; i++, k++ )
  493. A[ LDA*i+j ]=ap[ k ];
  494. for( i=0, k=0; i<*n; i++ )
  495. for( j=i; j<*n; j++, k++ )
  496. AP[ k ]=A[ LDA*i+j ];
  497. }
  498. else {
  499. for( j=0, k=0; j<*n; j++ )
  500. for( i=j; i<*n; i++, k++ )
  501. A[ LDA*i+j ]=ap[ k ];
  502. for( i=0, k=0; i<*n; i++ )
  503. for( j=0; j<i+1; j++, k++ )
  504. AP[ k ]=A[ LDA*i+j ];
  505. }
  506. cblas_sspr2( CblasRowMajor, uplo, *n, *alpha, x, *incx, y, *incy, AP );
  507. if (uplo == CblasUpper) {
  508. for( i=0, k=0; i<*n; i++ )
  509. for( j=i; j<*n; j++, k++ )
  510. A[ LDA*i+j ]=AP[ k ];
  511. for( j=0, k=0; j<*n; j++ )
  512. for( i=0; i<j+1; i++, k++ )
  513. ap[ k ]=A[ LDA*i+j ];
  514. }
  515. else {
  516. for( i=0, k=0; i<*n; i++ )
  517. for( j=0; j<i+1; j++, k++ )
  518. A[ LDA*i+j ]=AP[ k ];
  519. for( j=0, k=0; j<*n; j++ )
  520. for( i=j; i<*n; i++, k++ )
  521. ap[ k ]=A[ LDA*i+j ];
  522. }
  523. free(A);
  524. free(AP);
  525. }
  526. else
  527. cblas_sspr2( CblasColMajor, uplo, *n, *alpha, x, *incx, y, *incy, ap );
  528. }