// performance and memory leak testing.
int test3(const int64_t& max, int unit, int block)
{
Cache cache;
cache.setMaxCacheSize(max);
cache.setCacheBlockSize(unit);
const string filename = "testfile";
const int64_t size = unit * 100;
const int64_t timestamp = 101;
cache.update(filename, timestamp, size);
for (int i = 0; i < 100; ++ i)
{
char* buf = new char[block];
cache.insert(buf, filename, block * i, block);
}
assert(cache.getCacheSize() <= max);
char* buf = new char[unit];
for (int i = 0; i < 100; ++ i)
{
cache.read(filename, buf, block * i, block);
}
cout << "performance and memory leak testing passed.\n";
return 0;
}
// Test IO data cache
int test2()
{
Cache cache;
cache.setCacheBlockSize(200);
const string filename = "testfile";
const int64_t size = 100;
const int64_t timestamp = 101;
cache.update(filename, timestamp, size);
int64_t offset = 200;
int64_t block = 201;
char* buf = new char[block];
*buf = 'z';
cache.insert(buf, filename, offset, block);
char data[block];
int64_t result = cache.read(filename, data, offset, block);
assert((result == block) && (*data == 'z'));
result = cache.read(filename, data, offset, block + 1);
assert(result == block);
// Test large block that cover multiple cache units.
int64_t off2 = 900;
int64_t block2 = 901;
char* large_buf = new char[block2];
cache.insert(large_buf, filename, off2, block2);
char data2[block2];
result = cache.read(filename, data2, off2, block2);
assert(result == block2);
// Read partial data.
result = cache.read(filename, data2, off2 + 50, block2 - 100);
assert(result == block2 - 100);
// Test maximu cache size.
cache.setMaxCacheSize(1000);
// Insert overlapping buffer block.
large_buf = new char[block2];
cache.insert(large_buf, filename, off2, block2);
large_buf = new char[block2];
cache.insert(large_buf, filename, off2, block2);
// Cache should constain most recent block only,
assert(cache.getCacheSize() == 901);
cout << "IO cache check passed.\n";
return 0;
}
