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_dblas2.c 17 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583
  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_dgemv(int *order, char *transp, int *m, int *n, double *alpha,
  11. double *a, int *lda, double *x, int *incx, double *beta,
  12. double *y, int *incy ) {
  13. double *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 = ( double* )malloc( (*m)*LDA*sizeof( double ) );
  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_dgemv( 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_dgemv( CblasColMajor, trans,
  29. *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
  30. else
  31. cblas_dgemv( UNDEFINED, trans,
  32. *m, *n, *alpha, a, *lda, x, *incx, *beta, y, *incy );
  33. }
  34. void F77_dger(int *order, int *m, int *n, double *alpha, double *x, int *incx,
  35. double *y, int *incy, double *a, int *lda ) {
  36. double *A;
  37. int i,j,LDA;
  38. if (*order == TEST_ROW_MJR) {
  39. LDA = *n+1;
  40. A = ( double* )malloc( (*m)*LDA*sizeof( double ) );
  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_dger(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_dger( CblasColMajor, *m, *n, *alpha, x, *incx, y, *incy, a, *lda );
  53. }
  54. void F77_dtrmv(int *order, char *uplow, char *transp, char *diagn,
  55. int *n, double *a, int *lda, double *x, int *incx) {
  56. double *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 = ( double* )malloc( (*n)*LDA*sizeof( double ) );
  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_dtrmv(CblasRowMajor, uplo, trans, diag, *n, A, LDA, x, *incx);
  71. free(A);
  72. }
  73. else if (*order == TEST_COL_MJR)
  74. cblas_dtrmv(CblasColMajor, uplo, trans, diag, *n, a, *lda, x, *incx);
  75. else {
  76. cblas_dtrmv(UNDEFINED, uplo, trans, diag, *n, a, *lda, x, *incx);
  77. }
  78. }
  79. void F77_dtrsv(int *order, char *uplow, char *transp, char *diagn,
  80. int *n, double *a, int *lda, double *x, int *incx ) {
  81. double *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 = ( double* )malloc( (*n)*LDA*sizeof( double ) );
  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_dtrsv(CblasRowMajor, uplo, trans, diag, *n, A, LDA, x, *incx );
  96. free(A);
  97. }
  98. else
  99. cblas_dtrsv(CblasColMajor, uplo, trans, diag, *n, a, *lda, x, *incx );
  100. }
  101. void F77_dsymv(int *order, char *uplow, int *n, double *alpha, double *a,
  102. int *lda, double *x, int *incx, double *beta, double *y,
  103. int *incy) {
  104. double *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 = ( double* )malloc( (*n)*LDA*sizeof( double ) );
  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_dsymv(CblasRowMajor, uplo, *n, *alpha, A, LDA, x, *incx,
  115. *beta, y, *incy );
  116. free(A);
  117. }
  118. else
  119. cblas_dsymv(CblasColMajor, uplo, *n, *alpha, a, *lda, x, *incx,
  120. *beta, y, *incy );
  121. }
  122. void F77_dsyr(int *order, char *uplow, int *n, double *alpha, double *x,
  123. int *incx, double *a, int *lda) {
  124. double *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 = ( double* )malloc( (*n)*LDA*sizeof( double ) );
  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_dsyr(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_dsyr(CblasColMajor, uplo, *n, *alpha, x, *incx, a, *lda);
  142. }
  143. void F77_dsyr2(int *order, char *uplow, int *n, double *alpha, double *x,
  144. int *incx, double *y, int *incy, double *a, int *lda) {
  145. double *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 = ( double* )malloc( (*n)*LDA*sizeof( double ) );
  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_dsyr2(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_dsyr2(CblasColMajor, uplo, *n, *alpha, x, *incx, y, *incy, a, *lda);
  163. }
  164. void F77_dgbmv(int *order, char *transp, int *m, int *n, int *kl, int *ku,
  165. double *alpha, double *a, int *lda, double *x, int *incx,
  166. double *beta, double *y, int *incy ) {
  167. double *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 = ( double* )malloc( (*n+*kl)*LDA*sizeof( double ) );
  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_dgbmv( CblasRowMajor, trans, *m, *n, *kl, *ku, *alpha,
  191. A, LDA, x, *incx, *beta, y, *incy );
  192. free(A);
  193. }
  194. else
  195. cblas_dgbmv( CblasColMajor, trans, *m, *n, *kl, *ku, *alpha,
  196. a, *lda, x, *incx, *beta, y, *incy );
  197. }
  198. void F77_dtbmv(int *order, char *uplow, char *transp, char *diagn,
  199. int *n, int *k, double *a, int *lda, double *x, int *incx) {
  200. double *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 = ( double* )malloc( (*n+*k)*LDA*sizeof( double ) );
  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_dtbmv(CblasRowMajor, uplo, trans, diag, *n, *k, A, LDA, x, *incx);
  236. free(A);
  237. }
  238. else
  239. cblas_dtbmv(CblasColMajor, uplo, trans, diag, *n, *k, a, *lda, x, *incx);
  240. }
  241. void F77_dtbsv(int *order, char *uplow, char *transp, char *diagn,
  242. int *n, int *k, double *a, int *lda, double *x, int *incx) {
  243. double *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 = ( double* )malloc( (*n+*k)*LDA*sizeof( double ) );
  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_dtbsv(CblasRowMajor, uplo, trans, diag, *n, *k, A, LDA, x, *incx);
  279. free(A);
  280. }
  281. else
  282. cblas_dtbsv(CblasColMajor, uplo, trans, diag, *n, *k, a, *lda, x, *incx);
  283. }
  284. void F77_dsbmv(int *order, char *uplow, int *n, int *k, double *alpha,
  285. double *a, int *lda, double *x, int *incx, double *beta,
  286. double *y, int *incy) {
  287. double *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 = ( double* )malloc( (*n+*k)*LDA*sizeof( double ) );
  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_dsbmv(CblasRowMajor, uplo, *n, *k, *alpha, A, LDA, x, *incx,
  319. *beta, y, *incy );
  320. free(A);
  321. }
  322. else
  323. cblas_dsbmv(CblasColMajor, uplo, *n, *k, *alpha, a, *lda, x, *incx,
  324. *beta, y, *incy );
  325. }
  326. void F77_dspmv(int *order, char *uplow, int *n, double *alpha, double *ap,
  327. double *x, int *incx, double *beta, double *y, int *incy) {
  328. double *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 = ( double* )malloc( LDA*LDA*sizeof( double ) );
  335. AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
  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_dspmv( CblasRowMajor, uplo, *n, *alpha, AP, x, *incx, *beta, y,
  353. *incy );
  354. free(A);
  355. free(AP);
  356. }
  357. else
  358. cblas_dspmv( CblasColMajor, uplo, *n, *alpha, ap, x, *incx, *beta, y,
  359. *incy );
  360. }
  361. void F77_dtpmv(int *order, char *uplow, char *transp, char *diagn,
  362. int *n, double *ap, double *x, int *incx) {
  363. double *A, *AP;
  364. int i, j, k, LDA;
  365. enum CBLAS_TRANSPOSE trans;
  366. enum CBLAS_UPLO uplo;
  367. enum CBLAS_DIAG diag;
  368. get_transpose_type(transp,&trans);
  369. get_uplo_type(uplow,&uplo);
  370. get_diag_type(diagn,&diag);
  371. if (*order == TEST_ROW_MJR) {
  372. LDA = *n;
  373. A = ( double* )malloc( LDA*LDA*sizeof( double ) );
  374. AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
  375. if (uplo == CblasUpper) {
  376. for( j=0, k=0; j<*n; j++ )
  377. for( i=0; i<j+1; i++, k++ )
  378. A[ LDA*i+j ]=ap[ k ];
  379. for( i=0, k=0; i<*n; i++ )
  380. for( j=i; j<*n; j++, k++ )
  381. AP[ k ]=A[ LDA*i+j ];
  382. }
  383. else {
  384. for( j=0, k=0; j<*n; j++ )
  385. for( i=j; i<*n; i++, k++ )
  386. A[ LDA*i+j ]=ap[ k ];
  387. for( i=0, k=0; i<*n; i++ )
  388. for( j=0; j<i+1; j++, k++ )
  389. AP[ k ]=A[ LDA*i+j ];
  390. }
  391. cblas_dtpmv( CblasRowMajor, uplo, trans, diag, *n, AP, x, *incx );
  392. free(A);
  393. free(AP);
  394. }
  395. else
  396. cblas_dtpmv( CblasColMajor, uplo, trans, diag, *n, ap, x, *incx );
  397. }
  398. void F77_dtpsv(int *order, char *uplow, char *transp, char *diagn,
  399. int *n, double *ap, double *x, int *incx) {
  400. double *A, *AP;
  401. int i, j, k, LDA;
  402. enum CBLAS_TRANSPOSE trans;
  403. enum CBLAS_UPLO uplo;
  404. enum CBLAS_DIAG diag;
  405. get_transpose_type(transp,&trans);
  406. get_uplo_type(uplow,&uplo);
  407. get_diag_type(diagn,&diag);
  408. if (*order == TEST_ROW_MJR) {
  409. LDA = *n;
  410. A = ( double* )malloc( LDA*LDA*sizeof( double ) );
  411. AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
  412. if (uplo == CblasUpper) {
  413. for( j=0, k=0; j<*n; j++ )
  414. for( i=0; i<j+1; i++, k++ )
  415. A[ LDA*i+j ]=ap[ k ];
  416. for( i=0, k=0; i<*n; i++ )
  417. for( j=i; j<*n; j++, k++ )
  418. AP[ k ]=A[ LDA*i+j ];
  419. }
  420. else {
  421. for( j=0, k=0; j<*n; j++ )
  422. for( i=j; i<*n; i++, k++ )
  423. A[ LDA*i+j ]=ap[ k ];
  424. for( i=0, k=0; i<*n; i++ )
  425. for( j=0; j<i+1; j++, k++ )
  426. AP[ k ]=A[ LDA*i+j ];
  427. }
  428. cblas_dtpsv( CblasRowMajor, uplo, trans, diag, *n, AP, x, *incx );
  429. free(A);
  430. free(AP);
  431. }
  432. else
  433. cblas_dtpsv( CblasColMajor, uplo, trans, diag, *n, ap, x, *incx );
  434. }
  435. void F77_dspr(int *order, char *uplow, int *n, double *alpha, double *x,
  436. int *incx, double *ap ){
  437. double *A, *AP;
  438. int i,j,k,LDA;
  439. enum CBLAS_UPLO uplo;
  440. get_uplo_type(uplow,&uplo);
  441. if (*order == TEST_ROW_MJR) {
  442. LDA = *n;
  443. A = ( double* )malloc( LDA*LDA*sizeof( double ) );
  444. AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
  445. if (uplo == CblasUpper) {
  446. for( j=0, k=0; j<*n; j++ )
  447. for( i=0; i<j+1; i++, k++ )
  448. A[ LDA*i+j ]=ap[ k ];
  449. for( i=0, k=0; i<*n; i++ )
  450. for( j=i; j<*n; j++, k++ )
  451. AP[ k ]=A[ LDA*i+j ];
  452. }
  453. else {
  454. for( j=0, k=0; j<*n; j++ )
  455. for( i=j; i<*n; i++, k++ )
  456. A[ LDA*i+j ]=ap[ k ];
  457. for( i=0, k=0; i<*n; i++ )
  458. for( j=0; j<i+1; j++, k++ )
  459. AP[ k ]=A[ LDA*i+j ];
  460. }
  461. cblas_dspr( CblasRowMajor, uplo, *n, *alpha, x, *incx, AP );
  462. if (uplo == CblasUpper) {
  463. for( i=0, k=0; i<*n; i++ )
  464. for( j=i; j<*n; j++, k++ )
  465. A[ LDA*i+j ]=AP[ k ];
  466. for( j=0, k=0; j<*n; j++ )
  467. for( i=0; i<j+1; i++, k++ )
  468. ap[ k ]=A[ LDA*i+j ];
  469. }
  470. else {
  471. for( i=0, k=0; i<*n; i++ )
  472. for( j=0; j<i+1; j++, k++ )
  473. A[ LDA*i+j ]=AP[ k ];
  474. for( j=0, k=0; j<*n; j++ )
  475. for( i=j; i<*n; i++, k++ )
  476. ap[ k ]=A[ LDA*i+j ];
  477. }
  478. free(A);
  479. free(AP);
  480. }
  481. else
  482. cblas_dspr( CblasColMajor, uplo, *n, *alpha, x, *incx, ap );
  483. }
  484. void F77_dspr2(int *order, char *uplow, int *n, double *alpha, double *x,
  485. int *incx, double *y, int *incy, double *ap ){
  486. double *A, *AP;
  487. int i,j,k,LDA;
  488. enum CBLAS_UPLO uplo;
  489. get_uplo_type(uplow,&uplo);
  490. if (*order == TEST_ROW_MJR) {
  491. LDA = *n;
  492. A = ( double* )malloc( LDA*LDA*sizeof( double ) );
  493. AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
  494. if (uplo == CblasUpper) {
  495. for( j=0, k=0; j<*n; j++ )
  496. for( i=0; i<j+1; i++, k++ )
  497. A[ LDA*i+j ]=ap[ k ];
  498. for( i=0, k=0; i<*n; i++ )
  499. for( j=i; j<*n; j++, k++ )
  500. AP[ k ]=A[ LDA*i+j ];
  501. }
  502. else {
  503. for( j=0, k=0; j<*n; j++ )
  504. for( i=j; i<*n; i++, k++ )
  505. A[ LDA*i+j ]=ap[ k ];
  506. for( i=0, k=0; i<*n; i++ )
  507. for( j=0; j<i+1; j++, k++ )
  508. AP[ k ]=A[ LDA*i+j ];
  509. }
  510. cblas_dspr2( CblasRowMajor, uplo, *n, *alpha, x, *incx, y, *incy, AP );
  511. if (uplo == CblasUpper) {
  512. for( i=0, k=0; i<*n; i++ )
  513. for( j=i; j<*n; j++, k++ )
  514. A[ LDA*i+j ]=AP[ k ];
  515. for( j=0, k=0; j<*n; j++ )
  516. for( i=0; i<j+1; i++, k++ )
  517. ap[ k ]=A[ LDA*i+j ];
  518. }
  519. else {
  520. for( i=0, k=0; i<*n; i++ )
  521. for( j=0; j<i+1; j++, k++ )
  522. A[ LDA*i+j ]=AP[ k ];
  523. for( j=0, k=0; j<*n; j++ )
  524. for( i=j; i<*n; i++, k++ )
  525. ap[ k ]=A[ LDA*i+j ];
  526. }
  527. free(A);
  528. free(AP);
  529. }
  530. else
  531. cblas_dspr2( CblasColMajor, uplo, *n, *alpha, x, *incx, y, *incy, ap );
  532. }

OpenBLAS is an optimized BLAS library based on GotoBLAS2 1.13 BSD version.

Contributors (1)