eliminate_common_subexpression.cpp 1.31 KB
Newer Older
Paul's avatar
Paul committed
1
#include <migraphx/eliminate_common_subexpression.hpp>
Paul's avatar
Paul committed
2
3
4
5
6
#include <migraphx/program.hpp>
#include <migraphx/instruction.hpp>
#include <migraphx/iterator_for.hpp>
#include <migraphx/ranges.hpp>
#include <migraphx/functional.hpp>
Paul's avatar
Paul committed
7

Paul's avatar
Paul committed
8
9
#include <unordered_set>

Paul's avatar
Paul committed
10
namespace migraphx {
Paul's avatar
Paul committed
11
inline namespace MIGRAPHX_INLINE_NS {
Paul's avatar
Paul committed
12

Paul's avatar
Paul committed
13
template <class Range>
Paul's avatar
Paul committed
14
15
16
17
18
19
20
21
22
23
void cse_range(program& p, Range&& r)
{
    std::unordered_multimap<std::string, instruction_ref> instructions;
    for(auto ins : r)
    {
        // Skip dead instructions
        if(ins->outputs().empty())
            continue;
        // Find instruction with the same name
        auto found_instructions = range(instructions.equal_range(ins->name()));
Paul's avatar
Paul committed
24
        for(const auto& pp : found_instructions)
Paul's avatar
Paul committed
25
26
27
28
29
        {
            auto eq = pp.second;
            if(*eq != *ins)
                continue;
            p.replace_instruction(ins, eq);
Paul's avatar
Paul committed
30
31
32
33
34
            auto outputs = eq->outputs();
            std::sort(outputs.begin(), outputs.end(), [&](auto x, auto y) {
                return std::distance(eq, x) < std::distance(eq, y);
            });
            cse_range(p, outputs);
Paul's avatar
Paul committed
35
36
37
38
39
        }
        instructions.emplace(ins->name(), ins);
    }
}

Paul's avatar
Paul committed
40
void eliminate_common_subexpression::apply(program& p) const { cse_range(p, iterator_for(p)); }
Paul's avatar
Paul committed
41

Paul's avatar
Paul committed
42
} // namespace MIGRAPHX_INLINE_NS
Paul's avatar
Paul committed
43
} // namespace migraphx