LAPACK 3.12.1
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ F77_dtpmv()

void F77_dtpmv ( CBLAS_INT * layout,
char * uplow,
char * transp,
char * diagn,
CBLAS_INT * n,
double * ap,
double * x,
CBLAS_INT * incx )

Definition at line 444 of file c_dblas2.c.

449 {
450 double *A, *AP;
451 CBLAS_INT i, j, k, LDA;
452 CBLAS_TRANSPOSE trans;
453 CBLAS_UPLO uplo;
454 CBLAS_DIAG diag;
455
456 get_transpose_type(transp,&trans);
457 get_uplo_type(uplow,&uplo);
458 get_diag_type(diagn,&diag);
459
460 if (*layout == TEST_ROW_MJR) {
461 LDA = *n;
462 A = ( double* )malloc( LDA*LDA*sizeof( double ) );
463 AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
464 if (uplo == CblasUpper) {
465 for( j=0, k=0; j<*n; j++ )
466 for( i=0; i<j+1; i++, k++ )
467 A[ LDA*i+j ]=ap[ k ];
468 for( i=0, k=0; i<*n; i++ )
469 for( j=i; j<*n; j++, k++ )
470 AP[ k ]=A[ LDA*i+j ];
471 }
472 else {
473 for( j=0, k=0; j<*n; j++ )
474 for( i=j; i<*n; i++, k++ )
475 A[ LDA*i+j ]=ap[ k ];
476 for( i=0, k=0; i<*n; i++ )
477 for( j=0; j<i+1; j++, k++ )
478 AP[ k ]=A[ LDA*i+j ];
479 }
480 cblas_dtpmv( CblasRowMajor, uplo, trans, diag, *n, AP, x, *incx );
481 free(A);
482 free(AP);
483 }
484 else
485 cblas_dtpmv( CblasColMajor, uplo, trans, diag, *n, ap, x, *incx );
486}
CBLAS_UPLO
Definition cblas.h:41
@ CblasUpper
Definition cblas.h:41
CBLAS_TRANSPOSE
Definition cblas.h:40
@ CblasColMajor
Definition cblas.h:39
@ CblasRowMajor
Definition cblas.h:39
CBLAS_DIAG
Definition cblas.h:42
#define CBLAS_INT
Definition cblas.h:24
void cblas_dtpmv(CBLAS_LAYOUT layout, CBLAS_UPLO Uplo, CBLAS_TRANSPOSE TransA, CBLAS_DIAG Diag, const CBLAS_INT N, const double *Ap, double *X, const CBLAS_INT incX)
Definition cblas_dtpmv.c:10
void get_diag_type(char *type, CBLAS_DIAG *diag)
Definition auxiliary.c:25
#define TEST_ROW_MJR
Definition cblas_test.h:21
void get_uplo_type(char *type, CBLAS_UPLO *uplo)
Definition auxiliary.c:18
void get_transpose_type(char *type, CBLAS_TRANSPOSE *trans)
Definition auxiliary.c:8
Here is the call graph for this function: