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

◆ F77_dspmv()

void F77_dspmv ( CBLAS_INT * layout,
char * uplow,
CBLAS_INT * n,
double * alpha,
double * ap,
double * x,
CBLAS_INT * incx,
double * beta,
double * y,
CBLAS_INT * incy )

Definition at line 402 of file c_dblas2.c.

407 {
408 double *A,*AP;
409 CBLAS_INT i,j,k,LDA;
410 CBLAS_UPLO uplo;
411
412 get_uplo_type(uplow,&uplo);
413
414 if (*layout == TEST_ROW_MJR) {
415 LDA = *n;
416 A = ( double* )malloc( LDA*LDA*sizeof( double ) );
417 AP = ( double* )malloc( (((LDA+1)*LDA)/2)*sizeof( double ) );
418 if (uplo == CblasUpper) {
419 for( j=0, k=0; j<*n; j++ )
420 for( i=0; i<j+1; i++, k++ )
421 A[ LDA*i+j ]=ap[ k ];
422 for( i=0, k=0; i<*n; i++ )
423 for( j=i; j<*n; j++, k++ )
424 AP[ k ]=A[ LDA*i+j ];
425 }
426 else {
427 for( j=0, k=0; j<*n; j++ )
428 for( i=j; i<*n; i++, k++ )
429 A[ LDA*i+j ]=ap[ k ];
430 for( i=0, k=0; i<*n; i++ )
431 for( j=0; j<i+1; j++, k++ )
432 AP[ k ]=A[ LDA*i+j ];
433 }
434 cblas_dspmv( CblasRowMajor, uplo, *n, *alpha, AP, x, *incx, *beta, y,
435 *incy );
436 free(A);
437 free(AP);
438 }
439 else
440 cblas_dspmv( CblasColMajor, uplo, *n, *alpha, ap, x, *incx, *beta, y,
441 *incy );
442}
CBLAS_UPLO
Definition cblas.h:41
@ CblasUpper
Definition cblas.h:41
@ CblasColMajor
Definition cblas.h:39
@ CblasRowMajor
Definition cblas.h:39
void cblas_dspmv(CBLAS_LAYOUT layout, CBLAS_UPLO Uplo, const CBLAS_INT N, const double alpha, const double *Ap, const double *X, const CBLAS_INT incX, const double beta, double *Y, const CBLAS_INT incY)
Definition cblas_dspmv.c:13
#define CBLAS_INT
Definition cblas.h:24
#define TEST_ROW_MJR
Definition cblas_test.h:21
void get_uplo_type(char *type, CBLAS_UPLO *uplo)
Definition auxiliary.c:18
Here is the call graph for this function: