-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathkttimeddb.h
2839 lines (2829 loc) · 98.4 KB
/
kttimeddb.h
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
/*************************************************************************************************
* Timed database
* Copyright (C) 2009-2012 FAL Labs
* This file is part of Kyoto Tycoon.
* This program is free software: you can redistribute it and/or modify it under the terms of
* the GNU General Public License as published by the Free Software Foundation, either version
* 3 of the License, or any later version.
* 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 GNU General Public License for more details.
* You should have received a copy of the GNU General Public License along with this program.
* If not, see <http://www.gnu.org/licenses/>.
*************************************************************************************************/
#ifndef _KTTIMEDDB_H // duplication check
#define _KTTIMEDDB_H
#include <ktcommon.h>
#include <ktutil.h>
#include <ktulog.h>
#include <ktshlib.h>
namespace kyototycoon { // common namespace
/**
* Timed database.
* @note This class is a concrete class of a wrapper for the polymorphic database to add
* expiration features. This class can be inherited but overwriting methods is forbidden.
* Before every database operation, it is necessary to call the TimedDB::open method in order to
* open a database file and connect the database object to it. To avoid data missing or
* corruption, it is important to close every database file by the TimedDB::close method when
* the database is no longer in use. It is forbidden for multible database objects in a process
* to open the same database at the same time.
*/
class TimedDB {
public:
class Cursor;
class Visitor;
class UpdateTrigger;
/** The width of expiration time. */
static const int32_t XTWIDTH = 5;
/** The maximum number of expiration time. */
static const int64_t XTMAX = (1LL << (XTWIDTH * 8)) - 1;
private:
class TimedVisitor;
class TimedMetaTrigger;
struct MergeLine;
/* The magic data of the database type. */
static const uint8_t MAGICDATA = 0xbb;
/* The score unit of expiratoin. */
static const int64_t XTSCUNIT = 256;
/* The inverse frequency of reading expiration. */
static const int64_t XTREADFREQ = 8;
/* The inverse frequency of iterating expiration. */
static const int64_t XTITERFREQ = 4;
/* The unit step number of expiration. */
static const int64_t XTUNIT = 8;
/* The size of the logging buffer. */
static const size_t LOGBUFSIZ = 1024;
public:
/**
* Cursor to indicate a record.
*/
class Cursor {
friend class TimedDB;
public:
/**
* Constructor.
* @param db the container database object.
*/
explicit Cursor(TimedDB* db) : db_(db), cur_(NULL), back_(false) {
_assert_(db);
cur_ = db_->db_.cursor();
}
/**
* Destructor.
*/
virtual ~Cursor() {
_assert_(true);
delete cur_;
}
/**
* Jump the cursor to the first record for forward scan.
* @return true on success, or false on failure.
*/
bool jump() {
_assert_(true);
if (!cur_->jump()) return false;
back_ = false;
return true;
}
/**
* Jump the cursor to a record for forward scan.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return true on success, or false on failure.
*/
bool jump(const char* kbuf, size_t ksiz) {
_assert_(kbuf && ksiz <= kc::MEMMAXSIZ);
if (!cur_->jump(kbuf, ksiz)) return false;
back_ = false;
return true;
}
/**
* Jump the cursor to a record for forward scan.
* @note Equal to the original Cursor::jump method except that the parameter is std::string.
*/
bool jump(const std::string& key) {
_assert_(true);
return jump(key.c_str(), key.size());
}
/**
* Jump the cursor to the last record for backward scan.
* @return true on success, or false on failure.
* @note This method is dedicated to tree databases. Some database types, especially hash
* databases, may provide a dummy implementation.
*/
bool jump_back() {
_assert_(true);
if (!cur_->jump_back()) return false;
back_ = true;
return true;
}
/**
* Jump the cursor to a record for backward scan.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @return true on success, or false on failure.
* @note This method is dedicated to tree databases. Some database types, especially hash
* databases, will provide a dummy implementation.
*/
bool jump_back(const char* kbuf, size_t ksiz) {
_assert_(kbuf && ksiz <= kc::MEMMAXSIZ);
if (!cur_->jump_back(kbuf, ksiz)) return false;
back_ = true;
return true;
}
/**
* Jump the cursor to a record for backward scan.
* @note Equal to the original Cursor::jump_back method except that the parameter is
* std::string.
*/
bool jump_back(const std::string& key) {
_assert_(true);
return jump_back(key.c_str(), key.size());
}
/**
* Step the cursor to the next record.
* @return true on success, or false on failure.
*/
bool step() {
_assert_(true);
if (!cur_->step()) return false;
back_ = false;
return true;
}
/**
* Step the cursor to the previous record.
* @return true on success, or false on failure.
* @note This method is dedicated to tree databases. Some database types, especially hash
* databases, may provide a dummy implementation.
*/
bool step_back() {
_assert_(true);
if (!cur_->step_back()) return false;
back_ = true;
return true;
}
/**
* Accept a visitor to the current record.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @param step true to move the cursor to the next record, or false for no move.
* @return true on success, or false on failure.
* @note the operation for each record is performed atomically and other threads accessing
* the same record are blocked.
*/
bool accept(Visitor* visitor, bool writable = true, bool step = false) {
_assert_(visitor);
bool err = false;
int64_t ct = std::time(NULL);
while (true) {
TimedVisitor myvisitor(db_, visitor, ct, true);
if (!cur_->accept(&myvisitor, writable, step)) {
err = true;
break;
}
if (myvisitor.again()) {
if (!step && !(back_ ? cur_->step_back() : cur_->step())) {
err = true;
break;
}
continue;
}
break;
}
if (db_->xcur_) {
int64_t xtsc = writable ? XTSCUNIT : XTSCUNIT / XTREADFREQ;
if (!db_->expire_records(xtsc)) err = true;
}
return !err;
}
/**
* Set the value of the current record.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @param xt the expiration time from now in seconds. If it is negative, the absolute value
* is treated as the epoch time.
* @param step true to move the cursor to the next record, or false for no move.
* @return true on success, or false on failure.
*/
bool set_value(const char* vbuf, size_t vsiz, int64_t xt = kc::INT64MAX, bool step = false) {
_assert_(vbuf && vsiz <= kc::MEMMAXSIZ);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(const char* vbuf, size_t vsiz, int64_t xt) :
vbuf_(vbuf), vsiz_(vsiz), xt_(xt), ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
ok_ = true;
*sp = vsiz_;
*xtp = xt_;
return vbuf_;
}
const char* vbuf_;
size_t vsiz_;
int64_t xt_;
bool ok_;
};
VisitorImpl visitor(vbuf, vsiz, xt);
if (!accept(&visitor, true, step)) return false;
if (!visitor.ok()) return false;
return true;
}
/**
* Set the value of the current record.
* @note Equal to the original Cursor::set_value method except that the parameter is
* std::string.
*/
bool set_value_str(const std::string& value, int64_t xt = kc::INT64MAX, bool step = false) {
_assert_(true);
return set_value(value.c_str(), value.size(), xt, step);
}
/**
* Remove the current record.
* @return true on success, or false on failure.
* @note If no record corresponds to the key, false is returned. The cursor is moved to the
* next record implicitly.
*/
bool remove() {
_assert_(true);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : ok_(false) {}
bool ok() const {
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
ok_ = true;
return REMOVE;
}
bool ok_;
};
VisitorImpl visitor;
if (!accept(&visitor, true, false)) return false;
if (!visitor.ok()) return false;
return true;
}
/**
* Get the key of the current record.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the key region of the current record, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
char* get_key(size_t* sp, bool step = false) {
_assert_(sp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : kbuf_(NULL), ksiz_(0) {}
char* pop(size_t* sp) {
*sp = ksiz_;
return kbuf_;
}
void clear() {
delete[] kbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
kbuf_ = new char[ksiz+1];
std::memcpy(kbuf_, kbuf, ksiz);
kbuf_[ksiz] = '\0';
ksiz_ = ksiz;
return NOP;
}
char* kbuf_;
size_t ksiz_;
};
VisitorImpl visitor;
if (!accept(&visitor, false, step)) {
visitor.clear();
*sp = 0;
return NULL;
}
size_t ksiz;
char* kbuf = visitor.pop(&ksiz);
if (!kbuf) {
*sp = 0;
return NULL;
}
*sp = ksiz;
return kbuf;
}
/**
* Get the key of the current record.
* @note Equal to the original Cursor::get_key method except that a parameter is a string to
* contain the result and the return value is bool for success.
*/
bool get_key(std::string* key, bool step = false) {
_assert_(key);
size_t ksiz;
char* kbuf = get_key(&ksiz, step);
if (!kbuf) return false;
key->clear();
key->append(kbuf, ksiz);
delete[] kbuf;
return true;
}
/**
* Get the value of the current record.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the value region of the current record, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero
* code is appended at the end of the region of the return value, the return value can be
* treated as a C-style string. Because the region of the return value is allocated with the
* the new[] operator, it should be released with the delete[] operator when it is no longer
* in use.
*/
char* get_value(size_t* sp, bool step = false) {
_assert_(sp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : vbuf_(NULL), vsiz_(0) {}
char* pop(size_t* sp) {
*sp = vsiz_;
return vbuf_;
}
void clear() {
delete[] vbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
vbuf_ = new char[vsiz+1];
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
return NOP;
}
char* vbuf_;
size_t vsiz_;
};
VisitorImpl visitor;
if (!accept(&visitor, false, step)) {
visitor.clear();
*sp = 0;
return NULL;
}
size_t vsiz;
char* vbuf = visitor.pop(&vsiz);
if (!vbuf) {
*sp = 0;
return NULL;
}
*sp = vsiz;
return vbuf;
}
/**
* Get the value of the current record.
* @note Equal to the original Cursor::get_value method except that a parameter is a string
* to contain the result and the return value is bool for success.
*/
bool get_value(std::string* value, bool step = false) {
_assert_(value);
size_t vsiz;
char* vbuf = get_value(&vsiz, step);
if (!vbuf) return false;
value->clear();
value->append(vbuf, vsiz);
delete[] vbuf;
return true;
}
/**
* Get a pair of the key and the value of the current record.
* @param ksp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param vbp the pointer to the variable into which the pointer to the value region is
* assigned.
* @param vsp the pointer to the variable into which the size of the value region is
* assigned.
* @param xtp the pointer to the variable into which the absolute expiration time is
* assigned. If it is NULL, it is ignored.
* @param step true to move the cursor to the next record, or false for no move.
* @return the pointer to the pair of the key region, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero code is
* appended at the end of each region of the key and the value, each region can be treated
* as a C-style string. The return value should be deleted explicitly by the caller with
* the detele[] operator.
*/
char* get(size_t* ksp, const char** vbp, size_t* vsp, int64_t* xtp = NULL,
bool step = false) {
_assert_(ksp && vbp && vsp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : kbuf_(NULL), ksiz_(0), vbuf_(NULL), vsiz_(0), xt_(0) {}
char* pop(size_t* ksp, const char** vbp, size_t* vsp, int64_t* xtp) {
*ksp = ksiz_;
*vbp = vbuf_;
*vsp = vsiz_;
if (xtp) *xtp = xt_;
return kbuf_;
}
void clear() {
delete[] kbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
size_t rsiz = ksiz + 1 + vsiz + 1;
kbuf_ = new char[rsiz];
std::memcpy(kbuf_, kbuf, ksiz);
kbuf_[ksiz] = '\0';
ksiz_ = ksiz;
vbuf_ = kbuf_ + ksiz + 1;
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
xt_ = *xtp;
return NOP;
}
char* kbuf_;
size_t ksiz_;
char* vbuf_;
size_t vsiz_;
int64_t xt_;
};
VisitorImpl visitor;
if (!accept(&visitor, false, step)) {
visitor.clear();
*ksp = 0;
*vbp = NULL;
*vsp = 0;
if (xtp) *xtp = 0;
return NULL;
}
return visitor.pop(ksp, vbp, vsp, xtp);
}
/**
* Get a pair of the key and the value of the current record.
* @note Equal to the original Cursor::get method except that parameters are strings
* to contain the result and the return value is bool for success.
*/
bool get(std::string* key, std::string* value, int64_t* xtp = NULL, bool step = false) {
_assert_(key && value);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::string* key, std::string* value) :
key_(key), value_(value), xt_(0), ok_(false) {}
bool ok(int64_t* xtp) {
if (xtp) *xtp = xt_;
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
key_->clear();
key_->append(kbuf, ksiz);
value_->clear();
value_->append(vbuf, vsiz);
xt_ = *xtp;
ok_ = true;
return NOP;
}
std::string* key_;
std::string* value_;
int64_t xt_;
bool ok_;
};
VisitorImpl visitor(key, value);
if (!accept(&visitor, false, step)) return false;
return visitor.ok(xtp);
}
/**
* Get a pair of the key and the value of the current record and remove it atomically.
* @param ksp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param vbp the pointer to the variable into which the pointer to the value region is
* assigned.
* @param vsp the pointer to the variable into which the size of the value region is
* assigned.
* @param xtp the pointer to the variable into which the absolute expiration time is
* assigned. If it is NULL, it is ignored.
* @return the pointer to the pair of the key region, or NULL on failure.
* @note If the cursor is invalidated, NULL is returned. Because an additional zero code is
* appended at the end of each region of the key and the value, each region can be treated
* as a C-style string. The return value should be deleted explicitly by the caller with
* the detele[] operator.
*/
char* seize(size_t* ksp, const char** vbp, size_t* vsp, int64_t* xtp = NULL) {
_assert_(ksp && vbp && vsp);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl() : kbuf_(NULL), ksiz_(0), vbuf_(NULL), vsiz_(0), xt_(0) {}
char* pop(size_t* ksp, const char** vbp, size_t* vsp, int64_t* xtp) {
*ksp = ksiz_;
*vbp = vbuf_;
*vsp = vsiz_;
if (xtp) *xtp = xt_;
return kbuf_;
}
void clear() {
delete[] kbuf_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
size_t rsiz = ksiz + 1 + vsiz + 1;
kbuf_ = new char[rsiz];
std::memcpy(kbuf_, kbuf, ksiz);
kbuf_[ksiz] = '\0';
ksiz_ = ksiz;
vbuf_ = kbuf_ + ksiz + 1;
std::memcpy(vbuf_, vbuf, vsiz);
vbuf_[vsiz] = '\0';
vsiz_ = vsiz;
xt_ = *xtp;
return REMOVE;
}
char* kbuf_;
size_t ksiz_;
char* vbuf_;
size_t vsiz_;
int64_t xt_;
};
VisitorImpl visitor;
if (!accept(&visitor, true, false)) {
visitor.clear();
*ksp = 0;
*vbp = NULL;
*vsp = 0;
if (xtp) *xtp = 0;
return NULL;
}
return visitor.pop(ksp, vbp, vsp, xtp);
}
/**
* Get a pair of the key and the value of the current record and remove it atomically.
* @note Equal to the original Cursor::seize method except that parameters are strings
* to contain the result and the return value is bool for success.
*/
bool seize(std::string* key, std::string* value, int64_t* xtp = NULL) {
_assert_(key && value);
class VisitorImpl : public Visitor {
public:
explicit VisitorImpl(std::string* key, std::string* value) :
key_(key), value_(value), xt_(0), ok_(false) {}
bool ok(int64_t* xtp) {
if (xtp) *xtp = xt_;
return ok_;
}
private:
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
key_->clear();
key_->append(kbuf, ksiz);
value_->clear();
value_->append(vbuf, vsiz);
xt_ = *xtp;
ok_ = true;
return REMOVE;
}
std::string* key_;
std::string* value_;
int64_t xt_;
bool ok_;
};
VisitorImpl visitor(key, value);
if (!accept(&visitor, true, false)) return false;
return visitor.ok(xtp);
}
/**
* Get the database object.
* @return the database object.
*/
TimedDB* db() {
_assert_(true);
return db_;
}
/**
* Get the last happened error.
* @return the last happened error.
*/
kc::BasicDB::Error error() {
_assert_(true);
return db()->error();
}
private:
/** Dummy constructor to forbid the use. */
Cursor(const Cursor&);
/** Dummy Operator to forbid the use. */
Cursor& operator =(const Cursor&);
/** The inner database. */
TimedDB* db_;
/** The inner cursor. */
kc::BasicDB::Cursor* cur_;
/** The backward flag. */
bool back_;
};
/**
* Interface to access a record.
*/
class Visitor {
public:
/** Special pointer for no operation. */
static const char* const NOP;
/** Special pointer to remove the record. */
static const char* const REMOVE;
/**
* Destructor.
*/
virtual ~Visitor() {
_assert_(true);
}
/**
* Visit a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param vbuf the pointer to the value region.
* @param vsiz the size of the value region.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param xtp the pointer to the variable into which the expiration time from now in seconds
* is assigned. The initial value is the absolute expiration time.
* @return If it is the pointer to a region, the value is replaced by the content. If it
* is Visitor::NOP, nothing is modified. If it is Visitor::REMOVE, the record is removed.
*/
virtual const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp, int64_t* xtp) {
_assert_(kbuf && ksiz <= kc::MEMMAXSIZ && vbuf && vsiz <= kc::MEMMAXSIZ && sp && xtp);
return NOP;
}
/**
* Visit a empty record space.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @param xtp the pointer to the variable into which the expiration time from now in seconds
* is assigned.
* @return If it is the pointer to a region, the value is replaced by the content. If it
* is Visitor::NOP or Visitor::REMOVE, nothing is modified.
*/
virtual const char* visit_empty(const char* kbuf, size_t ksiz, size_t* sp, int64_t* xtp) {
_assert_(kbuf && ksiz <= kc::MEMMAXSIZ && sp && xtp);
return NOP;
}
/**
* Preprocess the main operations.
*/
virtual void visit_before() {
_assert_(true);
}
/**
* Postprocess the main operations.
*/
virtual void visit_after() {
_assert_(true);
}
};
/**
* Interface to trigger update operations.
*/
class UpdateTrigger {
public:
/**
* Destructor.
*/
virtual ~UpdateTrigger() {
_assert_(true);
}
/**
* Trigger an update operation.
* @param mbuf the pointer to the message region.
* @param msiz the size of the message region.
*/
virtual void trigger(const char* mbuf, size_t msiz) = 0;
/**
* Begin transaction.
*/
virtual void begin_transaction() = 0;
/**
* End transaction.
* @param commit true to commit the transaction, or false to abort the transaction.
*/
virtual void end_transaction(bool commit) = 0;
};
/**
* Merge modes.
*/
enum MergeMode {
MSET, ///< overwrite the existing value
MADD, ///< keep the existing value
MREPLACE, ///< modify the existing record only
MAPPEND ///< append the new value
};
/**
* Default constructor.
*/
explicit TimedDB() :
xlock_(), db_(), mtrigger_(this), utrigger_(NULL), omode_(0),
opts_(0), capcnt_(0), capsiz_(0), xcur_(NULL), xsc_(0) {
_assert_(true);
db_.tune_meta_trigger(&mtrigger_);
}
/**
* Destructor.
*/
virtual ~TimedDB() {
_assert_(true);
if (omode_ != 0) close();
}
/**
* Set the internal database object.
* @param db the internal database object. Its possession is transferred inside and the
* object is deleted automatically.
* @return true on success, or false on failure.
*/
bool set_internal_db(kc::BasicDB* db) {
_assert_(db);
if (omode_ != 0) {
set_error(kc::BasicDB::Error::INVALID, "already opened");
return false;
}
db_.set_internal_db(db);
return true;
}
/**
* Get the last happened error.
* @return the last happened error.
*/
kc::BasicDB::Error error() const {
_assert_(true);
return db_.error();
}
/**
* Set the error information.
* @param code an error code.
* @param message a supplement message.
*/
void set_error(kc::BasicDB::Error::Code code, const char* message) {
_assert_(message);
db_.set_error(code, message);
}
/**
* Open a database file.
* @param path the path of a database file. The same as with kc::PolyDB. In addition, the
* following tuning parameters are supported. "ktopts" sets options and the value can contain
* "p" for the persistent option. "ktcapcnt" sets the capacity by record number. "ktcapsiz"
* sets the capacity by database size.
* @param mode the connection mode. The same as with kc::PolyDB.
* @return true on success, or false on failure.
*/
bool open(const std::string& path = ":",
uint32_t mode = kc::BasicDB::OWRITER | kc::BasicDB::OCREATE) {
_assert_(true);
if (omode_ != 0) {
set_error(kc::BasicDB::Error::INVALID, "already opened");
return false;
}
kc::ScopedSpinLock lock(&xlock_);
std::vector<std::string> elems;
kc::strsplit(path, '#', &elems);
capcnt_ = -1;
capsiz_ = -1;
opts_ = 0;
std::vector<std::string>::iterator it = elems.begin();
std::vector<std::string>::iterator itend = elems.end();
if (it != itend) ++it;
while (it != itend) {
std::vector<std::string> fields;
if (kc::strsplit(*it, '=', &fields) > 1) {
const char* key = fields[0].c_str();
const char* value = fields[1].c_str();
if (!std::strcmp(key, "ktcapcnt") || !std::strcmp(key, "ktcapcount") ||
!std::strcmp(key, "ktcap_count")) {
capcnt_ = kc::atoix(value);
} else if (!std::strcmp(key, "ktcapsiz") || !std::strcmp(key, "ktcapsize") ||
!std::strcmp(key, "ktcap_size")) {
capsiz_ = kc::atoix(value);
} else if (!std::strcmp(key, "ktopts") || !std::strcmp(key, "ktoptions")) {
if (std::strchr(value, 'p')) opts_ |= TPERSIST;
}
}
++it;
}
if (!db_.open(path, mode)) return false;
kc::BasicDB* idb = db_.reveal_inner_db();
if (idb) {
const std::type_info& info = typeid(*idb);
if (info == typeid(kc::HashDB)) {
kc::HashDB* hdb = (kc::HashDB*)idb;
char* opq = hdb->opaque();
if (opq) {
if (*(uint8_t*)opq == MAGICDATA) {
opts_ = *(uint8_t*)(opq + 1);
} else if ((mode & kc::BasicDB::OWRITER) && hdb->count() < 1) {
*(uint8_t*)opq = MAGICDATA;
*(uint8_t*)(opq + 1) = opts_;
hdb->synchronize_opaque();
}
}
} else if (info == typeid(kc::TreeDB)) {
kc::TreeDB* tdb = (kc::TreeDB*)idb;
char* opq = tdb->opaque();
if (opq) {
if (*(uint8_t*)opq == MAGICDATA) {
opts_ = *(uint8_t*)(opq + 1);
} else if ((mode & kc::BasicDB::OWRITER) && tdb->count() < 1) {
*(uint8_t*)opq = MAGICDATA;
*(uint8_t*)(opq + 1) = opts_;
tdb->synchronize_opaque();
}
}
} else if (info == typeid(kc::DirDB)) {
kc::DirDB* ddb = (kc::DirDB*)idb;
char* opq = ddb->opaque();
if (opq) {
if (*(uint8_t*)opq == MAGICDATA) {
opts_ = *(uint8_t*)(opq + 1);
} else if ((mode & kc::BasicDB::OWRITER) && ddb->count() < 1) {
*(uint8_t*)opq = MAGICDATA;
*(uint8_t*)(opq + 1) = opts_;
ddb->synchronize_opaque();
}
}
} else if (info == typeid(kc::ForestDB)) {
kc::ForestDB* fdb = (kc::ForestDB*)idb;
char* opq = fdb->opaque();
if (opq) {
if (*(uint8_t*)opq == MAGICDATA) {
opts_ = *(uint8_t*)(opq + 1);
} else if ((mode & kc::BasicDB::OWRITER) && fdb->count() < 1) {
*(uint8_t*)opq = MAGICDATA;
*(uint8_t*)(opq + 1) = opts_;
fdb->synchronize_opaque();
}
}
}
}
omode_ = mode;
if ((omode_ & kc::BasicDB::OWRITER) && !(opts_ & TPERSIST)) {
xcur_ = db_.cursor();
if (db_.count() > 0) xcur_->jump();
}
xsc_ = 0;
return true;
}
/**
* Close the database file.
* @return true on success, or false on failure.
*/
bool close() {
_assert_(true);
if (omode_ == 0) {
set_error(kc::BasicDB::Error::INVALID, "not opened");
return false;
}
kc::ScopedSpinLock lock(&xlock_);
bool err = false;
delete xcur_;
xcur_ = NULL;
if (!db_.close()) err = true;
omode_ = 0;
return !err;
}
/**
* Accept a visitor to a record.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @return true on success, or false on failure.
* @note the operation for each record is performed atomically and other threads accessing the
* same record are blocked.
*/
bool accept(const char* kbuf, size_t ksiz, Visitor* visitor, bool writable = true) {
_assert_(kbuf && ksiz <= kc::MEMMAXSIZ && visitor);
bool err = false;
int64_t ct = std::time(NULL);
TimedVisitor myvisitor(this, visitor, ct, false);
if (!db_.accept(kbuf, ksiz, &myvisitor, writable)) err = true;
if (xcur_) {
int64_t xtsc = writable ? XTSCUNIT : XTSCUNIT / XTREADFREQ;
if (!expire_records(xtsc)) err = true;
}
return !err;
}
/**
* Accept a visitor to multiple records at once.
* @param keys specifies a string vector of the keys.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @return true on success, or false on failure.
* @note The operations for specified records are performed atomically and other threads
* accessing the same records are blocked. To avoid deadlock, any database operation must not
* be performed in this function.
*/
bool accept_bulk(const std::vector<std::string>& keys, Visitor* visitor,
bool writable = true) {
_assert_(visitor);
bool err = false;
int64_t ct = std::time(NULL);
TimedVisitor myvisitor(this, visitor, ct, false);
if (!db_.accept_bulk(keys, &myvisitor, writable)) err = true;
if (xcur_) {
int64_t xtsc = writable ? XTSCUNIT : XTSCUNIT / XTREADFREQ;
if (!expire_records(xtsc)) err = true;
}
return !err;
}
/**
* Iterate to accept a visitor for each record.
* @param visitor a visitor object.
* @param writable true for writable operation, or false for read-only operation.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
* @note The whole iteration is performed atomically and other threads are blocked.
*/
bool iterate(Visitor *visitor, bool writable = true,
kc::BasicDB::ProgressChecker* checker = NULL) {
_assert_(visitor);
bool err = false;
int64_t ct = std::time(NULL);
TimedVisitor myvisitor(this, visitor, ct, true);
if (!db_.iterate(&myvisitor, writable, checker)) err = true;
if (xcur_) {
int64_t count = db_.count();
int64_t xtsc = writable ? XTSCUNIT : XTSCUNIT / XTREADFREQ;
if (count > 0) xtsc *= count / XTITERFREQ;
if (!expire_records(xtsc)) err = true;
}
return !err;
}
/**
* Scan each record in parallel.
* @param visitor a visitor object.
* @param thnum the number of worker threads.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.
* @note This function is for reading records and not for updating ones. The return value of
* the visitor is just ignored. To avoid deadlock, any explicit database operation must not
* be performed in this function.
*/
bool scan_parallel(Visitor *visitor, size_t thnum,
kc::BasicDB::ProgressChecker* checker = NULL) {
bool err = false;
int64_t ct = std::time(NULL);
TimedVisitor myvisitor(this, visitor, ct, true);
if (!db_.scan_parallel(&myvisitor, thnum, checker)) err = true;
if (xcur_) {
int64_t count = db_.count();
int64_t xtsc = XTSCUNIT / XTREADFREQ;
if (count > 0) xtsc *= count / XTITERFREQ;
if (!expire_records(xtsc)) err = true;
}
return !err;
}
/**
* Synchronize updated contents with the file and the device.
* @param hard true for physical synchronization with the device, or false for logical
* synchronization with the file system.
* @param proc a postprocessor object. If it is NULL, no postprocessing is performed.
* @param checker a progress checker object. If it is NULL, no checking is performed.
* @return true on success, or false on failure.