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
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
|
/**
* Copyright (C) 2021-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#pragma once
#include <array>
#include <deque>
#include <vector>
#include "mongo/bson/util/builder.h"
#include "mongo/platform/int128.h"
namespace mongo {
/**
* Callback type to implement writing of 64 bit Simple8b words.
*/
using Simple8bWriteFn = std::function<void(uint64_t)>;
/**
* Simple8bBuilder compresses a series of integers into chains of 64 bit Simple8b blocks.
*
* T may be uint64_t and uint128_t only.
*/
template <typename T>
class Simple8bBuilder {
private:
struct PendingValue;
public:
// Callback to handle writing of finalized Simple-8b blocks. Machine Endian byte order, the
// value need to be converted to Little Endian before persisting.
Simple8bBuilder(Simple8bWriteFn writeFunc);
~Simple8bBuilder();
/**
* Appends val to Simple8b. Returns true if the append was successful and false if the value was
* outside the range of possible values we can store in Simple8b.
*
* A call to append may result in multiple Simple8b blocks being finalized.
*/
bool append(T val);
/**
* Appends a missing value to Simple8b.
*
* May result in a single Simple8b being finalized.
*/
void skip();
/**
* Flushes all buffered values into finalized Simple8b blocks.
*
* It is allowed to continue to append values after this call.
*/
void flush();
/**
* Iterator for reading pending values in Simple8bBuilder that has not yet been written to
* Simple-8b blocks.
*
* Provides forward iteration
*/
class PendingIterator {
public:
friend class Simple8bBuilder;
// typedefs expected in iterators
using iterator_category = std::forward_iterator_tag;
using difference_type = ptrdiff_t;
using value_type = boost::optional<T>;
using pointer = const boost::optional<T>*;
using reference = const boost::optional<T>&;
pointer operator->() const;
reference operator*() const;
PendingIterator& operator++();
PendingIterator operator++(int);
bool operator==(const PendingIterator& rhs) const;
bool operator!=(const PendingIterator& rhs) const;
private:
PendingIterator(typename std::deque<PendingValue>::const_iterator it,
reference rleValue,
uint32_t rleCount);
typename std::deque<PendingValue>::const_iterator _it;
const boost::optional<T>& _rleValue;
uint32_t _rleCount;
};
/**
* Forward iterators to read pending values
*/
PendingIterator begin() const;
PendingIterator end() const;
/**
* Set write callback
*/
void setWriteCallback(Simple8bWriteFn writer);
private:
// Number of different type of selectors and their extensions available
static constexpr uint8_t kNumOfSelectorTypes = 4;
/**
* This stores a value that has yet to be added to the buffer. It also stores the number of bits
* required to store the value for each selector extension type. Furthermore, it stores the
* number of trailing zeros that would be stored if this value was stored according to the
* respective selector type. The arrays are indexed using the same selector indexes as defined
* in the cpp file.
*/
struct PendingValue {
PendingValue(boost::optional<T> val,
std::array<uint8_t, kNumOfSelectorTypes> bitCount,
std::array<uint8_t, kNumOfSelectorTypes> trailingZerosCount);
bool isSkip() const {
return !val.has_value();
}
T value() const {
return val.value();
}
boost::optional<T> val;
std::array<uint8_t, kNumOfSelectorTypes> bitCount = {0, 0, 0, 0};
// This is not the total number of trailing zeros, but the trailing zeros that will be
// stored given the selector chosen.
std::array<uint8_t, kNumOfSelectorTypes> trailingZerosCount = {0, 0, 0, 0};
};
// The min number of meaningful bits each selector can store
static constexpr std::array<uint8_t, 4> kMinDataBits = {1, 2, 4, 4};
/**
* Function objects to encode Simple8b blocks for the different extension types.
*
* See .cpp file for more information.
*/
struct BaseSelectorEncodeFunctor;
struct SevenSelectorEncodeFunctor;
template <uint8_t ExtensionType>
struct EightSelectorEncodeFunctor;
struct EightSelectorSmallEncodeFunctor;
struct EightSelectorLargeEncodeFunctor;
/**
* Appends a value to the Simple8b chain of words.
* Return true if successfully appended and false otherwise.
*/
bool _appendValue(T value, bool tryRle);
/**
* Appends a skip to _pendingValues and forms a new Simple8b word if there is no space.
*/
void _appendSkip();
/**
* When an RLE ends because of inconsecutive values, check if there are enough
* consecutive values for a RLE value and/or any values to be appended to _pendingValues.
*/
void _handleRleTermination();
/**
* Based on _rleCount, create a RLE Simple8b word if possible.
* If _rleCount is not large enough, do nothing.
*/
void _appendRleEncoding();
/*
* Checks to see if RLE is possible and/or ongoing
*/
bool _rlePossible() const;
/**
* Tests if a value would fit inside the current simple8b word using any of the selectors
* selector. Returns true if adding the value fits in the current simple8b word and false
* otherwise.
*/
bool _doesIntegerFitInCurrentWord(const PendingValue& value);
/*
* This is a helper method for testing if a given selector will allow an integer to fit in a
* simple8b word. Takes in a value to be stored and an extensionType representing the selector
* compression method to check. Returns true if the word fits and updates the global
* _lastValidExtensionType with the extensionType passed. If false, updates
* isSelectorPossible[extensionType] to false so we do not need to recheck that extension if we
* find a valid type and more values are added into the current word.
*/
bool _doesIntegerFitInCurrentWordWithGivenSelectorType(const PendingValue& value,
uint8_t extensionType);
/**
* Encodes the largest possible simple8b word from _pendingValues without unused buckets using
* the selector compression method passed in extensionType. Assumes is always called right after
* _doesIntegerFitInCurrentWord fails for the first time. It removes the integers used to form
* the simple8b word from _pendingValues permanently and updates our global state with any
* remaining integers in _pendingValues.
*/
int64_t _encodeLargestPossibleWord(uint8_t extensionType);
/**
* Takes a vector of integers to be compressed into a 64 bit word via the selector type given.
* The values will be stored from right to left in little endian order.
* For now, we will assume that all ints in the vector are greater or equal to zero.
* We will also assume that the selector and all values will fit into the 64 bit word.
* Returns the encoded Simple8b word if the inputs are valid and errCode otherwise.
*/
template <typename Func>
uint64_t _encode(Func func, uint8_t selectorIdx, uint8_t extensionType);
/**
* Updates the simple8b current state with the passed parameters. The maximum is always taken
* between the current state and the new value passed. This is used to keep track of the size of
* the simple8b word that we will need to encode.
*/
void _updateSimple8bCurrentState(const PendingValue& val);
// If RLE is ongoing, the number of consecutive repeats fo lastValueInPrevWord.
uint32_t _rleCount = 0;
// If RLE is ongoing, the last value in the previous Simple8b word.
PendingValue _lastValueInPrevWord = {boost::optional<T>(0), {0, 0, 0, 0}, {0, 0, 0, 0}};
// These variables hold the max amount of bits for each value in _pendingValues. They are
// updated whenever values are added or removed from _pendingValues to always reflect the max
// value in the deque.
std::array<uint8_t, kNumOfSelectorTypes> _currMaxBitLen = kMinDataBits;
std::array<uint8_t, kNumOfSelectorTypes> _currTrailingZerosCount = {0, 0, 0, 0};
// This holds the last valid selector compression method that succeded for
// doesIntegerFitInCurrentWord and is used to designate the compression type when we need to
// write a simple8b word to buffer.
uint8_t _lastValidExtensionType = 0;
// Holds whether the selector compression method is possible. This is updated in
// doesIntegerFitInCurrentWordWithSelector to avoid unnecessary calls when a selector is already
// invalid for the current set of words in _pendingValues.
std::array<bool, kNumOfSelectorTypes> isSelectorPossible = {true, true, true, true};
// This holds values that have not be encoded to the simple8b buffer, but are waiting for a full
// simple8b word to be filled before writing to buffer.
std::deque<PendingValue> _pendingValues;
// User-defined callback to handle writing of finalized Simple-8b blocks
Simple8bWriteFn _writeFn;
};
/**
* Simple8b provides an interface to read Simple8b encoded data built by Simple8bBuilder above
*/
template <typename T>
class Simple8b {
public:
class Iterator {
public:
friend class Simple8b;
// typedefs expected in iterators
using iterator_category = std::input_iterator_tag;
using difference_type = ptrdiff_t;
using value_type = boost::optional<T>;
using pointer = const boost::optional<T>*;
using reference = const boost::optional<T>&;
/**
* Returns the number of values in the current Simple8b block that the iterator is
* positioned on.
*/
size_t blockSize() const;
/**
* Returns the value in at the current iterator position.
*/
pointer operator->() const {
return &_value;
}
reference operator*() const {
return _value;
}
/**
* Advance the iterator one step.
*/
Iterator& operator++();
/**
* Advance the iterator to the next Simple8b block.
*/
Iterator& advanceBlock();
bool operator==(const Iterator& rhs) const;
bool operator!=(const Iterator& rhs) const;
private:
Iterator(const uint64_t* pos, const uint64_t* end);
/**
* Loads the current Simple8b block into the iterator
*/
void _loadBlock();
void _loadValue();
/**
* RLE count, may only be called if iterator is positioned on an RLE block
*/
uint16_t _rleCountInCurrent(uint8_t selectorExtension) const;
const uint64_t* _pos;
const uint64_t* _end;
// Current Simple8b block in native endian
uint64_t _current;
boost::optional<T> _value;
// Mask for getting a single Simple-8b slot
uint64_t _mask;
// Remaining RLE count for repeating previous value
uint16_t _rleRemaining;
// Number of positions to shift the mask to get slot for current iterator position
uint8_t _shift;
// Number of bits in single Simple-8b slot, used to increment _shift when updating iterator
// position
uint8_t _bitsPerValue;
// Variables for the extended Selectors 7 and 8 with embedded count in Simple-8b slot
// Mask to extract count
uint8_t _countMask;
// Number of bits for the count
uint8_t _countBits;
// Multiplier of the value in count to get number of zeros
uint8_t _countMultiplier;
// Holds the current simple8b block's selector
uint8_t _selector;
// Holds the current simple8b blocks's extension type
uint8_t _extensionType;
};
/**
* Does not take ownership of buffer, must remain valid during the lifetime of this class.
*/
Simple8b(const char* buffer, int size);
/**
* Forward iterators to read decompressed values
*/
Iterator begin() const;
Iterator end() const;
private:
const char* _buffer;
int _size;
};
} // namespace mongo
|