-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy pathkcdbext.h
1690 lines (1678 loc) · 56.3 KB
/
kcdbext.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
/*************************************************************************************************
* Database extension
* Copyright (C) 2009-2012 FAL Labs
* This file is part of Kyoto Cabinet.
* 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 _KCDBEXT_H // duplication check
#define _KCDBEXT_H
#include <kccommon.h>
#include <kcutil.h>
#include <kcthread.h>
#include <kcfile.h>
#include <kccompress.h>
#include <kccompare.h>
#include <kcmap.h>
#include <kcregex.h>
#include <kcdb.h>
#include <kcplantdb.h>
#include <kcprotodb.h>
#include <kcstashdb.h>
#include <kccachedb.h>
#include <kchashdb.h>
#include <kcdirdb.h>
#include <kcpolydb.h>
namespace kyotocabinet { // common namespace
/**
* MapReduce framework.
* @note Although this framework is not distributed or concurrent, it is useful for aggregate
* calculation with less CPU loading and less memory usage.
*/
class MapReduce {
public:
class ValueIterator;
private:
class FlushThread;
class ReduceTaskQueue;
class MapVisitor;
struct MergeLine;
/** An alias of vector of loaded values. */
typedef std::vector<std::string> Values;
/** The default number of temporary databases. */
static const size_t DEFDBNUM = 8;
/** The maxinum number of temporary databases. */
static const size_t MAXDBNUM = 256;
/** The default cache limit. */
static const int64_t DEFCLIM = 512LL << 20;
/** The default cache bucket numer. */
static const int64_t DEFCBNUM = 1048583LL;
/** The bucket number of temprary databases. */
static const int64_t DBBNUM = 512LL << 10;
/** The page size of temprary databases. */
static const int32_t DBPSIZ = 32768;
/** The mapped size of temprary databases. */
static const int64_t DBMSIZ = 516LL * 4096;
/** The page cache capacity of temprary databases. */
static const int64_t DBPCCAP = 16LL << 20;
/** The default number of threads in parallel mode. */
static const size_t DEFTHNUM = 8;
/** The number of slots of the record lock. */
static const int32_t RLOCKSLOT = 256;
public:
/**
* Value iterator for the reducer.
*/
class ValueIterator {
friend class MapReduce;
public:
/**
* Get the next value.
* @param sp the pointer to the variable into which the size of the region of the return
* value is assigned.
* @return the pointer to the next value region, or NULL if no value remains.
*/
const char* next(size_t* sp) {
_assert_(sp);
if (!vptr_) {
if (vit_ == vend_) return NULL;
vptr_ = vit_->data();
vsiz_ = vit_->size();
vit_++;
}
uint64_t vsiz;
size_t step = readvarnum(vptr_, vsiz_, &vsiz);
vptr_ += step;
vsiz_ -= step;
const char* vbuf = vptr_;
*sp = vsiz;
vptr_ += vsiz;
vsiz_ -= vsiz;
if (vsiz_ < 1) vptr_ = NULL;
return vbuf;
}
private:
/**
* Default constructor.
*/
explicit ValueIterator(Values::const_iterator vit, Values::const_iterator vend) :
vit_(vit), vend_(vend), vptr_(NULL), vsiz_(0) {
_assert_(true);
}
/**
* Destructor.
*/
~ValueIterator() {
_assert_(true);
}
/** Dummy constructor to forbid the use. */
ValueIterator(const ValueIterator&);
/** Dummy Operator to forbid the use. */
ValueIterator& operator =(const ValueIterator&);
/** The current iterator of loaded values. */
Values::const_iterator vit_;
/** The ending iterator of loaded values. */
Values::const_iterator vend_;
/** The pointer of the current value. */
const char* vptr_;
/** The size of the current value. */
size_t vsiz_;
};
/**
* Execution options.
*/
enum Option {
XNOLOCK = 1 << 0, ///< avoid locking against update operations
XPARAMAP = 1 << 1, ///< run mappers in parallel
XPARARED = 1 << 2, ///< run reducers in parallel
XPARAFLS = 1 << 3, ///< run cache flushers in parallel
XNOCOMP = 1 << 8 ///< avoid compression of temporary databases
};
/**
* Default constructor.
*/
explicit MapReduce() :
db_(NULL), rcomp_(NULL), tmpdbs_(NULL), dbnum_(DEFDBNUM), dbclock_(0),
mapthnum_(DEFTHNUM), redthnum_(DEFTHNUM), flsthnum_(DEFTHNUM),
cache_(NULL), csiz_(0), clim_(DEFCLIM), cbnum_(DEFCBNUM), flsths_(NULL),
redtasks_(NULL), redaborted_(false), rlocks_(NULL) {
_assert_(true);
}
/**
* Destructor.
*/
virtual ~MapReduce() {
_assert_(true);
}
/**
* Map a record data.
* @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.
* @return true on success, or false on failure.
* @note This function can call the MapReduce::emit method to emit a record. To avoid
* deadlock, any explicit database operation must not be performed in this function.
*/
virtual bool map(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) = 0;
/**
* Reduce a record data.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param iter the iterator to get the values.
* @return true on success, or false on failure.
* @note To avoid deadlock, any explicit database operation must not be performed in this
* function.
*/
virtual bool reduce(const char* kbuf, size_t ksiz, ValueIterator* iter) = 0;
/**
* Preprocess the map operations.
* @return true on success, or false on failure.
* @note This function can call the MapReduce::emit method to emit a record. To avoid
* deadlock, any explicit database operation must not be performed in this function.
*/
virtual bool preprocess() {
_assert_(true);
return true;
}
/**
* Mediate between the map and the reduce phases.
* @return true on success, or false on failure.
* @note This function can call the MapReduce::emit method to emit a record. To avoid
* deadlock, any explicit database operation must not be performed in this function.
*/
virtual bool midprocess() {
_assert_(true);
return true;
}
/**
* Postprocess the reduce operations.
* @return true on success, or false on failure.
* @note To avoid deadlock, any explicit database operation must not be performed in this
* function.
*/
virtual bool postprocess() {
_assert_(true);
return true;
}
/**
* Process a log message.
* @param name the name of the event.
* @param message a supplement message.
* @return true on success, or false on failure.
*/
virtual bool log(const char* name, const char* message) {
_assert_(name && message);
return true;
}
/**
* Execute the MapReduce process about a database.
* @param db the source database.
* @param tmppath the path of a directory for the temporary data storage. If it is an empty
* string, temporary data are handled on memory.
* @param opts the optional features by bitwise-or: MapReduce::XNOLOCK to avoid locking
* against update operations by other threads, MapReduce::XPARAMAP to run the mapper in
* parallel, MapReduce::XPARARED to run the reducer in parallel, MapReduce::XNOCOMP to avoid
* compression of temporary databases.
* @return true on success, or false on failure.
*/
bool execute(BasicDB* db, const std::string& tmppath = "", uint32_t opts = 0) {
int64_t count = db->count();
if (count < 0) {
if (db->error() != BasicDB::Error::NOIMPL) return false;
count = 0;
}
bool err = false;
double stime, etime;
db_ = db;
rcomp_ = LEXICALCOMP;
BasicDB* idb = db;
if (typeid(*db) == typeid(PolyDB)) {
PolyDB* pdb = (PolyDB*)idb;
idb = pdb->reveal_inner_db();
}
const std::type_info& info = typeid(*idb);
if (info == typeid(GrassDB)) {
GrassDB* gdb = (GrassDB*)idb;
rcomp_ = gdb->rcomp();
} else if (info == typeid(TreeDB)) {
TreeDB* tdb = (TreeDB*)idb;
rcomp_ = tdb->rcomp();
} else if (info == typeid(ForestDB)) {
ForestDB* fdb = (ForestDB*)idb;
rcomp_ = fdb->rcomp();
}
tmpdbs_ = new BasicDB*[dbnum_];
if (tmppath.empty()) {
if (!logf("prepare", "started to open temporary databases on memory")) err = true;
stime = time();
for (size_t i = 0; i < dbnum_; i++) {
GrassDB* gdb = new GrassDB;
int32_t myopts = 0;
if (!(opts & XNOCOMP)) myopts |= GrassDB::TCOMPRESS;
gdb->tune_options(myopts);
gdb->tune_buckets(DBBNUM / 2);
gdb->tune_page(DBPSIZ);
gdb->tune_page_cache(DBPCCAP);
gdb->tune_comparator(rcomp_);
gdb->open("%", GrassDB::OWRITER | GrassDB::OCREATE | GrassDB::OTRUNCATE);
tmpdbs_[i] = gdb;
}
etime = time();
if (!logf("prepare", "opening temporary databases finished: time=%.6f", etime - stime))
err = true;
if (err) {
delete[] tmpdbs_;
return false;
}
} else {
File::Status sbuf;
if (!File::status(tmppath, &sbuf) || !sbuf.isdir) {
db->set_error(_KCCODELINE_, BasicDB::Error::NOREPOS, "no such directory");
delete[] tmpdbs_;
return false;
}
if (!logf("prepare", "started to open temporary databases under %s", tmppath.c_str()))
err = true;
stime = time();
uint32_t pid = getpid() & UINT16MAX;
uint32_t tid = Thread::hash() & UINT16MAX;
uint32_t ts = time() * 1000;
for (size_t i = 0; i < dbnum_; i++) {
std::string childpath =
strprintf("%s%cmr-%04x-%04x-%08x-%03d%ckct",
tmppath.c_str(), File::PATHCHR, pid, tid, ts, (int)(i + 1), File::EXTCHR);
TreeDB* tdb = new TreeDB;
int32_t myopts = TreeDB::TSMALL | TreeDB::TLINEAR;
if (!(opts & XNOCOMP)) myopts |= TreeDB::TCOMPRESS;
tdb->tune_options(myopts);
tdb->tune_buckets(DBBNUM);
tdb->tune_page(DBPSIZ);
tdb->tune_map(DBMSIZ);
tdb->tune_page_cache(DBPCCAP);
tdb->tune_comparator(rcomp_);
if (!tdb->open(childpath, TreeDB::OWRITER | TreeDB::OCREATE | TreeDB::OTRUNCATE)) {
const BasicDB::Error& e = tdb->error();
db->set_error(_KCCODELINE_, e.code(), e.message());
err = true;
}
tmpdbs_[i] = tdb;
}
etime = time();
if (!logf("prepare", "opening temporary databases finished: time=%.6f", etime - stime))
err = true;
if (err) {
for (size_t i = 0; i < dbnum_; i++) {
delete tmpdbs_[i];
}
delete[] tmpdbs_;
return false;
}
}
if (opts & XPARARED) redtasks_ = new ReduceTaskQueue;
if (opts & XPARAFLS) flsths_ = new std::deque<FlushThread*>;
if (opts & XNOLOCK) {
MapChecker mapchecker;
MapVisitor mapvisitor(this, &mapchecker, count);
mapvisitor.visit_before();
if (!err) {
BasicDB::Cursor* cur = db->cursor();
if (!cur->jump() && cur->error() != BasicDB::Error::NOREC) err = true;
while (!err) {
if (!cur->accept(&mapvisitor, false, true)) {
if (cur->error() != BasicDB::Error::NOREC) err = true;
break;
}
}
delete cur;
}
if (mapvisitor.error()) {
db_->set_error(_KCCODELINE_, BasicDB::Error::LOGIC, "mapper failed");
err = true;
}
mapvisitor.visit_after();
} else if (opts & XPARAMAP) {
MapChecker mapchecker;
MapVisitor mapvisitor(this, &mapchecker, count);
rlocks_ = new SlottedMutex(RLOCKSLOT);
if (!err && !db->scan_parallel(&mapvisitor, mapthnum_, &mapchecker)) {
db_->set_error(_KCCODELINE_, BasicDB::Error::LOGIC, "mapper failed");
err = true;
}
delete rlocks_;
rlocks_ = NULL;
if (mapvisitor.error()) err = true;
} else {
MapChecker mapchecker;
MapVisitor mapvisitor(this, &mapchecker, count);
if (!err && !db->iterate(&mapvisitor, false, &mapchecker)) err = true;
if (mapvisitor.error()) {
db_->set_error(_KCCODELINE_, BasicDB::Error::LOGIC, "mapper failed");
err = true;
}
}
if (flsths_) {
delete flsths_;
flsths_ = NULL;
}
if (redtasks_) {
delete redtasks_;
redtasks_ = NULL;
}
if (!logf("clean", "closing the temporary databases")) err = true;
stime = time();
for (size_t i = 0; i < dbnum_; i++) {
const std::string& path = tmpdbs_[i]->path();
if (!tmpdbs_[i]->clear()) {
const BasicDB::Error& e = tmpdbs_[i]->error();
db->set_error(_KCCODELINE_, e.code(), e.message());
err = true;
}
if (!tmpdbs_[i]->close()) {
const BasicDB::Error& e = tmpdbs_[i]->error();
db->set_error(_KCCODELINE_, e.code(), e.message());
err = true;
}
if (!tmppath.empty()) File::remove(path);
delete tmpdbs_[i];
}
etime = time();
if (!logf("clean", "closing the temporary databases finished: time=%.6f",
etime - stime)) err = true;
delete[] tmpdbs_;
return !err;
}
/**
* Set the storage configurations.
* @param dbnum the number of temporary databases.
* @param clim the limit size of the internal cache.
* @param cbnum the bucket number of the internal cache.
*/
void tune_storage(int32_t dbnum, int64_t clim, int64_t cbnum) {
_assert_(true);
dbnum_ = dbnum > 0 ? dbnum : DEFDBNUM;
if (dbnum_ > MAXDBNUM) dbnum_ = MAXDBNUM;
clim_ = clim > 0 ? clim : DEFCLIM;
cbnum_ = cbnum > 0 ? cbnum : DEFCBNUM;
if (cbnum_ > INT16MAX) cbnum_ = nearbyprime(cbnum_);
}
/**
* Set the thread configurations.
* @param mapthnum the number of threads for the mapper.
* @param redthnum the number of threads for the reducer.
* @param flsthnum the number of threads for the internal flusher.
*/
void tune_thread(int32_t mapthnum, int32_t redthnum, int32_t flsthnum) {
_assert_(true);
mapthnum_ = mapthnum > 0 ? mapthnum : DEFTHNUM;
redthnum_ = redthnum > 0 ? redthnum : DEFTHNUM;
flsthnum_ = flsthnum > 0 ? flsthnum : DEFTHNUM;
}
protected:
/**
* Emit a record from the mapper.
* @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.
* @return true on success, or false on failure.
*/
bool emit(const char* kbuf, size_t ksiz, const char* vbuf, size_t vsiz) {
_assert_(kbuf && ksiz <= MEMMAXSIZ && vbuf && vsiz <= MEMMAXSIZ);
bool err = false;
size_t rsiz = sizevarnum(vsiz) + vsiz;
char stack[NUMBUFSIZ*4];
char* rbuf = rsiz > sizeof(stack) ? new char[rsiz] : stack;
char* wp = rbuf;
wp += writevarnum(rbuf, vsiz);
std::memcpy(wp, vbuf, vsiz);
if (rlocks_) {
size_t bidx = TinyHashMap::hash_record(kbuf, ksiz) % cbnum_;
size_t lidx = bidx % RLOCKSLOT;
rlocks_->lock(lidx);
cache_->append(kbuf, ksiz, rbuf, rsiz);
rlocks_->unlock(lidx);
} else {
cache_->append(kbuf, ksiz, rbuf, rsiz);
}
if (rbuf != stack) delete[] rbuf;
csiz_ += sizevarnum(ksiz) + ksiz + rsiz;
return !err;
}
private:
/**
* Cache flusher.
*/
class FlushThread : public Thread {
public:
/** constructor */
explicit FlushThread(MapReduce* mr, BasicDB* tmpdb,
TinyHashMap* cache, size_t csiz, bool cown) :
mr_(mr), tmpdb_(tmpdb), cache_(cache), csiz_(csiz), cown_(cown), err_(false) {}
/** perform the concrete process */
void run() {
if (!mr_->logf("map", "started to flushing the cache: count=%lld size=%lld",
(long long)cache_->count(), (long long)csiz_)) err_ = true;
double stime = time();
BasicDB* tmpdb = tmpdb_;
TinyHashMap* cache = cache_;
bool cown = cown_;
TinyHashMap::Sorter sorter(cache);
const char* kbuf, *vbuf;
size_t ksiz, vsiz;
while ((kbuf = sorter.get(&ksiz, &vbuf, &vsiz)) != NULL) {
if (!tmpdb->append(kbuf, ksiz, vbuf, vsiz)) {
const BasicDB::Error& e = tmpdb->error();
mr_->db_->set_error(_KCCODELINE_, e.code(), e.message());
err_ = true;
}
sorter.step();
if (cown) cache->remove(kbuf, ksiz);
}
double etime = time();
if (!mr_->logf("map", "flushing the cache finished: time=%.6f", etime - stime))
err_ = true;
if (cown) delete cache;
}
/** check the error flag. */
bool error() {
return err_;
}
private:
MapReduce* mr_; ///< driver
BasicDB* tmpdb_; ///< temprary database
TinyHashMap* cache_; ///< cache for emitter
size_t csiz_; ///< current cache size
bool cown_; ///< cache ownership flag
bool err_; ///< error flag
};
/**
* Task queue for parallel reducer.
*/
class ReduceTaskQueue : public TaskQueue {
public:
/**
* Task for parallel reducer.
*/
class ReduceTask : public Task {
friend class ReduceTaskQueue;
public:
/** constructor */
explicit ReduceTask(MapReduce* mr, const char* kbuf, size_t ksiz, const Values& values) :
mr_(mr), key_(kbuf, ksiz), values_(values) {}
private:
MapReduce* mr_; ///< driver
std::string key_; ///< key
Values values_; ///< values
};
/** constructor */
explicit ReduceTaskQueue() {}
private:
/** process a task */
void do_task(Task* task) {
ReduceTask* rtask = (ReduceTask*)task;
ValueIterator iter(rtask->values_.begin(), rtask->values_.end());
if (!rtask->mr_->reduce(rtask->key_.data(), rtask->key_.size(), &iter))
rtask->mr_->redaborted_ = true;
delete rtask;
}
};
/**
* Checker for the map process.
*/
class MapChecker : public BasicDB::ProgressChecker {
public:
/** constructor */
explicit MapChecker() : stop_(false) {}
/** stop the process */
void stop() {
stop_ = true;
}
/** check whether stopped */
bool stopped() {
return stop_;
}
private:
/** check whether stopped */
bool check(const char* name, const char* message, int64_t curcnt, int64_t allcnt) {
return !stop_;
}
bool stop_; ///< flag for stop
};
/**
* Visitor for the map process.
*/
class MapVisitor : public BasicDB::Visitor {
public:
/** constructor */
explicit MapVisitor(MapReduce* mr, MapChecker* checker, int64_t scale) :
mr_(mr), checker_(checker), scale_(scale), stime_(0), err_(false) {}
/** get the error flag */
bool error() {
return err_;
}
/** preprocess the mappter */
void visit_before() {
mr_->dbclock_ = 0;
mr_->cache_ = new TinyHashMap(mr_->cbnum_);
mr_->csiz_ = 0;
if (!mr_->preprocess()) err_ = true;
if (mr_->csiz_ > 0 && !mr_->flush_cache()) err_ = true;
if (!mr_->logf("map", "started the map process: scale=%lld", (long long)scale_))
err_ = true;
stime_ = time();
}
/** postprocess the mappter and call the reducer */
void visit_after() {
if (mr_->csiz_ > 0 && !mr_->flush_cache()) err_ = true;
double etime = time();
if (!mr_->logf("map", "the map process finished: time=%.6f", etime - stime_))
err_ = true;
if (!mr_->midprocess()) err_ = true;
if (mr_->csiz_ > 0 && !mr_->flush_cache()) err_ = true;
delete mr_->cache_;
if (mr_->flsths_ && !mr_->flsths_->empty()) {
std::deque<FlushThread*>::iterator flthit = mr_->flsths_->begin();
std::deque<FlushThread*>::iterator flthitend = mr_->flsths_->end();
while (flthit != flthitend) {
FlushThread* flth = *flthit;
flth->join();
if (flth->error()) err_ = true;
delete flth;
++flthit;
}
}
if (!err_ && !mr_->execute_reduce()) err_ = true;
if (!mr_->postprocess()) err_ = true;
}
private:
/** visit a record */
const char* visit_full(const char* kbuf, size_t ksiz,
const char* vbuf, size_t vsiz, size_t* sp) {
if (!mr_->map(kbuf, ksiz, vbuf, vsiz)) {
checker_->stop();
err_ = true;
}
if (mr_->rlocks_) {
if (mr_->csiz_ >= mr_->clim_) {
mr_->rlocks_->lock_all();
if (mr_->csiz_ >= mr_->clim_ && !mr_->flush_cache()) {
checker_->stop();
err_ = true;
}
mr_->rlocks_->unlock_all();
}
} else {
if (mr_->csiz_ >= mr_->clim_ && !mr_->flush_cache()) {
checker_->stop();
err_ = true;
}
}
return NOP;
}
MapReduce* mr_; ///< driver
MapChecker* checker_; ///< checker
int64_t scale_; ///< number of records
double stime_; ///< start time
bool err_; ///< error flag
};
/**
* Front line of a merging list.
*/
struct MergeLine {
BasicDB::Cursor* cur; ///< cursor
Comparator* rcomp; ///< record comparator
char* kbuf; ///< pointer to the key
size_t ksiz; ///< size of the key
const char* vbuf; ///< pointer to the value
size_t vsiz; ///< size of the value
/** comparing operator */
bool operator <(const MergeLine& right) const {
return rcomp->compare(kbuf, ksiz, right.kbuf, right.ksiz) > 0;
}
};
/**
* Process a log message.
* @param name the name of the event.
* @param format the printf-like format string.
* @param ... used according to the format string.
* @return true on success, or false on failure.
*/
bool logf(const char* name, const char* format, ...) {
_assert_(name && format);
va_list ap;
va_start(ap, format);
std::string message;
vstrprintf(&message, format, ap);
va_end(ap);
return log(name, message.c_str());
}
/**
* Flush all cache records.
* @return true on success, or false on failure.
*/
bool flush_cache() {
_assert_(true);
bool err = false;
BasicDB* tmpdb = tmpdbs_[dbclock_];
dbclock_ = (dbclock_ + 1) % dbnum_;
if (flsths_) {
size_t num = flsths_->size();
if (num >= flsthnum_ || num >= dbnum_) {
FlushThread* flth = flsths_->front();
flsths_->pop_front();
flth->join();
if (flth->error()) err = true;
delete flth;
}
FlushThread* flth = new FlushThread(this, tmpdb, cache_, csiz_, true);
cache_ = new TinyHashMap(cbnum_);
csiz_ = 0;
flth->start();
flsths_->push_back(flth);
} else {
FlushThread flth(this, tmpdb, cache_, csiz_, false);
flth.run();
if (flth.error()) err = true;
cache_->clear();
csiz_ = 0;
}
return !err;
}
/**
* Execute the reduce part.
* @return true on success, or false on failure.
*/
bool execute_reduce() {
bool err = false;
int64_t scale = 0;
for (size_t i = 0; i < dbnum_; i++) {
scale += tmpdbs_[i]->count();
}
if (!logf("reduce", "started the reduce process: scale=%lld", (long long)scale)) err = true;
double stime = time();
if (redtasks_) redtasks_->start(redthnum_);
std::priority_queue<MergeLine> lines;
for (size_t i = 0; i < dbnum_; i++) {
MergeLine line;
line.cur = tmpdbs_[i]->cursor();
line.rcomp = rcomp_;
line.cur->jump();
line.kbuf = line.cur->get(&line.ksiz, &line.vbuf, &line.vsiz, true);
if (line.kbuf) {
lines.push(line);
} else {
delete line.cur;
}
}
char* lkbuf = NULL;
size_t lksiz = 0;
Values values;
while (!err && !lines.empty()) {
MergeLine line = lines.top();
lines.pop();
if (lkbuf && (lksiz != line.ksiz || std::memcmp(lkbuf, line.kbuf, lksiz))) {
if (!call_reducer(lkbuf, lksiz, values)) {
db_->set_error(_KCCODELINE_, BasicDB::Error::LOGIC, "reducer failed");
err = true;
}
values.clear();
}
delete[] lkbuf;
lkbuf = line.kbuf;
lksiz = line.ksiz;
values.push_back(std::string(line.vbuf, line.vsiz));
line.kbuf = line.cur->get(&line.ksiz, &line.vbuf, &line.vsiz, true);
if (line.kbuf) {
lines.push(line);
} else {
delete line.cur;
}
}
if (lkbuf) {
if (!err && !call_reducer(lkbuf, lksiz, values)) {
db_->set_error(_KCCODELINE_, BasicDB::Error::LOGIC, "reducer failed");
err = true;
}
delete[] lkbuf;
}
while (!lines.empty()) {
MergeLine line = lines.top();
lines.pop();
delete[] line.kbuf;
delete line.cur;
}
if (redtasks_) redtasks_->finish();
double etime = time();
if (!logf("reduce", "the reduce process finished: time=%.6f", etime - stime)) err = true;
return !err;
}
/**
* Call the reducer.
* @param kbuf the pointer to the key region.
* @param ksiz the size of the key region.
* @param values a vector of the values.
* @return true on success, or false on failure.
*/
bool call_reducer(const char* kbuf, size_t ksiz, const Values& values) {
_assert_(kbuf && ksiz <= MEMMAXSIZ);
if (redtasks_) {
if (redaborted_) return false;
ReduceTaskQueue::ReduceTask* task =
new ReduceTaskQueue::ReduceTask(this, kbuf, ksiz, values);
redtasks_->add_task(task);
return true;
}
bool err = false;
ValueIterator iter(values.begin(), values.end());
if (!reduce(kbuf, ksiz, &iter)) err = true;
return !err;
}
/** Dummy constructor to forbid the use. */
MapReduce(const MapReduce&);
/** Dummy Operator to forbid the use. */
MapReduce& operator =(const MapReduce&);
/** The internal database. */
BasicDB* db_;
/** The record comparator. */
Comparator* rcomp_;
/** The temporary databases. */
BasicDB** tmpdbs_;
/** The number of temporary databases. */
size_t dbnum_;
/** The logical clock for temporary databases. */
int64_t dbclock_;
/** The number of the mapper threads. */
size_t mapthnum_;
/** The number of the reducer threads. */
size_t redthnum_;
/** The number of the flusher threads. */
size_t flsthnum_;
/** The cache for emitter. */
TinyHashMap* cache_;
/** The current size of the cache for emitter. */
AtomicInt64 csiz_;
/** The limit size of the cache for emitter. */
int64_t clim_;
/** The bucket number of the cache for emitter. */
int64_t cbnum_;
/** The flush threads. */
std::deque<FlushThread*>* flsths_;
/** The task queue for parallel reducer. */
TaskQueue* redtasks_;
/** The flag whether aborted. */
bool redaborted_;
/** The whole lock. */
SlottedMutex* rlocks_;
};
/**
* Index database.
* @note This class is designed to implement an indexing storage with an efficient appending
* operation for the existing record values. This class is a wrapper of the polymorphic
* database, featuring buffering mechanism to alleviate IO overhead in the database layer. This
* class can be inherited but overwriting methods is forbidden. Before every database operation,
* it is necessary to call the IndexDB::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 IndexDB::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. It is forbidden to share a database object with child processes.
*/
class IndexDB {
private:
/** The default number of temporary databases. */
static const size_t DEFDBNUM = 8;
/** The maxinum number of temporary databases. */
static const size_t MAXDBNUM = 256;
/** The default cache limit size. */
static const int64_t DEFCLIM = 256LL << 20;
/** The default cache bucket number. */
static const int64_t DEFCBNUM = 1048583LL;
/** The bucket number of temprary databases. */
static const int64_t DBBNUM = 512LL << 10;
/** The page size of temprary databases. */
static const int32_t DBPSIZ = 32768;
/** The mapped size of temprary databases. */
static const int64_t DBMSIZ = 516LL * 4096;
/** The page cache capacity of temprary databases. */
static const int64_t DBPCCAP = 16LL << 20;
public:
/**
* Default constructor.
*/
explicit IndexDB() :
mlock_(), db_(), omode_(0),
rcomp_(NULL), tmppath_(""), tmpdbs_(NULL), dbnum_(DEFDBNUM), dbclock_(0),
cache_(NULL), csiz_(0), clim_(0) {
_assert_(true);
}
/**
* Destructor.
* @note If the database is not closed, it is closed implicitly.
*/
virtual ~IndexDB() {
_assert_(true);
if (omode_ != 0) close();
}
/**
* Get the last happened error.
* @return the last happened error.
*/
BasicDB::Error error() const {
_assert_(true);
return db_.error();
}
/**
* Set the error information.
* @param file the file name of the program source code.
* @param line the line number of the program source code.
* @param func the function name of the program source code.
* @param code an error code.
* @param message a supplement message.
*/
void set_error(const char* file, int32_t line, const char* func,
BasicDB::Error::Code code, const char* message) {
_assert_(file && line > 0 && func && message);
db_.set_error(file, line, func, code, message);
}
/**
* Set the error information without source code information.
* @param code an error code.
* @param message a supplement message.
*/
void set_error(BasicDB::Error::Code code, const char* message) {
_assert_(message);
db_.set_error(_KCCODELINE_, code, message);
}
/**
* Open a database file.
* @param path the path of a database file. The same as with PolyDB. In addition, the
* following tuning parameters are supported. "idxclim" specifies the limit size of the
* internal cache. "idxcbnum" the bucket number of the internal cache. "idxdbnum" specifies
* the number of internal databases. "idxtmppath' specifies the path of the temporary
* directory.
* @param mode the connection mode. The same as with PolyDB.
* @return true on success, or false on failure.
* @note Every opened database must be closed by the IndexDB::close method when it is no longer
* in use. It is not allowed for two or more database objects in the same process to keep
* their connections to the same database file at the same time.
*/
bool open(const std::string& path = ":",
uint32_t mode = BasicDB::OWRITER | BasicDB::OCREATE) {
_assert_(true);
ScopedRWLock lock(&mlock_, true);
if (omode_ != 0) {
set_error(_KCCODELINE_, BasicDB::Error::INVALID, "already opened");
return false;
}
std::vector<std::string> elems;
strsplit(path, '#', &elems);
int64_t clim = 0;
int64_t cbnum = 0;
size_t dbnum = 0;
std::string tmppath = "";
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 (strsplit(*it, '=', &fields) > 1) {
const char* key = fields[0].c_str();
const char* value = fields[1].c_str();
if (!std::strcmp(key, "idxclim") || !std::strcmp(key, "idxcachelimit")) {
clim = atoix(value);
} else if (!std::strcmp(key, "idxcbnum") || !std::strcmp(key, "idxcachebuckets")) {
cbnum = atoix(value);
} else if (!std::strcmp(key, "idxdbnum")) {
dbnum = atoix(value);
} else if (!std::strcmp(key, "idxtmppath")) {
tmppath = value;
}
}
++it;
}
if (!db_.open(path, mode)) return false;
tmppath_ = tmppath;
rcomp_ = LEXICALCOMP;
BasicDB* idb = &db_;
if (typeid(db_) == typeid(PolyDB)) {
PolyDB* pdb = (PolyDB*)idb;
idb = pdb->reveal_inner_db();
}
const std::type_info& info = typeid(*idb);
if (info == typeid(GrassDB)) {
GrassDB* gdb = (GrassDB*)idb;
rcomp_ = gdb->rcomp();
} else if (info == typeid(TreeDB)) {
TreeDB* tdb = (TreeDB*)idb;
rcomp_ = tdb->rcomp();
} else if (info == typeid(ForestDB)) {
ForestDB* fdb = (ForestDB*)idb;
rcomp_ = fdb->rcomp();
}
dbnum_ = dbnum < MAXDBNUM ? dbnum : MAXDBNUM;
dbclock_ = 0;
if ((mode & BasicDB::OWRITER) && dbnum > 0) {
tmpdbs_ = new BasicDB*[dbnum_];
if (tmppath_.empty()) {
report(_KCCODELINE_, "started to open temporary databases on memory");
double stime = time();
for (size_t i = 0; i < dbnum_; i++) {
GrassDB* gdb = new GrassDB;
gdb->tune_options(GrassDB::TCOMPRESS);
gdb->tune_buckets(DBBNUM / 2);
gdb->tune_page(DBPSIZ);
gdb->tune_page_cache(DBPCCAP);
gdb->tune_comparator(rcomp_);
gdb->open("%", GrassDB::OWRITER | GrassDB::OCREATE | GrassDB::OTRUNCATE);
tmpdbs_[i] = gdb;
}
double etime = time();
report(_KCCODELINE_, "opening temporary databases finished: time=%.6f", etime - stime);
} else {
File::Status sbuf;
if (!File::status(tmppath_, &sbuf) || !sbuf.isdir) {
set_error(_KCCODELINE_, BasicDB::Error::NOREPOS, "no such directory");
delete[] tmpdbs_;
db_.close();
return false;
}
report(_KCCODELINE_, "started to open temporary databases under %s", tmppath.c_str());
double stime = time();
uint32_t pid = getpid() & UINT16MAX;
uint32_t tid = Thread::hash() & UINT16MAX;
uint32_t ts = time() * 1000;
bool err = false;
for (size_t i = 0; i < dbnum_; i++) {
std::string childpath =