cheched, that gbmv is OK
This commit is contained in:
parent
781bfb6e66
commit
4d61607c9e
|
@ -61,7 +61,7 @@ static void (*gbmv[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT,
|
||||||
#endif
|
#endif
|
||||||
};
|
};
|
||||||
|
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
static int (*gbmv_thread[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT,
|
static int (*gbmv_thread[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT,
|
||||||
FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
|
FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
|
||||||
#ifdef XDOUBLE
|
#ifdef XDOUBLE
|
||||||
|
@ -91,7 +91,7 @@ void NAME(char *TRANS, blasint *M, blasint *N,
|
||||||
blasint incx = *INCX;
|
blasint incx = *INCX;
|
||||||
blasint incy = *INCY;
|
blasint incy = *INCY;
|
||||||
FLOAT *buffer;
|
FLOAT *buffer;
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
int nthreads;
|
int nthreads;
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
@ -146,7 +146,7 @@ void CNAME(enum CBLAS_ORDER order,
|
||||||
FLOAT *buffer;
|
FLOAT *buffer;
|
||||||
blasint lenx, leny, info, t;
|
blasint lenx, leny, info, t;
|
||||||
int trans;
|
int trans;
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
int nthreads;
|
int nthreads;
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
@ -226,7 +226,7 @@ void CNAME(enum CBLAS_ORDER order,
|
||||||
|
|
||||||
buffer = (FLOAT *)blas_memory_alloc(1);
|
buffer = (FLOAT *)blas_memory_alloc(1);
|
||||||
|
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
nthreads = num_cpu_avail(2);
|
nthreads = num_cpu_avail(2);
|
||||||
|
|
||||||
if (nthreads == 1) {
|
if (nthreads == 1) {
|
||||||
|
@ -234,7 +234,7 @@ void CNAME(enum CBLAS_ORDER order,
|
||||||
|
|
||||||
(gbmv[(int)trans])(m, n, kl, ku, alpha, a, lda, x, incx, y, incy, buffer);
|
(gbmv[(int)trans])(m, n, kl, ku, alpha, a, lda, x, incx, y, incy, buffer);
|
||||||
|
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
} else {
|
} else {
|
||||||
|
|
||||||
(gbmv_thread[(int)trans])(m, n, kl, ku, alpha, a, lda, x, incx, y, incy, buffer, nthreads);
|
(gbmv_thread[(int)trans])(m, n, kl, ku, alpha, a, lda, x, incx, y, incy, buffer, nthreads);
|
||||||
|
|
|
@ -64,7 +64,7 @@ static void (*gbmv[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT, FLOAT,
|
||||||
#endif
|
#endif
|
||||||
};
|
};
|
||||||
|
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
static int (*gbmv_thread[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT *,
|
static int (*gbmv_thread[])(BLASLONG, BLASLONG, BLASLONG, BLASLONG, FLOAT *,
|
||||||
FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
|
FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, BLASLONG, FLOAT *, int) = {
|
||||||
#ifdef XDOUBLE
|
#ifdef XDOUBLE
|
||||||
|
@ -97,7 +97,7 @@ void NAME(char *TRANS, blasint *M, blasint *N,
|
||||||
blasint incx = *INCX;
|
blasint incx = *INCX;
|
||||||
blasint incy = *INCY;
|
blasint incy = *INCY;
|
||||||
FLOAT *buffer;
|
FLOAT *buffer;
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
int nthreads;
|
int nthreads;
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
@ -164,7 +164,7 @@ void CNAME(enum CBLAS_ORDER order,
|
||||||
blasint lenx, leny;
|
blasint lenx, leny;
|
||||||
int trans;
|
int trans;
|
||||||
blasint info, t;
|
blasint info, t;
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
int nthreads;
|
int nthreads;
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
@ -244,7 +244,7 @@ void CNAME(enum CBLAS_ORDER order,
|
||||||
|
|
||||||
buffer = (FLOAT *)blas_memory_alloc(1);
|
buffer = (FLOAT *)blas_memory_alloc(1);
|
||||||
|
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
nthreads = num_cpu_avail(2);
|
nthreads = num_cpu_avail(2);
|
||||||
|
|
||||||
if (nthreads == 1) {
|
if (nthreads == 1) {
|
||||||
|
@ -252,7 +252,7 @@ void CNAME(enum CBLAS_ORDER order,
|
||||||
|
|
||||||
(gbmv[(int)trans])(m, n, kl, ku, alpha_r, alpha_i, a, lda, x, incx, y, incy, buffer);
|
(gbmv[(int)trans])(m, n, kl, ku, alpha_r, alpha_i, a, lda, x, incx, y, incy, buffer);
|
||||||
|
|
||||||
#ifdef SMPTEST
|
#ifdef SMP
|
||||||
|
|
||||||
} else {
|
} else {
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue