Function radixSortTest

test/OpenCL/ParallelPrimitives/main.cpp:294–342

}

bool radixSortTest()
{
	TEST_INIT;

	int maxSize = 1024 * 256;

	b3AlignedObjectArray<b3SortData> buf0Host;
	buf0Host.resize(maxSize);
	b3AlignedObjectArray<b3SortData> buf1Host;
	buf1Host.resize(maxSize);
	b3OpenCLArray<b3SortData> buf2CL(g_context, g_queue, maxSize);

	b3RadixSort32CL* sort = new b3RadixSort32CL(g_context, g_device, g_queue, maxSize);

	int dx = maxSize / NUM_TESTS;
	for (int iter = 0; iter < NUM_TESTS; iter++)
	{
		int size = b3Min(128 + dx * iter, maxSize - 512);
		size = NEXTMULTIPLEOF(size, 512);  //not necessary

		buf0Host.resize(size);

		for (int i = 0; i < size; i++)
		{
			b3SortData v;
			v.m_key = getRandom(0, 0xff);
			v.m_value = i;
			buf0Host[i] = v;
		}

		buf2CL.copyFromHost(buf0Host);

		sort->executeHost(buf0Host);
		sort->execute(buf2CL);

		buf2CL.copyToHost(buf1Host);

		for (int i = 0; i < size; i++)
		{
			TEST_ASSERT(buf0Host[i].m_value == buf1Host[i].m_value && buf0Host[i].m_key == buf1Host[i].m_key);
		}
	}

	delete sort;

	TEST_REPORT("radixSort");

	return g_testFailed;
}

int main(int argc, char** argv)
{