275 lines
7.6 KiB
C++
275 lines
7.6 KiB
C++
//@HEADER
|
|
// ************************************************************************
|
|
//
|
|
// Kokkos v. 3.0
|
|
// Copyright (2020) National Technology & Engineering
|
|
// Solutions of Sandia, LLC (NTESS).
|
|
//
|
|
// Under the terms of Contract DE-NA0003525 with NTESS,
|
|
// 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 NTESS "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 NTESS 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 Christian R. Trott (crtrott@sandia.gov)
|
|
//
|
|
// ************************************************************************
|
|
//@HEADER
|
|
|
|
#ifndef KOKKOS_TEST_BITSET_HPP
|
|
#define KOKKOS_TEST_BITSET_HPP
|
|
|
|
#include <gtest/gtest.h>
|
|
#include <iostream>
|
|
#include <Kokkos_Core.hpp>
|
|
#include <Kokkos_Bitset.hpp>
|
|
#include <array>
|
|
|
|
namespace Test {
|
|
|
|
namespace Impl {
|
|
|
|
template <typename Bitset, bool Set>
|
|
struct TestBitset {
|
|
using bitset_type = Bitset;
|
|
using execution_space = typename bitset_type::execution_space;
|
|
using value_type = uint32_t;
|
|
|
|
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 {
|
|
using bitset_type = Bitset;
|
|
using execution_space = typename bitset_type::execution_space;
|
|
using value_type = uint32_t;
|
|
|
|
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 {
|
|
using bitset_type = Bitset;
|
|
using execution_space = typename bitset_type::execution_space;
|
|
using value_type = uint32_t;
|
|
|
|
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() {
|
|
using bitset_type = Kokkos::Bitset<Device>;
|
|
using const_bitset_type = Kokkos::ConstBitset<Device>;
|
|
|
|
{
|
|
unsigned ts = 100u;
|
|
bitset_type b1;
|
|
ASSERT_TRUE(b1.is_allocated());
|
|
|
|
b1 = bitset_type(ts);
|
|
bitset_type b2(b1);
|
|
bitset_type b3(ts);
|
|
|
|
ASSERT_TRUE(b1.is_allocated());
|
|
ASSERT_TRUE(b2.is_allocated());
|
|
ASSERT_TRUE(b3.is_allocated());
|
|
}
|
|
|
|
std::array<unsigned, 7> test_sizes = {
|
|
{0u, 10u, 100u, 1000u, 1u << 14, 1u << 16, 10000001}};
|
|
|
|
for (const auto test_size : test_sizes) {
|
|
// std::cout << "Bitset " << test_sizes[i] << std::endl;
|
|
|
|
bitset_type bitset(test_size);
|
|
|
|
// std::cout << " Check initial 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());
|
|
}
|
|
}
|
|
}
|
|
|
|
TEST(TEST_CATEGORY, bitset) { test_bitset<TEST_EXECSPACE>(); }
|
|
} // namespace Test
|
|
|
|
#endif // KOKKOS_TEST_BITSET_HPP
|