/
tuvm.c
361 lines (337 loc) · 7.16 KB
/
tuvm.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
/* Turing Machine emulator w/ 5 syntax
* Made for debugging homeworks from MAI about
* Creating algos for TM.
* */
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <assert.h>
#include <string.h>
#define USAGE_MSG "TM Emulator (5 syntax)\nUsage:\n -p Programm file\n -i Input string\n -io Input offset\n -d Debug info.\n -sX Set syntax, x = 4 or 5\n"
typedef uint32_t cmd_t;
#define CMD_ACT_U 0
#define CMD_ACT_R 0x00010000
#define CMD_ACT_L 0x00020000
#define CMD_ACT_S 0x00030000
int debug = 0;
static inline uint8_t cmd_qF(cmd_t a)
{
return (a&0xFE000000) >> 25;
}
static inline uint8_t cmd_qT(cmd_t a)
{
return (a&0x01FC0000) >> 18;
}
static inline uint32_t cmd_act(cmd_t a)
{
return a&0x00030000;
}
static inline uint8_t cmd_cF(cmd_t a)
{
return (a&0x0000FF00)>>8;
}
static inline uint8_t cmd_cT(cmd_t a)
{
return a&0x000000FF;
}
static inline cmd_t cmd_build(int qF, uint8_t cF, char act, int qT, uint8_t cT)
{
register cmd_t cmd=0;
cmd |= (qF & 0x0000007F)<<25;
cmd |= cF << 8;
if(act=='s'||act=='S')
cmd |= CMD_ACT_S;
else if(act=='r'||act=='R')
cmd |= CMD_ACT_R;
else if(act=='l'||act=='L')
cmd |= CMD_ACT_L;
else cmd |= CMD_ACT_U;
cmd |= (qT & 0x0000007F)<<18;
cmd |= cT;
return cmd;
}
int cmd_cmp(const void *a, const void *b)
/*Use it for sorting cmds in qsort. */
{
uint32_t x, y;
x = *(uint32_t*)a - 1;
y = *(uint32_t*)b - 1;
if(x>y)
return 1;
else if(x<y)
return -1;
else
return 0;
}
cmd_t *prog; /*List of instructions (sorted after feeding)*/
cmd_t **p_cache; /*p_cache[i] = first cmd w/ qF = i or NULL if no such*/
int prog_size=0, prog_len=0;
struct
{
uint8_t *f, *b;
int f_alloced, b_alloced;
int f_used, b_used;
int pos;
} data;
uint8_t data_read(void)
{
int *alloced;
uint8_t **bank;
int pos;
int *used;
if(data.pos<0)
pos=-data.pos, alloced = &data.b_alloced, bank = &data.b, used=&data.b_used;
else pos= data.pos, alloced = &data.f_alloced, bank = &data.f, used=&data.f_used;
if(*bank == NULL)
{
*bank = malloc(128);
*alloced = 128;
}
/* else if(pos>=alloced)
{
*alloced+=128;
*bank = realloc(*bank, *alloced);
} */
if(pos>=*used)
return (uint8_t) ' ';
else
return (*bank)[pos];
}
void data_write(uint8_t v)
{
int *alloced;
uint8_t **bank;
int pos;
int *used;
if(data.pos<0)
pos=-data.pos, alloced = &data.b_alloced, bank = &data.b, used=&data.b_used;
else pos= data.pos, alloced = &data.f_alloced, bank = &data.f, used=&data.f_used;
if(*bank == NULL)
{
*bank = malloc(128);
*alloced = 128;
}
else if(pos>=*alloced)
{
*alloced+=128;
*bank = realloc(*bank, *alloced);
}
(*bank)[pos] = v;
if(pos>=*used)
*used=pos+1;
}
void print_line(void)
{
if(data.b)
{
int i;
printf("Offset:-%i\n", data.b_used);
for(i=0;i<data.b_used;i++)
printf("%c",data.b[data.b_used-i]);
}
else printf("Offset:0\n");
if(data.f)
printf("%s", data.f);
printf("\n");
}
void feed_program(FILE *fin)
{
int qF, qT;
char act, cF, cT;
char in[32];
cmd_t cmd;
if(prog) free(prog);
if(p_cache) free(p_cache);
prog = calloc(256,sizeof(cmd_t));
p_cache = calloc(128,sizeof(void*));
prog_len = 0; prog_size = 256;
/*(1) read em*/
while(!feof(fin) /*&& fscanf(fin,"%i,%c,%c,%c,%i",&qF,&cF,&cT,&act,&qT)==5*/)
{
fgets(in,32,fin);
if(!strchr(in,',')) break;
qF = ((in[0]-'0')*10) + (in[1]-'0');
cF = in[3];
cT = in[5];
act= in[7];
qT = ((in[9]-'0')*10) + (in[10]-'0');
cmd= cmd_build(qF,cF,act,qT,cT);
if(debug)
printf("%s --> %2i %c %c %c %2i | %08X | %2i %c %c %c %2i\n",in, qF, cF, cT, act, qT, cmd,
cmd_qF(cmd), cmd_cF(cmd), cmd_cT(cmd), "urls"[cmd_act(cmd)>>16], cmd_qT(cmd) );
if(prog_len >= prog_size)
prog_size+=256, prog = realloc(prog,prog_size*sizeof(cmd_t));
prog[prog_len++]=cmd;
}
/*(2) sort em*/
qsort(prog,prog_len,sizeof(cmd_t), cmd_cmp);
/*(3) make cache*/
{
int i;
qF=300;
for(i=0;i<prog_len;i++)
if(cmd_qF(prog[i])!=qF)
qF = cmd_qF(prog[i]),
p_cache[qF] = &prog[i];
}
}
void feed_program4(FILE *fin)
{
int qF, qT;
char act, cF, cT;
char in[32];
cmd_t cmd;
if(prog) free(prog);
if(p_cache) free(p_cache);
prog = calloc(256,sizeof(cmd_t));
p_cache = calloc(128,sizeof(void*));
prog_len = 0; prog_size = 256;
/*(1) read em*/
while(!feof(fin) /*&& fscanf(fin,"%i,%c,%c,%c,%i",&qF,&cF,&cT,&act,&qT)==5*/)
{
fgets(in,32,fin);
if(!strchr(in,',')) break;
qF = ((in[0]-'0')*10) + (in[1]-'0');
cF = in[3];
cT = in[5];
if(cT == 's' || cT == 'S')
act = 's', cT = cF;
else if(cT == 'l' || cT == 'L')
act = 'l', cT = cF;
else if(cT == 'r' || cT == 'R')
act = 'r', cT = cF;
else if(cT == 'u' || cT == 'U')
act = 'u', cT = cF;
else act = 'u';
qT = ((in[7]-'0')*10) + (in[8]-'0');
cmd= cmd_build(qF,cF,act,qT,cT);
if(debug)
printf("%s --> %2i %c %c %c %2i | %08X | %2i %c %c %c %2i\n",in, qF, cF, cT, act, qT, cmd,
cmd_qF(cmd), cmd_cF(cmd), cmd_cT(cmd), "urls"[cmd_act(cmd)>>16], cmd_qT(cmd) );
if(prog_len >= prog_size)
prog_size+=256, prog = realloc(prog,prog_size*sizeof(cmd_t));
prog[prog_len++]=cmd;
}
/*(2) sort em*/
qsort(prog,prog_len,sizeof(cmd_t), cmd_cmp);
/*(3) make cache*/
{
int i;
qF=300;
for(i=0;i<prog_len;i++)
if(cmd_qF(prog[i])!=qF)
qF = cmd_qF(prog[i]),
p_cache[qF] = &prog[i];
}
}
void run(void)
{
uint8_t c;
int q=0;
int st=0;
int it=0;
cmd_t *cptr;
while(1)
{
it++;
c = data_read();
if(p_cache[q]==NULL)
{
st=1;
break;
}
cptr=p_cache[q];
while(cmd_qF(*cptr)==q && cmd_cF(*cptr)!=c)cptr++;
if(cmd_qF(*cptr)==q)
{
q=cmd_qT(*cptr);
data_write(cmd_cT(*cptr));
if(debug)
printf("Q%02i -> Q%02i; %c -> %c\n", cmd_qF(*cptr),cmd_qT(*cptr), cmd_cF(*cptr), cmd_cT(*cptr));
if(cmd_act(*cptr)==CMD_ACT_S)
break;
else if(cmd_act(*cptr)==CMD_ACT_L)
data.pos--;
else if(cmd_act(*cptr)==CMD_ACT_R)
data.pos++;
}
else
{
st=1;
break;
}
}
if(st==1)
printf("ERROR: No command. Q = %i, C = `%c`, pos = %i\n", q, c, data.pos);
else
printf("Done.\n");
printf("Count of iterations:%i\n", it);
}
int main(int argc, char **argv)
{
int i;
int in_offset=0;
char *in_fill=NULL;
FILE *pfile;
char ltrs[] = "urls";
int synt = 5;
pfile = stdin;
for(i=1;i<argc;i++)
{
if(argv[i][0]=='-')
{
if(argv[i][1]=='p')
pfile = fopen(argv[++i],"r");
else if(argv[i][1]=='i' && argv[i][2]=='o')
sscanf(argv[++i], "%i", &in_offset);
else if(argv[i][1]=='i' && argv[i][2]==0)
in_fill=argv[++i];
else if(argv[i][1]=='d')
debug = 1;
else if(argv[i][1]=='s')
{
if(argv[i][2]=='4' || argv[i][2]=='5')
synt = argv[i][2]-'0';
else
{
printf("Wrong syntax type!\n");
return 0;
};
}
else if(argv[i][1]=='h')
{
printf(USAGE_MSG);
return 0;
}
}
}
if(in_fill)
{
data.pos = in_offset;
while(*in_fill)
{
data_write(*in_fill);
in_fill++;
data.pos++;
}
}
if(!pfile)
{
printf("Cant open program file.\n");
return 0;
}
if(synt==5)
feed_program(pfile);
else feed_program4(pfile);
run();
print_line();
if(debug)
for(i=0;i<prog_len;i++)
printf("%2u,%c,%c,%c,%2u\n", cmd_qF(prog[i]),
cmd_cF(prog[i]),
cmd_cT(prog[i]),
ltrs[cmd_act(prog[i])>>16],
cmd_qT(prog[i])
);
return 0;
}