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

[ZARCH] fix a bug in max/min functions

This commit is contained in:
maamountki 2019-01-15 21:04:22 +02:00 committed by GitHub
parent 1a7925b3a3
commit b815a04c87
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
20 changed files with 20 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
kernel/zarch/camax.c
View File

@ -237,7 +237,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++; i++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (i < n1) { while ((i - 1) < n1) {
if (CABS1(x,ix) > maxf) { if (CABS1(x,ix) > maxf) {
maxf = CABS1(x,ix); maxf = CABS1(x,ix);

2
kernel/zarch/camin.c
View File

@ -237,7 +237,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++; i++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (i < n1) { while ((i - 1) < n1) {
if (CABS1(x,ix) < minf) { if (CABS1(x,ix) < minf) {
minf = CABS1(x,ix); minf = CABS1(x,ix);

2
kernel/zarch/damax.c
View File

@ -172,7 +172,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) > maxf) { if (ABS(x[i]) > maxf) {
maxf = ABS(x[i]); maxf = ABS(x[i]);

2
kernel/zarch/damin.c
View File

@ -172,7 +172,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) < minf) { if (ABS(x[i]) < minf) {
minf = ABS(x[i]); minf = ABS(x[i]);

2
kernel/zarch/dmax.c
View File

@ -148,7 +148,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] > maxf) { if (x[i] > maxf) {
maxf = x[i]; maxf = x[i];

2
kernel/zarch/dmin.c
View File

@ -148,7 +148,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] < minf) { if (x[i] < minf) {
minf = x[i]; minf = x[i];

2
kernel/zarch/idamax.c
View File

@ -226,7 +226,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) > maxf) { if (ABS(x[i]) > maxf) {
max = j; max = j;

2
kernel/zarch/idamin.c
View File

@ -226,7 +226,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) < minf) { if (ABS(x[i]) < minf) {
min = j; min = j;

2
kernel/zarch/idmax.c
View File

@ -202,7 +202,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] > maxf) { if (x[i] > maxf) {
max = j; max = j;

2
kernel/zarch/idmin.c
View File

@ -202,7 +202,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] < minf) { if (x[i] < minf) {
min = j; min = j;

2
kernel/zarch/isamax.c
View File

@ -269,7 +269,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) > maxf) { if (ABS(x[i]) > maxf) {
max = j; max = j;

2
kernel/zarch/isamin.c
View File

@ -269,7 +269,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) < minf) { if (ABS(x[i]) < minf) {
min = j; min = j;

2
kernel/zarch/ismax.c
View File

@ -245,7 +245,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] > maxf) { if (x[i] > maxf) {
max = j; max = j;

2
kernel/zarch/ismin.c
View File

@ -245,7 +245,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] < minf) { if (x[i] < minf) {
min = j; min = j;

2
kernel/zarch/samax.c
View File

@ -176,7 +176,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) > maxf) { if (ABS(x[i]) > maxf) {
maxf = ABS(x[i]); maxf = ABS(x[i]);

2
kernel/zarch/samin.c
View File

@ -176,7 +176,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (ABS(x[i]) < minf) { if (ABS(x[i]) < minf) {
minf = ABS(x[i]); minf = ABS(x[i]);

2
kernel/zarch/smax.c
View File

@ -152,7 +152,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] > maxf) { if (x[i] > maxf) {
maxf = x[i]; maxf = x[i];

2
kernel/zarch/smin.c
View File

@ -152,7 +152,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++; j++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (j < n1) { while ((j - 1) < n1) {
if (x[i] < minf) { if (x[i] < minf) {
minf = x[i]; minf = x[i];

2
kernel/zarch/zamax.c
View File

@ -189,7 +189,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++; i++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (i < n1) { while ((i - 1) < n1) {
if (CABS1(x,ix) > maxf) { if (CABS1(x,ix) > maxf) {
maxf = CABS1(x,ix); maxf = CABS1(x,ix);

2
kernel/zarch/zamin.c
View File

@ -189,7 +189,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++; i++;
BLASLONG n1 = (n - 1) & -4; BLASLONG n1 = (n - 1) & -4;
while (i < n1) { while ((i - 1) < n1) {
if (CABS1(x,ix) < minf) { if (CABS1(x,ix) < minf) {
minf = CABS1(x,ix); minf = CABS1(x,ix);