-
Notifications
You must be signed in to change notification settings - Fork 0
/
VM.h
138 lines (118 loc) · 3.34 KB
/
VM.h
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
#include <iostream>
#include <streambuf>
#include <fstream>
#include <vector>
#include <string>
#include <ctype.h>
#include <iterator>
#include <unordered_map>
#include <map>
int *ds = new int[1000];
void initialise_ds(unordered_map<string, tuple<string, int, int>> &symbol_table)
{
unordered_map<string, tuple<string, int, int>>::iterator itr;
for (itr = symbols.begin(); itr != symbols.end(); ++itr)
{
int address = get<1>(itr->second);
int init_value = get<2>(itr->second);
ds[address / 4] = init_value;
}
}
void execute_machine_code(vector<tuple<int, int, int, int>> &quad, unordered_map<string, tuple<string, int, int>> &symbol_table)
{
initialise_ds(symbol_table);
for (int pc = 0; pc < quad.size(); pc++)
{
int s1, s2, d;
switch (get<0>(quad[pc]))
{
case 1:
s1 = get<1>(quad[pc]) / 4;
d = get<2>(quad[pc]) / 4;
ds[d] = ds[s1];
break;
case 2:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]) / 4;
ds[d] = ds[s1] + ds[s2];
break;
case 3:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]) / 4;
ds[d] = ds[s1] - ds[s2];
break;
case 4:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]) / 4;
ds[d] = ds[s1] * ds[s2];
break;
case 5:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]) / 4;
ds[d] = ds[s1] / ds[s2];
break;
case 6:
d = get<1>(quad[pc]) / 4;
cout << " [in] ";
cin >> ds[d];
break;
case 7:
d = get<1>(quad[pc]) / 4;
cout << " [out] " << ds[d];
break;
case 8:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]);
if (ds[s1] == ds[s2])
pc = d - 2;
break;
case 9:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]);
if (ds[s1] >= ds[s2])
pc = d - 2;
break;
case 10:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]);
if (ds[s1] <= ds[s2])
pc = d - 2;
break;
case 11:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]);
if (ds[s1] > ds[s2])
pc = d - 2;
break;
case 12:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]);
if (ds[s1] < ds[s2])
pc = d - 2;
break;
case 13:
d = get<1>(quad[pc]);
pc = d - 2;
break;
case 14:
cout << endl;
break;
case 15:
s1 = get<1>(quad[pc]) / 4;
s2 = get<2>(quad[pc]) / 4;
d = get<3>(quad[pc]);
if (ds[s1] != ds[s2])
pc = d - 2;
break;
}
}
}