-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathProcessor.cpp
More file actions
267 lines (189 loc) · 4.08 KB
/
Copy pathProcessor.cpp
File metadata and controls
267 lines (189 loc) · 4.08 KB
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
/**
*Authors : Rory Magowan, Daniel Bereton, Daniel Kinnaird
*Version : 1.0 22nd November 2015
*
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include "Processor.h"
using namespace std;
/**
*Constructor for the processor which sets the contents of the CI, PI and accumulator to all 0s
*
*/
Processor::Processor(){
for (int i = 0; i < 32; i++)
{
accumulator[i] = 0;
ci[i] = 0;
pi[i] = 0;
}
}
/**
*Setter Method for the Accumulator
*
*/
void Processor::setAccumulator(bool accumulator[]){
for(int i = 0; i < 32; i++){
this -> accumulator[i] = accumulator[i];
}
}
/**
*Getter Method for the Accumulator
*
*/
bool* Processor::getAccumulator(){
return accumulator;
}
/**
*Setter Method for the CI
*
*/
void Processor::setCI(bool memoryAddress[32]){
for (int i = 0; i < 32; i++)
{
ci[i] = memoryAddress[i];
}
}
/**
*Getter Method for the CI
*
*/
bool* Processor::getCI(){
return ci;
}
/**
*Setter Method for the PI
*
*/
void Processor::setPI(bool instruction[32]){
for(int i = 0; i < 32; i++){
pi[i] = instruction[i];
}
}
/**
*Getter Method for the PI
*
*/
bool* Processor::getPI(){
return pi;
}
/**
*Method which resets each element of ci to 0
*
*/
void Processor::resetCI(){
for (int i = 0; i < 32; i++)
{
ci[i] = 0;
}
}
/**
*Method which resets each element of the accumulator to 0
*
*/
void Processor::resetAccumulator(){
for (int i = 0; i < 32; i++)
{
accumulator[i] = 0;
}
}
/**
*Method which converts a twos complement binary number into a decimal integer
*
*param a: bool binary[] - binary array for conversion
*return : int decimal - binary array converted to integer
*/
int Processor::convertBinToDec(bool binary[], int length){
int decimal = 0;
//Checks if the binary number is less than 32 bits long (ie. an operand or opcode which aren't
//two's complement numbers or if the number begins with a 0 and therefore is positive
if(length != 32 || binary[31] == 0){
for (int i = length - 1; i >= 0; i--){
decimal += (int(binary[i]))*pow(2,i);
}
}
else{
//If the number begins with one the MSB (most signifigant bit) calcualted as a negative
//value
decimal = -1 * ((int(binary[31]))*pow(2,31));
for (int i = 30; i >= 0; i--){
decimal += (int(binary[i]))*pow(2,i);
}
}
return decimal;
}
/**
*Method which converts decimal integer into binary number
*
*param a: int decimal - decimal number for conversion
*return : array[] - decimal number converted to binary
*/
bool* Processor::convertDecToBin(int decimal){
bool static array[32];
int index = 0;
for (int i = 0; i < 32; i++)
{
array[i] = 0;
}
while(decimal !=0){
array[index] = decimal%2;
decimal/=2;
index++;
}
return array;
}
/**
*Method which flips all the bits after the first 1 (read from right to left)
*
*param : operand - The binary number to be negated
*return : operand - The negated binary number
*
*/
bool* Processor::negate(bool operand[32]){
int first1;
//For loop to find the first 1 in the binary number
for(int i = 0; i < 32; i++){
if(operand[i] == 1){
first1 = i;
break;
}
}
for(int i = 31; i > first1; i--){
//Condition operator used to flip the bits
operand[i]==0 ? operand[i]=1 : operand[i]=0;
}
return operand;
}
/**
*Method which converts ci into decimal, increments the result
*and finally, converts the decimal integer back into ci
*
*/
void Processor::increment(){
int decimal = convertBinToDec(ci,32);
decimal++;
setCI(convertDecToBin(decimal));
}
/**
*Method to get a sub array from the present instruction used to get the operand and opcode from
*the present instruction
*
*param : start - the start position for the sub array in present instruction
*param : end - the end position for the sub array in present instruction
*return : decOP - the decimal value for the operand or opcode taken from the present instruction
*/
int Processor::getOp(int start, int end){
int size = (end-start)+1;
bool op[size];
int j = 0;
for(int i= start; i < (end+1); i++){
op[j] = pi[i];
cout << op[j];
j++;
}
cout << endl;
int decOP = convertBinToDec(op,size);
return decOP;
}