boost/compute
2
0
Fork 0
mirror of https://github.com/boostorg/compute.git synced 2026-01-27 06:42:19 +00:00
Code Issues Projects Releases Wiki Activity
Files
d40eddc56b17566eb45fdfd5cd81a84fc182686a
compute/test/test_sort.cpp
Denis Demidov 5d77bbebee Global setup for OpenCL context in tests 
refs kylelutz/compute#9

device, context, and queue are initialized statically in `context_setup.hpp`.
With this change all tests are able to complete when an NVIDIA GPU is in
exclusive compute mode.

Side effect of the change:
Time for all tests to complete reduced from 15.71 to 13.03 sec Tesla C2075.
2013-04-19 14:53:59 +04:00

360 lines
13 KiB
C++
Raw Blame History

//---------------------------------------------------------------------------//
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
//
// Distributed under the Boost Software License, Version 1.0
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
// See http://kylelutz.github.com/compute for more information.
//---------------------------------------------------------------------------//
#define BOOST_TEST_MODULE TestSort
#include <boost/test/unit_test.hpp>
#include <boost/compute/system.hpp>
#include <boost/compute/algorithm/sort.hpp>
#include <boost/compute/algorithm/is_sorted.hpp>
#include <boost/compute/container/vector.hpp>
#include "context_setup.hpp"
namespace bc = boost::compute;
// test trivial sorting of zero and one element vectors
BOOST_AUTO_TEST_CASE(sort_int_0_and_1)
{
boost::compute::vector<int> vec;
BOOST_CHECK_EQUAL(vec.size(), size_t(0));
BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end()) == true);
boost::compute::sort(vec.begin(), vec.end());
vec.push_back(11);
BOOST_CHECK_EQUAL(vec.size(), size_t(1));
BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end()) == true);
boost::compute::sort(vec.begin(), vec.end());
}
// test sorting of two element int vectors
BOOST_AUTO_TEST_CASE(sort_int_2)
{
int data[] = { 4, 2 };
boost::compute::vector<int> vec(data, data + 2);
// check that vec is unsorted
BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end()) == false);
// sort vec
boost::compute::sort(vec.begin(), vec.end());
// check that vec is sorted
BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end()) == true);
// sort already sorted vec and ensure it is still sorted
boost::compute::sort(vec.begin(), vec.end());
BOOST_CHECK(boost::compute::is_sorted(vec.begin(), vec.end()) == true);
}
BOOST_AUTO_TEST_CASE(sort_char_vector)
{
using boost::compute::char_;
char_ data[] = { 'c', 'a', '0', '7', 'B', 'F', '\0', '$' };
boost::compute::vector<char_> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], '\0');
BOOST_CHECK_EQUAL(data[1], '$');
BOOST_CHECK_EQUAL(data[2], '0');
BOOST_CHECK_EQUAL(data[3], '7');
BOOST_CHECK_EQUAL(data[4], 'B');
BOOST_CHECK_EQUAL(data[5], 'F');
BOOST_CHECK_EQUAL(data[6], 'a');
BOOST_CHECK_EQUAL(data[7], 'c');
}
BOOST_AUTO_TEST_CASE(sort_uchar_vector)
{
using boost::compute::uchar_;
uchar_ data[] = { 0x12, 0x00, 0xFF, 0xB4, 0x80, 0x32, 0x64, 0xA2 };
boost::compute::vector<uchar_> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], uchar_(0x00));
BOOST_CHECK_EQUAL(data[1], uchar_(0x12));
BOOST_CHECK_EQUAL(data[2], uchar_(0x32));
BOOST_CHECK_EQUAL(data[3], uchar_(0x64));
BOOST_CHECK_EQUAL(data[4], uchar_(0x80));
BOOST_CHECK_EQUAL(data[5], uchar_(0xA2));
BOOST_CHECK_EQUAL(data[6], uchar_(0xB4));
BOOST_CHECK_EQUAL(data[7], uchar_(0xFF));
}
BOOST_AUTO_TEST_CASE(sort_short_vector)
{
using boost::compute::short_;
short_ data[] = { -4, 152, -94, 963, 31002, -456, 0, -2113 };
boost::compute::vector<short_> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], short_(-2113));
BOOST_CHECK_EQUAL(data[1], short_(-456));
BOOST_CHECK_EQUAL(data[2], short_(-94));
BOOST_CHECK_EQUAL(data[3], short_(-4));
BOOST_CHECK_EQUAL(data[4], short_(0));
BOOST_CHECK_EQUAL(data[5], short_(152));
BOOST_CHECK_EQUAL(data[6], short_(963));
BOOST_CHECK_EQUAL(data[7], short_(31002));
}
BOOST_AUTO_TEST_CASE(sort_ushort_vector)
{
using boost::compute::ushort_;
ushort_ data[] = { 4, 152, 94, 963, 63202, 34560, 0, 2113 };
boost::compute::vector<ushort_> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], ushort_(0));
BOOST_CHECK_EQUAL(data[1], ushort_(4));
BOOST_CHECK_EQUAL(data[2], ushort_(94));
BOOST_CHECK_EQUAL(data[3], ushort_(152));
BOOST_CHECK_EQUAL(data[4], ushort_(963));
BOOST_CHECK_EQUAL(data[5], ushort_(2113));
BOOST_CHECK_EQUAL(data[6], ushort_(34560));
BOOST_CHECK_EQUAL(data[7], ushort_(63202));
}
BOOST_AUTO_TEST_CASE(sort_int_vector)
{
int data[] = { -4, 152, -5000, 963, 75321, -456, 0, 1112 };
boost::compute::vector<int> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], -5000);
BOOST_CHECK_EQUAL(data[1], -456);
BOOST_CHECK_EQUAL(data[2], -4);
BOOST_CHECK_EQUAL(data[3], 0);
BOOST_CHECK_EQUAL(data[4], 152);
BOOST_CHECK_EQUAL(data[5], 963);
BOOST_CHECK_EQUAL(data[6], 1112);
BOOST_CHECK_EQUAL(data[7], 75321);
}
BOOST_AUTO_TEST_CASE(sort_uint_vector)
{
using boost::compute::uint_;
uint_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
boost::compute::vector<uint_> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], uint_(0));
BOOST_CHECK_EQUAL(data[1], uint_(500));
BOOST_CHECK_EQUAL(data[2], uint_(562));
BOOST_CHECK_EQUAL(data[3], uint_(1988));
BOOST_CHECK_EQUAL(data[4], uint_(9852));
BOOST_CHECK_EQUAL(data[5], uint_(102030));
BOOST_CHECK_EQUAL(data[6], uint_(123456));
BOOST_CHECK_EQUAL(data[7], uint_(4000000));
}
BOOST_AUTO_TEST_CASE(sort_long_vector)
{
using boost::compute::long_;
long_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
boost::compute::vector<long_> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], long_(0));
BOOST_CHECK_EQUAL(data[1], long_(500));
BOOST_CHECK_EQUAL(data[2], long_(562));
BOOST_CHECK_EQUAL(data[3], long_(1988));
BOOST_CHECK_EQUAL(data[4], long_(9852));
BOOST_CHECK_EQUAL(data[5], long_(102030));
BOOST_CHECK_EQUAL(data[6], long_(123456));
BOOST_CHECK_EQUAL(data[7], long_(4000000));
}
BOOST_AUTO_TEST_CASE(sort_ulong_vector)
{
using boost::compute::ulong_;
ulong_ data[] = { 500, 1988, 123456, 562, 0, 4000000, 9852, 102030 };
boost::compute::vector<ulong_> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], ulong_(0));
BOOST_CHECK_EQUAL(data[1], ulong_(500));
BOOST_CHECK_EQUAL(data[2], ulong_(562));
BOOST_CHECK_EQUAL(data[3], ulong_(1988));
BOOST_CHECK_EQUAL(data[4], ulong_(9852));
BOOST_CHECK_EQUAL(data[5], ulong_(102030));
BOOST_CHECK_EQUAL(data[6], ulong_(123456));
BOOST_CHECK_EQUAL(data[7], ulong_(4000000));
}
BOOST_AUTO_TEST_CASE(sort_float_vector)
{
float data[] = { -6023.0f, 152.5f, -63.0f, 1234567.0f, 11.2f,
-5000.1f, 0.0f, 14.0f, -8.25f, -0.0f };
boost::compute::vector<float> vector(data, data + 10);
BOOST_CHECK_EQUAL(vector.size(), size_t(10));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], -6023.0f);
BOOST_CHECK_EQUAL(data[1], -5000.1f);
BOOST_CHECK_EQUAL(data[2], -63.0f);
BOOST_CHECK_EQUAL(data[3], -8.25f);
BOOST_CHECK_EQUAL(data[4], -0.0f);
BOOST_CHECK_EQUAL(data[5], 0.0f);
BOOST_CHECK_EQUAL(data[6], 11.2f);
BOOST_CHECK_EQUAL(data[7], 14.0f);
BOOST_CHECK_EQUAL(data[8], 152.5f);
BOOST_CHECK_EQUAL(data[9], 1234567.0f);
}
BOOST_AUTO_TEST_CASE(sort_double_vector)
{
if(!device.supports_extension("cl_khr_fp64")){
std::cout << "skipping test: device does not support double" << std::endl;
return;
}
double data[] = { -6023.0, 152.5, -63.0, 1234567.0, 11.2,
-5000.1, 0.0, 14.0, -8.25, -0.0 };
boost::compute::vector<double> vector(data, data + 10);
BOOST_CHECK_EQUAL(vector.size(), size_t(10));
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == false);
boost::compute::sort(vector.begin(), vector.end());
BOOST_CHECK(boost::compute::is_sorted(vector.begin(), vector.end()) == true);
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], -6023.0);
BOOST_CHECK_EQUAL(data[1], -5000.1);
BOOST_CHECK_EQUAL(data[2], -63.0);
BOOST_CHECK_EQUAL(data[3], -8.25);
BOOST_CHECK_EQUAL(data[4], -0.0);
BOOST_CHECK_EQUAL(data[5], 0.0);
BOOST_CHECK_EQUAL(data[6], 11.2);
BOOST_CHECK_EQUAL(data[7], 14.0);
BOOST_CHECK_EQUAL(data[8], 152.5);
BOOST_CHECK_EQUAL(data[9], 1234567.0);
}
BOOST_AUTO_TEST_CASE(reverse_sort_int_vector)
{
int data[] = { -4, 152, -5000, 963, 75321, -456, 0, 1112 };
boost::compute::vector<int> vector(data, data + 8);
BOOST_CHECK_EQUAL(vector.size(), size_t(8));
boost::compute::sort(vector.begin(), vector.end(), boost::compute::greater<int>());
boost::compute::copy(vector.begin(), vector.end(), data);
BOOST_CHECK_EQUAL(data[0], 75321);
BOOST_CHECK_EQUAL(data[1], 1112);
BOOST_CHECK_EQUAL(data[2], 963);
BOOST_CHECK_EQUAL(data[3], 152);
BOOST_CHECK_EQUAL(data[4], 0);
BOOST_CHECK_EQUAL(data[5], -4);
BOOST_CHECK_EQUAL(data[6], -456);
BOOST_CHECK_EQUAL(data[7], -5000);
}
BOOST_AUTO_TEST_CASE(sort_vectors_by_length)
{
using boost::compute::float2_;
using boost::compute::lambda::_1;
using boost::compute::lambda::_2;
float data[] = { 1.0f, 0.2f,
1.3f, 1.0f,
6.7f, 0.0f,
5.2f, 3.4f,
1.4f, 1.4f };
// create vector on device containing vectors
boost::compute::vector<float2_> vector(
reinterpret_cast<float2_ *>(data),
reinterpret_cast<float2_ *>(data) + 5,
context
);
// sort vectors by length
boost::compute::sort(
vector.begin(),
vector.end(),
length(_1) < length(_2),
queue
);
// copy sorted values back to host
boost::compute::copy(
vector.begin(),
vector.end(),
reinterpret_cast<float2_ *>(data),
queue
);
// check values
BOOST_CHECK_EQUAL(data[0], 1.0f);
BOOST_CHECK_EQUAL(data[1], 0.2f);
BOOST_CHECK_EQUAL(data[2], 1.3f);
BOOST_CHECK_EQUAL(data[3], 1.0f);
BOOST_CHECK_EQUAL(data[4], 1.4f);
BOOST_CHECK_EQUAL(data[5], 1.4f);
BOOST_CHECK_EQUAL(data[6], 5.2f);
BOOST_CHECK_EQUAL(data[7], 3.4f);
BOOST_CHECK_EQUAL(data[8], 6.7f);
BOOST_CHECK_EQUAL(data[9], 0.0f);
}
BOOST_AUTO_TEST_SUITE_END()
Reference in New Issue View Git Blame Copy Permalink