2014-05-30 11:44:24 -04:00
|
|
|
|
|
|
|
// CopyBlocks.cpp
|
|
|
|
|
|
|
|
// Implements the test for cChunkData::CopyBlockTypes() range copying
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include "Globals.h"
|
|
|
|
#include "ChunkData.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int main(int argc, char ** argv)
|
|
|
|
{
|
|
|
|
// Set up a cChunkData with known contents - all blocks 0x01, all metas 0x02:
|
2014-06-16 10:12:50 -04:00
|
|
|
class cMockAllocationPool
|
|
|
|
: public cAllocationPool<cChunkData::sChunkSection>
|
|
|
|
{
|
|
|
|
virtual cChunkData::sChunkSection * Allocate()
|
|
|
|
{
|
|
|
|
return new cChunkData::sChunkSection();
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void Free(cChunkData::sChunkSection * a_Ptr)
|
|
|
|
{
|
|
|
|
delete a_Ptr;
|
|
|
|
}
|
|
|
|
} Pool;
|
|
|
|
cChunkData Data(Pool);
|
2014-05-30 11:44:24 -04:00
|
|
|
cChunkDef::BlockTypes BlockTypes;
|
|
|
|
cChunkDef::BlockNibbles BlockMetas;
|
|
|
|
memset(BlockTypes, 0x01, sizeof(BlockTypes));
|
|
|
|
memset(BlockMetas, 0x02, sizeof(BlockMetas));
|
|
|
|
Data.SetBlockTypes(BlockTypes);
|
|
|
|
Data.SetMetas(BlockMetas);
|
|
|
|
|
|
|
|
// Try to read varying amounts of blocktypes from the cChunkData.
|
|
|
|
// Verify that the exact amount of memory is copied, by copying to a larger buffer and checking its boundaries
|
|
|
|
BLOCKTYPE TestBuffer[5 * cChunkDef::NumBlocks];
|
|
|
|
size_t WritePosIdx = 2 * cChunkDef::NumBlocks;
|
|
|
|
BLOCKTYPE * WritePosition = &TestBuffer[WritePosIdx];
|
2014-05-30 12:32:15 -04:00
|
|
|
memset(TestBuffer, 0x03, sizeof(TestBuffer));
|
|
|
|
size_t LastReportedStep = 1;
|
|
|
|
for (size_t idx = 0; idx < 5000; idx += 7)
|
2014-05-30 11:44:24 -04:00
|
|
|
{
|
2014-05-30 12:32:15 -04:00
|
|
|
if (idx / 500 != LastReportedStep)
|
2014-05-30 11:44:24 -04:00
|
|
|
{
|
2014-05-30 12:32:15 -04:00
|
|
|
printf("Testing index %u...\n", (unsigned)idx);
|
|
|
|
LastReportedStep = idx / 500;
|
|
|
|
}
|
2014-05-30 11:44:24 -04:00
|
|
|
|
2014-05-30 12:32:15 -04:00
|
|
|
for (size_t len = 3; len < 1000; len += 13)
|
|
|
|
{
|
2014-05-30 11:44:24 -04:00
|
|
|
Data.CopyBlockTypes(WritePosition, idx, len);
|
|
|
|
|
|
|
|
// Verify the data copied:
|
|
|
|
for (size_t i = 0; i < len; i++)
|
|
|
|
{
|
|
|
|
assert_test(WritePosition[i] == 0x01);
|
|
|
|
}
|
|
|
|
// Verify the space before the copied data hasn't been changed:
|
2014-05-30 12:13:36 -04:00
|
|
|
for (size_t i = 0; i < WritePosIdx; i++)
|
2014-05-30 11:44:24 -04:00
|
|
|
{
|
|
|
|
assert_test(TestBuffer[i] == 0x03);
|
|
|
|
}
|
|
|
|
// Verify the space after the copied data hasn't been changed:
|
|
|
|
for (size_t i = WritePosIdx + idx + len; i < ARRAYCOUNT(TestBuffer); i++)
|
|
|
|
{
|
|
|
|
assert_test(TestBuffer[i] == 0x03);
|
|
|
|
}
|
2014-05-30 12:32:15 -04:00
|
|
|
|
|
|
|
// Re-initialize the buffer for the next test:
|
|
|
|
for (size_t i = 0; i < len; i++)
|
|
|
|
{
|
|
|
|
WritePosition[i] = 0x03;
|
|
|
|
}
|
|
|
|
} // for len
|
2014-05-30 11:44:24 -04:00
|
|
|
} // for idx
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|