eliminate_contiguous_test.cpp 1.37 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#include <migraph/eliminate_contiguous.hpp>
#include <migraph/dead_code_elimination.hpp>
#include <migraph/operators.hpp>
#include <basic_ops.hpp>
#include <test.hpp>

struct eliminate_contiguous_target
{
    std::string name() const { return "eliminate_contiguous"; }
    std::vector<migraph::pass> get_passes(migraph::context&) const
    {
        return {migraph::eliminate_contiguous{}, migraph::dead_code_elimination{}};
    }
    migraph::context get_context() const { return {}; }
};

Paul's avatar
Paul committed
17
TEST_CASE(standard_op)
18
19
20
{
    migraph::program p;
    auto l = p.add_literal(get_2x2());
21
22
    auto t = p.add_instruction(migraph::op::transpose{{1, 0}}, l);
    auto c = p.add_instruction(migraph::op::contiguous{}, t);
23
24
25
26
27
28
    p.add_instruction(pass_standard_op{}, c);
    auto count = std::distance(p.begin(), p.end());
    p.compile(eliminate_contiguous_target{});
    EXPECT(std::distance(p.begin(), p.end()) == count);
}

Paul's avatar
Paul committed
29
TEST_CASE(non_standard_op)
30
31
32
{
    migraph::program p;
    auto l = p.add_literal(get_2x2());
33
34
    auto t = p.add_instruction(migraph::op::transpose{{1, 0}}, l);
    auto c = p.add_instruction(migraph::op::contiguous{}, t);
35
36
37
38
39
40
    p.add_instruction(pass_op{}, c);
    auto count = std::distance(p.begin(), p.end());
    p.compile(eliminate_contiguous_target{});
    EXPECT(std::distance(p.begin(), p.end()) == (count - 1));
}

Paul's avatar
Paul committed
41
int main(int argc, const char* argv[]) { test::run(argc, argv); }