//@HEADER // ************************************************************************ // // Kokkos v. 4.0 // Copyright (2022) 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. // // Part of Kokkos, under the Apache License v2.0 with LLVM Exceptions. // See https://kokkos.org/LICENSE for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //@HEADER #include namespace Test { namespace stdalgos { namespace TeamFill_n { namespace KE = Kokkos::Experimental; template struct TestFunctorA { ViewType m_view; DistancesViewType m_distancesView; IntraTeamSentinelView m_intraTeamSentinelView; std::size_t m_fillCount; int m_apiPick; TestFunctorA(const ViewType view, const DistancesViewType distancesView, const IntraTeamSentinelView intraTeamSentinelView, std::size_t fillCount, int apiPick) : m_view(view), m_distancesView(distancesView), m_intraTeamSentinelView(intraTeamSentinelView), m_fillCount(fillCount), m_apiPick(apiPick) {} template KOKKOS_INLINE_FUNCTION void operator()(const MemberType& member) const { const auto leagueRank = member.league_rank(); const auto myRowIndex = leagueRank; auto myRowView = Kokkos::subview(m_view, myRowIndex, Kokkos::ALL()); ptrdiff_t resultDist = 0; if (m_apiPick == 0) { auto it = KE::fill_n(member, KE::begin(myRowView), m_fillCount, leagueRank); resultDist = KE::distance(KE::begin(myRowView), it); Kokkos::single(Kokkos::PerTeam(member), [=, *this]() { m_distancesView(myRowIndex) = resultDist; }); } else if (m_apiPick == 1) { auto it = KE::fill_n(member, myRowView, m_fillCount, leagueRank); resultDist = KE::distance(KE::begin(myRowView), it); Kokkos::single(Kokkos::PerTeam(member), [=, *this]() { m_distancesView(myRowIndex) = resultDist; }); } // store result of checking if all members have their local // values matching the one stored in m_distancesView member.team_barrier(); const bool intraTeamCheck = team_members_have_matching_result( member, resultDist, m_distancesView(myRowIndex)); Kokkos::single(Kokkos::PerTeam(member), [=, *this]() { m_intraTeamSentinelView(myRowIndex) = intraTeamCheck; }); } }; template void test_A(std::size_t numTeams, std::size_t numCols, std::size_t fillCount, int apiId) { /* description: create a rank-2 view, run a team parfor with one row per team, such that n elements of each row are filled up with the league_rank value of the team in charge of it, while the other elements in the row are left unchanged */ // ----------------------------------------------- // prepare data // ----------------------------------------------- // create a view in the memory space associated with default exespace // with as many rows as the number of teams and fill it with random // values from an arbitrary range auto [dataView, cloneOfDataViewBeforeOp_h] = create_random_view_and_host_clone( LayoutTag{}, numTeams, numCols, Kokkos::pair{5, 523}, "dataView"); // ----------------------------------------------- // launch kokkos kernel // ----------------------------------------------- using space_t = Kokkos::DefaultExecutionSpace; Kokkos::TeamPolicy policy(numTeams, Kokkos::AUTO()); // fill_n returns an iterator so to verify that it is correct // each team stores the distance of the returned iterator from the // beginning of the interval that team operates on and then we check // that these distances match the expected value Kokkos::View distancesView("distancesView", numTeams); // sentinel to check if all members of the team compute the same result Kokkos::View intraTeamSentinelView("intraTeamSameResult", numTeams); // use CTAD for functor TestFunctorA fnc(dataView, distancesView, intraTeamSentinelView, fillCount, apiId); Kokkos::parallel_for(policy, fnc); // ----------------------------------------------- // check // ----------------------------------------------- auto dataViewAfterOp_h = create_host_space_copy(dataView); auto distancesView_h = create_host_space_copy(distancesView); auto intraTeamSentinelView_h = create_host_space_copy(intraTeamSentinelView); for (std::size_t i = 0; i < dataView.extent(0); ++i) { ASSERT_TRUE(intraTeamSentinelView_h(i)); // check that values match what we expect for (std::size_t j = 0; j < fillCount; ++j) { ASSERT_EQ(dataViewAfterOp_h(i, j), ValueType(i)); } // all other elements should be unchanged from before op for (std::size_t j = fillCount; j < numCols; ++j) { ASSERT_EQ(dataViewAfterOp_h(i, j), cloneOfDataViewBeforeOp_h(i, j)); } // check that returned iterators are correct if (fillCount > 0) { ASSERT_EQ(distancesView_h(i), std::size_t(fillCount)); } else { ASSERT_EQ(distancesView_h(i), std::size_t(0)); } } } template void run_all_scenarios() { // prepare a map where, for a given set of num cols // we provide a list of counts of elements to fill // key = num of columns, // value = list of num of elemenents to fill const std::map> scenarios = { {0, {0}}, {2, {0, 1, 2}}, {6, {0, 1, 2, 5}}, {13, {0, 1, 2, 8, 11}}, {56, {0, 1, 2, 8, 11, 33, 56}}, {123, {0, 1, 11, 33, 56, 89, 112}}}; for (int numTeams : teamSizesToTest) { for (const auto& scenario : scenarios) { const std::size_t numCols = scenario.first; for (int numFills : scenario.second) { for (int apiId : {0, 1}) { test_A(numTeams, numCols, numFills, apiId); } } } } } TEST(std_algorithms_fill_n_team_test, test) { run_all_scenarios(); run_all_scenarios(); run_all_scenarios(); } } // namespace TeamFill_n } // namespace stdalgos } // namespace Test