-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree.cpp
674 lines (603 loc) · 26 KB
/
Tree.cpp
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
#include <assert.h>
#include <algorithm>
#include "Tree.h"
#include "N.cpp"
#include "Epoche.cpp"
#include "Key.h"
namespace ART_OLC {
#ifdef NUMA_NODE
Tree::Tree(LoadKeyFunction loadKey) : root(new( nullptr, 0)N256(nullptr, 0)), loadKey(loadKey) {
}
#else
Tree::Tree(LoadKeyFunction loadKey) : root(new N256(nullptr, 0)), loadKey(loadKey) {
}
#endif
Tree::~Tree() {
N::deleteChildren(root);
N::deleteNode(root);
}
ThreadInfo Tree::getThreadInfo() {
return ThreadInfo(this->epoche);
}
void yield(int count) {
if (count>3)
sched_yield();
else
_mm_pause();
}
TID Tree::lookup(const Key &k, ThreadInfo &threadEpocheInfo) const {
EpocheGuardReadonly epocheGuard(threadEpocheInfo);
int restartCount = 0;
restart:
if (restartCount++)
yield(restartCount);
bool needRestart = false;
N *node;
N *parentNode = nullptr;
uint64_t v;
uint32_t level = 0;
bool optimisticPrefixMatch = false;
node = root;
v = node->readLockOrRestart(needRestart);
if (needRestart) goto restart;
while (true) {
switch (checkPrefix(node, k, level)) { // increases level
case CheckPrefixResult::NoMatch:
node->readUnlockOrRestart(v, needRestart);
if (needRestart) goto restart;
return 0;
case CheckPrefixResult::OptimisticMatch:
optimisticPrefixMatch = true;
// fallthrough
case CheckPrefixResult::Match:
if (k.getKeyLen() <= level) {
return 0;
}
parentNode = node;
node = N::getChild(k[level], parentNode);
parentNode->checkOrRestart(v,needRestart);
if (needRestart) goto restart;
if (node == nullptr) {
return 0;
}
if (N::isLeaf(node)) {
parentNode->readUnlockOrRestart(v, needRestart);
if (needRestart) goto restart;
TID tid = N::getLeaf(node);
if (level < k.getKeyLen() - 1 || optimisticPrefixMatch) {
return checkKey(tid, k);
}
return tid;
}
level++;
}
uint64_t nv = node->readLockOrRestart(needRestart);
if (needRestart) goto restart;
parentNode->readUnlockOrRestart(v, needRestart);
if (needRestart) goto restart;
v = nv;
}
}
bool Tree::lookupRange(const Key &start, const Key &end, Key &continueKey, TID result[],
std::size_t resultSize, std::size_t &resultsFound, ThreadInfo &threadEpocheInfo) const {
for (uint32_t i = 0; i < std::min(start.getKeyLen(), end.getKeyLen()); ++i) {
if (start[i] > end[i]) {
resultsFound = 0;
return false;
} else if (start[i] < end[i]) {
break;
}
}
EpocheGuard epocheGuard(threadEpocheInfo);
TID toContinue = 0;
std::function<void(const N *)> copy = [&result, &resultSize, &resultsFound, &toContinue, ©](const N *node) {
if (N::isLeaf(node)) {
if (resultsFound == resultSize) {
toContinue = N::getLeaf(node);
return;
}
result[resultsFound] = N::getLeaf(node);
resultsFound++;
} else {
std::tuple<uint8_t, N *> children[256];
uint32_t childrenCount = 0;
N::getChildren(node, 0u, 255u, children, childrenCount);
for (uint32_t i = 0; i < childrenCount; ++i) {
const N *n = std::get<1>(children[i]);
copy(n);
if (toContinue != 0) {
break;
}
}
}
};
std::function<void(N *, uint8_t, uint32_t, const N *, uint64_t)> findStart = [©, &start, &findStart, &toContinue, this](
N *node, uint8_t nodeK, uint32_t level, const N *parentNode, uint64_t vp) {
if (N::isLeaf(node)) {
copy(node);
return;
}
uint64_t v;
PCCompareResults prefixResult;
{
readAgain:
bool needRestart = false;
v = node->readLockOrRestart(needRestart);
if (needRestart) goto readAgain;
prefixResult = checkPrefixCompare(node, start, 0, level, loadKey, needRestart);
if (needRestart) goto readAgain;
parentNode->readUnlockOrRestart(vp, needRestart);
if (needRestart) {
readParentAgain:
needRestart = false;
vp = parentNode->readLockOrRestart(needRestart);
if (needRestart) goto readParentAgain;
node = N::getChild(nodeK, parentNode);
parentNode->readUnlockOrRestart(vp, needRestart);
if (needRestart) goto readParentAgain;
if (node == nullptr) {
return;
}
if (N::isLeaf(node)) {
copy(node);
return;
}
goto readAgain;
}
node->readUnlockOrRestart(v, needRestart);
if (needRestart) goto readAgain;
}
switch (prefixResult) {
case PCCompareResults::Bigger:
copy(node);
break;
case PCCompareResults::Equal: {
uint8_t startLevel = (start.getKeyLen() > level) ? start[level] : 0;
std::tuple<uint8_t, N *> children[256];
uint32_t childrenCount = 0;
v = N::getChildren(node, startLevel, 255, children, childrenCount);
for (uint32_t i = 0; i < childrenCount; ++i) {
const uint8_t k = std::get<0>(children[i]);
N *n = std::get<1>(children[i]);
if (k == startLevel) {
findStart(n, k, level + 1, node, v);
} else if (k > startLevel) {
copy(n);
}
if (toContinue != 0) {
break;
}
}
break;
}
case PCCompareResults::Smaller:
break;
}
};
std::function<void(N *, uint8_t, uint32_t, const N *, uint64_t)> findEnd = [©, &end, &toContinue, &findEnd, this](
N *node, uint8_t nodeK, uint32_t level, const N *parentNode, uint64_t vp) {
if (N::isLeaf(node)) {
return;
}
uint64_t v;
PCCompareResults prefixResult;
{
readAgain:
bool needRestart = false;
v = node->readLockOrRestart(needRestart);
if (needRestart) goto readAgain;
prefixResult = checkPrefixCompare(node, end, 255, level, loadKey, needRestart);
if (needRestart) goto readAgain;
parentNode->readUnlockOrRestart(vp, needRestart);
if (needRestart) {
readParentAgain:
vp = parentNode->readLockOrRestart(needRestart);
if (needRestart) goto readParentAgain;
node = N::getChild(nodeK, parentNode);
parentNode->readUnlockOrRestart(vp, needRestart);
if (needRestart) goto readParentAgain;
if (node == nullptr) {
return;
}
if (N::isLeaf(node)) {
return;
}
goto readAgain;
}
node->readUnlockOrRestart(v, needRestart);
if (needRestart) goto readAgain;
}
switch (prefixResult) {
case PCCompareResults::Smaller:
copy(node);
break;
case PCCompareResults::Equal: {
uint8_t endLevel = (end.getKeyLen() > level) ? end[level] : 255;
std::tuple<uint8_t, N *> children[256];
uint32_t childrenCount = 0;
v = N::getChildren(node, 0, endLevel, children, childrenCount);
for (uint32_t i = 0; i < childrenCount; ++i) {
const uint8_t k = std::get<0>(children[i]);
N *n = std::get<1>(children[i]);
if (k == endLevel) {
findEnd(n, k, level + 1, node, v);
} else if (k < endLevel) {
copy(n);
}
if (toContinue != 0) {
break;
}
}
break;
}
case PCCompareResults::Bigger:
break;
}
};
int restartCount = 0;
restart:
if (restartCount++)
yield(restartCount);
bool needRestart = false;
resultsFound = 0;
uint32_t level = 0;
N *node = nullptr;
N *nextNode = root;
N *parentNode;
uint64_t v = 0;
uint64_t vp;
while (true) {
parentNode = node;
vp = v;
node = nextNode;
PCEqualsResults prefixResult;
v = node->readLockOrRestart(needRestart);
if (needRestart) goto restart;
prefixResult = checkPrefixEquals(node, level, start, end, loadKey, needRestart);
if (needRestart) goto restart;
if (parentNode != nullptr) {
parentNode->readUnlockOrRestart(vp, needRestart);
if (needRestart) goto restart;
}
node->readUnlockOrRestart(v, needRestart);
if (needRestart) goto restart;
switch (prefixResult) {
case PCEqualsResults::NoMatch: {
return false;
}
case PCEqualsResults::Contained: {
copy(node);
break;
}
case PCEqualsResults::BothMatch: {
uint8_t startLevel = (start.getKeyLen() > level) ? start[level] : 0;
uint8_t endLevel = (end.getKeyLen() > level) ? end[level] : 255;
if (startLevel != endLevel) {
std::tuple<uint8_t, N *> children[256];
uint32_t childrenCount = 0;
v = N::getChildren(node, startLevel, endLevel, children, childrenCount);
for (uint32_t i = 0; i < childrenCount; ++i) {
const uint8_t k = std::get<0>(children[i]);
N *n = std::get<1>(children[i]);
if (k == startLevel) {
findStart(n, k, level + 1, node, v);
} else if (k > startLevel && k < endLevel) {
copy(n);
} else if (k == endLevel) {
findEnd(n, k, level + 1, node, v);
}
if (toContinue) {
break;
}
}
} else {
nextNode = N::getChild(startLevel, node);
node->readUnlockOrRestart(v, needRestart);
if (needRestart) goto restart;
level++;
continue;
}
break;
}
}
break;
}
if (toContinue != 0) {
loadKey(toContinue, continueKey);
return true;
} else {
return false;
}
}
TID Tree::checkKey(const TID tid, const Key &k) const {
Key kt;
this->loadKey(tid, kt);
if (k == kt) {
return tid;
}
return 0;
}
void Tree::insert(const Key &k, TID tid, ThreadInfo &epocheInfo) {
EpocheGuard epocheGuard(epocheInfo);
int restartCount = 0;
restart:
if (restartCount++)
yield(restartCount);
bool needRestart = false;
N *node = nullptr;
N *nextNode = root;
N *parentNode = nullptr;
uint8_t parentKey, nodeKey = 0;
uint64_t parentVersion = 0;
uint32_t level = 0;
while (true) {
parentNode = node;
parentKey = nodeKey;
node = nextNode;
auto v = node->readLockOrRestart(needRestart);
if (needRestart) goto restart;
uint32_t nextLevel = level;
uint8_t nonMatchingKey;
Prefix remainingPrefix;
auto res = checkPrefixPessimistic(node, k, nextLevel, nonMatchingKey, remainingPrefix,
this->loadKey, needRestart); // increases level
if (needRestart) goto restart;
switch (res) {
case CheckPrefixPessimisticResult::NoMatch: {
parentNode->upgradeToWriteLockOrRestart(parentVersion, needRestart);
if (needRestart) goto restart;
node->upgradeToWriteLockOrRestart(v, needRestart);
if (needRestart) {
parentNode->writeUnlock();
goto restart;
}
// 1) Create new node which will be parent of node, Set common prefix, level to this node
#ifdef NUMA_NODE
auto newNode = new(node->getPrefix(), nextLevel - level) N4(node->getPrefix(), nextLevel - level);
#else
auto newNode = new N4(node->getPrefix(), nextLevel - level);
#endif
// 2) add node and (tid, *k) as children
newNode->insert(k[nextLevel], N::setLeaf(tid));
newNode->insert(nonMatchingKey, node);
// 3) upgradeToWriteLockOrRestart, update parentNode to point to the new node, unlock
N::change(parentNode, parentKey, newNode);
parentNode->writeUnlock();
// 4) update prefix of node, unlock
node->setPrefix(remainingPrefix,
node->getPrefixLength() - ((nextLevel - level) + 1));
node->writeUnlock();
return;
}
case CheckPrefixPessimisticResult::Match:
break;
}
level = nextLevel;
nodeKey = k[level];
nextNode = N::getChild(nodeKey, node);
node->checkOrRestart(v,needRestart);
if (needRestart) goto restart;
if (nextNode == nullptr) {
N::insertAndUnlock(node, v, parentNode, parentVersion, parentKey, nodeKey, N::setLeaf(tid), needRestart, epocheInfo);
if (needRestart) goto restart;
return;
}
if (parentNode != nullptr) {
parentNode->readUnlockOrRestart(parentVersion, needRestart);
if (needRestart) goto restart;
}
if (N::isLeaf(nextNode)) {
node->upgradeToWriteLockOrRestart(v, needRestart);
if (needRestart) goto restart;
Key key;
loadKey(N::getLeaf(nextNode), key);
if (key == k) {
// upsert
N::change(node, k[level], N::setLeaf(tid));
node->writeUnlock();
return;
}
level++;
uint32_t prefixLength = 0;
while (key[level + prefixLength] == k[level + prefixLength]) {
prefixLength++;
}
#ifdef NUMA_NODE
auto n4 = new(&k[level], prefixLength) N4(&k[level], prefixLength);
#else
auto n4 = new N4(&k[level], prefixLength);
#endif
n4->insert(k[level + prefixLength], N::setLeaf(tid));
n4->insert(key[level + prefixLength], nextNode);
N::change(node, k[level - 1], n4);
node->writeUnlock();
return;
}
level++;
parentVersion = v;
}
}
void Tree::remove(const Key &k, TID tid, ThreadInfo &threadInfo) {
EpocheGuard epocheGuard(threadInfo);
int restartCount = 0;
restart:
if (restartCount++)
yield(restartCount);
bool needRestart = false;
N *node = nullptr;
N *nextNode = root;
N *parentNode = nullptr;
uint8_t parentKey, nodeKey = 0;
uint64_t parentVersion = 0;
uint32_t level = 0;
while (true) {
parentNode = node;
parentKey = nodeKey;
node = nextNode;
auto v = node->readLockOrRestart(needRestart);
if (needRestart) goto restart;
switch (checkPrefix(node, k, level)) { // increases level
case CheckPrefixResult::NoMatch:
node->readUnlockOrRestart(v, needRestart);
if (needRestart) goto restart;
return;
case CheckPrefixResult::OptimisticMatch:
// fallthrough
case CheckPrefixResult::Match: {
nodeKey = k[level];
nextNode = N::getChild(nodeKey, node);
node->checkOrRestart(v, needRestart);
if (needRestart) goto restart;
if (nextNode == nullptr) {
node->readUnlockOrRestart(v, needRestart);
if (needRestart) goto restart;
return;
}
if (N::isLeaf(nextNode)) {
if (N::getLeaf(nextNode) != tid) {
return;
}
assert(parentNode == nullptr || node->getCount() != 1);
if (node->getCount() == 2 && parentNode != nullptr) {
parentNode->upgradeToWriteLockOrRestart(parentVersion, needRestart);
if (needRestart) goto restart;
node->upgradeToWriteLockOrRestart(v, needRestart);
if (needRestart) {
parentNode->writeUnlock();
goto restart;
}
// 1. check remaining entries
N *secondNodeN;
uint8_t secondNodeK;
std::tie(secondNodeN, secondNodeK) = N::getSecondChild(node, nodeKey);
if (N::isLeaf(secondNodeN)) {
//N::remove(node, k[level]); not necessary
N::change(parentNode, parentKey, secondNodeN);
parentNode->writeUnlock();
node->writeUnlockObsolete();
this->epoche.markNodeForDeletion(node, threadInfo);
} else {
secondNodeN->writeLockOrRestart(needRestart);
if (needRestart) {
node->writeUnlock();
parentNode->writeUnlock();
goto restart;
}
//N::remove(node, k[level]); not necessary
N::change(parentNode, parentKey, secondNodeN);
parentNode->writeUnlock();
secondNodeN->addPrefixBefore(node, secondNodeK);
secondNodeN->writeUnlock();
node->writeUnlockObsolete();
this->epoche.markNodeForDeletion(node, threadInfo);
}
} else {
N::removeAndUnlock(node, v, k[level], parentNode, parentVersion, parentKey, needRestart, threadInfo);
if (needRestart) goto restart;
}
return;
}
level++;
parentVersion = v;
}
}
}
}
inline typename Tree::CheckPrefixResult Tree::checkPrefix(N *n, const Key &k, uint32_t &level) {
if (n->hasPrefix()) {
if (k.getKeyLen() <= level + n->getPrefixLength()) {
return CheckPrefixResult::NoMatch;
}
for (uint32_t i = 0; i < std::min(n->getPrefixLength(), maxStoredPrefixLength); ++i) {
if (n->getPrefix()[i] != k[level]) {
return CheckPrefixResult::NoMatch;
}
++level;
}
if (n->getPrefixLength() > maxStoredPrefixLength) {
level = level + (n->getPrefixLength() - maxStoredPrefixLength);
return CheckPrefixResult::OptimisticMatch;
}
}
return CheckPrefixResult::Match;
}
typename Tree::CheckPrefixPessimisticResult Tree::checkPrefixPessimistic(N *n, const Key &k, uint32_t &level,
uint8_t &nonMatchingKey,
Prefix &nonMatchingPrefix,
LoadKeyFunction loadKey, bool &needRestart) {
if (n->hasPrefix()) {
uint32_t prevLevel = level;
Key kt;
for (uint32_t i = 0; i < n->getPrefixLength(); ++i) {
if (i == maxStoredPrefixLength) {
auto anyTID = N::getAnyChildTid(n, needRestart);
if (needRestart) return CheckPrefixPessimisticResult::Match;
loadKey(anyTID, kt);
}
uint8_t curKey = i >= maxStoredPrefixLength ? kt[level] : n->getPrefix()[i];
if (curKey != k[level]) {
nonMatchingKey = curKey;
if (n->getPrefixLength() > maxStoredPrefixLength) {
if (i < maxStoredPrefixLength) {
auto anyTID = N::getAnyChildTid(n, needRestart);
if (needRestart) return CheckPrefixPessimisticResult::Match;
loadKey(anyTID, kt);
}
memcpy(nonMatchingPrefix, &kt[0] + level + 1, std::min((n->getPrefixLength() - (level - prevLevel) - 1),
maxStoredPrefixLength));
} else {
memcpy(nonMatchingPrefix, n->getPrefix() + i + 1, n->getPrefixLength() - i - 1);
}
return CheckPrefixPessimisticResult::NoMatch;
}
++level;
}
}
return CheckPrefixPessimisticResult::Match;
}
typename Tree::PCCompareResults Tree::checkPrefixCompare(const N *n, const Key &k, uint8_t fillKey, uint32_t &level,
LoadKeyFunction loadKey, bool &needRestart) {
if (n->hasPrefix()) {
Key kt;
for (uint32_t i = 0; i < n->getPrefixLength(); ++i) {
if (i == maxStoredPrefixLength) {
auto anyTID = N::getAnyChildTid(n, needRestart);
if (needRestart) return PCCompareResults::Equal;
loadKey(anyTID, kt);
}
uint8_t kLevel = (k.getKeyLen() > level) ? k[level] : fillKey;
uint8_t curKey = i >= maxStoredPrefixLength ? kt[level] : n->getPrefix()[i];
if (curKey < kLevel) {
return PCCompareResults::Smaller;
} else if (curKey > kLevel) {
return PCCompareResults::Bigger;
}
++level;
}
}
return PCCompareResults::Equal;
}
typename Tree::PCEqualsResults Tree::checkPrefixEquals(const N *n, uint32_t &level, const Key &start, const Key &end,
LoadKeyFunction loadKey, bool &needRestart) {
if (n->hasPrefix()) {
Key kt;
for (uint32_t i = 0; i < n->getPrefixLength(); ++i) {
if (i == maxStoredPrefixLength) {
auto anyTID = N::getAnyChildTid(n, needRestart);
if (needRestart) return PCEqualsResults::BothMatch;
loadKey(anyTID, kt);
}
uint8_t startLevel = (start.getKeyLen() > level) ? start[level] : 0;
uint8_t endLevel = (end.getKeyLen() > level) ? end[level] : 255;
uint8_t curKey = i >= maxStoredPrefixLength ? kt[level] : n->getPrefix()[i];
if (curKey > startLevel && curKey < endLevel) {
return PCEqualsResults::Contained;
} else if (curKey < startLevel || curKey > endLevel) {
return PCEqualsResults::NoMatch;
}
++level;
}
}
return PCEqualsResults::BothMatch;
}
}