14#define GEN_PASS_DEF_DUPLICATEFUNCTIONELIMINATIONPASS
15#include "mlir/Dialect/Func/Transforms/Passes.h.inc"
22struct DuplicateFuncOpEquivalenceInfo
23 :
public llvm::DenseMapInfo<func::FuncOp> {
25 static unsigned getHashValue(
const func::FuncOp cFunc) {
27 return DenseMapInfo<func::FuncOp>::getHashValue(cFunc);
31 llvm::hash_code
hash = {};
32 func::FuncOp func =
const_cast<func::FuncOp &
>(cFunc);
33 StringAttr symNameAttrName = func.getSymNameAttrName();
34 for (NamedAttribute namedAttr : cFunc->getAttrs()) {
35 StringAttr attrName = namedAttr.getName();
36 if (attrName == symNameAttrName)
38 hash = llvm::hash_combine(
hash, namedAttr);
42 func.getBody().walk([&](Operation *op) {
43 hash = llvm::hash_combine(
53 static bool isEqual(func::FuncOp
lhs, func::FuncOp
rhs) {
56 if (
lhs == getEmptyKey() ||
rhs == getEmptyKey())
59 if (
lhs.isDeclaration() ||
rhs.isDeclaration())
63 if (
lhs->getDiscardableAttrDictionary() !=
64 rhs->getDiscardableAttrDictionary())
70 auto pLhs =
lhs.getProperties();
71 auto pRhs =
rhs.getProperties();
72 pLhs.sym_name =
nullptr;
73 pRhs.sym_name =
nullptr;
83struct DuplicateFunctionEliminationPass
84 :
public func::impl::DuplicateFunctionEliminationPassBase<
85 DuplicateFunctionEliminationPass> {
87 using DuplicateFunctionEliminationPassBase<
88 DuplicateFunctionEliminationPass>::DuplicateFunctionEliminationPassBase;
90 void runOnOperation()
override {
91 auto module = getOperation();
97 module.walk([&](func::FuncOp f) {
98 auto [repr, inserted] = uniqueFuncOps.insert(f);
99 getRepresentant[f.getSymNameAttr()] = *repr;
101 toBeErased.insert(f);
107 SymbolTableCollection symbolTable;
108 SymbolUserMap userMap(symbolTable, module);
109 for (
auto it : toBeErased) {
110 StringAttr oldSymbol = it.getSymNameAttr();
111 StringAttr newSymbol = getRepresentant[oldSymbol].getSymNameAttr();
112 userMap.replaceAllUsesWith(it, newSymbol);
static size_t hash(const T &value)
Local helper to compute std::hash for a value.
*if copies could not be generated due to yet unimplemented cases *copyInPlacementStart and copyOutPlacementStart in copyPlacementBlock *specify the insertion points where the incoming copies and outgoing should be inserted(the insertion happens right before the *insertion point). Since `begin` can itself be invalidated due to the memref *rewriting done from this method
Include the generated interface declarations.
llvm::DenseSet< ValueT, ValueInfoT > DenseSet
llvm::DenseMap< KeyT, ValueT, KeyInfoT, BucketT > DenseMap
static llvm::hash_code ignoreHashValue(Value)
Helper that can be used with computeHash above to ignore operation operands/result mapping.
static bool isRegionEquivalentTo(Region *lhs, Region *rhs, function_ref< LogicalResult(Value, Value)> checkEquivalent, function_ref< void(Value, Value)> markEquivalent, OperationEquivalence::Flags flags, function_ref< LogicalResult(ValueRange, ValueRange)> checkCommutativeEquivalent=nullptr)
Compare two regions (including their subregions) and return if they are equivalent.
static llvm::hash_code computeHash(Operation *op, function_ref< llvm::hash_code(Value)> hashOperands=[](Value v) { return hash_value(v);}, function_ref< llvm::hash_code(Value)> hashResults=[](Value v) { return hash_value(v);}, Flags flags=Flags::None)
Compute a hash for the given operation.