This website works better with JavaScript.
Home
Issues
Pull Requests
Milestones
AI流水线
Repositories
Datasets
Forum
实训
竞赛
大数据
AI开发
Register
Sign In
OSchip
/
OpenBLAS
Not watched
Unwatch
Watch all
Watch but not notify
1
Star
0
Fork
0
Code
Releases
66
Wiki
evaluate
Activity
Issues
0
Pull Requests
0
Datasets
Model
Cloudbrain
HPC
Browse Source
[ZARCH] fix a bug in max/min functions
tags/v0.3.6^2
maamountki
GitHub
7 years ago
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
Split View
Diff Options
Show Stats
Download Patch File
Download Diff File
+1
-1
kernel/zarch/camax.c
+1
-1
kernel/zarch/camin.c
+1
-1
kernel/zarch/damax.c
+1
-1
kernel/zarch/damin.c
+1
-1
kernel/zarch/dmax.c
+1
-1
kernel/zarch/dmin.c
+1
-1
kernel/zarch/idamax.c
+1
-1
kernel/zarch/idamin.c
+1
-1
kernel/zarch/idmax.c
+1
-1
kernel/zarch/idmin.c
+1
-1
kernel/zarch/isamax.c
+1
-1
kernel/zarch/isamin.c
+1
-1
kernel/zarch/ismax.c
+1
-1
kernel/zarch/ismin.c
+1
-1
kernel/zarch/samax.c
+1
-1
kernel/zarch/samin.c
+1
-1
kernel/zarch/smax.c
+1
-1
kernel/zarch/smin.c
+1
-1
kernel/zarch/zamax.c
+1
-1
kernel/zarch/zamin.c
+ 1
- 1
kernel/zarch/camax.c
View File
@@ -237,7 +237,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++;
BLASLONG n1 = (n - 1) & -4;
while (i < n1) {
while (
(
i
- 1)
< n1) {
if (CABS1(x,ix) > maxf) {
maxf = CABS1(x,ix);
+ 1
- 1
kernel/zarch/camin.c
View File
@@ -237,7 +237,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++;
BLASLONG n1 = (n - 1) & -4;
while (i < n1) {
while (
(
i
- 1)
< n1) {
if (CABS1(x,ix) < minf) {
minf = CABS1(x,ix);
+ 1
- 1
kernel/zarch/damax.c
View File
@@ -172,7 +172,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) > maxf) {
maxf = ABS(x[i]);
+ 1
- 1
kernel/zarch/damin.c
View File
@@ -172,7 +172,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) < minf) {
minf = ABS(x[i]);
+ 1
- 1
kernel/zarch/dmax.c
View File
@@ -148,7 +148,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] > maxf) {
maxf = x[i];
+ 1
- 1
kernel/zarch/dmin.c
View File
@@ -148,7 +148,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] < minf) {
minf = x[i];
+ 1
- 1
kernel/zarch/idamax.c
View File
@@ -226,7 +226,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) > maxf) {
max = j;
+ 1
- 1
kernel/zarch/idamin.c
View File
@@ -226,7 +226,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) < minf) {
min = j;
+ 1
- 1
kernel/zarch/idmax.c
View File
@@ -202,7 +202,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] > maxf) {
max = j;
+ 1
- 1
kernel/zarch/idmin.c
View File
@@ -202,7 +202,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] < minf) {
min = j;
+ 1
- 1
kernel/zarch/isamax.c
View File
@@ -269,7 +269,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) > maxf) {
max = j;
+ 1
- 1
kernel/zarch/isamin.c
View File
@@ -269,7 +269,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) < minf) {
min = j;
+ 1
- 1
kernel/zarch/ismax.c
View File
@@ -245,7 +245,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] > maxf) {
max = j;
+ 1
- 1
kernel/zarch/ismin.c
View File
@@ -245,7 +245,7 @@ BLASLONG CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] < minf) {
min = j;
+ 1
- 1
kernel/zarch/samax.c
View File
@@ -176,7 +176,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) > maxf) {
maxf = ABS(x[i]);
+ 1
- 1
kernel/zarch/samin.c
View File
@@ -176,7 +176,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (ABS(x[i]) < minf) {
minf = ABS(x[i]);
+ 1
- 1
kernel/zarch/smax.c
View File
@@ -152,7 +152,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] > maxf) {
maxf = x[i];
+ 1
- 1
kernel/zarch/smin.c
View File
@@ -152,7 +152,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
j++;
BLASLONG n1 = (n - 1) & -4;
while (j < n1) {
while (
(
j
- 1)
< n1) {
if (x[i] < minf) {
minf = x[i];
+ 1
- 1
kernel/zarch/zamax.c
View File
@@ -189,7 +189,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++;
BLASLONG n1 = (n - 1) & -4;
while (i < n1) {
while (
(
i
- 1)
< n1) {
if (CABS1(x,ix) > maxf) {
maxf = CABS1(x,ix);
+ 1
- 1
kernel/zarch/zamin.c
View File
@@ -189,7 +189,7 @@ FLOAT CNAME(BLASLONG n, FLOAT *x, BLASLONG inc_x) {
i++;
BLASLONG n1 = (n - 1) & -4;
while (i < n1) {
while (
(
i
- 1)
< n1) {
if (CABS1(x,ix) < minf) {
minf = CABS1(x,ix);
Write
Preview
Loading…
Cancel
Save