1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
/*
* GridTools
*
* Copyright (c) 2014-2023, ETH Zurich
* All rights reserved.
*
* Please, refer to the LICENSE file in the root directory.
* SPDX-License-Identifier: BSD-3-Clause
*/
/**
* Integration test for testing expressions inside a computation.
* The test setup is not very nice but it was designed that way to minimize compilation time, i.e. to test everything
* within one make_computation call.
*/
#include <gtest/gtest.h>
#include <gridtools/stencil/cartesian.hpp>
#include <gridtools/stencil/global_parameter.hpp>
#include <gridtools/stencil/naive.hpp>
#include <gridtools/stencil/positional.hpp>
#define GT_STENCIL_NAIVE
#include <stencil_select.hpp>
#include <test_environment.hpp>
namespace {
using namespace gridtools;
using namespace stencil;
using namespace cartesian;
struct test_functor {
using val2 = in_accessor<0>;
using val3 = in_accessor<1>;
using out = inout_accessor<2>;
using i_pos = in_accessor<3>;
using param_list = make_param_list<val2, val3, out, i_pos>;
template <class Eval>
GT_FUNCTION static void apply(Eval &&eval) {
using namespace expressions;
constexpr dimension<1> i;
constexpr dimension<2> j;
constexpr dimension<3> k;
// starts the cascade
int index = 0;
if (false)
assert(false);
#define EXPRESSION_TEST(expr, expected) \
else if (eval(i_pos()) == index++) { \
eval(out()) = eval(expr) - expected; \
}
/*
* Put expression test here in the form
* EXPRESSION_TEST( <expr> ) where <expr> is the expression to test.
* Then put the result below. The order of EXPRESSION_TESTs and EXPRESSION_TEST_RESULTs has to be preserved
*/
EXPRESSION_TEST(val3() * val2(), 6)
EXPRESSION_TEST(val3() + val2(), 5)
EXPRESSION_TEST(val3() - val2(), 1)
EXPRESSION_TEST(val3() / val2(), 1.5)
EXPRESSION_TEST(val3(i, j, k) * val2(i, j, k), 6)
EXPRESSION_TEST(val3(i, j, k) + val2(i, j, k), 5)
EXPRESSION_TEST(val3(i, j, k) - val2(i, j, k), 1)
EXPRESSION_TEST(val3(i, j, k) / val2(i, j, k), 1.5)
EXPRESSION_TEST(val3() * 3., 9)
EXPRESSION_TEST(3. * val3(), 9)
EXPRESSION_TEST(val3() * 3, 9) // accessor<double> mult int
EXPRESSION_TEST(3 * val3(), 9) // int mult accessor<double>
EXPRESSION_TEST(val3() + 3., 6)
EXPRESSION_TEST(3. + val3(), 6)
EXPRESSION_TEST(val3() + 3, 6) // accessor<double> plus int
EXPRESSION_TEST(3 + val3(), 6) // int plus accessor<double>
EXPRESSION_TEST(val3() - 2., 1)
EXPRESSION_TEST(3. - val2(), 1)
EXPRESSION_TEST(val3() - 2, 1) // accessor<double> minus int
EXPRESSION_TEST(3 - val2(), 1) // int minus accessor<double>
EXPRESSION_TEST(val3() / 2., 1.5)
EXPRESSION_TEST(3. / val2(), 1.5)
EXPRESSION_TEST(val3() / 2, 1.5) // accessor<double> div int
EXPRESSION_TEST(3 / val2(), 1.5) // int div accessor<double>
EXPRESSION_TEST(-val2(), -2)
EXPRESSION_TEST(+val2(), 2)
EXPRESSION_TEST(val3() + 2. * val2(), 7)
EXPRESSION_TEST(pow<2>(val3()), 9)
#undef EXPRESSION_TEST
else eval(out()) = 0;
}
};
using env_t = test_environment<>::apply<stencil_backend_t, double, inlined_params<100, 1, 1>>;
TEST(test_expressions, integration_test) {
auto out = env_t::make_storage();
run_single_stage(test_functor(),
naive(),
env_t::make_grid(),
global_parameter(2.),
global_parameter(3.),
out,
positional<dim::i>());
env_t::verify(0, out);
}
} // namespace
|
