Skip to content

Commit

Permalink
Remove old region tests. Superceded by new tests.
Browse files Browse the repository at this point in the history
  • Loading branch information
rhornung67 committed May 4, 2020
1 parent 9b41cad commit f67b3c1
Showing 1 changed file with 0 additions and 114 deletions.
114 changes: 0 additions & 114 deletions test/old-tests/unit/test-kernel.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1355,120 +1355,6 @@ TEST(Kernel, CollapseSeq)
delete[] x;
}

//Sequential region
TEST(Kernel, RegionSeq)
{

const int N = 300;
int * Arr_a = new int[N];
int * Arr_b = new int[N];
int * Arr_c = new int[N];

for(int i=0; i<N; ++i) {
Arr_a[i] = 0;
Arr_b[i] = 0;
Arr_c[i] = 0;
}

using Pol =
RAJA::KernelPolicy<
RAJA::statement::Region<RAJA::seq_region,
RAJA::statement::For<0, RAJA::loop_exec,
RAJA::statement::Lambda<0>
>,
RAJA::statement::For<0, RAJA::loop_exec,
RAJA::statement::Lambda<1>
>,
RAJA::statement::For<0, RAJA::loop_exec,
RAJA::statement::Lambda<2>
>
>
>;

RAJA::kernel<Pol>(
RAJA::make_tuple(RAJA::RangeSegment(0,N)),

[=] (int i) {
Arr_a[i] = 50;
},

[=] (int i) {
Arr_b[i] = 100;
},

[=] (int i) {
Arr_c[i] = Arr_a[i] + Arr_b[N - 1 - i];
}

);

for(int i=0; i<N; ++i) {
ASSERT_EQ(Arr_c[i], 150);
}

delete [] Arr_a;
delete [] Arr_b;
delete [] Arr_c;
}


#if defined(RAJA_ENABLE_OPENMP)
TEST(Kernel, RegionOMP)
{

const int N = 300;
int * Arr_a = new int[N];
int * Arr_b = new int[N];
int * Arr_c = new int[N];

for(int i=0; i<N; ++i) {
Arr_a[i] = 0;
Arr_b[i] = 0;
Arr_c[i] = 0;
}

using Pol =
RAJA::KernelPolicy<
RAJA::statement::Region<RAJA::omp_parallel_region,
RAJA::statement::For<0, RAJA::omp_for_nowait_exec,
RAJA::statement::Lambda<0>
>,
RAJA::statement::For<0, RAJA::omp_for_nowait_exec,
RAJA::statement::Lambda<1>
>,
RAJA::statement::OmpSyncThreads,
RAJA::statement::For<0, RAJA::omp_for_nowait_exec,
RAJA::statement::Lambda<2>
>
>
>;

RAJA::kernel<Pol>(
RAJA::make_tuple(RAJA::RangeSegment(0,N)),

[=] (int i) {
Arr_a[i] = 50;
},

[=] (int i) {
Arr_b[i] = 100;
},

[=] (int i) {
Arr_c[i] = Arr_a[i] + Arr_b[N - 1 - i];
}

);

for(int i=0; i<N; ++i) {
ASSERT_EQ(Arr_c[i], 150);
}

delete [] Arr_a;
delete [] Arr_b;
delete [] Arr_c;
}


TEST(Kernel, Collapse2)
{
Expand Down

0 comments on commit f67b3c1

Please sign in to comment.