-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.c
401 lines (332 loc) · 8.97 KB
/
main.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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <unistd.h>
#include <string.h>
#include <strings.h>
#include <stdbool.h>
#include <inttypes.h>
#include "matrix.h"
#define MAX_BUFFER 256
#define MAX_ENTRIES 512
#define MATRIX_GUARD(x) \
uint32_t* m = find_matrix(x); \
if (m == NULL) { \
puts("no such matrix"); \
return; \
}
#define MATRIX_GUARD_PAIR(x, y) \
uint32_t* m1 = find_matrix(x); \
uint32_t* m2 = find_matrix(y); \
if (m1 == NULL || m2 == NULL) { \
puts("no such matrix"); \
return; \
}
typedef struct entry {
char key[MAX_BUFFER];
uint32_t* matrix;
} entry;
static ssize_t g_order = 0; /* 1 <= order <= 10,000 */
static ssize_t g_nthreads = 0; /* 1 <= nthreads <= 256 */
static ssize_t g_nentries = 0; /* 0 <= nentries <= 512 */
static entry** g_entries = NULL;
/**
* Adds entry to list of entries
*/
entry* add_entry(char* key) {
entry* e = calloc(1, sizeof(entry));
strcpy(e->key, key);
g_entries[g_nentries] = e;
g_nentries += 1;
return e;
}
/**
* Returns entry with given key
*/
entry* find_entry(char* key) {
for (ssize_t i = 0; i < g_nentries; i++) {
if (strcmp(key, g_entries[i]->key) == 0) {
return g_entries[i];
}
}
return NULL;
}
/**
* Returns matrix with given key
*/
uint32_t* find_matrix(char* key) {
entry* e = find_entry(key);
if (e == NULL) {
return NULL;
}
return e->matrix;
}
/**
* Releases all dynamically allocated memory
*/
void release(void) {
if (g_entries == NULL) {
return;
}
for (ssize_t i = 0; i < g_nentries; i++) {
free(g_entries[i]->matrix);
free(g_entries[i]);
}
free(g_entries);
}
/**
* Defines settings based on command line arguments
*/
void define_settings(int argc, char** argv) {
if (argc != 3) {
goto invalid;
}
g_order = atoll(argv[1]);
g_nthreads = atoll(argv[2]);
if (g_order < 1 || g_nthreads < 1) {
goto invalid;
}
set_nthreads(g_nthreads);
set_dimensions(g_order);
return;
invalid:
puts("Invalid command line arguments");
puts("Usage: matrix <width> <# threads>");
exit(1);
}
/**
* Bye command
*/
void command_bye(void) {
printf("bye\n");
release();
exit(0);
}
/**
* Help command
*/
void command_help(void) {
const char* HELP =
"BYE\n"
"HELP\n"
"\n"
"SET <key> = identity\n"
"SET <key> = random <seed>\n"
"SET <key> = uniform <value>\n"
"SET <key> = sequence <start> <step>\n"
"\n"
"SET <key> = cloned <matrix>\n"
"SET <key> = reversed <matrix>\n"
"SET <key> = transposed <matrix>\n"
"\n"
"SET <key> = matrix#add <matrix a> <matrix b>\n"
"SET <key> = matrix#mul <matrix a> <matrix b>\n"
"SET <key> = matrix#pow <matrix> <exponent>\n"
"SET <key> = scalar#add <matrix> <scalar>\n"
"SET <key> = scalar#mul <matrix> <scalar>\n"
"\n"
"SHOW <key>\n"
"SHOW <key> row <number>\n"
"SHOW <key> column <number>\n"
"SHOW <key> element <row> <column>\n"
"\n"
"COMPUTE sum <key>\n"
"COMPUTE trace <key>\n"
"COMPUTE minimum <key>\n"
"COMPUTE maximum <key>\n"
"COMPUTE frequency <key> <value>\n";
printf("%s", HELP);
}
/**
* Set command
*/
void command_set(const char* line) {
char cmd[MAX_BUFFER];
char key[MAX_BUFFER];
char func[MAX_BUFFER];
char arg1[MAX_BUFFER];
char arg2[MAX_BUFFER];
int argc = sscanf(line, "%s %s = %s %s %s", cmd, key, func, arg1, arg2);
if (argc < 3) {
puts("invalid arguments");
return;
}
uint32_t* matrix = NULL;
switch (argc) {
case 3:
if (strcasecmp(func, "identity") == 0) {
matrix = identity_matrix();
} else {
goto invalid;
}
break;
case 4:
if (strcasecmp(func, "random") == 0) {
uint32_t seed = atoll(arg1);
matrix = random_matrix(seed);
} else if (strcasecmp(func, "uniform") == 0) {
uint32_t value = atoll(arg1);
matrix = uniform_matrix(value);
} else if (strcasecmp(func, "cloned") == 0) {
MATRIX_GUARD(arg1);
matrix = cloned(m);
} else if (strcasecmp(func, "reversed") == 0) {
MATRIX_GUARD(arg1);
matrix = reversed(m);
} else if (strcasecmp(func, "transposed") == 0) {
MATRIX_GUARD(arg1);
matrix = transposed(m);
} else {
goto invalid;
}
break;
case 5:
if (strcasecmp(func, "sequence") == 0) {
uint32_t start = atoll(arg1);
uint32_t step = atoll(arg2);
matrix = sequence_matrix(start, step);
} else if (strcasecmp(func, "scalar#add") == 0) {
MATRIX_GUARD(arg1);
uint32_t value = atoll(arg2);
matrix = scalar_add(m, value);
} else if (strcasecmp(func, "scalar#mul") == 0) {
MATRIX_GUARD(arg1);
uint32_t value = atoll(arg2);
matrix = scalar_mul(m, value);
} else if (strcasecmp(func, "matrix#add") == 0) {
MATRIX_GUARD_PAIR(arg1, arg2);
matrix = matrix_add(m1, m2);
} else if (strcasecmp(func, "matrix#mul") == 0) {
MATRIX_GUARD_PAIR(arg1, arg2);
matrix = matrix_mul(m1, m2);
} else if (strcasecmp(func, "matrix#pow") == 0) {
MATRIX_GUARD(arg1);
uint32_t exponent = atoll(arg2);
matrix = matrix_pow(m, exponent);
} else {
goto invalid;
}
break;
}
entry* e = find_entry(key);
if (e == NULL) {
e = add_entry(key);
} else {
free(e->matrix);
}
e->matrix = matrix;
puts("ok");
return;
invalid:
puts("invalid arguments");
}
/**
* Show command
*/
void command_show(char* line) {
char cmd[MAX_BUFFER];
char key[MAX_BUFFER];
char func[MAX_BUFFER];
char arg1[MAX_BUFFER];
char arg2[MAX_BUFFER];
int argc = sscanf(line, "%s %s %s %s %s", cmd, key, func, arg1, arg2);
if (argc < 2) {
goto invalid;
}
MATRIX_GUARD(key);
if (argc == 2) {
display(m);
return;
}
const uint32_t v1 = atoll(arg1) - 1;
if (v1 >= g_order) {
goto invalid;
}
if (argc == 4 && strcasecmp(func, "row") == 0) {
display_row(m, v1);
} else if (argc == 4 && strcasecmp(func, "column") == 0) {
display_column(m, v1);
} else if (argc == 5 && strcasecmp(func, "element") == 0) {
const uint32_t v2 = atoll(arg2) - 1;
if (v2 >= g_order) {
goto invalid;
}
display_element(m, v1, v2);
}
return;
invalid:
puts("invalid arguments");
}
/**
* Compute command
*/
void command_compute(char* line) {
char cmd[MAX_BUFFER];
char key[MAX_BUFFER];
char func[MAX_BUFFER];
char arg1[MAX_BUFFER];
int argc = sscanf(line, "%s %s %s %s", cmd, func, key, arg1);
if (argc < 3) {
goto invalid;
}
MATRIX_GUARD(key);
uint32_t result = 0;
if (strcasecmp(func, "sum") == 0) {
result = get_sum(m);
} else if (strcasecmp(func, "trace") == 0) {
result = get_trace(m);
} else if (strcasecmp(func, "minimum") == 0) {
result = get_minimum(m);
} else if (strcasecmp(func, "maximum") == 0) {
result = get_maximum(m);
} else if (strcasecmp(func, "frequency") == 0) {
result = get_frequency(m, atoll(arg1));
} else {
goto invalid;
}
printf("%" PRIu32 "\n", result);
return;
invalid:
puts("invalid arguments");
}
/**
* Runs computations and stores matrices based on given input
*/
void compute_engine(void) {
g_entries = calloc(MAX_ENTRIES, sizeof(entry*));
while (true) {
printf("> ");
char line[MAX_BUFFER];
if (fgets(line, MAX_BUFFER, stdin) == NULL) {
command_bye();
}
char command[MAX_BUFFER];
if (sscanf(line, "%s", command) != 1) {
printf("\n");
continue;
}
if (strcasecmp(command, "bye") == 0) {
command_bye();
} else if (strcasecmp(command, "help") == 0) {
command_help();
} else if (strcasecmp(command, "set") == 0) {
command_set(line);
} else if (strcasecmp(command, "show") == 0) {
command_show(line);
} else if (strcasecmp(command, "compute") == 0) {
command_compute(line);
} else {
puts("invalid command");
}
printf("\n");
}
}
/**
* Main function
*/
int main(int argc, char** argv)
{
define_settings(argc, argv);
compute_engine();
return 0;
}