greg/stasis-bLSM
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

more iterator renaming; also, getnext() -> next_callerFrees()

Browse source 
git-svn-id: svn+ssh://svn.corp.yahoo.com/yahoo/yrl/labs/pnuts/code/logstore@679 8dad8b1f-cf64-0410-95b6-bcf113ffbcfe
This commit is contained in:
sears 2010-03-09 19:02:54 +00:00
parent 76cd6a26c7
commit 1f2f4c745b
6 changed files with 112 additions and 107 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
logiterators.cpp
View file

@ -104,7 +104,7 @@ void diskTreeIterator<TUPLE>::init_helper(TUPLE* key1)
} }
template <class TUPLE> template <class TUPLE>
TUPLE * diskTreeIterator<TUPLE>::getnext() TUPLE * diskTreeIterator<TUPLE>::next_callerFrees()
{ {
if(!this->lsmIterator_) { return NULL; } if(!this->lsmIterator_) { return NULL; }

2
logiterators.h
View file

@ -21,7 +21,7 @@ public:
~diskTreeIterator(); ~diskTreeIterator();
TUPLE * getnext(); TUPLE * next_callerFrees();
private: private:
void init_iterators(TUPLE * key1, TUPLE * key2); void init_iterators(TUPLE * key1, TUPLE * key2);

33
logstore.h
View file

@ -160,7 +160,7 @@ public:
current_[0] = first_iter_->getnext(); current_[0] = first_iter_->getnext();
for(int i = 1; i < num_iters_; i++) { for(int i = 1; i < num_iters_; i++) {
iters_[i-1] = iters[i-1]; iters_[i-1] = iters[i-1];
current_[i] = iters_[i-1]->getnext(); current_[i] = iters_[i-1]->next_callerFrees();
} }
} }
~mergeManyIterator() { ~mergeManyIterator() {
@ -190,7 +190,7 @@ public:
if(last_iter_ == 0) { if(last_iter_ == 0) {
current_[last_iter_] = first_iter_->getnext(); current_[last_iter_] = first_iter_->getnext();
} else if(last_iter_ != -1){ } else if(last_iter_ != -1){
current_[last_iter_] = iters_[last_iter_-1]->getnext(); current_[last_iter_] = iters_[last_iter_-1]->next_callerFrees();
} else { } else {
// last call was 'peek' // last call was 'peek'
} }
@ -224,7 +224,7 @@ public:
// advance the iterators that match the tuple we're returning. // advance the iterators that match the tuple we're returning.
for(int i = 0; i < num_dups; i++) { for(int i = 0; i < num_dups; i++) {
TUPLE::freetuple(current_[dups[i]]); // should never be null TUPLE::freetuple(current_[dups[i]]); // should never be null
current_[dups[i]] = iters_[dups[i]-1]->getnext(); current_[dups[i]] = iters_[dups[i]-1]->next_callerFrees();
} }
last_iter_ = min; // mark the min iter to be advance at the next invocation of next(). This saves us a copy in the non-merging case. last_iter_ = min; // mark the min iter to be advance at the next invocation of next(). This saves us a copy in the non-merging case.
return ret; return ret;
@ -330,10 +330,13 @@ private:
logtable * ltable; logtable * ltable;
uint64_t epoch; uint64_t epoch;
typedef mergeManyIterator< typedef mergeManyIterator<
typename memTreeComponent<TUPLE>::changingMemTreeIterator, typename memTreeComponent<TUPLE>::revalidatingIterator,
typename memTreeComponent<TUPLE>::memTreeIterator, TUPLE> inner_merge_it_t; typename memTreeComponent<TUPLE>::iterator,
// typedef mergeManyIterator<memTreeIterator<memTreeComponent::rbtree_t, TUPLE>, diskTreeIterator<TUPLE>, TUPLE> merge_it_t; TUPLE> inner_merge_it_t;
typedef mergeManyIterator<inner_merge_it_t, diskTreeIterator<TUPLE>, TUPLE> merge_it_t; typedef mergeManyIterator<
inner_merge_it_t,
diskTreeIterator<TUPLE>,
TUPLE> merge_it_t;
merge_it_t* merge_it_; merge_it_t* merge_it_;
@ -350,25 +353,25 @@ private:
void validate() { void validate() {
typename memTreeComponent<TUPLE>::changingMemTreeIterator * c0_it; typename memTreeComponent<TUPLE>::revalidatingIterator * c0_it;
typename memTreeComponent<TUPLE>::memTreeIterator *c0_mergeable_it[1]; typename memTreeComponent<TUPLE>::iterator *c0_mergeable_it[1];
diskTreeIterator<TUPLE> * disk_it[3]; diskTreeIterator<TUPLE> * disk_it[3];
epoch = ltable->get_epoch(); epoch = ltable->get_epoch();
if(last_returned) { if(last_returned) {
c0_it = new typename memTreeComponent<TUPLE>::changingMemTreeIterator(ltable->get_tree_c0(), ltable->getMergeData()->rbtree_mut, last_returned); c0_it = new typename memTreeComponent<TUPLE>::revalidatingIterator(ltable->get_tree_c0(), ltable->getMergeData()->rbtree_mut, last_returned);
c0_mergeable_it[0] = new typename memTreeComponent<TUPLE>::memTreeIterator (ltable->get_tree_c0_mergeable(), last_returned); c0_mergeable_it[0] = new typename memTreeComponent<TUPLE>::iterator (ltable->get_tree_c0_mergeable(), last_returned);
disk_it[0] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1(), *last_returned); disk_it[0] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1(), *last_returned);
disk_it[1] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1_mergeable(), *last_returned); disk_it[1] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1_mergeable(), *last_returned);
disk_it[2] = new diskTreeIterator<TUPLE> (ltable->get_tree_c2(), *last_returned); disk_it[2] = new diskTreeIterator<TUPLE> (ltable->get_tree_c2(), *last_returned);
} else if(key) { } else if(key) {
c0_it = new typename memTreeComponent<TUPLE>::changingMemTreeIterator(ltable->get_tree_c0(), ltable->getMergeData()->rbtree_mut, key); c0_it = new typename memTreeComponent<TUPLE>::revalidatingIterator(ltable->get_tree_c0(), ltable->getMergeData()->rbtree_mut, key);
c0_mergeable_it[0] = new typename memTreeComponent<TUPLE>::memTreeIterator (ltable->get_tree_c0_mergeable(), key); c0_mergeable_it[0] = new typename memTreeComponent<TUPLE>::iterator (ltable->get_tree_c0_mergeable(), key);
disk_it[0] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1(), *key); disk_it[0] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1(), *key);
disk_it[1] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1_mergeable(), *key); disk_it[1] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1_mergeable(), *key);
disk_it[2] = new diskTreeIterator<TUPLE> (ltable->get_tree_c2(), *key); disk_it[2] = new diskTreeIterator<TUPLE> (ltable->get_tree_c2(), *key);
} else { } else {
c0_it = new typename memTreeComponent<TUPLE>::changingMemTreeIterator(ltable->get_tree_c0(), ltable->getMergeData()->rbtree_mut ); c0_it = new typename memTreeComponent<TUPLE>::revalidatingIterator(ltable->get_tree_c0(), ltable->getMergeData()->rbtree_mut );
c0_mergeable_it[0] = new typename memTreeComponent<TUPLE>::memTreeIterator (ltable->get_tree_c0_mergeable() ); c0_mergeable_it[0] = new typename memTreeComponent<TUPLE>::iterator (ltable->get_tree_c0_mergeable() );
disk_it[0] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1() ); disk_it[0] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1() );
disk_it[1] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1_mergeable() ); disk_it[1] = new diskTreeIterator<TUPLE> (ltable->get_tree_c1_mergeable() );
disk_it[2] = new diskTreeIterator<TUPLE> (ltable->get_tree_c2() ); disk_it[2] = new diskTreeIterator<TUPLE> (ltable->get_tree_c2() );

41
memTreeComponent.h
View file

@ -10,33 +10,33 @@ public:
static void tearDownTree(rbtree_ptr_t t); static void tearDownTree(rbtree_ptr_t t);
////////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////
// memTreeIterator // Plain iterator; cannot cope with changes to underlying tree
///////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////
class memTreeIterator class iterator
{ {
private: private:
typedef typename rbtree_t::const_iterator MTITER; typedef typename rbtree_t::const_iterator MTITER;
public: public:
memTreeIterator( rbtree_t *s ) iterator( rbtree_t *s )
: first_(true), : first_(true),
done_(s == NULL) { done_(s == NULL) {
init_iterators(s, NULL, NULL); init_iterators(s, NULL, NULL);
} }
memTreeIterator( rbtree_t *s, TUPLE *&key ) iterator( rbtree_t *s, TUPLE *&key )
: first_(true), done_(s == NULL) { : first_(true), done_(s == NULL) {
init_iterators(s, key, NULL); init_iterators(s, key, NULL);
} }
~memTreeIterator() { ~iterator() {
delete it_; delete it_;
delete itend_; delete itend_;
} }
TUPLE* getnext() { TUPLE* next_callerFrees() {
if(done_) { return NULL; } if(done_) { return NULL; }
if(first_) { first_ = 0;} else { (*it_)++; } if(first_) { first_ = 0;} else { (*it_)++; }
if(*it_==*itend_) { done_= true; return NULL; } if(*it_==*itend_) { done_= true; return NULL; }
@ -63,9 +63,9 @@ public:
itend_ = NULL; itend_ = NULL;
} }
} }
explicit memTreeIterator() { abort(); } explicit iterator() { abort(); }
void operator=(memTreeIterator & t) { abort(); } void operator=(iterator & t) { abort(); }
int operator-(memTreeIterator & t) { abort(); } int operator-(iterator & t) { abort(); }
private: private:
bool first_; bool first_;
bool done_; bool done_;
@ -73,13 +73,18 @@ public:
MTITER *itend_; MTITER *itend_;
}; };
class changingMemTreeIterator ///////////////////////////////////////////////////////////////
// Revalidating iterator; automatically copes with changes to underlying tree
///////////////////////////////////////////////////////////////
class revalidatingIterator
{ {
private: private:
typedef typename rbtree_t::const_iterator MTITER; typedef typename rbtree_t::const_iterator MTITER;
public: public:
changingMemTreeIterator( rbtree_t *s, pthread_mutex_t * rb_mut ) : s_(s), mut_(rb_mut) { revalidatingIterator( rbtree_t *s, pthread_mutex_t * rb_mut ) : s_(s), mut_(rb_mut) {
pthread_mutex_lock(mut_); pthread_mutex_lock(mut_);
if(s_->begin() == s_->end()) { if(s_->begin() == s_->end()) {
next_ret_ = NULL; next_ret_ = NULL;
@ -88,7 +93,7 @@ public:
} }
pthread_mutex_unlock(mut_); pthread_mutex_unlock(mut_);
} }
changingMemTreeIterator( rbtree_t *s, pthread_mutex_t * rb_mut, TUPLE *&key ) : s_(s), mut_(rb_mut) { revalidatingIterator( rbtree_t *s, pthread_mutex_t * rb_mut, TUPLE *&key ) : s_(s), mut_(rb_mut) {
pthread_mutex_lock(mut_); pthread_mutex_lock(mut_);
if(key) { if(key) {
if(s_->find(key) != s_->end()) { if(s_->find(key) != s_->end()) {
@ -109,7 +114,7 @@ public:
pthread_mutex_unlock(mut_); pthread_mutex_unlock(mut_);
} }
~changingMemTreeIterator() { ~revalidatingIterator() {
if(next_ret_) datatuple::freetuple(next_ret_); if(next_ret_) datatuple::freetuple(next_ret_);
} }
@ -128,9 +133,9 @@ public:
} }
private: private:
explicit changingMemTreeIterator() { abort(); } explicit revalidatingIterator() { abort(); }
void operator=(changingMemTreeIterator & t) { abort(); } void operator=(revalidatingIterator & t) { abort(); }
int operator-(changingMemTreeIterator & t) { abort(); } int operator-(revalidatingIterator & t) { abort(); }
rbtree_t *s_; rbtree_t *s_;
TUPLE * next_ret_; TUPLE * next_ret_;

17
merger.cpp
View file

@ -335,8 +335,8 @@ void* memMergeThread(void*arg)
//create the iterators //create the iterators
diskTreeIterator<datatuple> *itrA = new diskTreeIterator<datatuple>(ltable->get_tree_c1()->get_root_rec()); // XXX don't want get_root_rec() to be here. diskTreeIterator<datatuple> *itrA = new diskTreeIterator<datatuple>(ltable->get_tree_c1()->get_root_rec()); // XXX don't want get_root_rec() to be here.
memTreeComponent<datatuple>::memTreeIterator *itrB = memTreeComponent<datatuple>::iterator *itrB =
new memTreeComponent<datatuple>::memTreeIterator(ltable->get_tree_c0_mergeable()); new memTreeComponent<datatuple>::iterator(ltable->get_tree_c0_mergeable());
//create a new tree //create a new tree
@ -573,14 +573,14 @@ void merge_iterators(int xid,
DataPage<datatuple> *dp = 0; DataPage<datatuple> *dp = 0;
datatuple *t1 = itrA->getnext(); datatuple *t1 = itrA->next_callerFrees();
if(t1) { if(t1) {
stats->num_tuples_in_large++; stats->num_tuples_in_large++;
stats->bytes_in_large += t1->byte_length(); stats->bytes_in_large += t1->byte_length();
} }
datatuple *t2 = 0; datatuple *t2 = 0;
while( (t2=itrB->getnext()) != 0) while( (t2=itrB->next_callerFrees()) != 0)
{ {
stats->num_tuples_in_small++; stats->num_tuples_in_small++;
stats->bytes_in_small += t2->byte_length(); stats->bytes_in_small += t2->byte_length();
@ -596,7 +596,7 @@ void merge_iterators(int xid,
datatuple::freetuple(t1); datatuple::freetuple(t1);
stats->num_tuples_out++; stats->num_tuples_out++;
//advance itrA //advance itrA
t1 = itrA->getnext(); t1 = itrA->next_callerFrees();
if(t1) { if(t1) {
stats->num_tuples_in_large++; stats->num_tuples_in_large++;
stats->bytes_in_large += t1->byte_length(); stats->bytes_in_large += t1->byte_length();
@ -612,7 +612,7 @@ void merge_iterators(int xid,
dp = insertTuple(xid, dp, mtuple, ltable, scratch_tree, stats); dp = insertTuple(xid, dp, mtuple, ltable, scratch_tree, stats);
datatuple::freetuple(t1); datatuple::freetuple(t1);
t1 = itrA->getnext(); //advance itrA t1 = itrA->next_callerFrees(); //advance itrA
if(t1) { if(t1) {
stats->num_tuples_in_large++; stats->num_tuples_in_large++;
stats->bytes_in_large += t1->byte_length(); stats->bytes_in_large += t1->byte_length();
@ -637,7 +637,7 @@ void merge_iterators(int xid,
datatuple::freetuple(t1); datatuple::freetuple(t1);
stats->num_tuples_out++; stats->num_tuples_out++;
//advance itrA //advance itrA
t1 = itrA->getnext(); t1 = itrA->next_callerFrees();
if(t1) { if(t1) {
stats->num_tuples_in_large++; stats->num_tuples_in_large++;
stats->bytes_in_large += t1->byte_length(); stats->bytes_in_large += t1->byte_length();
@ -672,6 +672,3 @@ insertTuple(int xid, DataPage<datatuple> *dp, datatuple *t,
return dp; return dp;
} }

2
test/check_logtable.cpp
View file

@ -121,7 +121,7 @@ void insertProbeIter(size_t NUM_ENTRIES)
datatuple *dt=0; datatuple *dt=0;
while( (dt=tree_itr.getnext()) != NULL) while( (dt=tree_itr.next_callerFrees()) != NULL)
{ {
assert(dt->keylen() == key_arr[tuplenum].length()+1); assert(dt->keylen() == key_arr[tuplenum].length()+1);
assert(dt->datalen() == data_arr[tuplenum].length()+1); assert(dt->datalen() == data_arr[tuplenum].length()+1);