-
Notifications
You must be signed in to change notification settings - Fork 168
/
datalayer.h
293 lines (264 loc) · 10.8 KB
/
datalayer.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
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
// Copyright (c) 2012, Cornell University
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of HyperDex nor the names of its contributors may be
// used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
#ifndef hyperdex_daemon_datalayer_h_
#define hyperdex_daemon_datalayer_h_
// STL
#include <list>
#include <string>
#include <tr1/memory>
#include <vector>
// LevelDB
#include <leveldb/db.h>
// po6
#include <po6/net/hostname.h>
#include <po6/net/location.h>
#include <po6/pathname.h>
#include <po6/threads/cond.h>
#include <po6/threads/mutex.h>
#include <po6/threads/thread.h>
// HyperDex
#include "common/attribute_check.h"
#include "common/configuration.h"
#include "common/counter_map.h"
#include "common/ids.h"
#include "common/schema.h"
#include "daemon/reconfigure_returncode.h"
namespace hyperdex
{
// Forward declarations
class daemon;
class datalayer
{
public:
enum returncode
{
SUCCESS,
NOT_FOUND,
BAD_ENCODING,
CORRUPTION,
IO_ERROR,
LEVELDB_ERROR
};
class reference;
class region_iterator;
class snapshot;
public:
datalayer(daemon*);
~datalayer() throw ();
public:
bool setup(const po6::pathname& path,
bool* saved,
server_id* saved_us,
po6::net::location* saved_bind_to,
po6::net::hostname* saved_coordinator);
void teardown();
reconfigure_returncode prepare(const configuration& old_config,
const configuration& new_config,
const server_id& us);
reconfigure_returncode reconfigure(const configuration& old_config,
const configuration& new_config,
const server_id& us);
reconfigure_returncode cleanup(const configuration& old_config,
const configuration& new_config,
const server_id& us);
public:
returncode get(const region_id& ri,
const e::slice& key,
std::vector<e::slice>* value,
uint64_t* version,
reference* ref);
returncode put(const region_id& ri,
const region_id& reg_id,
uint64_t seq_id,
const e::slice& key,
const std::vector<e::slice>& value,
uint64_t version);
returncode del(const region_id& ri,
const region_id& reg_id,
uint64_t seq_id,
const e::slice& key);
returncode make_snapshot(const region_id& ri,
attribute_check* checks,
size_t checks_sz,
snapshot* snap);
// leveldb provides no failure mechanism for this, neither do we
std::tr1::shared_ptr<leveldb::Snapshot> make_raw_snapshot();
void make_region_iterator(region_iterator* riter,
std::tr1::shared_ptr<leveldb::Snapshot> snap,
const region_id& ri);
returncode get_transfer(const region_id& ri,
uint64_t seq_no,
bool* has_value,
e::slice* key,
std::vector<e::slice>* value,
uint64_t* version,
reference* ref);
// XXX errors are absorbed here; short of crashing we can only log
bool check_acked(const region_id& reg_id, uint64_t seq_id);
void mark_acked(const region_id& reg_id, uint64_t seq_id);
void max_seq_id(const region_id& reg_id, uint64_t* seq_id);
private:
class search_filter;
typedef std::list<std::vector<char> > backing_t;
private:
datalayer(const datalayer&);
datalayer& operator = (const datalayer&);
private:
void encode_key(const region_id& ri,
const e::slice& key,
std::vector<char>* kbacking,
leveldb::Slice* lkey);
returncode decode_key(const e::slice& lkey,
region_id* ri,
e::slice* key);
void encode_value(const std::vector<e::slice>& attrs,
uint64_t version,
std::vector<char>* backing,
leveldb::Slice* lvalue);
returncode decode_value(const e::slice& value,
std::vector<e::slice>* attrs,
uint64_t* version);
void encode_transfer(const capture_id& ci,
uint64_t count,
std::vector<char>* backing,
leveldb::Slice* tkey);
void encode_key_value(const e::slice& key,
/*pointer to make it optional*/
const std::vector<e::slice>* value,
uint64_t version,
std::vector<char>* backing,
leveldb::Slice* slice);
returncode decode_key_value(const e::slice& slice,
bool* has_value,
e::slice* key,
std::vector<e::slice>* value,
uint64_t* version);
void generate_object_range(const region_id& ri,
backing_t* backing,
leveldb::Range* r);
void generate_index(const region_id& ri,
uint16_t attr,
hyperdatatype type,
const e::slice& value,
const e::slice& key,
backing_t* backing,
std::vector<leveldb::Slice>* idxs);
void generate_search_filters(const region_id& ri,
attribute_check* check_ptr,
attribute_check* check_end,
backing_t* backing,
std::vector<search_filter>* sf);
returncode create_index_changes(const schema* sc,
const region_id& ri,
const e::slice& key,
const leveldb::Slice& lkey,
backing_t* backing,
leveldb::WriteBatch* updates);
returncode create_index_changes(const schema* sc,
const region_id& ri,
const e::slice& key,
const leveldb::Slice& lkey,
const std::vector<e::slice>& value,
backing_t* backing,
leveldb::WriteBatch* updates);
void cleaner();
void shutdown();
private:
daemon* m_daemon;
leveldb::DB* m_db;
counter_map m_counters;
po6::threads::thread m_cleaner;
po6::threads::mutex m_block_cleaner;
po6::threads::cond m_wakeup_cleaner;
bool m_need_cleaning;
bool m_shutdown;
};
class datalayer::reference
{
public:
reference();
~reference() throw ();
public:
void swap(reference* ref);
private:
friend class datalayer;
private:
std::string m_backing;
};
class datalayer::region_iterator
{
public:
region_iterator();
~region_iterator() throw ();
public:
bool valid();
void next();
void unpack(e::slice* key, std::vector<e::slice>* val, uint64_t* ver, reference* ref);
e::slice key();
private:
friend class datalayer;
region_iterator(const region_iterator&);
region_iterator& operator = (const region_iterator&);
private:
datalayer* m_dl;
std::tr1::shared_ptr<leveldb::Snapshot> m_snap;
std::auto_ptr<leveldb::Iterator> m_iter;
region_id m_region;
};
class datalayer::snapshot
{
public:
snapshot();
~snapshot() throw ();
public:
bool valid();
void next();
void unpack(e::slice* key, std::vector<e::slice>* val, uint64_t* ver);
void unpack(e::slice* key, std::vector<e::slice>* val, uint64_t* ver, reference* ref);
private:
friend class datalayer;
snapshot(const snapshot&);
snapshot& operator = (const snapshot&);
private:
datalayer* m_dl;
const leveldb::Snapshot* m_snap;
backing_t m_backing;
std::vector<search_filter> m_sfs;
const attribute_check* m_checks;
size_t m_checks_sz;
region_id m_ri;
leveldb::Range m_obj_range;
leveldb::Iterator* m_iter;
returncode m_error;
e::slice m_key;
std::vector<e::slice> m_value;
uint64_t m_version;
};
std::ostream&
operator << (std::ostream& lhs, datalayer::returncode rhs);
} // namespace hyperdex
#endif // hyperdex_daemon_datalayer_h_