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

◆ F77_ssbmv()

void F77_ssbmv ( CBLAS_INT * layout,
char * uplow,
CBLAS_INT * n,
CBLAS_INT * k,
float * alpha,
float * a,
CBLAS_INT * lda,
float * x,
CBLAS_INT * incx,
float * beta,
float * y,
CBLAS_INT * incy )

Definition at line 353 of file c_sblas2.c.

359 {
360 float *A;
361 CBLAS_INT i,j,irow,jcol,LDA;
362 CBLAS_UPLO uplo;
363
364 get_uplo_type(uplow,&uplo);
365
366 if (*layout == TEST_ROW_MJR) {
367 LDA = *k+1;
368 A = ( float* )malloc( (*n+*k)*LDA*sizeof( float ) );
369 if (uplo == CblasUpper) {
370 for( i=0; i<*k; i++ ){
371 irow=*k-i;
372 jcol=(*k)-i;
373 for( j=jcol; j<*n; j++ )
374 A[ LDA*(j-jcol)+irow ]=a[ (*lda)*j+i ];
375 }
376 i=*k;
377 irow=*k-i;
378 for( j=0; j<*n; j++ )
379 A[ LDA*j+irow ]=a[ (*lda)*j+i ];
380 }
381 else {
382 i=0;
383 irow=*k-i;
384 for( j=0; j<*n; j++ )
385 A[ LDA*j+irow ]=a[ (*lda)*j+i ];
386 for( i=1; i<*k+1; i++ ){
387 irow=*k-i;
388 jcol=i;
389 for( j=jcol; j<(*n+*k); j++ )
390 A[ LDA*j+irow ]=a[ (*lda)*(j-jcol)+i ];
391 }
392 }
393 cblas_ssbmv(CblasRowMajor, uplo, *n, *k, *alpha, A, LDA, x, *incx,
394 *beta, y, *incy );
395 free(A);
396 }
397 else
398 cblas_ssbmv(CblasColMajor, uplo, *n, *k, *alpha, a, *lda, x, *incx,
399 *beta, y, *incy );
400}
CBLAS_UPLO
Definition cblas.h:41
@ CblasUpper
Definition cblas.h:41
@ CblasColMajor
Definition cblas.h:39
@ CblasRowMajor
Definition cblas.h:39
void cblas_ssbmv(CBLAS_LAYOUT layout, CBLAS_UPLO Uplo, const CBLAS_INT N, const CBLAS_INT K, const float alpha, const float *A, const CBLAS_INT lda, const float *X, const CBLAS_INT incX, const float beta, float *Y, const CBLAS_INT incY)
Definition cblas_ssbmv.c:11
#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: