floraachy
/
OpenBLAS
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix the compute error of gemv when incx and incy are negative numbers.

This commit is contained in:
traz 2011-11-04 19:32:21 +00:00
parent c1e618ea2d
commit a32e56500a
4 changed files with 25 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
kernel/mips64/gemv_n_loongson3a.c
View File

@ -16,13 +16,16 @@
int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT ALPHA, FLOAT *A, BLASLONG LDA, FLOAT *X, BLASLONG INCX, FLOAT *Y, BLASLONG INCY, FLOAT *BUFFER) int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT ALPHA, FLOAT *A, BLASLONG LDA, FLOAT *X, BLASLONG INCX, FLOAT *Y, BLASLONG INCY, FLOAT *BUFFER)
{ {
BLASLONG kx=0, ky=0;
if(!ALPHA) if(!ALPHA)
return 0; return 0;
if(INCX < 0) //if(INCX < 0)
INCX = -INCX; // kx = (1-N) * INCX;
if(INCY < 0) // INCX = -INCX;
INCY = -INCY; //if(INCY < 0)
// ky = (1-M) * INCY;
// INCY = -INCY;
BLASLONG fahead = 30; BLASLONG fahead = 30;
BLASLONG spec_unroll = 4; BLASLONG spec_unroll = 4;
@ -31,7 +34,7 @@ int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT ALPHA, FLOAT *A, BLASLO
if(ALPHA == 1) { if(ALPHA == 1) {
if(INCY == 1) { if(INCY == 1) {
for(; likely(j < N); j++, k += INCX) { for(k=kx; likely(j < N); j++, k += INCX) {
BLASLONG i = 0; BLASLONG i = 0;
for(; likely(i < tMQ);) { for(; likely(i < tMQ);) {
prefetch(A[LDA * j + i + fahead]); prefetch(A[LDA * j + i + fahead]);
@ -46,8 +49,8 @@ int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT ALPHA, FLOAT *A, BLASLO
} }
} }
} else { } else {
for(; likely(j < N); j++, k += INCX) { for(k=kx; likely(j < N); j++, k += INCX) {
BLASLONG i = 0, h = 0; BLASLONG i = 0, h = ky;
for(; likely(i < tMQ);) { for(; likely(i < tMQ);) {
prefetch(A[LDA * j + i + fahead]); prefetch(A[LDA * j + i + fahead]);
prefetch(Y[h + fahead]); prefetch(Y[h + fahead]);
@ -63,7 +66,7 @@ int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT ALPHA, FLOAT *A, BLASLO
} }
} else { } else {
if(INCY == 1) { if(INCY == 1) {
for(; likely(j < N); j++, k += INCX) { for(k=kx; likely(j < N); j++, k += INCX) {
BLASLONG i = 0; BLASLONG i = 0;
for(; likely(i < tMQ);) { for(; likely(i < tMQ);) {
prefetch(A[LDA * j + i + fahead]); prefetch(A[LDA * j + i + fahead]);
@ -78,8 +81,8 @@ int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT ALPHA, FLOAT *A, BLASLO
} }
} }
} else { } else {
for(; likely(j < N); j++, k += INCX) { for(k=kx; likely(j < N); j++, k += INCX) {
BLASLONG i = 0, h = 0; BLASLONG i = 0, h = ky;
for(; likely(i < tMQ);) { for(; likely(i < tMQ);) {
prefetch(A[LDA * j + i + fahead]); prefetch(A[LDA * j + i + fahead]);
prefetch(Y[h + fahead]); prefetch(Y[h + fahead]);

8
kernel/mips64/gemv_t_loongson3a.c
View File

@ -18,10 +18,10 @@ int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT ALPHA, FLOAT *A, BLASLO
if(!ALPHA) if(!ALPHA)
return 0; return 0;
if(INCX < 0) // if(INCX < 0)
INCX = -INCX; // INCX = -INCX;
if(INCY < 0) // if(INCY < 0)
INCY = -INCY; // INCY = -INCY;
BLASLONG fahead = 30; BLASLONG fahead = 30;
BLASLONG spec_unroll = 3; BLASLONG spec_unroll = 3;

8
kernel/mips64/zgemv_n_loongson3a.c
View File

@ -19,10 +19,10 @@ int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT rALPHA, FLOAT iALPHA, F
if(!rALPHA && iALPHA) if(!rALPHA && iALPHA)
return 0; return 0;
if(INCX < 0) // if(INCX < 0)
INCX = -INCX; // INCX = -INCX;
if(INCY < 0) // if(INCY < 0)
INCY = -INCY; // INCY = -INCY;
BLASLONG fahead = 60; BLASLONG fahead = 60;
BLASLONG spec_unroll = 2; BLASLONG spec_unroll = 2;

8
kernel/mips64/zgemv_t_loongson3a.c
View File

@ -18,10 +18,10 @@ int CNAME(BLASLONG M, BLASLONG N, BLASLONG UNUSED, FLOAT rALPHA, FLOAT iALPHA, F
if(!rALPHA && iALPHA) if(!rALPHA && iALPHA)
return 0; return 0;
if(INCX < 0) // if(INCX < 0)
INCX = -INCX; // INCX = -INCX;
if(INCY < 0) // if(INCY < 0)
INCY = -INCY; // INCY = -INCY;
BLASLONG fahead = 30; BLASLONG fahead = 30;
BLASLONG spec_unroll = 2; BLASLONG spec_unroll = 2;