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
use block::{BlockBuilder, BlockContents};
use blockhandle::BlockHandle;
use options::{CompressionType, BuildOptions};
use iterator::{Comparator, StandardComparator};
use std::io::{Result, Write};
use std::fs::{File, OpenOptions};
use std::path::Path;
use std::cmp::Ordering;
use crc::crc32;
use crc::Hasher32;
use integer_encoding::FixedInt;
pub const FOOTER_LENGTH: usize = 40;
pub const FULL_FOOTER_LENGTH: usize = FOOTER_LENGTH + 8;
pub const MAGIC_FOOTER_NUMBER: u64 = 0xdb4775248b80fb57;
pub const MAGIC_FOOTER_ENCODED: [u8; 8] = [0x57, 0xfb, 0x80, 0x8b, 0x24, 0x75, 0x47, 0xdb];
fn find_shortest_sep<C: Comparator>(c: &C, lo: &[u8], hi: &[u8]) -> Vec<u8> {
let min;
if lo.len() < hi.len() {
min = lo.len();
} else {
min = hi.len();
}
let mut diff_at = 0;
while diff_at < min && lo[diff_at] == hi[diff_at] {
diff_at += 1;
}
if diff_at == min {
return Vec::from(lo);
} else {
if lo[diff_at] < 0xff && lo[diff_at] + 1 < hi[diff_at] {
let mut result = Vec::from(&lo[0..diff_at + 1]);
result[diff_at] += 1;
assert_eq!(c.cmp(&result, hi), Ordering::Less);
return result;
}
return Vec::from(lo);
}
}
#[derive(Debug)]
pub struct Footer {
pub index: BlockHandle,
}
impl Footer {
pub fn new(index: BlockHandle) -> Footer {
Footer { index: index }
}
pub fn decode(from: &[u8]) -> Footer {
assert!(from.len() >= FULL_FOOTER_LENGTH);
assert_eq!(&from[FOOTER_LENGTH..], &MAGIC_FOOTER_ENCODED);
let (ix, _) = BlockHandle::decode(&from[0..]);
Footer { index: ix }
}
pub fn encode(&self, to: &mut [u8]) {
assert!(to.len() >= FOOTER_LENGTH + 8);
let s1 = self.index.encode_to(&mut to[0..]);
for i in s1..FOOTER_LENGTH {
to[i] = 0;
}
for i in FOOTER_LENGTH..FULL_FOOTER_LENGTH {
to[i] = MAGIC_FOOTER_ENCODED[i - FOOTER_LENGTH];
}
}
}
pub struct TableBuilder<C: Comparator, Dst: Write> {
o: BuildOptions,
cmp: C,
dst: Dst,
offset: usize,
num_entries: usize,
prev_block_last_key: Vec<u8>,
data_block: Option<BlockBuilder<C>>,
index_block: Option<BlockBuilder<C>>,
}
impl<Dst: Write> TableBuilder<StandardComparator, Dst> {
pub fn new_defaults(dst: Dst) -> TableBuilder<StandardComparator, Dst> {
TableBuilder::new(dst, BuildOptions::default(), StandardComparator)
}
}
impl TableBuilder<StandardComparator, File> {
pub fn new_to_file(file: &Path) -> Result<TableBuilder<StandardComparator, File>> {
let f = try!(OpenOptions::new().create(true).write(true).truncate(true).open(file));
Ok(TableBuilder::new(f, BuildOptions::default(), StandardComparator))
}
}
impl<C: Comparator, Dst: Write> TableBuilder<C, Dst> {
pub fn new(dst: Dst, opt: BuildOptions, cmp: C) -> TableBuilder<C, Dst> {
TableBuilder {
o: opt,
cmp: cmp,
dst: dst,
offset: 0,
prev_block_last_key: vec![],
num_entries: 0,
data_block: Some(BlockBuilder::new(opt, cmp)),
index_block: Some(BlockBuilder::new(opt, cmp)),
}
}
pub fn entries(&self) -> usize {
self.num_entries
}
pub fn add(&mut self, key: &[u8], val: &[u8]) {
assert!(self.data_block.is_some());
assert!(self.num_entries == 0 ||
self.cmp.cmp(&self.prev_block_last_key, key) == Ordering::Less);
if self.data_block.as_ref().unwrap().size_estimate() > self.o.block_size {
self.write_data_block(key);
}
let dblock = &mut self.data_block.as_mut().unwrap();
self.num_entries += 1;
dblock.add(key, val);
}
fn write_data_block(&mut self, next_key: &[u8]) {
assert!(self.data_block.is_some());
let block = self.data_block.take().unwrap();
let sep = find_shortest_sep(&self.cmp, block.last_key(), next_key);
self.prev_block_last_key = Vec::from(block.last_key());
let contents = block.finish();
let handle = BlockHandle::new(self.offset, contents.len());
let mut handle_enc = [0 as u8; 16];
let enc_len = handle.encode_to(&mut handle_enc);
self.index_block.as_mut().unwrap().add(&sep, &handle_enc[0..enc_len]);
self.data_block = Some(BlockBuilder::new(self.o, self.cmp));
let ctype = self.o.compression_type;
self.write_block(contents, ctype);
}
fn write_block(&mut self, c: BlockContents, t: CompressionType) -> BlockHandle {
assert_eq!(t, CompressionType::CompressionNone);
let mut buf = [0 as u8; 4];
let mut digest = crc32::Digest::new(crc32::CASTAGNOLI);
digest.write(&c);
digest.write(&[self.o.compression_type as u8; 1]);
digest.sum32().encode_fixed(&mut buf);
let _ = self.dst.write(&c);
let _ = self.dst.write(&[t as u8; 1]);
let _ = self.dst.write(&buf);
let handle = BlockHandle::new(self.offset, c.len());
self.offset += c.len() + 1 + buf.len();
handle
}
pub fn finish(mut self) {
assert!(self.data_block.is_some());
let ctype = self.o.compression_type;
let flush_last_block = self.data_block.as_ref().unwrap().entries() > 0;
if flush_last_block {
self.write_data_block(&[0xff as u8; 1]);
}
let index_cont = self.index_block.take().unwrap().finish();
let ix_handle = self.write_block(index_cont, ctype);
let footer = Footer::new(ix_handle);
let mut buf = [0; FULL_FOOTER_LENGTH];
footer.encode(&mut buf);
self.offset += self.dst.write(&buf[..]).unwrap();
}
}
#[cfg(test)]
mod tests {
use super::{find_shortest_sep, Footer, TableBuilder};
use iterator::StandardComparator;
use blockhandle::BlockHandle;
use options::BuildOptions;
#[test]
fn test_shortest_sep() {
assert_eq!(find_shortest_sep(&StandardComparator, "abcd".as_bytes(), "abcf".as_bytes()),
"abce".as_bytes());
assert_eq!(find_shortest_sep(&StandardComparator,
"abcdefghi".as_bytes(),
"abcffghi".as_bytes()),
"abce".as_bytes());
assert_eq!(find_shortest_sep(&StandardComparator, "a".as_bytes(), "a".as_bytes()),
"a".as_bytes());
assert_eq!(find_shortest_sep(&StandardComparator, "a".as_bytes(), "b".as_bytes()),
"a".as_bytes());
assert_eq!(find_shortest_sep(&StandardComparator, "abc".as_bytes(), "zzz".as_bytes()),
"b".as_bytes());
assert_eq!(find_shortest_sep(&StandardComparator, "".as_bytes(), "".as_bytes()),
"".as_bytes());
}
#[test]
fn test_footer() {
let f = Footer::new(BlockHandle::new(55, 5));
let mut buf = [0; 48];
f.encode(&mut buf[..]);
let f2 = Footer::decode(&buf);
assert_eq!(f2.index.offset(), 55);
assert_eq!(f2.index.size(), 5);
}
#[test]
fn test_table_builder() {
let mut d = Vec::with_capacity(512);
let mut opt = BuildOptions::default();
opt.block_restart_interval = 3;
let mut b = TableBuilder::new(&mut d, opt, StandardComparator);
let data = vec![("abc", "def"), ("abd", "dee"), ("bcd", "asa"), ("bsr", "a00")];
for &(k, v) in data.iter() {
b.add(k.as_bytes(), v.as_bytes());
}
b.finish();
}
#[test]
#[should_panic]
fn test_bad_input() {
let mut d = Vec::with_capacity(512);
let mut opt = BuildOptions::default();
opt.block_restart_interval = 3;
let mut b = TableBuilder::new(&mut d, opt, StandardComparator);
let data = vec![("abc", "def"), ("abc", "dee"), ("bcd", "asa"), ("bsr", "a00")];
for &(k, v) in data.iter() {
b.add(k.as_bytes(), v.as_bytes());
}
}
}