Function boundSearchTest

test/OpenCL/ParallelPrimitives/main.cpp:138–249

};

void boundSearchTest()
{
	TEST_INIT;

	int maxSize = 1024 * 256;
	int bucketSize = 256;

	b3OpenCLArray<b3SortData> srcCL(g_context, g_queue, maxSize);
	b3OpenCLArray<unsigned int> upperCL(g_context, g_queue, maxSize);
	b3OpenCLArray<unsigned int> lowerCL(g_context, g_queue, maxSize);

	b3AlignedObjectArray<b3SortData> srcHost;
	b3AlignedObjectArray<unsigned int> upperHost;
	b3AlignedObjectArray<unsigned int> lowerHost;
	b3AlignedObjectArray<unsigned int> upperHostCompare;
	b3AlignedObjectArray<unsigned int> lowerHostCompare;

	b3BoundSearchCL* search = new b3BoundSearchCL(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);

		upperHost.resize(bucketSize);
		lowerHost.resize(bucketSize);
		upperHostCompare.resize(bucketSize);
		lowerHostCompare.resize(bucketSize);

		srcHost.resize(size);

		for (int i = 0; i < size; i++)
		{
			b3SortData v;
			//			v.m_key = i<2? 0 : 5;
			v.m_key = getRandom(0, bucketSize);

			v.m_value = i;
			srcHost.at(i) = v;
		}

		srcHost.quickSort(b3SortDataCompare());
		srcCL.copyFromHost(srcHost);

		{
			for (int i = 0; i < bucketSize; i++)
			{
				lowerHost[i] = -1;
				lowerHostCompare[i] = -1;
				upperHost[i] = -1;
				upperHostCompare[i] = -1;
			}
			upperCL.copyFromHost(upperHost);
			lowerCL.copyFromHost(lowerHost);
		}

		search->execute(srcCL, size, upperCL, bucketSize, b3BoundSearchCL::BOUND_UPPER);
		search->execute(srcCL, size, lowerCL, bucketSize, b3BoundSearchCL::BOUND_LOWER);