-
Notifications
You must be signed in to change notification settings - Fork 0
/
output.c
198 lines (191 loc) · 6.8 KB
/
output.c
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
#include "matrix.h"
int filename_start(char *filename, int len) {
for (int i = len; i >= 0; i--) {
if (filename[i] == '/') {
return i+1;
}
}
return 0;
}
char *get_output_name(struct tm tm, char *routine) {
char *output = allocate(OUTPUT_NAME_SIZE * sizeof(char));
snprintf(output, OUTPUT_NAME_SIZE, "%d_%02d%02d%04d_%02d%02d_%s.out", SID, tm.tm_mday, tm.tm_mon + 1, tm.tm_year + 1900, tm.tm_hour, tm.tm_min, routine);
output[OUTPUT_NAME_SIZE] = '\0';
return output;
}
void write_times(FILE *fp, float load_time, float routine_time) {
fprintf(fp, "%f\n%f\n", load_time, routine_time);
}
void write_details(FILE *fp, char* filename, char* filename2, int rows, int cols, enum ROUTINE_TYPE routine, enum VAR_TYPE type) {
switch (routine) {
case SM:
fprintf(fp, "sm\n");
break;
case TR:
fprintf(fp, "tr\n");
break;
case AD:
fprintf(fp, "ad\n");
break;
case TS:
fprintf(fp, "ts\n");
break;
case MM:
fprintf(fp, "mm\n");
break;
default: // Should not get here
fprintf(stderr, "matrix: could not write routine type to output file\n");
exit(EXIT_FAILURE);
}
// Print only the file name ommitting file path
int len = strlen(filename);
int start = filename_start(filename, len);
fprintf(fp, "%.*s\n", len - start, filename + start);
if (filename2 != NULL) {
len = strlen(filename2);
start = filename_start(filename2, len);
fprintf(fp, "%.*s\n", len - start, filename2 + start);
}
fprintf(fp, "%d\n", param.threads);
if (routine == TR) { // Don't write other things if routine is TR
return;
}
switch (type) {
case TYPE_INT:
fprintf(fp, "int\n");
break;
case TYPE_FLOAT:
fprintf(fp, "float\n");
break;
default: // Should not get here
fprintf(stderr, "matrix: could not write matrix data type to output file\n");
exit(EXIT_FAILURE);
}
fprintf(fp, "%d\n%d\n", rows, cols);
}
void write_coo_data(FILE *fp, struct COO matrix) {
int pos = 0;
int count = 0;
int total = matrix.rows * matrix.cols;
if (matrix.type == TYPE_INT) {
for (int i = 0; i < matrix.rows; i++) {
for (int j = 0; j < matrix.cols; j++) {
// Assuming elements x,y are sorted
if (matrix.elements[pos].x != i) { // Skip checking elements if none are on the same row
fprintf(fp, "0");
count += matrix.cols - j;
for (int k = j; k < matrix.cols-1; k++) {
fprintf(fp, " 0");
}
if (count != total) { // Write space if not last val
fprintf(fp, " ");
}
break; // Skip to next row
} else if (matrix.elements[pos].y == j) {
fprintf(fp, "%d", matrix.elements[pos++].value.i);
} else {
fprintf(fp, "0");
}
count++;
if (count != total) { // Write space if not last val
fprintf(fp, " ");
}
}
}
} else {
for (int i = 0; i < matrix.rows; i++) {
for (int j = 0; j < matrix.cols; j++) {
if (matrix.elements[pos].x != i) { // Skip checking elements if none are on the same row
fprintf(fp, "0.0");
count += matrix.cols - j;
for (int k = j; k < matrix.cols-1; k++) {
fprintf(fp, " 0.0");
}
if (count != total) { // Write space if not last val
fprintf(fp, " ");
}
break; // Skip to next row
} else if (matrix.elements[pos].y == j) {
fprintf(fp, "%f", matrix.elements[pos++].value.f);
} else {
fprintf(fp, "0.0");
}
count++;
if (count != total) { // Write space if not last val
fprintf(fp, " ");
}
}
}
}
fprintf(fp, "\n");
}
void write_csr_data(FILE *fp, struct CSR matrix) {
int elements = 0; // Number of non zero elements in each row
int pos = 0; // Position pointer
int count = 0; // Number of written values
int j = 0;
if (matrix.type == TYPE_INT) {
for (int i = 1; i < matrix.rows+1; i++) {
elements = matrix.ia[i] - matrix.ia[i-1];
pos = matrix.ia[i-1];
count = 0;
j = 0;
while (count < matrix.cols) {
if (elements == 0) { // Written all the elements
fprintf(fp, "0");
for (int j = 1; j < matrix.cols - count; j++) {
fprintf(fp, " 0");
}
if (i != matrix.rows) { // Write space if not last val
fprintf(fp, " ");
}
break; // Skip to next row
}
while (j != matrix.ja[pos]) {
fprintf(fp, "0 ");
j++;
count++;
}
fprintf(fp, "%d", matrix.nnz.i[pos++]); // Print the value
elements--;
j++;
count++;
if (count != matrix.cols || i != matrix.rows) {
fprintf(fp, " ");
}
}
}
} else {
for (int i = 1; i < matrix.rows+1; i++) {
elements = matrix.ia[i] - matrix.ia[i-1];
pos = matrix.ia[i-1];
count = 0;
j = 0;
while (count < matrix.cols) {
if (elements == 0) { // Written all the elements
fprintf(fp, "0.0");
for (int j = 1; j < matrix.cols - count; j++) {
fprintf(fp, " 0.0");
}
if (i != matrix.rows) { // Write space if not last val
fprintf(fp, " ");
}
break; // Skip to next row
}
while (j != matrix.ja[pos]) {
fprintf(fp, "0.0 ");
j++;
count++;
}
fprintf(fp, "%f", matrix.nnz.f[pos++]); // Print the value
elements--;
j++;
count++;
if (count != matrix.cols || i != matrix.rows) {
fprintf(fp, " ");
}
}
}
}
fprintf(fp, "\n");
}