-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcspp_memtable.cc
1578 lines (1568 loc) · 61 KB
/
cspp_memtable.cc
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
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright (c) 2021-present, Topling, Inc. All rights reserved.
// Created by leipeng, fully rewrite by leipeng 2021-05-12
#include "db/memtable.h"
#include "topling/side_plugin_factory.h"
#include "logging/logging.h"
// dump cspp memtable as sst
#include "file/filename.h"
#include "monitoring/iostats_context_imp.h"
#include "table/top_table_builder.h"
#include "table/top_table_reader.h"
#include "topling/builtin_table_factory.h"
#if defined(_MSC_VER)
#pragma warning(disable: 4245) // convert int to size_t in fsa of cspp
#pragma warning(disable: 4458) // deactived_mem_sum hide class member(intentional)
#endif
#include <terark/fsa/cspptrie.inl>
#include <terark/num_to_str.hpp>
#include <terark/util/vm_util.hpp>
#if defined(OS_LINUX)
#include <linux/mman.h>
#include <linux/version.h>
#endif
const char* git_version_hash_info_cspp_memtable();
namespace terark {
TERARK_DLL_EXPORT void CSPP_SetDebugLevel(long level); // defined in cspptrie.cpp
TERARK_DLL_EXPORT long CSPP_GetDebugLevel(); // defined in cspptrie.cpp
} // namespace terark
namespace ROCKSDB_NAMESPACE {
using namespace terark;
extern bool IsRocksBackgroundThread(); // defined in util/threadpool_impl.cc
ROCKSDB_ENUM_CLASS(ConvertKind, uint08_t, kDontConvert, kDumpMem, kFileMmap);
static const uint32_t LOCK_FLAG = uint32_t(1) << 31;
struct CSPPMemTabFactory;
struct MemTabLinkListNode {
MemTabLinkListNode *m_prev, *m_next;
};
struct CSPPMemTab : public MemTableRep, public MemTabLinkListNode {
static constexpr size_t Align = MainPatricia::AlignSize;
static_assert(Align == 4);
#pragma pack(push, 4)
struct Entry {
uint64_t tag;
uint32_t pos;
operator uint64_t() const noexcept { return tag; } // NOLINT
Slice GetValue(const void* mempool) const noexcept {
if (size_t p = pos) {
auto enc_valptr = (const char*)(mempool) + p * Align;
return GetLengthPrefixedSlice(enc_valptr);
} else {
return Slice();
}
}
};
struct VecPin { // once allocated, never realloc
uint32_t num;
uint32_t cap;
uint32_t pos;
};
#pragma pack(pop)
static void encode_pre(Slice d, void* buf) {
assert(d.size_ > 0); // empty `d` will not call this function
char* p = EncodeVarint32((char*)buf, (uint32_t)d.size());
memcpy(p, d.data_, d.size_);
}
mutable MainPatricia m_trie;
bool m_read_by_writer_token;
bool m_token_use_idle;
bool m_accurate_memsize;
bool m_rev;
bool m_is_flushed = false;
bool m_is_empty = true;
bool m_is_sst : 1;
bool m_has_converted_to_sst : 1;
bool m_has_marked_readonly : 1; // pre C++20 can not init on define
ConvertKind m_convert_to_sst;
CSPPMemTabFactory* m_fac;
Logger* m_log;
size_t m_instance_idx;
size_t max_dup_len = 1;
size_t num_dup_user_keys = 0;
uint32_t m_cumu_iter_num = 0;
uint32_t m_live_iter_num = 0;
#if defined(ROCKSDB_UNIT_TEST)
size_t m_mem_size = 0;
#endif
CSPPMemTab(intptr_t cap, bool rev, Logger*, CSPPMemTabFactory*,
size_t instance_idx, ConvertKind, fstring fpath_or_conf);
CSPPMemTab(bool rev, Logger*, CSPPMemTabFactory*, size_t instance_idx);
void init(bool rev, Logger*, CSPPMemTabFactory*);
~CSPPMemTab() noexcept override;
KeyHandle Allocate(const size_t, char**) final { TERARK_DIE("Bad call"); }
void Insert(KeyHandle) final { TERARK_DIE("Bad call"); }
struct Token : public Patricia::WriterToken {
uint64_t tag_ = UINT64_MAX;
Slice val_;
size_t max_dup_len = 1;
size_t num_dup_user_keys = 0;
~Token();
bool init_value(void* trie_valptr, size_t trie_valsize) noexcept final;
void destroy_value(void* valptr, size_t valsize) noexcept final;
bool insert_for_dup_user_key(CSPPMemTab*);
};
void OnDupUserKeyYield();
bool insert_kv(fstring ikey, const Slice& val, Token*);
bool InsertKeyValueConcurrently(const Slice& ikey, const Slice& val) final {
if (UNLIKELY(m_is_empty)) { // must check, avoid write as possible
m_is_empty = false;
}
Token* token = m_trie.tls_writer_token_nn<Token>();
token->acquire(&m_trie);
auto ret = insert_kv(ikey, val, token);
m_token_use_idle ? token->idle() : token->release();
return ret;
}
bool InsertKeyValue(const Slice& k, const Slice& v) final {
return InsertKeyValueConcurrently(k, v);
}
bool InsertKeyValueWithHintConcurrently(const Slice& k, const Slice& v,
void** hint) final {
if (UNLIKELY(m_is_empty)) { // must check, avoid write as possible
m_is_empty = false;
}
// SkipListMemTable use `*hint` as last insertion position, We use `*hint`
// as the tls writer token ptr to avoid calling of tls_writer_token_nn
assert(nullptr != hint);
Token*& token = *(Token**)(hint);
if (LIKELY(nullptr != token)) {
assert(m_trie.tls_writer_token_nn<Token>() == token);
} else {
token = m_trie.tls_writer_token_nn<Token>();
token->acquire(&m_trie);
}
return insert_kv(k, v, token);
}
bool InsertKeyValueWithHint(const Slice& k, const Slice& v, void** hint)
final {
return InsertKeyValueWithHintConcurrently(k, v, hint);
}
void FinishHint(void* hint) final {
if (nullptr != hint) {
auto token = (Token*)hint;
m_token_use_idle ? token->idle() : token->release();
}
}
inline Patricia::TokenBase* reader_token() const {
if (m_read_by_writer_token)
return m_trie.tls_writer_token_nn<Token>();
else
return m_trie.tls_reader_token();
}
bool Contains(const Slice& ikey) const final {
fstring user_key(ikey.data(), ikey.size() - 8);
auto token = reader_token();
token->acquire(&m_trie);
if (!m_trie.lookup(user_key, token)) {
m_token_use_idle ? token->idle() : token->release();
return false;
}
uint64_t find_tag = DecodeFixed64(user_key.end());
auto vec_pin = (VecPin*)m_trie.mem_get(m_trie.value_of<uint32_t>(*token));
auto num = vec_pin->num & ~LOCK_FLAG;
auto entry = (Entry*)m_trie.mem_get(vec_pin->pos);
bool ret = binary_search_0(entry, num, find_tag);
m_token_use_idle ? token->idle() : token->release();
return ret;
}
void ConvertToReadOnly(const char* caller, fstring sst_name);
void MarkReadOnly() final;
void MarkFlushed() final;
void ColdizeMemory(const char* func);
bool SupportConvertToSST() const final {
return ConvertKind::kDontConvert != m_convert_to_sst;
}
Status ConvertToSST(FileMetaData*, const TableBuilderOptions&) final;
size_t ApproximateMemoryUsage() final {
#if defined(ROCKSDB_UNIT_TEST)
size_t free_sz;
if (m_trie.is_readonly()) {
// fast and accurate once become readonly
free_sz = m_trie.mem_frag_size();
}
else {
if (m_accurate_memsize) {
// !!this is slow!!
// other threads are concurrently running, to minimize race condition,
// we get free_sz first
free_sz = m_trie.slow_get_free_size();
}
else {
// We always eliminate free size, because it seem rocksdb MemTableList
// has a bug(or a feature) which leaks memtables when size is not
// accurate. We found this bug by our online webview, and more assure
// by running MemTableList unit test.
free_sz = m_trie.mem_frag_size(); // fast but not accurate
// more tolerations, use tls as a second chance
size_t tls_free_sz = m_trie.get_cur_tls_free_size();
free_sz = std::max(free_sz, tls_free_sz);
}
}
size_t all_sz = m_trie.mem_size_inline();
if (terark_likely(all_sz > free_sz)) {
maximize(m_mem_size, all_sz - free_sz);
} else {
// if this happens, it should be a bug, just ignore it on release!
ROCKS_LOG_ERROR(m_log,
"CSPPMemTab::ApproximateMemoryUsage: all <= free : %zd %zd, ignore",
all_sz, free_sz);
ROCKSDB_ASSERT_LE(free_sz, all_sz);
// read recent mem size again from mem_size_inline
maximize(m_mem_size, m_trie.mem_size_inline());
}
return m_mem_size;
#else
return m_trie.mem_size_inline();
#endif
}
uint64_t ApproximateNumEntries(const Slice&, const Slice&) final;
terark_forceinline Slice GetValue(const Entry& e) const {
return e.GetValue(m_trie.mem_get(0));
}
ROCKSDB_FLATTEN
void Get(const ReadOptions& ro, const LookupKey& k, void* callback_args,
bool(*callback_func)(void*, const KeyValuePair&)) final {
if (UNLIKELY(m_is_empty)) {
return;
}
KeyValuePair key_val(ExtractUserKey(k.internal_key()));
auto token = reader_token();
token->acquire(&m_trie);
if (!m_trie.lookup(fstring(key_val.ukey), token)) {
m_token_use_idle ? token->idle() : token->release();
return;
}
uint32_t vec_pin_pos = m_trie.value_of<uint32_t>(*token);
auto vec_pin = (VecPin*)m_trie.mem_get(vec_pin_pos);
size_t num = vec_pin->num & ~LOCK_FLAG;
auto entry = (Entry*)m_trie.mem_get(vec_pin->pos);
uint64_t find_tag = DecodeFixed64(key_val.ukey.end());
intptr_t idx = upper_bound_0(entry, num, find_tag);
if (UNLIKELY(ro.just_check_key_exists)) {
while (idx--) {
uint64_t tag = entry[idx].tag;
if ((tag & 255) == kTypeMerge) {
// instruct get_context to stop earlier
tag = (tag & ~uint64_t(255)) | kTypeValue;
}
key_val.tag = tag;
if (!callback_func(callback_args, key_val))
break;
}
}
else while (idx--) {
key_val.tag = entry[idx].tag;
key_val.value = GetValue(entry[idx]);
if (!callback_func(callback_args, key_val))
break;
}
m_token_use_idle ? token->idle() : token->release();
}
Status SST_Get(const ReadOptions& ro, const Slice& ikey,
GetContext* get_context) const {
ROCKSDB_ASSERT_GE(ikey.size(), kNumInternalBytes);
ParsedInternalKey pikey(ikey);
Status st;
MainPatricia::SingleReaderToken token(&m_trie);
if (!m_trie.lookup(pikey.user_key, &token)) {
return st;
}
const SequenceNumber find_tag = pikey.GetTag();
Cleanable noop_pinner;
Cleanable* pinner = ro.pinning_tls ? &noop_pinner : nullptr;
uint32_t vec_pin_pos = m_trie.value_of<uint32_t>(token);
auto vec_pin = (VecPin*)m_trie.mem_get(vec_pin_pos);
size_t num = vec_pin->num & ~LOCK_FLAG;
auto entry = (Entry*)m_trie.mem_get(vec_pin->pos);
intptr_t idx = upper_bound_0(entry, num, find_tag);
if (ro.just_check_key_exists) {
while (idx--) {
uint64_t tag = entry[idx].tag;
UnPackSequenceAndType(tag, &pikey.sequence, &pikey.type);
if (pikey.type == kTypeMerge) {
// instruct get_context to stop earlier
pikey.type = kTypeValue;
}
if (!get_context->SaveValue(pikey, "", pinner)) {
break;
}
}
}
else while (idx--) {
uint64_t tag = entry[idx].tag;
UnPackSequenceAndType(tag, &pikey.sequence, &pikey.type);
Slice value = GetValue(entry[idx]);
if (!get_context->SaveValue(pikey, value, pinner)) {
break;
}
}
return st;
}
bool GetRandomInternalKeysAppend(size_t num, std::vector<std::string>* output) const;
std::string FirstInternalKey(Slice user_key, MainPatricia::TokenBase&) const;
#if (ROCKSDB_MAJOR * 10000 + ROCKSDB_MINOR * 10 + ROCKSDB_PATCH) >= 70060
using Anchor = TableReader::Anchor;
Status ApproximateKeyAnchors(const ReadOptions&, std::vector<Anchor>&) const;
#endif
bool NeedsUserKeyCompareInGet() const final { return false; }
MemTableRep::Iterator* GetIterator(Arena*) final;
struct Iter;
static size_t EncValueLen(size_t raw_val_len) {
if (raw_val_len)
return pow2_align_up(VarintLength(raw_val_len) + raw_val_len, Align);
else
return 0; // does not occupy space
}
void ToWebViewJson(json&, const json& dump_options) const;
};
bool CSPPMemTab::Token::init_value(void* trie_valptr, size_t valsize) noexcept {
TERARK_ASSERT_EQ(valsize, sizeof(uint32_t));
auto trie = static_cast<MainPatricia*>(m_trie);
// 1. one memory block, 3 logical blocks are contiguous, CPU cache friendly
// 2. one memory block can be free'ed partially, we using this feature here
static_assert(Align == 4); // now it must be 4
static_assert(sizeof(VecPin) % Align == 0);
size_t enc_val_len = EncValueLen(val_.size());
size_t vec_pin_pos = trie->mem_alloc(sizeof(VecPin) + sizeof(Entry) + enc_val_len);
TERARK_VERIFY_NE(vec_pin_pos, MainPatricia::mem_alloc_fail);
size_t entry_pos = vec_pin_pos + (sizeof(VecPin) / Align);
auto vec_pin = (VecPin*)(trie->mem_get(vec_pin_pos));
auto entry = (Entry*)(vec_pin + 1);
*(uint32_t*)trie_valptr = (uint32_t)vec_pin_pos;
vec_pin->pos = (uint32_t)entry_pos;
vec_pin->cap = 1;
vec_pin->num = 1;
entry->tag = tag_;
if (val_.size_) {
auto enc_val_ptr = (byte_t*)(entry + 1);
size_t enc_val_pos = vec_pin_pos + ((sizeof(VecPin) + sizeof(Entry)) / Align);
entry->pos = (uint32_t)enc_val_pos;
encode_pre(val_, enc_val_ptr);
} else {
entry->pos = 0;
}
return true;
}
void CSPPMemTab::Token::destroy_value(void* trie_valptr, size_t valsize) noexcept {
// should be called very rarely: multi threads racing insert same user_key.
// if do nothing, the memory block allocated in init_value will be leaked.
TERARK_ASSERT_EQ(valsize, sizeof(uint32_t));
auto trie = static_cast<MainPatricia*>(m_trie);
size_t vec_pin_pos = *(const uint32_t*)trie_valptr;
size_t enc_val_len = EncValueLen(val_.size());
size_t mem_block_len = sizeof(VecPin) + sizeof(Entry) + enc_val_len;
trie->mem_free(vec_pin_pos, mem_block_len); // free right now, not lazy free
}
terark_forceinline
bool CSPPMemTab::insert_kv(fstring ikey, const Slice& val, Token* tok) {
fstring user_key(ikey.data(), ikey.size() - 8);
tok->tag_ = DecodeFixed64(user_key.end());
tok->val_ = val;
uint32_t value_storage = UINT32_MAX;
if (LIKELY(m_trie.insert(user_key, &value_storage, tok))) {
TERARK_VERIFY_S(tok->has_value(), "OOM: mem_cap=%zd is too small: %s",
m_trie.mem_capacity(), m_trie.mmap_fpath());
return true; // done: value insert has been handled in init_value
}
return tok->insert_for_dup_user_key(this);
}
bool CSPPMemTab::Token::insert_for_dup_user_key(CSPPMemTab* tab) {
auto trie = &tab->m_trie;
auto vec_pin_pos = trie->value_of<uint32_t>(*this);
auto vec_pin = (VecPin*)trie->mem_get(vec_pin_pos);
uint32_t num;
while (LOCK_FLAG & (num = as_atomic(vec_pin->num)
.fetch_or(LOCK_FLAG, std::memory_order_acquire))) {
tab->OnDupUserKeyYield();
std::this_thread::yield(); // has been locked by other threads, yield
}
const uint32_t old_cap = vec_pin->cap;
TERARK_ASSERT_GT(num, 0);
TERARK_ASSERT_LE(num, old_cap);
const auto entry_old_pos = vec_pin->pos;
const auto entry_old = (Entry*)trie->mem_get(entry_old_pos);
const uint64_t curr_seq = tag_ >> 8;
const uint64_t last_seq = entry_old[num-1].tag >> 8;
if (UNLIKELY(curr_seq == last_seq)) {
as_atomic(vec_pin->num).store(num, std::memory_order_release);
return false; // duplicate internal_key(user_key, tag)
}
trie->mem_gc(this); // on many dup, gc is needed to revoke lazy free'ed mem
size_t enc_val_pos;
if (val_.size_) {
enc_val_pos = trie->mem_alloc(VarintLength(val_.size()) + val_.size());
TERARK_VERIFY_NE(enc_val_pos, MainPatricia::mem_alloc_fail);
encode_pre(val_, trie->mem_get(enc_val_pos));
} else {
enc_val_pos = 0;
}
maximize(max_dup_len, num + 1);
if (num < old_cap && last_seq < curr_seq) {
entry_old[num].pos = (uint32_t)enc_val_pos;
entry_old[num].tag = tag_;
// this atomic store also clears LOCK_FLAG
as_atomic(vec_pin->num).store(num + 1, std::memory_order_release);
return true;
}
if (1 == num) {
num_dup_user_keys++;
}
uint32_t new_cap = num == old_cap ? old_cap * 2 : old_cap;
size_t entry_cow_pos = trie->mem_alloc(sizeof(Entry) * new_cap);
TERARK_VERIFY_NE(entry_cow_pos, MainPatricia::mem_alloc_fail);
auto entry_cow = (Entry*)trie->mem_get(entry_cow_pos);
if (LIKELY(last_seq < curr_seq)) {
memcpy(entry_cow, entry_old, sizeof(Entry) * num);
entry_cow[num].pos = (uint32_t)enc_val_pos;
entry_cow[num].tag = tag_;
} else {
auto idx = lower_bound_0(entry_old, num, tag_);
memcpy(entry_cow, entry_old, sizeof(Entry) * idx);
entry_cow[idx].pos = (uint32_t)enc_val_pos;
entry_cow[idx].tag = tag_;
memcpy(entry_cow + idx+1, entry_old + idx, sizeof(Entry)*(num-idx));
}
vec_pin->pos = (uint32_t)entry_cow_pos; // not need atomic
vec_pin->cap = new_cap; // not need atomic
// this memory_order_release makes all previous write visiable to other CPUs
// vec_pin->num.store also clears LOCK_FLAG
as_atomic(vec_pin->num).store(num + 1, std::memory_order_release);
trie->mem_lazy_free(entry_old_pos, sizeof(Entry) * num, this);
return true;
}
struct CSPPMemTab::Iter : public MemTableRep::Iterator, boost::noncopyable {
Patricia::Iterator* m_iter;
#if defined(_MSC_VER) || defined(__clang__)
void CreateDfaIter() {
m_iter = m_tab->m_trie.new_iter();
}
bool InvokeDfaIterNext() { return m_iter->incr(); }
bool InvokeDfaIterPrev() { return m_iter->decr(); }
#else
#pragma GCC diagnostic ignored "-Wpmf-conversions"
typedef bool (*DfaIterScanFN)(ADFA_LexIterator*);
DfaIterScanFN m_dfa_iter_next;
DfaIterScanFN m_dfa_iter_prev;
void CreateDfaIter() {
m_iter = m_tab->m_trie.new_iter();
m_dfa_iter_next = (DfaIterScanFN)(m_iter->*(&ADFA_LexIterator::incr));
m_dfa_iter_prev = (DfaIterScanFN)(m_iter->*(&ADFA_LexIterator::decr));
}
inline bool InvokeDfaIterNext() { return m_dfa_iter_next(m_iter); }
inline bool InvokeDfaIterPrev() { return m_dfa_iter_prev(m_iter); }
#endif
CSPPMemTab* m_tab;
const char* m_mempool = nullptr; // used for speed up memory access
const VecPin* m_vec_pin = nullptr; // used for speed up memory access
int m_idx = -1;
bool m_rev;
struct EntryVec { int num; const Entry* vec; };
terark_forceinline EntryVec GetEntryVec() {
assert(m_iter->has_value());
auto mempool = m_mempool;
auto vec_pin_pos = *(uint32_t*)(mempool + m_iter->get_valpos());
auto vec_pin_ptr = (VecPin*)(mempool + Align * vec_pin_pos);
m_vec_pin = vec_pin_ptr; // save to m_vec_pin for laster use for speed up
return AccessEntryVec(vec_pin_ptr, mempool);
}
terark_forceinline
EntryVec AccessEntryVec(const VecPin* vec_pin, const char* mempool) const {
auto entry_num = int(vec_pin->num & ~LOCK_FLAG);
auto entry_vec = (Entry*)(mempool + Align * vec_pin->pos);
return { entry_num, entry_vec };
}
terark_forceinline void AppendTag(uint64_t tag) const {
unaligned_save(m_iter->mutable_word().ensure_unused(8), tag);
}
explicit Iter(CSPPMemTab*);
~Iter() noexcept override;
bool Valid() const final { return m_idx >= 0; }
const char* varlen_key() const final { TERARK_DIE("Bad call"); }
Slice user_key() const final {
TERARK_ASSERT_GE(m_idx, 0);
return SliceOf(m_iter->word());
}
Slice key() const final {
TERARK_ASSERT_GE(m_idx, 0);
fstring user_key = m_iter->word();
return Slice(user_key.p, user_key.n + 8);
}
Slice value() const final {
TERARK_ASSERT_GE(m_idx, 0);
auto mempool = m_mempool;
auto entry = (const Entry*)(mempool + Align * m_vec_pin->pos);
return entry[m_idx].GetValue(mempool);
}
std::pair<Slice, Slice>
GetKeyValue() const final { return {key(), value()}; }
void Next() final {
NextAndCheckValid(); // ignore return value
}
bool NextAndCheckValid() final {
TERARK_ASSERT_GE(m_idx, 0);
if (m_idx-- == 0) {
if (UNLIKELY(!(m_rev ? InvokeDfaIterPrev() : InvokeDfaIterNext()))) {
TERARK_ASSERT_LT(m_idx, 0);
return false; // fail
}
auto entry = GetEntryVec();
AppendTag(entry.vec[m_idx = entry.num - 1].tag);
} else {
auto entry = (const Entry*)(m_mempool + Align * m_vec_pin->pos);
AppendTag(entry[m_idx].tag);
}
return true;
}
bool NextAndGetResult(IterateResult* result) final {
if (LIKELY(NextAndCheckValid())) {
result->SetKey(this->key());
result->bound_check_result = IterBoundCheck::kUnknown;
result->value_prepared = true;
result->is_valid = true;
return true;
} else {
result->is_valid = false;
return false;
}
}
void Prev() final {
PrevAndCheckValid(); // ignore return value
}
bool PrevAndCheckValid() final {
TERARK_ASSERT_GE(m_idx, 0);
auto entry = AccessEntryVec(m_vec_pin, m_mempool);
if (++m_idx == entry.num) {
if (UNLIKELY(!(m_rev ? InvokeDfaIterNext() : InvokeDfaIterPrev()))) {
m_idx = -1;
return false; // fail
}
entry = GetEntryVec();
m_idx = 0;
}
AppendTag(entry.vec[m_idx].tag);
return true;
}
void Seek(const Slice& ikey, const char*) final {
return Seek(ikey);
}
void Seek(const Slice& ikey) final {
if (UNLIKELY(!m_iter)) {
if (m_tab->m_is_empty) return;
CreateDfaIter();
}
fstring user_key = ExtractUserKey(ikey);
uint64_t find_tag = DecodeFixed64(user_key.end());
auto& iter = *m_iter;
if (UNLIKELY(!(m_rev ? iter.seek_rev_lower_bound(user_key)
: iter.seek_lower_bound(user_key)))) {
m_idx = -1;
return; // fail
}
auto entry = GetEntryVec();
if (iter.word() == user_key) {
m_idx = (int)upper_bound_0(entry.vec, entry.num, find_tag) - 1;
if (m_idx >= 0) {
AppendTag(entry.vec[m_idx].tag);
return; // success
}
if (UNLIKELY(!(m_rev ? InvokeDfaIterPrev() : InvokeDfaIterNext()))) {
TERARK_ASSERT_LT(m_idx, 0);
return; // fail
}
entry = GetEntryVec();
}
assert((iter.word() > user_key) ^ m_rev);
AppendTag(entry.vec[m_idx = entry.num - 1].tag);
}
void SeekForPrev(const Slice& ikey, const char*) final {
return SeekForPrev(ikey);
}
void SeekForPrev(const Slice& ikey) final {
if (UNLIKELY(!m_iter)) {
if (m_tab->m_is_empty) return;
CreateDfaIter();
}
fstring user_key = ExtractUserKey(ikey);
uint64_t find_tag = DecodeFixed64(user_key.end());
auto& iter = *m_iter;
if (UNLIKELY(!(m_rev ? iter.seek_lower_bound(user_key)
: iter.seek_rev_lower_bound(user_key)))) {
m_idx = -1;
return; // fail
}
auto entry = GetEntryVec();
if (iter.word() == user_key) {
m_idx = (int)lower_bound_0(entry.vec, entry.num, find_tag);
if (m_idx != entry.num) {
AppendTag(entry.vec[m_idx].tag);
return; // success
}
if (UNLIKELY(!(m_rev ? InvokeDfaIterNext() : InvokeDfaIterPrev()))) {
m_idx = -1;
return; // fail
}
entry = GetEntryVec();
}
assert((iter.word() < user_key) ^ m_rev);
AppendTag(entry.vec[m_idx = 0].tag);
}
void SeekToFirst() final {
if (UNLIKELY(!m_iter)) {
if (m_tab->m_is_empty) return;
CreateDfaIter();
}
if (UNLIKELY(!(m_rev ? m_iter->seek_end() : m_iter->seek_begin()))) {
m_idx = -1;
return; // fail
}
auto entry = GetEntryVec();
AppendTag(entry.vec[m_idx = entry.num - 1].tag);
}
void SeekToLast() final {
if (UNLIKELY(!m_iter)) {
if (m_tab->m_is_empty) return;
CreateDfaIter();
}
if (UNLIKELY(!(m_rev ? m_iter->seek_begin() : m_iter->seek_end()))) {
m_idx = -1;
return; // fail
}
auto entry = GetEntryVec();
AppendTag(entry.vec[m_idx = 0].tag);
}
bool IsKeyPinned() const final { return false; }
};
void JS_CSPPMemTab_AddVersion(json& djs, bool html) {
auto& ver = djs["cspp-memtable"];
const char* git_ver = git_version_hash_info_cspp_memtable();
if (html) {
std::string topling_rocks = HtmlEscapeMin(strstr(git_ver, "commit ") + strlen("commit "));
auto headstr = [](const std::string& s, auto pos) {
return terark::fstring(s.data(), pos - s.begin());
};
auto tailstr = [](const std::string& s, auto pos) {
return terark::fstring(&*pos, s.end() - pos);
};
auto topling_rocks_sha_end = std::find_if(topling_rocks.begin(), topling_rocks.end(), &isspace);
terark::string_appender<> oss_rocks(valvec_reserve(), 512);
oss_rocks|"<pre>"
|"<a href='https://github.com/topling/cspp-memtable/commit/"
|headstr(topling_rocks, topling_rocks_sha_end)|"'>"
|headstr(topling_rocks, topling_rocks_sha_end)|"</a>"
|tailstr(topling_rocks, topling_rocks_sha_end)
|"</pre>";
ver = static_cast<std::string&&>(oss_rocks);
} else {
ver = git_ver;
}
}
ROCKSDB_ENUM_CLASS(HugePageEnum, uint8_t, kNone = 0, kMmap = 1, kTransparent = 2);
constexpr size_t huge_2m = 2 << 20;
struct CSPPMemTabFactory final : public MemTableRepFactory {
size_t m_mem_cap = 2LL << 30;
bool use_vm = true;
HugePageEnum use_hugepage = HugePageEnum::kNone;
bool vm_explicit_commit = false;
bool vm_background_commit = false; // true almost always makes slow
bool vm_coldize_on_flush = false;
bool read_by_writer_token = true;
bool token_use_idle = true;
bool accurate_memsize = false; // mainly for debug and unit test
bool sync_sst_file = true;
bool enableApproximateNumEntries = false; // may be pretty not accurate
ConvertKind convert_to_sst = ConvertKind::kDontConvert;
std::string chroot_dir; // default empty
size_t chunk_size = huge_2m;
size_t cumu_num = 0, cumu_iter_num = 0;
size_t live_num = 0, live_iter_num = 0;
size_t max_dup_len = 1;
size_t num_dup_user_keys = 0;
size_t num_dup_yields = 0;
uint64_t deactived_mem_sum = 0;
MemTabLinkListNode m_head;
mutable std::mutex m_mtx;
CSPPMemTabFactory(const json& js, const SidePluginRepo& r) {
m_head.m_next = m_head.m_prev = &m_head;
ROCKSDB_JSON_OPT_PROP(js, chroot_dir); // immutable
Update({}, js, r);
}
MemTableRep* CreateMemTableRep(const MemTableRep::KeyComparator& cmp,
Allocator* a, const SliceTransform* s,
Logger* logger) final {
return CreateMemTableRep("", MutableCFOptions(), cmp, a, s, logger, 0);
}
MemTableRep* CreateMemTableRep(const MemTableRep::KeyComparator& cmp,
Allocator* a, const SliceTransform* s,
Logger* logger, uint32_t cf_id) final {
return CreateMemTableRep("", MutableCFOptions(), cmp, a, s, logger, cf_id);
}
MemTableRep* CreateMemTableRep(const std::string& level0_dir,
const MutableCFOptions& mcfopt,
const MemTableRep::KeyComparator& cmp,
Allocator*, const SliceTransform*,
Logger* logger, uint32_t cf_id) final {
auto uc = cmp.icomparator()->user_comparator();
if (!uc->IsBytewise()) {
return nullptr;
}
// may be updated by webview
auto curr_chunk_size = this->chunk_size;
auto curr_use_hugepage = this->use_hugepage;
auto curr_convert_to_sst = this->convert_to_sst;
auto curr_num = as_atomic(cumu_num).fetch_add(1, std::memory_order_relaxed);
terark::string_appender<> conf(valvec_reserve(), 512);
conf|"?chunk_size="|curr_chunk_size;
if (ConvertKind::kFileMmap == curr_convert_to_sst) {
// File mmap does not support hugepage
conf|"&file_path="|chroot_dir|level0_dir;
conf^"/cspp-%06zd.memtab"^curr_num^"-"^cf_id;
} else {
conf|"&hugepage="|int(curr_use_hugepage);
if (HugePageEnum::kNone == curr_use_hugepage || huge_2m == curr_chunk_size) {
if (vm_explicit_commit)
conf|"&vm_explicit_commit=true"; // default is false
}
}
// config param mem_cap is required, DONT delete it!
// because write_buffer_size can be changed dynamically, if it is changed
// larger, and existing CSPPMemTab was created with
// mem_cap = old write_bufer_size * 2
// which is smaller than new write_bufer_size, that CSPPMemTab will be
// add data size with respect to new write_bufer_size, thus cause memory
// alloc in CSPP trie failed.
auto require = std::min({mcfopt.write_buffer_size * 2,
mcfopt.write_buffer_size + (1ul << 30),
size_t(16) << 30});
auto mem_cap = std::max(m_mem_cap, require);
auto tab = new CSPPMemTab(mem_cap, uc->IsReverseBytewise(), logger,
this, curr_num, curr_convert_to_sst, conf);
auto len = std::min(mcfopt.write_buffer_size, tab->m_trie.mem_capacity());
if (ConvertKind::kFileMmap == curr_convert_to_sst && len >= 4096 &&
vm_background_commit && IsRocksBackgroundThread()) {
// this is almost always slow, may be NUMA, if not populate write all
// memory, os will populate it as needed, thus the memory will almost
// always allocated on/near working CPUs, for NUMA, this is more friendly
#ifdef __linux__
if (g_linux_kernel_version >= KERNEL_VERSION(5,14,0)) {
auto populate_write = 23; // MADV_POPULATE_WRITE = 23
auto mem = tab->m_trie.get_mmap();
auto t0 = std::chrono::steady_clock::now();
if (madvise((void*)mem.p, len, populate_write) < 0) {
ROCKS_LOG_WARN(logger, "MADV_POPULATE_WRITE(%s, %zd) = %m",
tab->m_trie.mmap_fpath().c_str(), len);
}
auto t1 = std::chrono::steady_clock::now();
using namespace std::chrono;
ROCKS_LOG_DEBUG(logger, "MADV_POPULATE_WRITE(%s, %zd) = %.6f ms",
tab->m_trie.mmap_fpath().c_str(), len,
duration_cast<nanoseconds>(t1-t0).count()/1e6);
}
#endif
}
return tab;
}
const char *Name() const final { return "CSPPMemTabFactory"; }
bool IsInsertConcurrentlySupported() const final { return true; }
bool CanHandleDuplicatedKey() const final { return true; }
//-----------------------------------------------------------------
void Update(const json&, const json& js, const SidePluginRepo&) {
size_t mem_cap = m_mem_cap;
ROCKSDB_JSON_OPT_SIZE(js, mem_cap);
ROCKSDB_JSON_OPT_PROP(js, use_vm);
auto iter = js.find("use_hugepage");
if (js.end() != iter) {
auto& jhg = iter.value();
if (jhg.is_boolean()) {
use_hugepage = jhg.get<bool>() ? HugePageEnum::kMmap
: HugePageEnum::kNone;
} else if (jhg.is_string()) {
ROCKSDB_JSON_OPT_ENUM(js, use_hugepage);
} else {
THROW_InvalidArgument("use_hugepage must be bool or HugePageEnum");
}
}
ROCKSDB_JSON_OPT_PROP(js, vm_explicit_commit);
ROCKSDB_JSON_OPT_PROP(js, vm_background_commit);
ROCKSDB_JSON_OPT_PROP(js, vm_coldize_on_flush);
ROCKSDB_JSON_OPT_PROP(js, read_by_writer_token);
ROCKSDB_JSON_OPT_PROP(js, token_use_idle);
ROCKSDB_JSON_OPT_PROP(js, accurate_memsize);
ROCKSDB_JSON_OPT_ENUM(js, convert_to_sst);
ROCKSDB_JSON_OPT_PROP(js, sync_sst_file);
ROCKSDB_JSON_OPT_PROP(js, enableApproximateNumEntries);
iter = js.find("chunk_size");
if (js.end() != iter) {
ROCKSDB_JSON_OPT_SIZE(js, chunk_size);
ROCKSDB_VERIFY_F((chunk_size & (chunk_size-1)) == 0, "%zd(%#zX)",
chunk_size, chunk_size);
}
else {
#if defined(ROCKSDB_UNIT_TEST)
chunk_size = 1024;
#endif
}
{ // cspp global conf
if (js.contains("cspp_debug_level")) {
if (js["cspp_debug_level"].is_string()) {
InfoLogLevel cspp_debug_level = InfoLogLevel::ERROR_LEVEL;
ROCKSDB_JSON_OPT_ENUM(js, cspp_debug_level);
CSPP_SetDebugLevel(3 - cspp_debug_level);
} else {
long cspp_debug_level = 0; // ERROR_LEVEL
ROCKSDB_JSON_OPT_PROP(js, cspp_debug_level);
CSPP_SetDebugLevel(cspp_debug_level);
}
}
}
m_mem_cap = mem_cap;
}
std::string ToString(const json& d, const SidePluginRepo&) const {
return JsonToString(ToJson(d), d);
}
json ToJson(const json& d) const {
size_t mem_cap = m_mem_cap;
bool html = JsonSmartBool(d, "html");
json djs;
if (html) {
const auto document =
"<a href='https://github.com/topling/cspp-memtab/blob/main/README-en.md'>Document(English)</a>"
" | "
"<a href='https://github.com/topling/cspp-memtab/blob/main/README.md'>文档（中文）</a>"
;
ROCKSDB_JSON_SET_PROP(djs, document);
}
ROCKSDB_JSON_SET_SIZE(djs, mem_cap);
ROCKSDB_JSON_SET_SIZE(djs, chunk_size);
ROCKSDB_JSON_SET_PROP(djs, use_vm);
ROCKSDB_JSON_SET_ENUM(djs, use_hugepage);
ROCKSDB_JSON_SET_PROP(djs, vm_explicit_commit);
ROCKSDB_JSON_SET_PROP(djs, vm_background_commit);
ROCKSDB_JSON_SET_PROP(djs, vm_coldize_on_flush);
ROCKSDB_JSON_SET_PROP(djs, read_by_writer_token);
ROCKSDB_JSON_SET_PROP(djs, token_use_idle);
ROCKSDB_JSON_SET_PROP(djs, accurate_memsize);
ROCKSDB_JSON_SET_ENUM(djs, convert_to_sst);
ROCKSDB_JSON_SET_PROP(djs, sync_sst_file);
ROCKSDB_JSON_SET_PROP(djs, enableApproximateNumEntries);
ROCKSDB_JSON_SET_PROP(djs, chroot_dir);
{ // cspp global conf
long val = CSPP_GetDebugLevel();
if (val >= 0 && val <= 3) {
auto cspp_debug_level = InfoLogLevel(3 - val);
ROCKSDB_JSON_SET_ENUM(djs, cspp_debug_level);
} else {
auto cspp_debug_level = val;
ROCKSDB_JSON_SET_PROP(djs, cspp_debug_level);
}
}
ROCKSDB_JSON_SET_PROP(djs, max_dup_len);
ROCKSDB_JSON_SET_PROP(djs, num_dup_user_keys);
ROCKSDB_JSON_SET_PROP(djs, num_dup_yields);
ROCKSDB_JSON_SET_PROP(djs, cumu_iter_num);
ROCKSDB_JSON_SET_PROP(djs, live_iter_num);
size_t active_num = 0;
size_t active_used_mem = 0;
size_t live_used_mem = 0;
size_t token_qlen = 0;
size_t total_raw_iter = 0;
string_appender<> detail_qlen(valvec_reserve(), 128*live_num);
detail_qlen << "[ ";
m_mtx.lock();
for (auto node = m_head.m_next; node != &m_head; node = node->m_next) {
auto memtab = static_cast<CSPPMemTab*>(node);
live_used_mem += memtab->m_trie.mem_size_inline();
if (!memtab->m_has_marked_readonly && !memtab->m_is_sst)
active_num++,
active_used_mem += memtab->m_trie.mem_size_inline();
size_t idx = memtab->m_instance_idx;
size_t raw_iter = memtab->m_trie.live_iter_num();
size_t cur_qlen = memtab->m_trie.get_token_qlen();
token_qlen += cur_qlen;
total_raw_iter += raw_iter;
if (memtab->m_is_flushed)
if (html)
detail_qlen|"<strong>("|idx|","|cur_qlen|","|raw_iter|")</strong>, ";
else
detail_qlen|"**("|idx|","|cur_qlen|","|raw_iter|")**, ";
else if (memtab->m_trie.is_readonly()) // real readonly
detail_qlen|"("|idx|","|cur_qlen|","|raw_iter|"), ";
else if (memtab->m_has_marked_readonly)
if (html)
detail_qlen|"<span style='color:darkgreen'>("|idx|","|cur_qlen|","|raw_iter|")</span>, ";
else
detail_qlen|"-("|idx|","|cur_qlen|","|raw_iter|")-, ";
else if (!memtab->m_is_empty) // active
if (html)
detail_qlen|"<strong style='color:darkred'>("|idx|","|cur_qlen|","|raw_iter|")</strong>, ";
else
detail_qlen|"*("|idx|","|cur_qlen|","|raw_iter|")*, ";
else // prepared
if (html)
// counter intuitive: darkgray is lighter than gray, so use gray
detail_qlen|"<span style='color:gray'>("|idx|","|cur_qlen|","|raw_iter|")</span>, ";
else
detail_qlen|"+("|idx|","|cur_qlen|","|raw_iter|")+, ";
}
size_t deactived_num; // include history and living readonly memtab
if (LIKELY(m_head.m_prev != &m_head)) { // not empty
// m_head.m_prev is the most recent memtab in the list
// likely be same with cumu_num, when racing, may be not same
deactived_num = static_cast<CSPPMemTab*>(m_head.m_prev)->m_instance_idx + 1;
} else { // very very unlikely goes here
deactived_num = cumu_num; // not accurate on racing
}
m_mtx.unlock();
deactived_num -= active_num; // more accurate than deactived_mem_sum
auto deactived_mem_sum = this->deactived_mem_sum; // not accurate on racing
auto deactived_mem_avg = deactived_num ? deactived_mem_sum / deactived_num : 0;
ROCKSDB_JSON_SET_PROP(djs, deactived_num); // more accurate
ROCKSDB_JSON_SET_SIZE(djs, deactived_mem_sum); // less accurate
ROCKSDB_JSON_SET_SIZE(djs, deactived_mem_avg); // less accurate
if (detail_qlen.size() >= 4) {
detail_qlen.end()[-2] = ' ';
detail_qlen.end()[-1] = ']';
} else {
detail_qlen << " ]";
}
ROCKSDB_JSON_SET_SIZE(djs, active_used_mem);
ROCKSDB_JSON_SET_SIZE(djs, live_used_mem);
ROCKSDB_JSON_SET_PROP(djs, live_num);
ROCKSDB_JSON_SET_PROP(djs, token_qlen);
ROCKSDB_JSON_SET_PROP(djs, total_raw_iter);
djs["comment"] = "(idx, qlen, raw_iter_num) | "
"<strong>flushed</strong> | "
"real readonly | "
"<span style='color:darkgreen'>marked readonly</span> | "
"<strong style='color:darkred'>active</strong> | "
// counter intuitive: darkgray is lighter than gray, so use gray
"<span style='color:gray'>prepared</span>"
;
ROCKSDB_JSON_SET_PROP(djs, detail_qlen);
JS_CSPPMemTab_AddVersion(djs, html);
return djs;
}
};
void CSPPMemTab::OnDupUserKeyYield() {
as_atomic(m_fac->num_dup_yields).fetch_add(1, std::memory_order_relaxed);
}
MemTableRep::Iterator* CSPPMemTab::GetIterator(Arena* a) {
#if 0
if (m_is_sst) {
m_is_sst = true;
} else {
m_is_sst = false;
}
#endif
as_atomic(m_fac->cumu_iter_num).fetch_add(1, std::memory_order_relaxed);
as_atomic(m_fac->live_iter_num).fetch_add(1, std::memory_order_relaxed);
as_atomic(m_cumu_iter_num).fetch_add(1, std::memory_order_relaxed);
as_atomic(m_live_iter_num).fetch_add(1, std::memory_order_relaxed);
return a ? new(a->AllocateAligned(sizeof(Iter))) Iter(this) : new Iter(this);
}
CSPPMemTab::Iter::Iter(CSPPMemTab* tab) {
m_tab = tab;
m_rev = tab->m_rev;
m_iter = nullptr;
m_mempool = (const char*)tab->m_trie.mem_get(0);
}
CSPPMemTab::Iter::~Iter() noexcept {
if (m_iter) {
m_iter->dispose();
}
auto factory = m_tab->m_fac;
as_atomic(factory->live_iter_num).fetch_sub(1, std::memory_order_relaxed);
as_atomic(m_tab->m_live_iter_num).fetch_sub(1, std::memory_order_relaxed);
}
CSPPMemTab::CSPPMemTab(intptr_t cap, bool rev, Logger* log, CSPPMemTabFactory* f,
size_t instance_idx, ConvertKind convert_to_sst, fstring fpath_or_conf)
: MemTableRep(nullptr)
, m_trie(4, f->use_vm ? -cap : cap, Patricia::MultiWriteMultiRead,
fpath_or_conf) {
init(rev, log, f);
m_is_sst = false;
m_instance_idx = instance_idx;
m_convert_to_sst = convert_to_sst;
}
/// For SST
CSPPMemTab::CSPPMemTab(bool rev, Logger* log, CSPPMemTabFactory* f,
size_t instance_idx)
: MemTableRep(nullptr) {
init(rev, log, f);
m_is_empty = false;
m_is_sst = true;
m_instance_idx = instance_idx;
m_convert_to_sst = ConvertKind::kDontConvert;
}
inline void CSPPMemTab::init(bool rev, Logger* log, CSPPMemTabFactory* f) {
m_fac = f;