940a6da6fe
The tests now pass, except that check_merge never terminates (it takes too long) and check_mergelarge still is not passing. For better luck running this version of the code, turn off stasis' concurrent buffer manager. We're doing something bad that leads to deadlocks with the concurrent buffer manager. Another (the same?) bug less-frequently leads to page corruption with the old stasis buffer manager. git-svn-id: svn+ssh://svn.corp.yahoo.com/yahoo/yrl/labs/pnuts/code/logstore@556 8dad8b1f-cf64-0410-95b6-bcf113ffbcfe
158 lines
3.7 KiB
C++
158 lines
3.7 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 "check_util.h"
|
|
|
|
#undef begin
|
|
#undef end
|
|
|
|
template class DataPage<datatuple>;
|
|
|
|
|
|
void insertProbeIter(size_t NUM_ENTRIES)
|
|
{
|
|
srand(1000);
|
|
unlink("storefile.txt");
|
|
unlink("logfile.txt");
|
|
|
|
sync();
|
|
|
|
bufferManagerNonBlockingSlowHandleType = IO_HANDLE_PFILE;
|
|
|
|
Tinit();
|
|
|
|
int xid = Tbegin();
|
|
|
|
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());
|
|
|
|
//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);
|
|
//}
|
|
|
|
|
|
|
|
recordid alloc_state = Talloc(xid,sizeof(RegionAllocConf_t));
|
|
|
|
Tset(xid,alloc_state, &logtree::REGION_ALLOC_STATIC_INITIALIZER);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
printf("Stage 1: Writing %d keys\n", NUM_ENTRIES);
|
|
|
|
int pcount = 10;
|
|
int dpages = 0;
|
|
DataPage<datatuple> *dp=0;
|
|
int64_t datasize = 0;
|
|
std::vector<pageid_t> dsp;
|
|
for(size_t i = 0; i < NUM_ENTRIES; i++)
|
|
{
|
|
//prepare the key
|
|
datatuple *newtuple = datatuple::create(key_arr[i].c_str(), key_arr[i].length()+1, data_arr[i].c_str(), data_arr[i].length()+1);
|
|
|
|
/*
|
|
printf("key: \t, keylen: %u\ndata: datalen: %u\n",
|
|
//newtuple.key,
|
|
*newtuple.keylen,
|
|
//newtuple.data,
|
|
*newtuple.datalen);
|
|
*/
|
|
datasize += newtuple->byte_length();
|
|
if(dp==NULL || !dp->append(xid, newtuple))
|
|
{
|
|
dpages++;
|
|
if(dp)
|
|
delete dp;
|
|
|
|
dp = new DataPage<datatuple>(xid, pcount, &DataPage<datatuple>::dp_alloc_region_rid, &alloc_state );
|
|
|
|
if(!dp->append(xid, newtuple))
|
|
{
|
|
delete dp;
|
|
dp = new DataPage<datatuple>(xid, pcount, &DataPage<datatuple>::dp_alloc_region_rid, &alloc_state );
|
|
assert(dp->append(xid, newtuple));
|
|
}
|
|
|
|
dsp.push_back(dp->get_start_pid());
|
|
}
|
|
|
|
|
|
}
|
|
|
|
printf("Total data set length: %lld\n", (long long)datasize);
|
|
printf("Storage utilization: %.2f\n", (datasize+.0) / (PAGE_SIZE * pcount * dpages));
|
|
printf("Number of datapages: %d\n", dpages);
|
|
printf("Writes complete.\n");
|
|
|
|
Tcommit(xid);
|
|
xid = Tbegin();
|
|
|
|
|
|
printf("Stage 2: Reading %d tuples\n", NUM_ENTRIES);
|
|
|
|
|
|
int tuplenum = 0;
|
|
for(int i = 0; i < dpages ; i++)
|
|
{
|
|
DataPage<datatuple> dp(xid, dsp[i]);
|
|
DataPage<datatuple>::RecordIterator itr = dp.begin();
|
|
datatuple *dt=0;
|
|
while( (dt=itr.getnext(xid)) != NULL)
|
|
{
|
|
assert(dt->keylen() == key_arr[tuplenum].length()+1);
|
|
assert(dt->datalen() == data_arr[tuplenum].length()+1);
|
|
tuplenum++;
|
|
datatuple::freetuple(dt);
|
|
dt = 0;
|
|
}
|
|
|
|
}
|
|
|
|
printf("Reads completed.\n");
|
|
|
|
Tcommit(xid);
|
|
Tdeinit();
|
|
}
|
|
|
|
|
|
/** @test
|
|
*/
|
|
int main()
|
|
{
|
|
insertProbeIter(10000);
|
|
|
|
|
|
|
|
return 0;
|
|
}
|
|
|