#include "source/opt/redundancy_elimination.h"
#include "source/opt/value_number_table.h"
namespace spvtools {
namespace opt {
Pass::Status RedundancyEliminationPass::Process() {
bool modified = false;
ValueNumberTable vnTable(context());
for (auto& func : *get_module()) {
if (func.IsDeclaration()) {
continue;
}
DominatorTree& dom_tree =
context()->GetDominatorAnalysis(&func)->GetDomTree();
if (EliminateRedundanciesFrom(dom_tree.GetRoot(), vnTable)) {
modified = true;
}
}
return (modified ? Status::SuccessWithChange : Status::SuccessWithoutChange);
}
bool RedundancyEliminationPass::EliminateRedundanciesFrom(
DominatorTreeNode* bb, const ValueNumberTable& vnTable) {
struct State {
DominatorTreeNode* node;
std::map<uint32_t, uint32_t> value_to_id_map;
};
std::vector<State> todo;
todo.push_back({bb, std::map<uint32_t, uint32_t>()});
bool modified = false;
for (size_t next_node = 0; next_node < todo.size(); next_node++) {
modified |= EliminateRedundanciesInBB(todo[next_node].node->bb_, vnTable,
&todo[next_node].value_to_id_map);
for (DominatorTreeNode* child : todo[next_node].node->children_) {
todo.push_back({child, todo[next_node].value_to_id_map});
}
}
return modified;
}
}
}