#include #include #include #include #include #include namespace migraphx { inline namespace MIGRAPHX_INLINE_NS { template std::ptrdiff_t bidistance(const Range& r, Iterator start, Iterator last) { auto start_forward = start; auto start_backwards = start; std::size_t n = 0; while(start_forward != last and start_backwards != last) { n++; if(start_forward != r.end()) start_forward++; if(start_backwards != r.begin()) start_backwards--; } if(start_forward == last) return n; else return -n; } void dead_code_elimination::apply(program& p) const { auto last = std::prev(p.end()); for(auto ins : iterator_for(p)) { // Skip the first instruction, since we always process the previous // instruction if(ins == p.begin()) continue; const auto i = std::prev(ins); // Skip the last instruction if(i == last) break; // Skip instruction with empty shape as output unless its a builtin or undefined or identity if(i->get_shape().elements() == 0 and i->name().front() != '@' and i->name() != "undefined" and i->name() != "identity") continue; assert(bidistance(p, i, last) > 0); fix([&](auto self, auto leaf) { assert(p.has_instruction(leaf)); if(leaf->outputs().empty()) { auto args = leaf->inputs(); leaf->clear_arguments(); assert(bidistance(p, last, leaf) < 0); assert(leaf != ins); p.move_instruction(leaf, p.end()); for(auto arg : args) self(arg); } })(i); } p.remove_instructions(std::next(last), p.end()); } } // namespace MIGRAPHX_INLINE_NS } // namespace migraphx