286 lines
7.3 KiB
C++
Executable File
286 lines
7.3 KiB
C++
Executable File
//@HEADER
|
|
// ************************************************************************
|
|
//
|
|
// Kokkos v. 2.0
|
|
// Copyright (2014) Sandia Corporation
|
|
//
|
|
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
|
|
// the U.S. Government retains certain rights in this software.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// 1. Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
//
|
|
// 2. Redistributions in binary form must reproduce the above copyright
|
|
// notice, this list of conditions and the following disclaimer in the
|
|
// documentation and/or other materials provided with the distribution.
|
|
//
|
|
// 3. Neither the name of the Corporation nor the names of the
|
|
// contributors may be used to endorse or promote products derived from
|
|
// this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
|
|
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// Questions? Contact H. Carter Edwards (hcedwar@sandia.gov)
|
|
//
|
|
// ************************************************************************
|
|
//@HEADER
|
|
|
|
#ifndef KOKKOS_TEST_BITSET_HPP
|
|
#define KOKKOS_TEST_BITSET_HPP
|
|
|
|
#include <gtest/gtest.h>
|
|
#include <iostream>
|
|
|
|
|
|
namespace Test {
|
|
|
|
namespace Impl {
|
|
|
|
template <typename Bitset, bool Set>
|
|
struct TestBitset
|
|
{
|
|
typedef Bitset bitset_type;
|
|
typedef typename bitset_type::execution_space execution_space;
|
|
typedef uint32_t value_type;
|
|
|
|
bitset_type m_bitset;
|
|
|
|
TestBitset( bitset_type const& bitset)
|
|
: m_bitset(bitset)
|
|
{}
|
|
|
|
unsigned testit(unsigned collisions)
|
|
{
|
|
execution_space::fence();
|
|
|
|
unsigned count = 0;
|
|
Kokkos::parallel_reduce( m_bitset.size()*collisions, *this, count);
|
|
return count;
|
|
}
|
|
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void init( value_type & v ) const { v = 0; }
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void join( volatile value_type & dst, const volatile value_type & src ) const
|
|
{ dst += src; }
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void operator()(uint32_t i, value_type & v) const
|
|
{
|
|
i = i % m_bitset.size();
|
|
if (Set) {
|
|
if (m_bitset.set(i)) {
|
|
if (m_bitset.test(i)) ++v;
|
|
}
|
|
}
|
|
else {
|
|
if (m_bitset.reset(i)) {
|
|
if (!m_bitset.test(i)) ++v;
|
|
}
|
|
}
|
|
}
|
|
|
|
};
|
|
|
|
template <typename Bitset>
|
|
struct TestBitsetTest
|
|
{
|
|
typedef Bitset bitset_type;
|
|
typedef typename bitset_type::execution_space execution_space;
|
|
typedef uint32_t value_type;
|
|
|
|
bitset_type m_bitset;
|
|
|
|
TestBitsetTest( bitset_type const& bitset)
|
|
: m_bitset(bitset)
|
|
{}
|
|
|
|
unsigned testit()
|
|
{
|
|
execution_space::fence();
|
|
|
|
unsigned count = 0;
|
|
Kokkos::parallel_reduce( m_bitset.size(), *this, count);
|
|
return count;
|
|
}
|
|
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void init( value_type & v ) const { v = 0; }
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void join( volatile value_type & dst, const volatile value_type & src ) const
|
|
{ dst += src; }
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void operator()(uint32_t i, value_type & v) const
|
|
{
|
|
if (m_bitset.test( i )) ++v;
|
|
}
|
|
};
|
|
|
|
template <typename Bitset, bool Set>
|
|
struct TestBitsetAny
|
|
{
|
|
typedef Bitset bitset_type;
|
|
typedef typename bitset_type::execution_space execution_space;
|
|
typedef uint32_t value_type;
|
|
|
|
bitset_type m_bitset;
|
|
|
|
TestBitsetAny( bitset_type const& bitset)
|
|
: m_bitset(bitset)
|
|
{}
|
|
|
|
unsigned testit()
|
|
{
|
|
execution_space::fence();
|
|
|
|
unsigned count = 0;
|
|
Kokkos::parallel_reduce( m_bitset.size(), *this, count);
|
|
return count;
|
|
}
|
|
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void init( value_type & v ) const { v = 0; }
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void join( volatile value_type & dst, const volatile value_type & src ) const
|
|
{ dst += src; }
|
|
|
|
KOKKOS_INLINE_FUNCTION
|
|
void operator()(uint32_t i, value_type & v) const
|
|
{
|
|
bool result = false;
|
|
unsigned attempts = 0;
|
|
uint32_t hint = (i >> 4) << 4;
|
|
while (attempts < m_bitset.max_hint()) {
|
|
if (Set) {
|
|
Kokkos::tie(result, hint) = m_bitset.find_any_unset_near(hint, i);
|
|
if (result && m_bitset.set(hint)) {
|
|
++v;
|
|
break;
|
|
}
|
|
else if (!result) {
|
|
++attempts;
|
|
}
|
|
}
|
|
else {
|
|
Kokkos::tie(result, hint) = m_bitset.find_any_set_near(hint, i);
|
|
if (result && m_bitset.reset(hint)) {
|
|
++v;
|
|
break;
|
|
}
|
|
else if (!result) {
|
|
++attempts;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
};
|
|
} // namespace Impl
|
|
|
|
|
|
|
|
template <typename Device>
|
|
void test_bitset()
|
|
{
|
|
typedef Kokkos::Bitset< Device > bitset_type;
|
|
typedef Kokkos::ConstBitset< Device > const_bitset_type;
|
|
|
|
//unsigned test_sizes[] = { 0u, 1000u, 1u<<14, 1u<<16, 10000001 };
|
|
unsigned test_sizes[] = { 1000u, 1u<<14, 1u<<16, 10000001 };
|
|
|
|
for (int i=0, end = sizeof(test_sizes)/sizeof(unsigned); i<end; ++i) {
|
|
|
|
//std::cout << "Bitset " << test_sizes[i] << std::endl;
|
|
|
|
bitset_type bitset(test_sizes[i]);
|
|
|
|
//std::cout << " Check inital count " << std::endl;
|
|
// nothing should be set
|
|
{
|
|
Impl::TestBitsetTest< bitset_type > f(bitset);
|
|
uint32_t count = f.testit();
|
|
EXPECT_EQ(0u, count);
|
|
EXPECT_EQ(count, bitset.count());
|
|
}
|
|
|
|
//std::cout << " Check set() " << std::endl;
|
|
bitset.set();
|
|
// everything should be set
|
|
{
|
|
Impl::TestBitsetTest< const_bitset_type > f(bitset);
|
|
uint32_t count = f.testit();
|
|
EXPECT_EQ(bitset.size(), count);
|
|
EXPECT_EQ(count, bitset.count());
|
|
}
|
|
|
|
//std::cout << " Check reset() " << std::endl;
|
|
bitset.reset();
|
|
EXPECT_EQ(0u, bitset.count());
|
|
|
|
//std::cout << " Check set(i) " << std::endl;
|
|
// test setting bits
|
|
{
|
|
Impl::TestBitset< bitset_type, true > f(bitset);
|
|
uint32_t count = f.testit(10u);
|
|
EXPECT_EQ( bitset.size(), bitset.count());
|
|
EXPECT_EQ( bitset.size(), count );
|
|
}
|
|
|
|
//std::cout << " Check reset(i) " << std::endl;
|
|
// test resetting bits
|
|
{
|
|
Impl::TestBitset< bitset_type, false > f(bitset);
|
|
uint32_t count = f.testit(10u);
|
|
EXPECT_EQ( bitset.size(), count);
|
|
EXPECT_EQ( 0u, bitset.count() );
|
|
}
|
|
|
|
|
|
//std::cout << " Check find_any_set(i) " << std::endl;
|
|
// test setting any bits
|
|
{
|
|
Impl::TestBitsetAny< bitset_type, true > f(bitset);
|
|
uint32_t count = f.testit();
|
|
EXPECT_EQ( bitset.size(), bitset.count());
|
|
EXPECT_EQ( bitset.size(), count );
|
|
}
|
|
|
|
//std::cout << " Check find_any_unset(i) " << std::endl;
|
|
// test resetting any bits
|
|
{
|
|
Impl::TestBitsetAny< bitset_type, false > f(bitset);
|
|
uint32_t count = f.testit();
|
|
EXPECT_EQ( bitset.size(), count);
|
|
EXPECT_EQ( 0u, bitset.count() );
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} // namespace Test
|
|
|
|
#endif //KOKKOS_TEST_BITSET_HPP
|
|
|