Newer
Older
Marco van Oort
committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include "SparseMatrix.h"
int main(int argc, char **argv) {
char filename[MAX_WORD_LENGTH];
struct sparsematrix A_orig, A_sort;
long nz, s, t, p, P, *used, match;
FILE *fp;
printf("Test MMSortNonzeros: ");
/* Check sorting in general */
strcpy(filename,"test_MMSortNonzeros1.inp");
nz = 12;
fp = fopen(filename, "r");
MMReadSparseMatrix(fp, &A_orig);
rewind(fp);
MMReadSparseMatrix(fp, &A_sort);
fclose(fp);
/* Use values as processor numbers */
if (!MMSortNonzeros(&A_sort, 0)) {
printf("Error!\n");
exit(1);
}
used = (long *) malloc(nz * sizeof(long));
for(s=0; s<nz; s++) {
used[s] = 0;
}
/* Check completeness */
match = 0;
for(t=0; t<nz; t++) {
for(s=0; s<nz; s++) {
if(used[s] == 0 && A_orig.i[t] == A_sort.i[s] && A_orig.j[t] == A_sort.j[s] && A_orig.ReValue[t] == A_sort.ReValue[s]) {
match++;
used[s] = 1;
break;
}
}
}
if(match != nz) {
printf("Error!\n");
exit(1);
}
/* Check order */
for(s=1; s<nz; s++) {
if(A_sort.i[s] < A_sort.i[s-1]) {
printf("Error!\n");
exit(1);
}
if(A_sort.i[s] == A_sort.i[s-1] && A_sort.j[s] < A_sort.j[s-1]) {
printf("Error!\n");
exit(1);
}
}
MMDeleteSparseMatrix(&A_orig);
MMDeleteSparseMatrix(&A_sort);
free(used);
/* Check sorting per part/processor */
strcpy(filename,"test_MMSortNonzeros2.inp");
nz = 13;
P = 3;
fp = fopen(filename, "r");
MMReadSparseMatrix(fp, &A_orig);
rewind(fp);
MMReadSparseMatrix(fp, &A_sort);
fclose(fp);
/* Use values as processor numbers */
if (!MMSortNonzeros(&A_sort, 1)) {
printf("Error!\n");
exit(1);
}
used = (long *) malloc(nz * sizeof(long));
for(s=0; s<nz; s++) {
used[s] = 0;
}
/* Check completeness */
match = 0;
for(p=1; p<=P; p++) {
for(t=A_orig.Pstart[p-1]; t<A_orig.Pstart[p]; t++) {
for(s=A_orig.Pstart[p-1]; s<A_orig.Pstart[p]; s++) {
if(used[s] == 0 && A_orig.i[t] == A_sort.i[s] && A_orig.j[t] == A_sort.j[s] && A_orig.ReValue[t] == A_sort.ReValue[s]) {
match++;
used[s] = 1;
break;
}
}
}
}
if(match != nz) {
printf("Error!\n");
exit(1);
}
/* Check order */
for(p=1; p<=P; p++) {
for(s=A_sort.Pstart[p-1]+1; s<A_sort.Pstart[p]; s++) {
if(A_sort.i[s] < A_sort.i[s-1]) {
printf("Error!\n");
exit(1);
}
if(A_sort.i[s] == A_sort.i[s-1] && A_sort.j[s] < A_sort.j[s-1]) {
printf("Error!\n");
exit(1);
}
}
}
MMDeleteSparseMatrix(&A_orig);
MMDeleteSparseMatrix(&A_sort);
free(used);
printf("OK\n");
exit(0);
} /* end main */