#include "mlir/Dialect/Bufferization/Transforms/Passes.h"
#include "mlir/Dialect/Func/IR/FuncOps.h"
#include "mlir/Dialect/MemRef/IR/MemRef.h"
namespace mlir {
namespace bufferization {
#define GEN_PASS_DEF_DROPEQUIVALENTBUFFERRESULTSPASS
#include "mlir/Dialect/Bufferization/Transforms/Passes.h.inc"
}
}
using namespace mlir;
static SmallVector<func::ReturnOp> getReturnOps(func::FuncOp funcOp) {
SmallVector<func::ReturnOp> returnOps;
for (Block &b : funcOp.getBody()) {
if (auto candidateOp = dyn_cast<func::ReturnOp>(b.getTerminator())) {
returnOps.push_back(candidateOp);
}
}
return returnOps;
}
static SmallVector<Value>
getReturnOpsOperandInPos(ArrayRef<func::ReturnOp> returnOps, size_t pos) {
return llvm::map_to_vector(returnOps, [&](func::ReturnOp returnOp) {
return returnOp.getOperand(pos);
});
}
static bool operandsEqualFuncArgument(ArrayRef<Value> operands,
BlockArgument argument) {
for (Value val : operands) {
while (auto castOp = val.getDefiningOp<memref::CastOp>())
val = castOp.getSource();
if (val != argument)
return false;
}
return true;
}
LogicalResult
mlir::bufferization::dropEquivalentBufferResults(ModuleOp module) {
IRRewriter rewriter(module.getContext());
DenseMap<func::FuncOp, DenseSet<func::CallOp>> callerMap;
module.walk([&](func::CallOp callOp) {
if (func::FuncOp calledFunc =
dyn_cast_or_null<func::FuncOp>(callOp.resolveCallable())) {
if (!calledFunc.isPublic() && !calledFunc.isExternal())
callerMap[calledFunc].insert(callOp);
}
});
for (auto funcOp : module.getOps<func::FuncOp>()) {
if (funcOp.isExternal() || funcOp.isPublic())
continue;
SmallVector<func::ReturnOp> returnOps = getReturnOps(funcOp);
if (returnOps.empty())
continue;
size_t numReturnOps = returnOps.size();
size_t numReturnValues = funcOp.getFunctionType().getNumResults();
SmallVector<SmallVector<Value>> newReturnValues(numReturnOps);
BitVector erasedResultIndices(numReturnValues);
DenseMap<int64_t, int64_t> resultToArgs;
for (size_t i = 0; i < numReturnValues; ++i) {
bool erased = false;
SmallVector<Value> returnOperands =
getReturnOpsOperandInPos(returnOps, i);
for (BlockArgument bbArg : funcOp.getArguments()) {
if (operandsEqualFuncArgument(returnOperands, bbArg)) {
resultToArgs[i] = bbArg.getArgNumber();
erased = true;
break;
}
}
if (erased) {
erasedResultIndices.set(i);
} else {
for (auto [newReturnValue, operand] :
llvm::zip(newReturnValues, returnOperands)) {
newReturnValue.push_back(operand);
}
}
}
if (failed(funcOp.eraseResults(erasedResultIndices)))
return failure();
for (auto [returnOp, newReturnValue] :
llvm::zip(returnOps, newReturnValues))
returnOp.getOperandsMutable().assign(newReturnValue);
for (func::CallOp callOp : callerMap[funcOp]) {
rewriter.setInsertionPoint(callOp);
auto newCallOp = func::CallOp::create(rewriter, callOp.getLoc(), funcOp,
callOp.getOperands());
SmallVector<Value> newResults;
int64_t nextResult = 0;
for (int64_t i = 0; i < callOp.getNumResults(); ++i) {
if (!resultToArgs.count(i)) {
newResults.push_back(newCallOp.getResult(nextResult++));
continue;
}
Value replacement = callOp.getOperand(resultToArgs[i]);
Type expectedType = callOp.getResult(i).getType();
if (replacement.getType() != expectedType) {
replacement = memref::CastOp::create(rewriter, callOp.getLoc(),
expectedType, replacement);
}
newResults.push_back(replacement);
}
rewriter.replaceOp(callOp, newResults);
}
}
return success();
}
namespace {
struct DropEquivalentBufferResultsPass
: bufferization::impl::DropEquivalentBufferResultsPassBase<
DropEquivalentBufferResultsPass> {
void runOnOperation() override {
if (failed(bufferization::dropEquivalentBufferResults(getOperation())))
return signalPassFailure();
}
};
}