/
types.rs
334 lines (303 loc) · 12.5 KB
/
types.rs
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
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
use byteorder::{ByteOrder, NativeEndian};
use hex::ToHex;
use std::fmt::{self, Debug, Display, Formatter};
use tikv_util::codec;
use tikv_util::codec::bytes;
use tikv_util::codec::bytes::BytesEncoder;
use tikv_util::codec::number::{self, NumberEncoder};
/// Value type which is essentially raw bytes.
pub type Value = Vec<u8>;
/// Key-value pair type.
///
/// The value is simply raw bytes; the key is a little bit tricky, which is
/// encoded bytes.
pub type KvPair = (Vec<u8>, Value);
/// Key type.
///
/// Keys have 2 types of binary representation - raw and encoded. The raw
/// representation is for public interface, the encoded representation is for
/// internal storage. We can get both representations from an instance of this
/// type.
///
/// Orthogonal to binary representation, keys may or may not embed a timestamp,
/// but this information is transparent to this type, the caller must use it
/// consistently.
#[derive(Eq, PartialEq, Ord, PartialOrd, Hash)]
pub struct Key(Vec<u8>);
/// Core functions for `Key`.
impl Key {
/// Creates a key from raw bytes.
#[inline]
pub fn from_raw(key: &[u8]) -> Key {
// adding extra length for appending timestamp
let len = codec::bytes::max_encoded_bytes_size(key.len()) + codec::number::U64_SIZE;
let mut encoded = Vec::with_capacity(len);
encoded.encode_bytes(key, false).unwrap();
Key(encoded)
}
/// Gets and moves the raw representation of this key.
#[inline]
pub fn into_raw(self) -> Result<Vec<u8>, codec::Error> {
let mut k = self.0;
bytes::decode_bytes_in_place(&mut k, false)?;
Ok(k)
}
/// Gets the raw representation of this key.
#[inline]
pub fn to_raw(&self) -> Result<Vec<u8>, codec::Error> {
bytes::decode_bytes(&mut self.0.as_slice(), false)
}
/// Creates a key from encoded bytes vector.
#[inline]
pub fn from_encoded(encoded_key: Vec<u8>) -> Key {
Key(encoded_key)
}
/// Creates a key with reserved capacity for timestamp from encoded bytes slice.
#[inline]
pub fn from_encoded_slice(encoded_key: &[u8]) -> Key {
let mut k = Vec::with_capacity(encoded_key.len() + number::U64_SIZE);
k.extend_from_slice(encoded_key);
Key(k)
}
/// Gets the encoded representation of this key.
#[inline]
pub fn as_encoded(&self) -> &Vec<u8> {
&self.0
}
/// Gets and moves the encoded representation of this key.
#[inline]
pub fn into_encoded(self) -> Vec<u8> {
self.0
}
/// Creates a new key by appending a `u64` timestamp to this key.
#[inline]
pub fn append_ts(self, ts: u64) -> Key {
let mut encoded = self.0;
encoded.encode_u64_desc(ts).unwrap();
Key(encoded)
}
/// Gets the timestamp contained in this key.
///
/// Preconditions: the caller must ensure this is actually a timestamped
/// key.
#[inline]
pub fn decode_ts(&self) -> Result<u64, codec::Error> {
Ok(Self::decode_ts_from(&self.0)?)
}
/// Creates a new key by truncating the timestamp from this key.
///
/// Preconditions: the caller must ensure this is actually a timestamped key.
#[inline]
pub fn truncate_ts(mut self) -> Result<Key, codec::Error> {
let len = self.0.len();
if len < number::U64_SIZE {
// TODO: IMHO, this should be an assertion failure instead of
// returning an error. If this happens, it indicates a bug in
// the caller module, have to make code change to fix it.
//
// Even if it passed the length check, it still could be buggy,
// a better way is to introduce a type `TimestampedKey`, and
// functions to convert between `TimestampedKey` and `Key`.
// `TimestampedKey` is in a higher (MVCC) layer, while `Key` is
// in the core storage engine layer.
Err(codec::Error::KeyLength)
} else {
self.0.truncate(len - number::U64_SIZE);
Ok(self)
}
}
/// Split a ts encoded key, return the user key and timestamp.
#[inline]
pub fn split_on_ts_for(key: &[u8]) -> Result<(&[u8], u64), codec::Error> {
if key.len() < number::U64_SIZE {
Err(codec::Error::KeyLength)
} else {
let pos = key.len() - number::U64_SIZE;
let k = &key[..pos];
let mut ts = &key[pos..];
Ok((k, number::decode_u64_desc(&mut ts)?))
}
}
/// Extract the user key from a ts encoded key.
#[inline]
pub fn truncate_ts_for(key: &[u8]) -> Result<&[u8], codec::Error> {
let len = key.len();
if len < number::U64_SIZE {
return Err(codec::Error::KeyLength);
}
Ok(&key[..key.len() - number::U64_SIZE])
}
/// Decode the timestamp from a ts encoded key.
#[inline]
pub fn decode_ts_from(key: &[u8]) -> Result<u64, codec::Error> {
let len = key.len();
if len < number::U64_SIZE {
return Err(codec::Error::KeyLength);
}
let mut ts = &key[len - number::U64_SIZE..];
number::decode_u64_desc(&mut ts)
}
/// Whether the user key part of a ts encoded key `ts_encoded_key` equals to the encoded
/// user key `user_key`.
///
/// There is an optimization in this function, which is to compare the last 8 encoded bytes
/// first before comparing the rest. It is because in TiDB many records are ended with an 8
/// byte row id and in many situations only this part is different when calling this function.
//
// TODO: If the last 8 byte is memory aligned, it would be better.
#[inline]
pub fn is_user_key_eq(ts_encoded_key: &[u8], user_key: &[u8]) -> bool {
let user_key_len = user_key.len();
if ts_encoded_key.len() != user_key_len + number::U64_SIZE {
return false;
}
if user_key_len >= number::U64_SIZE {
// We compare last 8 bytes as u64 first, then compare the rest.
// TODO: Can we just use == to check the left part and right part? `memcmp` might
// be smart enough.
let left = NativeEndian::read_u64(&ts_encoded_key[user_key_len - 8..]);
let right = NativeEndian::read_u64(&user_key[user_key_len - 8..]);
if left != right {
return false;
}
ts_encoded_key[..user_key_len - 8] == user_key[..user_key_len - 8]
} else {
ts_encoded_key[..user_key_len] == user_key[..]
}
}
/// Returns whether the encoded key is encoded from `raw_key`.
///
/// # Panics
///
/// Panics if `self` is not a valid encoded key.
pub fn is_encoded_from(&self, raw_key: &[u8]) -> bool {
bytes::is_encoded_from(&self.0, raw_key, false)
}
}
impl Clone for Key {
fn clone(&self) -> Self {
// default clone implemention use self.len() to reserve capacity
// for the sake of appending ts, we need to reserve more
let mut key = Vec::with_capacity(self.0.capacity());
key.extend_from_slice(&self.0);
Key(key)
}
}
impl Debug for Key {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
self.0.write_hex_upper(f)
}
}
impl Display for Key {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
self.0.write_hex_upper(f)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_split_ts() {
let k = b"k";
let ts = 123;
assert!(Key::split_on_ts_for(k).is_err());
let enc = Key::from_encoded_slice(k).append_ts(ts);
let res = Key::split_on_ts_for(enc.as_encoded()).unwrap();
assert_eq!(res, (k.as_ref(), ts));
}
#[test]
fn test_is_user_key_eq() {
// make a short name to keep format for the test.
fn eq(a: &[u8], b: &[u8]) -> bool {
Key::is_user_key_eq(a, b)
}
assert_eq!(false, eq(b"", b""));
assert_eq!(false, eq(b"12345", b""));
assert_eq!(true, eq(b"12345678", b""));
assert_eq!(true, eq(b"x12345678", b"x"));
assert_eq!(false, eq(b"x12345", b"x"));
// user key len == 3
assert_eq!(true, eq(b"xyz12345678", b"xyz"));
assert_eq!(true, eq(b"xyz________", b"xyz"));
assert_eq!(false, eq(b"xyy12345678", b"xyz"));
assert_eq!(false, eq(b"yyz12345678", b"xyz"));
assert_eq!(false, eq(b"xyz12345678", b"xy"));
assert_eq!(false, eq(b"xyy12345678", b"xy"));
assert_eq!(false, eq(b"yyz12345678", b"xy"));
// user key len == 7
assert_eq!(true, eq(b"abcdefg12345678", b"abcdefg"));
assert_eq!(true, eq(b"abcdefgzzzzzzzz", b"abcdefg"));
assert_eq!(false, eq(b"abcdefg12345678", b"abcdef"));
assert_eq!(false, eq(b"abcdefg12345678", b"bcdefg"));
assert_eq!(false, eq(b"abcdefv12345678", b"abcdefg"));
assert_eq!(false, eq(b"vbcdefg12345678", b"abcdefg"));
assert_eq!(false, eq(b"abccefg12345678", b"abcdefg"));
// user key len == 8
assert_eq!(true, eq(b"abcdefgh12345678", b"abcdefgh"));
assert_eq!(true, eq(b"abcdefghyyyyyyyy", b"abcdefgh"));
assert_eq!(false, eq(b"abcdefgh12345678", b"abcdefg"));
assert_eq!(false, eq(b"abcdefgh12345678", b"bcdefgh"));
assert_eq!(false, eq(b"abcdefgz12345678", b"abcdefgh"));
assert_eq!(false, eq(b"zbcdefgh12345678", b"abcdefgh"));
assert_eq!(false, eq(b"abcddfgh12345678", b"abcdefgh"));
// user key len == 9
assert_eq!(true, eq(b"abcdefghi12345678", b"abcdefghi"));
assert_eq!(true, eq(b"abcdefghixxxxxxxx", b"abcdefghi"));
assert_eq!(false, eq(b"abcdefghi12345678", b"abcdefgh"));
assert_eq!(false, eq(b"abcdefghi12345678", b"bcdefghi"));
assert_eq!(false, eq(b"abcdefghy12345678", b"abcdefghi"));
assert_eq!(false, eq(b"ybcdefghi12345678", b"abcdefghi"));
assert_eq!(false, eq(b"abcddfghi12345678", b"abcdefghi"));
// user key len == 11
assert_eq!(true, eq(b"abcdefghijk87654321", b"abcdefghijk"));
assert_eq!(true, eq(b"abcdefghijkabcdefgh", b"abcdefghijk"));
assert_eq!(false, eq(b"abcdefghijk87654321", b"abcdefghij"));
assert_eq!(false, eq(b"abcdefghijk87654321", b"bcdefghijk"));
assert_eq!(false, eq(b"abcdefghijx87654321", b"abcdefghijk"));
assert_eq!(false, eq(b"xbcdefghijk87654321", b"abcdefghijk"));
assert_eq!(false, eq(b"abxdefghijk87654321", b"abcdefghijk"));
assert_eq!(false, eq(b"axcdefghijk87654321", b"abcdefghijk"));
assert_eq!(false, eq(b"abcdeffhijk87654321", b"abcdefghijk"));
}
#[test]
fn test_is_encoded_from() {
for raw_len in 0..=24 {
let raw: Vec<u8> = (0..raw_len).collect();
let encoded = Key::from_raw(&raw);
assert!(encoded.is_encoded_from(&raw));
let encoded_len = encoded.as_encoded().len();
// Should fail if we modify one byte in raw
for i in 0..raw.len() {
let mut invalid_raw = raw.clone();
invalid_raw[i] = raw[i].wrapping_add(1);
assert!(!encoded.is_encoded_from(&invalid_raw));
}
// Should fail if we modify one byte in encoded
for i in 0..encoded_len {
let mut invalid_encoded = encoded.clone();
invalid_encoded.0[i] = encoded.0[i].wrapping_add(1);
assert!(!invalid_encoded.is_encoded_from(&raw));
}
// Should panic if encoded length is not a multiple of 9
let res = panic_hook::recover_safe(|| {
let mut invalid_encoded = encoded.clone();
invalid_encoded.0.pop();
invalid_encoded.is_encoded_from(&raw)
});
assert!(res.is_err());
// Should panic if encoded has less or more chunks
let shorter_encoded = Key::from_encoded_slice(&encoded.0[..encoded_len - 9]);
assert!(!shorter_encoded.is_encoded_from(&raw));
let mut longer_encoded = encoded.as_encoded().clone();
longer_encoded.extend(&[0, 0, 0, 0, 0, 0, 0, 0, 0xFF]);
let longer_encoded = Key::from_encoded(longer_encoded);
assert!(!longer_encoded.is_encoded_from(&raw));
// Should fail if raw is longer or shorter
let shorter_raw = &raw[..raw.len() - 1];
assert!(!encoded.is_encoded_from(shorter_raw));
let mut longer_raw = raw.to_vec();
longer_raw.push(0);
assert!(!encoded.is_encoded_from(&longer_raw));
}
}
}