forked from bristolcrypto/SPDZ-2
-
Notifications
You must be signed in to change notification settings - Fork 279
/
Processor.hpp
234 lines (207 loc) · 5.75 KB
/
Processor.hpp
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
/*
* Processor.cpp
*
*/
#include <GC/Processor.h>
#include <iostream>
using namespace std;
#include "GC/Program.h"
#include "Secret.h"
#include "Access.h"
#include "ReplicatedSecret.h"
namespace GC
{
template <class T>
Processor<T>::Processor(Machine<T>& machine) :
machine(machine), PC(0), time(0),
complexity(0)
{
}
template<class T>
Processor<T>::~Processor()
{
cerr << "Finished after " << time << " instructions" << endl;
}
template <class T>
void Processor<T>::reset(const Program<T>& program, int arg)
{
S.resize(program.num_reg(SBIT), "registers");
C.resize(program.num_reg(CBIT), "registers");
I.resize(program.num_reg(INT), "registers");
set_arg(arg);
PC = 0;
}
template <class T>
void Processor<T>::reset(const Program<T>& program)
{
reset(program, 0);
machine.reset(program);
}
template<class T>
void GC::Processor<T>::open_input_file(const string& name)
{
cout << "opening " << name << endl;
input_file.open(name);
input_filename = name;
}
template<class T>
inline long long GC::Processor<T>::get_input(int n_bits)
{
long long res;
input_file >> res;
if (input_file.eof())
throw IO_Error("not enough inputs in " + input_filename);
if (input_file.fail())
throw IO_Error("cannot read from " + input_filename);
check_input(res, n_bits);
return res;
}
template<class T>
void GC::Processor<T>::check_input(long long in, int n_bits)
{
auto test = in >> (n_bits - 1);
if (n_bits == 1)
{
if (not (in == 0 or in == 1))
throw runtime_error("input not a bit: " + to_string(in));
}
else if (not (test == 0 or test == -1))
{
throw runtime_error(
"input too large for a " + std::to_string(n_bits)
+ "-bit signed integer: " + to_string(in));
}
}
template <class T>
void Processor<T>::bitdecc(const vector<int>& regs, const Clear& x)
{
for (unsigned int i = 0; i < regs.size(); i++)
C[regs[i]] = (x >> i) & 1;
}
template <class T>
void Processor<T>::bitdecint(const vector<int>& regs, const Integer& x)
{
for (unsigned int i = 0; i < regs.size(); i++)
I[regs[i]] = (x >> i) & 1;
}
template<class T>
void GC::Processor<T>::load_dynamic_direct(const vector<int>& args)
{
vector< ReadAccess<T> > accesses;
if (args.size() % 3 != 0)
throw runtime_error("invalid number of arguments");
for (size_t i = 0; i < args.size(); i += 3)
accesses.push_back({S[args[i]], args[i+1], args[i+2], complexity});
T::load(accesses, machine.MD);
}
template<class T>
void GC::Processor<T>::load_dynamic_indirect(const vector<int>& args)
{
vector< ReadAccess<T> > accesses;
if (args.size() % 3 != 0)
throw runtime_error("invalid number of arguments");
for (size_t i = 0; i < args.size(); i += 3)
accesses.push_back({S[args[i]], C[args[i+1]], args[i+2], complexity});
T::load(accesses, machine.MD);
}
template<class T>
void GC::Processor<T>::store_dynamic_direct(const vector<int>& args)
{
vector< WriteAccess<T> > accesses;
if (args.size() % 2 != 0)
throw runtime_error("invalid number of arguments");
for (size_t i = 0; i < args.size(); i += 2)
accesses.push_back({args[i+1], S[args[i]]});
T::store(machine.MD, accesses);
complexity += accesses.size() / 2 * T::default_length;
}
template<class T>
void GC::Processor<T>::store_dynamic_indirect(const vector<int>& args)
{
vector< WriteAccess<T> > accesses;
if (args.size() % 2 != 0)
throw runtime_error("invalid number of arguments");
for (size_t i = 0; i < args.size(); i += 2)
accesses.push_back({C[args[i+1]], S[args[i]]});
T::store(machine.MD, accesses);
complexity += accesses.size() / 2 * T::default_length;
}
template<class T>
void GC::Processor<T>::store_clear_in_dynamic(const vector<int>& args)
{
vector<ClearWriteAccess> accesses;
check_args(args, 2);
for (size_t i = 0; i < args.size(); i += 2)
accesses.push_back({C[args[i+1]], C[args[i]]});
T::store_clear_in_dynamic(machine.MD, accesses);
}
template <class T>
void Processor<T>::xors(const vector<int>& args)
{
check_args(args, 4);
size_t n_args = args.size();
for (size_t i = 0; i < n_args; i += 4)
{
S[args[i+1]].xor_(args[i], S[args[i+2]], S[args[i+3]]);
#ifndef FREE_XOR
complexity += args[i];
#endif
}
}
template <class T>
void Processor<T>::and_(const vector<int>& args, bool repeat)
{
check_args(args, 4);
for (size_t i = 0; i < args.size(); i += 4)
{
S[args[i+1]].and_(args[i], S[args[i+2]], S[args[i+3]], repeat);
complexity += args[i];
}
}
template <class T>
void Processor<T>::input(const vector<int>& args)
{
check_args(args, 3);
for (size_t i = 0; i < args.size(); i += 3)
{
int n_bits = args[i + 1];
S[args[i+2]] = T::input(args[i] + 1, *this, n_bits);
#ifdef DEBUG_INPUT
cout << "input to " << args[i+2] << "/" << &S[args[i+2]] << endl;
#endif
}
}
template <class T>
void Processor<T>::print_reg(int reg, int n)
{
#ifdef DEBUG_VALUES
cout << "print_reg " << typeid(T).name() << " " << reg << " " << &C[reg] << endl;
#endif
T::out << "Reg[" << reg << "] = " << hex << showbase << C[reg] << dec << " # ";
print_str(n);
T::out << endl << flush;
}
template <class T>
void Processor<T>::print_reg_plain(Clear& value)
{
T::out << hex << showbase << value << dec << flush;
}
template <class T>
void Processor<T>::print_reg_signed(unsigned n_bits, Clear& value)
{
unsigned n_shift = 0;
if (n_bits > 1)
n_shift = sizeof(value.get()) * 8 - n_bits;
T::out << dec << (value.get() << n_shift >> n_shift) << flush;
}
template <class T>
void Processor<T>::print_chr(int n)
{
T::out << (char)n << flush;
}
template <class T>
void Processor<T>::print_str(int n)
{
T::out << string((char*)&n,sizeof(n)) << flush;
}
} /* namespace GC */