forked from eBay/NuRaft
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcalc_state_machine.hxx
305 lines (248 loc) · 9.58 KB
/
calc_state_machine.hxx
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
/************************************************************************
Copyright 2017-2019 eBay Inc.
Author/Developer(s): Jung-Sang Ahn
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
**************************************************************************/
#pragma once
#include "nuraft.hxx"
#include <atomic>
#include <cassert>
#include <iostream>
#include <mutex>
#include <string.h>
using namespace nuraft;
namespace calc_server {
class calc_state_machine : public state_machine {
public:
calc_state_machine(bool async_snapshot = false)
: cur_value_(0)
, last_committed_idx_(0)
, async_snapshot_(async_snapshot)
{}
~calc_state_machine() {}
enum op_type : int {
ADD = 0x0,
SUB = 0x1,
MUL = 0x2,
DIV = 0x3,
SET = 0x4
};
struct op_payload {
op_type type_;
int oprnd_;
};
static ptr<buffer> enc_log(const op_payload& payload) {
// Encode from {operator, operand} to Raft log.
ptr<buffer> ret = buffer::alloc(sizeof(op_payload));
buffer_serializer bs(ret);
// WARNING: We don't consider endian-safety in this example.
bs.put_raw(&payload, sizeof(op_payload));
return ret;
}
static void dec_log(buffer& log, op_payload& payload_out) {
// Decode from Raft log to {operator, operand} pair.
assert(log.size() == sizeof(op_payload));
buffer_serializer bs(log);
memcpy(&payload_out, bs.get_raw(log.size()), sizeof(op_payload));
}
ptr<buffer> pre_commit(const ulong log_idx, buffer& data) {
// Nothing to do with pre-commit in this example.
return nullptr;
}
ptr<buffer> commit(const ulong log_idx, buffer& data) {
op_payload payload;
dec_log(data, payload);
int64_t prev_value = cur_value_;
switch (payload.type_) {
case ADD: prev_value += payload.oprnd_; break;
case SUB: prev_value -= payload.oprnd_; break;
case MUL: prev_value *= payload.oprnd_; break;
case DIV: prev_value /= payload.oprnd_; break;
default:
case SET: prev_value = payload.oprnd_; break;
}
cur_value_ = prev_value;
last_committed_idx_ = log_idx;
// Return Raft log number as a return result.
ptr<buffer> ret = buffer::alloc( sizeof(log_idx) );
buffer_serializer bs(ret);
bs.put_u64(log_idx);
return ret;
}
void commit_config(const ulong log_idx, ptr<cluster_config>& new_conf) {
// Nothing to do with configuration change. Just update committed index.
last_committed_idx_ = log_idx;
}
void rollback(const ulong log_idx, buffer& data) {
// Nothing to do with rollback,
// as this example doesn't do anything on pre-commit.
}
int read_logical_snp_obj(snapshot& s,
void*& user_snp_ctx,
ulong obj_id,
ptr<buffer>& data_out,
bool& is_last_obj)
{
ptr<snapshot_ctx> ctx = nullptr;
{ std::lock_guard<std::mutex> ll(snapshots_lock_);
auto entry = snapshots_.find(s.get_last_log_idx());
if (entry == snapshots_.end()) {
// Snapshot doesn't exist.
//
// NOTE:
// This should not happen in real use cases.
// The below code is an example about how to handle
// this case without aborting the server.
data_out = nullptr;
is_last_obj = true;
return -1;
}
ctx = entry->second;
}
if (obj_id == 0) {
// Object ID == 0: first object, put dummy data.
data_out = buffer::alloc( sizeof(int32) );
buffer_serializer bs(data_out);
bs.put_i32(0);
is_last_obj = false;
} else {
// Object ID > 0: second object, put actual value.
data_out = buffer::alloc( sizeof(ulong) );
buffer_serializer bs(data_out);
bs.put_u64( ctx->value_ );
is_last_obj = true;
}
return 0;
}
void save_logical_snp_obj(snapshot& s,
ulong& obj_id,
buffer& data,
bool is_first_obj,
bool is_last_obj)
{
if (obj_id == 0) {
// Object ID == 0: it contains dummy value, create snapshot context.
ptr<buffer> snp_buf = s.serialize();
ptr<snapshot> ss = snapshot::deserialize(*snp_buf);
create_snapshot_internal(ss);
} else {
// Object ID > 0: actual snapshot value.
buffer_serializer bs(data);
int64_t local_value = (int64_t)bs.get_u64();
std::lock_guard<std::mutex> ll(snapshots_lock_);
auto entry = snapshots_.find(s.get_last_log_idx());
assert(entry != snapshots_.end());
entry->second->value_ = local_value;
}
// Request next object.
obj_id++;
}
bool apply_snapshot(snapshot& s) {
std::lock_guard<std::mutex> ll(snapshots_lock_);
auto entry = snapshots_.find(s.get_last_log_idx());
if (entry == snapshots_.end()) return false;
ptr<snapshot_ctx> ctx = entry->second;
cur_value_ = ctx->value_;
return true;
}
void free_user_snp_ctx(void*& user_snp_ctx) {
// In this example, `read_logical_snp_obj` doesn't create
// `user_snp_ctx`. Nothing to do in this function.
}
ptr<snapshot> last_snapshot() {
// Just return the latest snapshot.
std::lock_guard<std::mutex> ll(snapshots_lock_);
auto entry = snapshots_.rbegin();
if (entry == snapshots_.rend()) return nullptr;
ptr<snapshot_ctx> ctx = entry->second;
return ctx->snapshot_;
}
ulong last_commit_index() {
return last_committed_idx_;
}
void create_snapshot(snapshot& s,
async_result<bool>::handler_type& when_done)
{
if (!async_snapshot_) {
// Create a snapshot in a synchronous way (blocking the thread).
create_snapshot_sync(s, when_done);
} else {
// Create a snapshot in an asynchronous way (in a different thread).
create_snapshot_async(s, when_done);
}
}
int64_t get_current_value() const { return cur_value_; }
private:
struct snapshot_ctx {
snapshot_ctx( ptr<snapshot>& s, int64_t v )
: snapshot_(s), value_(v) {}
ptr<snapshot> snapshot_;
int64_t value_;
};
void create_snapshot_internal(ptr<snapshot> ss) {
std::lock_guard<std::mutex> ll(snapshots_lock_);
// Put into snapshot map.
ptr<snapshot_ctx> ctx = cs_new<snapshot_ctx>(ss, cur_value_);
snapshots_[ss->get_last_log_idx()] = ctx;
// Maintain last 3 snapshots only.
const int MAX_SNAPSHOTS = 3;
int num = snapshots_.size();
auto entry = snapshots_.begin();
for (int ii = 0; ii < num - MAX_SNAPSHOTS; ++ii) {
if (entry == snapshots_.end()) break;
entry = snapshots_.erase(entry);
}
}
void create_snapshot_sync(snapshot& s,
async_result<bool>::handler_type& when_done)
{
// Clone snapshot from `s`.
ptr<buffer> snp_buf = s.serialize();
ptr<snapshot> ss = snapshot::deserialize(*snp_buf);
create_snapshot_internal(ss);
ptr<std::exception> except(nullptr);
bool ret = true;
when_done(ret, except);
std::cout << "snapshot (" << ss->get_last_log_term() << ", "
<< ss->get_last_log_idx() << ") has been created synchronously"
<< std::endl;
}
void create_snapshot_async(snapshot& s,
async_result<bool>::handler_type& when_done)
{
// Clone snapshot from `s`.
ptr<buffer> snp_buf = s.serialize();
ptr<snapshot> ss = snapshot::deserialize(*snp_buf);
// Note that this is a very naive and inefficient example
// that creates a new thread for each snapshot creation.
std::thread t_hdl([this, ss, when_done]{
create_snapshot_internal(ss);
ptr<std::exception> except(nullptr);
bool ret = true;
when_done(ret, except);
std::cout << "snapshot (" << ss->get_last_log_term() << ", "
<< ss->get_last_log_idx() << ") has been created asynchronously"
<< std::endl;
});
t_hdl.detach();
}
// State machine's current value.
std::atomic<int64_t> cur_value_;
// Last committed Raft log number.
std::atomic<uint64_t> last_committed_idx_;
// Keeps the last 3 snapshots, by their Raft log numbers.
std::map< uint64_t, ptr<snapshot_ctx> > snapshots_;
// Mutex for `snapshots_`.
std::mutex snapshots_lock_;
// If `true`, snapshot will be created asynchronously.
bool async_snapshot_;
};
}; // namespace calc_server