e1c937a602
git-svn-id: svn+ssh://svn.corp.yahoo.com/yahoo/yrl/labs/pnuts/code/logstore@698 8dad8b1f-cf64-0410-95b6-bcf113ffbcfe
137 lines
3.4 KiB
C++
137 lines
3.4 KiB
C++
|
|
#include <string>
|
|
#include <vector>
|
|
#include <iostream>
|
|
#include <sstream>
|
|
#include "logstore.h"
|
|
#include "datapage.h"
|
|
#include <assert.h>
|
|
#include <limits.h>
|
|
#include <math.h>
|
|
#include <pthread.h>
|
|
#include <sys/time.h>
|
|
#include <time.h>
|
|
|
|
#include <stasis/transactional.h>
|
|
#undef begin
|
|
#undef end
|
|
|
|
#include "check_util.h"
|
|
|
|
void insertProbeIter(size_t NUM_ENTRIES)
|
|
{
|
|
srand(1000);
|
|
unlink("storefile.txt");
|
|
unlink("logfile.txt");
|
|
|
|
sync();
|
|
|
|
diskTreeComponent::internalNodes::init_stasis();
|
|
|
|
int xid = Tbegin();
|
|
|
|
logtable<datatuple> ltable(1000, 10000, 5);
|
|
recordid table_root = ltable.allocTable(xid);
|
|
|
|
Tcommit(xid);
|
|
|
|
xid = Tbegin();
|
|
diskTreeComponent *ltable_c1 = ltable.get_tree_c1();
|
|
|
|
std::vector<std::string> data_arr;
|
|
std::vector<std::string> key_arr;
|
|
preprandstr(NUM_ENTRIES, data_arr, 5*4096, true);
|
|
preprandstr(NUM_ENTRIES+200, key_arr, 50, true);//well i can handle upto 200
|
|
|
|
std::sort(key_arr.begin(), key_arr.end(), &mycmp);
|
|
|
|
removeduplicates(key_arr);
|
|
if(key_arr.size() > NUM_ENTRIES)
|
|
key_arr.erase(key_arr.begin()+NUM_ENTRIES, key_arr.end());
|
|
|
|
NUM_ENTRIES=key_arr.size();
|
|
|
|
if(data_arr.size() > NUM_ENTRIES)
|
|
data_arr.erase(data_arr.begin()+NUM_ENTRIES, data_arr.end());
|
|
|
|
printf("Stage 1: Writing %d keys\n", NUM_ENTRIES);
|
|
|
|
merge_stats_t *stats = (merge_stats_t*)calloc(sizeof(stats), 1);
|
|
|
|
for(size_t i = 0; i < NUM_ENTRIES; i++)
|
|
{
|
|
//prepare the tuple
|
|
datatuple* newtuple = datatuple::create(key_arr[i].c_str(), key_arr[i].length()+1, data_arr[i].c_str(), data_arr[i].length()+1);
|
|
|
|
stats->bytes_in_small += newtuple->byte_length();
|
|
|
|
ltable_c1->insertTuple(xid, newtuple, stats);
|
|
|
|
datatuple::freetuple(newtuple);
|
|
}
|
|
printf("\nTREE STRUCTURE\n");
|
|
ltable_c1->print_tree(xid);
|
|
|
|
printf("Total data set length: %lld\n", stats->bytes_in_small);
|
|
printf("Storage utilization: %.2f\n", (stats->bytes_in_small+.0) / (1.0* stats->bytes_out));
|
|
printf("Number of datapages: %lld\n", (long long)stats->num_datapages_out);
|
|
printf("Writes complete.\n");
|
|
|
|
ltable_c1->writes_done();
|
|
|
|
Tcommit(xid);
|
|
xid = Tbegin();
|
|
|
|
printf("Stage 2: Sequentially reading %d tuples\n", NUM_ENTRIES);
|
|
|
|
size_t tuplenum = 0;
|
|
diskTreeComponent::iterator * tree_itr = ltable_c1->open_iterator();
|
|
|
|
|
|
datatuple *dt=0;
|
|
while( (dt=tree_itr->next_callerFrees()) != NULL)
|
|
{
|
|
assert(dt->keylen() == key_arr[tuplenum].length()+1);
|
|
assert(dt->datalen() == data_arr[tuplenum].length()+1);
|
|
tuplenum++;
|
|
datatuple::freetuple(dt);
|
|
dt = 0;
|
|
}
|
|
delete(tree_itr);
|
|
assert(tuplenum == key_arr.size());
|
|
|
|
printf("Sequential Reads completed.\n");
|
|
|
|
int rrsize=key_arr.size() / 3;
|
|
printf("Stage 3: Randomly reading %d tuples by key\n", rrsize);
|
|
|
|
for(int i=0; i<rrsize; i++)
|
|
{
|
|
//randomly pick a key
|
|
int ri = rand()%key_arr.size();
|
|
|
|
datatuple *dt = ltable_c1->findTuple(xid, (const datatuple::key_t) key_arr[ri].c_str(), (size_t)key_arr[ri].length()+1);
|
|
|
|
assert(dt!=0);
|
|
assert(dt->keylen() == key_arr[ri].length()+1);
|
|
assert(dt->datalen() == data_arr[ri].length()+1);
|
|
datatuple::freetuple(dt);
|
|
dt = 0;
|
|
}
|
|
|
|
printf("Random Reads completed.\n");
|
|
Tcommit(xid);
|
|
diskTreeComponent::internalNodes::deinit_stasis();
|
|
}
|
|
|
|
/** @test
|
|
*/
|
|
int main()
|
|
{
|
|
insertProbeIter(15000);
|
|
|
|
|
|
|
|
return 0;
|
|
}
|
|
|