b52dbe0636
git-svn-id: svn+ssh://svn.corp.yahoo.com/yahoo/yrl/labs/pnuts/code/logstore@3786 8dad8b1f-cf64-0410-95b6-bcf113ffbcfe
264 lines
6.7 KiB
C++
264 lines
6.7 KiB
C++
/*
|
|
* check_logtree.cpp
|
|
*
|
|
* Copyright 2009-2012 Yahoo! Inc.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*
|
|
* Author: makdere
|
|
*/
|
|
#include <string>
|
|
#include <vector>
|
|
#include <iostream>
|
|
#include <algorithm>
|
|
#include <sstream>
|
|
#include "bLSM.h"
|
|
#include "regionAllocator.h"
|
|
#include "diskTreeComponent.h"
|
|
|
|
#include <assert.h>
|
|
#include <limits.h>
|
|
#include <math.h>
|
|
#include <pthread.h>
|
|
#include <sys/time.h>
|
|
#include <time.h>
|
|
|
|
#define LOG_NAME "check_logTree.log"
|
|
#define NUM_ENTRIES_A 10000
|
|
#define NUM_ENTRIES_B 10
|
|
#define NUM_ENTRIES_C 0
|
|
|
|
#define OFFSET (NUM_ENTRIES * 10)
|
|
|
|
#include <stasis/transactional.h>
|
|
#undef begin
|
|
#undef end
|
|
|
|
#include "check_util.h"
|
|
|
|
void insertProbeIter_str(int NUM_ENTRIES)
|
|
{
|
|
srand(1000);
|
|
unlink("storefile.txt");
|
|
unlink("logfile.txt");
|
|
system("rm -rf stasis_log/");
|
|
sync();
|
|
|
|
bLSM::init_stasis();
|
|
|
|
int xid = Tbegin();
|
|
|
|
Tcommit(xid);
|
|
|
|
xid = Tbegin();
|
|
diskTreeComponent::internalNodes *lt = new diskTreeComponent::internalNodes(xid, 1000, 10000, 40);
|
|
|
|
long oldpagenum = -1;
|
|
|
|
std::vector<std::string> arr;
|
|
preprandstr(NUM_ENTRIES, arr, 50, false);
|
|
std::sort(arr.begin(), arr.end(), &mycmp);
|
|
|
|
//for(int i = 0; i < NUM_ENTRIES; i++)
|
|
//{
|
|
// printf("%s\t", arr[i].c_str());
|
|
// int keylen = arr[i].length()+1;
|
|
// printf("%d\n", keylen);
|
|
//}
|
|
|
|
|
|
printf("Stage 1: Writing %d keys\n", NUM_ENTRIES);
|
|
|
|
|
|
for(int i = 0; i < NUM_ENTRIES; i++)
|
|
{
|
|
int keylen = arr[i].length()+1;
|
|
byte *currkey = (byte*)malloc(keylen);
|
|
for(int j=0; j<keylen-1; j++)
|
|
currkey[j] = arr[i][j];
|
|
currkey[keylen-1]='\0';
|
|
|
|
//printf("\n#########\ni=%d\nkey:\t%s\nkeylen:%d\n",i,((char*)currkey),keylen);
|
|
long pagenum = lt->findPage(xid, currkey, keylen);
|
|
//printf("pagenum:%d\n", pagenum);
|
|
assert(pagenum == -1 || pagenum == oldpagenum || oldpagenum == -1);
|
|
//printf("TlsmAppendPage %d\n",i);
|
|
|
|
lt->appendPage(xid, currkey, keylen, i + OFFSET);
|
|
|
|
pagenum = lt->findPage(xid, currkey,keylen);
|
|
oldpagenum = pagenum;
|
|
//printf("pagenum:%d\n", pagenum);
|
|
assert(pagenum == i + OFFSET);
|
|
free(currkey);
|
|
|
|
|
|
}
|
|
|
|
printf("Writes complete.");
|
|
|
|
Tcommit(xid);
|
|
xid = Tbegin();
|
|
|
|
printf("\nTREE STRUCTURE\n");
|
|
lt->print_tree(xid);
|
|
|
|
printf("Stage 2: Looking up %d keys\n", NUM_ENTRIES);
|
|
|
|
for(int i = 0; i < NUM_ENTRIES; i++) {
|
|
int keylen = arr[i].length()+1;
|
|
byte *currkey = (byte*)malloc(keylen);
|
|
for(int j=0; j<keylen-1; j++)
|
|
currkey[j] = arr[i][j];
|
|
currkey[keylen-1]='\0';
|
|
|
|
//printf("\n#########\ni=%d\nkey:\t%s\nkeylen:%d\n",i,((char*)currkey),keylen);
|
|
long pagenum = lt->findPage(xid, currkey, keylen);
|
|
//printf("pagenum:%d\n", pagenum);
|
|
assert(pagenum == i + OFFSET);
|
|
free(currkey);
|
|
}
|
|
|
|
|
|
printf("Stage 3: Iterating over %d keys\n", NUM_ENTRIES);
|
|
|
|
|
|
int64_t count = 0;
|
|
regionAllocator * ro_alloc = new regionAllocator();
|
|
diskTreeComponent::internalNodes::iterator * it = new diskTreeComponent::internalNodes::iterator(xid, ro_alloc, lt->get_root_rec());
|
|
|
|
while(it->next()) {
|
|
byte * key;
|
|
byte **key_ptr = &key;
|
|
size_t keysize = it->key((byte**)key_ptr);
|
|
|
|
pageid_t *value;
|
|
pageid_t **value_ptr = &value;
|
|
size_t valsize = it->value((byte**)value_ptr);
|
|
assert(valsize == sizeof(pageid_t));
|
|
assert(!mycmp(std::string((char*)key), arr[count]) && !mycmp(arr[count],std::string((char*)key)));
|
|
assert(keysize == arr[count].length()+1);
|
|
count++;
|
|
}
|
|
assert(count == NUM_ENTRIES);
|
|
|
|
it->close();
|
|
delete it;
|
|
delete ro_alloc;
|
|
Tcommit(xid);
|
|
bLSM::deinit_stasis();
|
|
}
|
|
|
|
|
|
|
|
|
|
void insertProbeIter_int(int NUM_ENTRIES)
|
|
{
|
|
|
|
unlink("storefile.txt");
|
|
unlink("logfile.txt");
|
|
|
|
sync();
|
|
|
|
Tinit();
|
|
|
|
int xid = Tbegin();
|
|
|
|
Tcommit(xid);
|
|
|
|
xid = Tbegin();
|
|
diskTreeComponent::internalNodes *lt = new diskTreeComponent::internalNodes(xid, 1000, 10000, 40);
|
|
|
|
long oldpagenum = -1;
|
|
|
|
for(int32_t i = 0; i < NUM_ENTRIES; i++) {
|
|
int keylen = sizeof(int32_t);
|
|
byte *currkey = (byte*)malloc(keylen);
|
|
memcpy(currkey, (byte*)(&i), keylen);
|
|
//currkey[]='\0';
|
|
|
|
printf("\n#########\ni=%d\nkey:\t%d\nkeylen:%d\n",i,*((int32_t*)currkey),keylen);
|
|
pageid_t pagenum = lt->findPage(xid, currkey, keylen);
|
|
printf("pagenum:%lld\n", (long long)pagenum);
|
|
assert(pagenum == -1 || pagenum == oldpagenum || oldpagenum == -1);
|
|
printf("TlsmAppendPage %d\n",i);
|
|
|
|
lt->appendPage(xid, currkey, keylen, i + OFFSET);
|
|
|
|
pagenum = lt->findPage(xid, currkey,keylen);
|
|
oldpagenum = pagenum;
|
|
printf("pagenum:%lld\n", (long long)pagenum);
|
|
assert(pagenum == i + OFFSET);
|
|
free(currkey);
|
|
}
|
|
|
|
printf("Writes complete.");
|
|
|
|
Tcommit(xid);
|
|
xid = Tbegin();
|
|
|
|
printf("\nTREE STRUCTURE\n");
|
|
lt->print_tree(xid);
|
|
|
|
for(int32_t i = 1; i < NUM_ENTRIES; i++) {
|
|
int keylen = sizeof(int32_t);
|
|
byte *currkey = (byte*)malloc(keylen);
|
|
memcpy(currkey, (byte*)(&i), keylen);
|
|
|
|
printf("\n#########\ni=%d\nkey:\t%d\nkeylen:%d\n",i,*((int32_t*)currkey),keylen);
|
|
pageid_t pagenum = lt->findPage(xid, currkey, keylen);
|
|
printf("pagenum:%lld\n", (long long) pagenum);
|
|
assert(pagenum == i + OFFSET);
|
|
free(currkey);
|
|
}
|
|
|
|
/*
|
|
int64_t count = 0;
|
|
|
|
lladdIterator_t * it = lsmTreeIterator_open(xid, tree);
|
|
|
|
while(lsmTreeIterator_next(xid, it)) {
|
|
lsmkey_t * key;
|
|
lsmkey_t **key_ptr = &key;
|
|
int size = lsmTreeIterator_key(xid, it, (byte**)key_ptr);
|
|
assert(size == sizeof(lsmkey_t));
|
|
long *value;
|
|
long **value_ptr = &value;
|
|
size = lsmTreeIterator_value(xid, it, (byte**)value_ptr);
|
|
assert(size == sizeof(pageid_t));
|
|
assert(*key + OFFSET == *value);
|
|
assert(*key == count);
|
|
count++;
|
|
}
|
|
assert(count == NUM_ENTRIES);
|
|
|
|
lsmTreeIterator_close(xid, it);
|
|
|
|
*/
|
|
Tcommit(xid);
|
|
Tdeinit();
|
|
}
|
|
|
|
/** @test
|
|
*/
|
|
int main()
|
|
{
|
|
insertProbeIter_str(NUM_ENTRIES_A);
|
|
//insertProbeIter_int(NUM_ENTRIES_A);
|
|
|
|
|
|
|
|
return 0;
|
|
}
|
|
|
|
|