15c0c51a9SNicolas Vasilache //===- VectorToLLVM.cpp - Conversion from Vector to the LLVM dialect ------===// 25c0c51a9SNicolas Vasilache // 330857107SMehdi Amini // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 456222a06SMehdi Amini // See https://llvm.org/LICENSE.txt for license information. 556222a06SMehdi Amini // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 65c0c51a9SNicolas Vasilache // 756222a06SMehdi Amini //===----------------------------------------------------------------------===// 85c0c51a9SNicolas Vasilache 965678d93SNicolas Vasilache #include "mlir/Conversion/VectorToLLVM/ConvertVectorToLLVM.h" 10870c1fd4SAlex Zinenko 111834ad4aSRiver Riddle #include "../PassDetail.h" 125c0c51a9SNicolas Vasilache #include "mlir/Conversion/StandardToLLVM/ConvertStandardToLLVM.h" 135c0c51a9SNicolas Vasilache #include "mlir/Conversion/StandardToLLVM/ConvertStandardToLLVMPass.h" 145c0c51a9SNicolas Vasilache #include "mlir/Dialect/LLVMIR/LLVMDialect.h" 1569d757c0SRob Suderman #include "mlir/Dialect/StandardOps/IR/Ops.h" 164d60f47bSRob Suderman #include "mlir/Dialect/Vector/VectorOps.h" 178345b86dSNicolas Vasilache #include "mlir/IR/AffineMap.h" 185c0c51a9SNicolas Vasilache #include "mlir/IR/Attributes.h" 195c0c51a9SNicolas Vasilache #include "mlir/IR/Builders.h" 205c0c51a9SNicolas Vasilache #include "mlir/IR/MLIRContext.h" 215c0c51a9SNicolas Vasilache #include "mlir/IR/Module.h" 225c0c51a9SNicolas Vasilache #include "mlir/IR/Operation.h" 235c0c51a9SNicolas Vasilache #include "mlir/IR/PatternMatch.h" 245c0c51a9SNicolas Vasilache #include "mlir/IR/StandardTypes.h" 255c0c51a9SNicolas Vasilache #include "mlir/IR/Types.h" 26ec1f4e7cSAlex Zinenko #include "mlir/Target/LLVMIR/TypeTranslation.h" 275c0c51a9SNicolas Vasilache #include "mlir/Transforms/DialectConversion.h" 285c0c51a9SNicolas Vasilache #include "mlir/Transforms/Passes.h" 295c0c51a9SNicolas Vasilache #include "llvm/IR/DerivedTypes.h" 305c0c51a9SNicolas Vasilache #include "llvm/IR/Module.h" 315c0c51a9SNicolas Vasilache #include "llvm/IR/Type.h" 325c0c51a9SNicolas Vasilache #include "llvm/Support/Allocator.h" 335c0c51a9SNicolas Vasilache #include "llvm/Support/ErrorHandling.h" 345c0c51a9SNicolas Vasilache 355c0c51a9SNicolas Vasilache using namespace mlir; 3665678d93SNicolas Vasilache using namespace mlir::vector; 375c0c51a9SNicolas Vasilache 389826fe5cSAart Bik // Helper to reduce vector type by one rank at front. 399826fe5cSAart Bik static VectorType reducedVectorTypeFront(VectorType tp) { 409826fe5cSAart Bik assert((tp.getRank() > 1) && "unlowerable vector type"); 419826fe5cSAart Bik return VectorType::get(tp.getShape().drop_front(), tp.getElementType()); 429826fe5cSAart Bik } 439826fe5cSAart Bik 449826fe5cSAart Bik // Helper to reduce vector type by *all* but one rank at back. 459826fe5cSAart Bik static VectorType reducedVectorTypeBack(VectorType tp) { 469826fe5cSAart Bik assert((tp.getRank() > 1) && "unlowerable vector type"); 479826fe5cSAart Bik return VectorType::get(tp.getShape().take_back(), tp.getElementType()); 489826fe5cSAart Bik } 499826fe5cSAart Bik 501c81adf3SAart Bik // Helper that picks the proper sequence for inserting. 51e62a6956SRiver Riddle static Value insertOne(ConversionPatternRewriter &rewriter, 520f04384dSAlex Zinenko LLVMTypeConverter &typeConverter, Location loc, 530f04384dSAlex Zinenko Value val1, Value val2, Type llvmType, int64_t rank, 540f04384dSAlex Zinenko int64_t pos) { 551c81adf3SAart Bik if (rank == 1) { 561c81adf3SAart Bik auto idxType = rewriter.getIndexType(); 571c81adf3SAart Bik auto constant = rewriter.create<LLVM::ConstantOp>( 580f04384dSAlex Zinenko loc, typeConverter.convertType(idxType), 591c81adf3SAart Bik rewriter.getIntegerAttr(idxType, pos)); 601c81adf3SAart Bik return rewriter.create<LLVM::InsertElementOp>(loc, llvmType, val1, val2, 611c81adf3SAart Bik constant); 621c81adf3SAart Bik } 631c81adf3SAart Bik return rewriter.create<LLVM::InsertValueOp>(loc, llvmType, val1, val2, 641c81adf3SAart Bik rewriter.getI64ArrayAttr(pos)); 651c81adf3SAart Bik } 661c81adf3SAart Bik 672d515e49SNicolas Vasilache // Helper that picks the proper sequence for inserting. 682d515e49SNicolas Vasilache static Value insertOne(PatternRewriter &rewriter, Location loc, Value from, 692d515e49SNicolas Vasilache Value into, int64_t offset) { 702d515e49SNicolas Vasilache auto vectorType = into.getType().cast<VectorType>(); 712d515e49SNicolas Vasilache if (vectorType.getRank() > 1) 722d515e49SNicolas Vasilache return rewriter.create<InsertOp>(loc, from, into, offset); 732d515e49SNicolas Vasilache return rewriter.create<vector::InsertElementOp>( 742d515e49SNicolas Vasilache loc, vectorType, from, into, 752d515e49SNicolas Vasilache rewriter.create<ConstantIndexOp>(loc, offset)); 762d515e49SNicolas Vasilache } 772d515e49SNicolas Vasilache 781c81adf3SAart Bik // Helper that picks the proper sequence for extracting. 79e62a6956SRiver Riddle static Value extractOne(ConversionPatternRewriter &rewriter, 800f04384dSAlex Zinenko LLVMTypeConverter &typeConverter, Location loc, 810f04384dSAlex Zinenko Value val, Type llvmType, int64_t rank, int64_t pos) { 821c81adf3SAart Bik if (rank == 1) { 831c81adf3SAart Bik auto idxType = rewriter.getIndexType(); 841c81adf3SAart Bik auto constant = rewriter.create<LLVM::ConstantOp>( 850f04384dSAlex Zinenko loc, typeConverter.convertType(idxType), 861c81adf3SAart Bik rewriter.getIntegerAttr(idxType, pos)); 871c81adf3SAart Bik return rewriter.create<LLVM::ExtractElementOp>(loc, llvmType, val, 881c81adf3SAart Bik constant); 891c81adf3SAart Bik } 901c81adf3SAart Bik return rewriter.create<LLVM::ExtractValueOp>(loc, llvmType, val, 911c81adf3SAart Bik rewriter.getI64ArrayAttr(pos)); 921c81adf3SAart Bik } 931c81adf3SAart Bik 942d515e49SNicolas Vasilache // Helper that picks the proper sequence for extracting. 952d515e49SNicolas Vasilache static Value extractOne(PatternRewriter &rewriter, Location loc, Value vector, 962d515e49SNicolas Vasilache int64_t offset) { 972d515e49SNicolas Vasilache auto vectorType = vector.getType().cast<VectorType>(); 982d515e49SNicolas Vasilache if (vectorType.getRank() > 1) 992d515e49SNicolas Vasilache return rewriter.create<ExtractOp>(loc, vector, offset); 1002d515e49SNicolas Vasilache return rewriter.create<vector::ExtractElementOp>( 1012d515e49SNicolas Vasilache loc, vectorType.getElementType(), vector, 1022d515e49SNicolas Vasilache rewriter.create<ConstantIndexOp>(loc, offset)); 1032d515e49SNicolas Vasilache } 1042d515e49SNicolas Vasilache 1052d515e49SNicolas Vasilache // Helper that returns a subset of `arrayAttr` as a vector of int64_t. 1069db53a18SRiver Riddle // TODO: Better support for attribute subtype forwarding + slicing. 1072d515e49SNicolas Vasilache static SmallVector<int64_t, 4> getI64SubArray(ArrayAttr arrayAttr, 1082d515e49SNicolas Vasilache unsigned dropFront = 0, 1092d515e49SNicolas Vasilache unsigned dropBack = 0) { 1102d515e49SNicolas Vasilache assert(arrayAttr.size() > dropFront + dropBack && "Out of bounds"); 1112d515e49SNicolas Vasilache auto range = arrayAttr.getAsRange<IntegerAttr>(); 1122d515e49SNicolas Vasilache SmallVector<int64_t, 4> res; 1132d515e49SNicolas Vasilache res.reserve(arrayAttr.size() - dropFront - dropBack); 1142d515e49SNicolas Vasilache for (auto it = range.begin() + dropFront, eit = range.end() - dropBack; 1152d515e49SNicolas Vasilache it != eit; ++it) 1162d515e49SNicolas Vasilache res.push_back((*it).getValue().getSExtValue()); 1172d515e49SNicolas Vasilache return res; 1182d515e49SNicolas Vasilache } 1192d515e49SNicolas Vasilache 12019dbb230Saartbik // Helper that returns data layout alignment of an operation with memref. 12119dbb230Saartbik template <typename T> 12219dbb230Saartbik LogicalResult getMemRefAlignment(LLVMTypeConverter &typeConverter, T op, 12319dbb230Saartbik unsigned &align) { 1245f9e0466SNicolas Vasilache Type elementTy = 12519dbb230Saartbik typeConverter.convertType(op.getMemRefType().getElementType()); 1265f9e0466SNicolas Vasilache if (!elementTy) 1275f9e0466SNicolas Vasilache return failure(); 1285f9e0466SNicolas Vasilache 129b2ab375dSAlex Zinenko // TODO: this should use the MLIR data layout when it becomes available and 130b2ab375dSAlex Zinenko // stop depending on translation. 131b2ab375dSAlex Zinenko LLVM::LLVMDialect *dialect = typeConverter.getDialect(); 132b2ab375dSAlex Zinenko align = LLVM::TypeToLLVMIRTranslator(dialect->getLLVMContext()) 133b2ab375dSAlex Zinenko .getPreferredAlignment(elementTy.cast<LLVM::LLVMType>(), 134d3a98076SAlex Zinenko dialect->getDataLayout()); 1355f9e0466SNicolas Vasilache return success(); 1365f9e0466SNicolas Vasilache } 1375f9e0466SNicolas Vasilache 138e8dcf5f8Saartbik // Helper that returns the base address of a memref. 139e8dcf5f8Saartbik LogicalResult getBase(ConversionPatternRewriter &rewriter, Location loc, 140e8dcf5f8Saartbik Value memref, MemRefType memRefType, Value &base) { 14119dbb230Saartbik // Inspect stride and offset structure. 14219dbb230Saartbik // 14319dbb230Saartbik // TODO: flat memory only for now, generalize 14419dbb230Saartbik // 14519dbb230Saartbik int64_t offset; 14619dbb230Saartbik SmallVector<int64_t, 4> strides; 14719dbb230Saartbik auto successStrides = getStridesAndOffset(memRefType, strides, offset); 14819dbb230Saartbik if (failed(successStrides) || strides.size() != 1 || strides[0] != 1 || 14919dbb230Saartbik offset != 0 || memRefType.getMemorySpace() != 0) 15019dbb230Saartbik return failure(); 151e8dcf5f8Saartbik base = MemRefDescriptor(memref).alignedPtr(rewriter, loc); 152e8dcf5f8Saartbik return success(); 153e8dcf5f8Saartbik } 15419dbb230Saartbik 155e8dcf5f8Saartbik // Helper that returns a pointer given a memref base. 156e8dcf5f8Saartbik LogicalResult getBasePtr(ConversionPatternRewriter &rewriter, Location loc, 157e8dcf5f8Saartbik Value memref, MemRefType memRefType, Value &ptr) { 158e8dcf5f8Saartbik Value base; 159e8dcf5f8Saartbik if (failed(getBase(rewriter, loc, memref, memRefType, base))) 160e8dcf5f8Saartbik return failure(); 161e8dcf5f8Saartbik auto pType = MemRefDescriptor(memref).getElementType(); 162e8dcf5f8Saartbik ptr = rewriter.create<LLVM::GEPOp>(loc, pType, base); 163e8dcf5f8Saartbik return success(); 164e8dcf5f8Saartbik } 165e8dcf5f8Saartbik 16639379916Saartbik // Helper that returns a bit-casted pointer given a memref base. 16739379916Saartbik LogicalResult getBasePtr(ConversionPatternRewriter &rewriter, Location loc, 16839379916Saartbik Value memref, MemRefType memRefType, Type type, 16939379916Saartbik Value &ptr) { 17039379916Saartbik Value base; 17139379916Saartbik if (failed(getBase(rewriter, loc, memref, memRefType, base))) 17239379916Saartbik return failure(); 17339379916Saartbik auto pType = type.template cast<LLVM::LLVMType>().getPointerTo(); 17439379916Saartbik base = rewriter.create<LLVM::BitcastOp>(loc, pType, base); 17539379916Saartbik ptr = rewriter.create<LLVM::GEPOp>(loc, pType, base); 17639379916Saartbik return success(); 17739379916Saartbik } 17839379916Saartbik 179e8dcf5f8Saartbik // Helper that returns vector of pointers given a memref base and an index 180e8dcf5f8Saartbik // vector. 181e8dcf5f8Saartbik LogicalResult getIndexedPtrs(ConversionPatternRewriter &rewriter, Location loc, 182e8dcf5f8Saartbik Value memref, Value indices, MemRefType memRefType, 183e8dcf5f8Saartbik VectorType vType, Type iType, Value &ptrs) { 184e8dcf5f8Saartbik Value base; 185e8dcf5f8Saartbik if (failed(getBase(rewriter, loc, memref, memRefType, base))) 186e8dcf5f8Saartbik return failure(); 187e8dcf5f8Saartbik auto pType = MemRefDescriptor(memref).getElementType(); 188e8dcf5f8Saartbik auto ptrsType = LLVM::LLVMType::getVectorTy(pType, vType.getDimSize(0)); 1891485fd29Saartbik ptrs = rewriter.create<LLVM::GEPOp>(loc, ptrsType, base, indices); 19019dbb230Saartbik return success(); 19119dbb230Saartbik } 19219dbb230Saartbik 1935f9e0466SNicolas Vasilache static LogicalResult 1945f9e0466SNicolas Vasilache replaceTransferOpWithLoadOrStore(ConversionPatternRewriter &rewriter, 1955f9e0466SNicolas Vasilache LLVMTypeConverter &typeConverter, Location loc, 1965f9e0466SNicolas Vasilache TransferReadOp xferOp, 1975f9e0466SNicolas Vasilache ArrayRef<Value> operands, Value dataPtr) { 198affbc0cdSNicolas Vasilache unsigned align; 19919dbb230Saartbik if (failed(getMemRefAlignment(typeConverter, xferOp, align))) 200affbc0cdSNicolas Vasilache return failure(); 201affbc0cdSNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::LoadOp>(xferOp, dataPtr, align); 2025f9e0466SNicolas Vasilache return success(); 2035f9e0466SNicolas Vasilache } 2045f9e0466SNicolas Vasilache 2055f9e0466SNicolas Vasilache static LogicalResult 2065f9e0466SNicolas Vasilache replaceTransferOpWithMasked(ConversionPatternRewriter &rewriter, 2075f9e0466SNicolas Vasilache LLVMTypeConverter &typeConverter, Location loc, 2085f9e0466SNicolas Vasilache TransferReadOp xferOp, ArrayRef<Value> operands, 2095f9e0466SNicolas Vasilache Value dataPtr, Value mask) { 2105f9e0466SNicolas Vasilache auto toLLVMTy = [&](Type t) { return typeConverter.convertType(t); }; 2115f9e0466SNicolas Vasilache VectorType fillType = xferOp.getVectorType(); 2125f9e0466SNicolas Vasilache Value fill = rewriter.create<SplatOp>(loc, fillType, xferOp.padding()); 2135f9e0466SNicolas Vasilache fill = rewriter.create<LLVM::DialectCastOp>(loc, toLLVMTy(fillType), fill); 2145f9e0466SNicolas Vasilache 2155f9e0466SNicolas Vasilache Type vecTy = typeConverter.convertType(xferOp.getVectorType()); 2165f9e0466SNicolas Vasilache if (!vecTy) 2175f9e0466SNicolas Vasilache return failure(); 2185f9e0466SNicolas Vasilache 2195f9e0466SNicolas Vasilache unsigned align; 22019dbb230Saartbik if (failed(getMemRefAlignment(typeConverter, xferOp, align))) 2215f9e0466SNicolas Vasilache return failure(); 2225f9e0466SNicolas Vasilache 2235f9e0466SNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::MaskedLoadOp>( 2245f9e0466SNicolas Vasilache xferOp, vecTy, dataPtr, mask, ValueRange{fill}, 2255f9e0466SNicolas Vasilache rewriter.getI32IntegerAttr(align)); 2265f9e0466SNicolas Vasilache return success(); 2275f9e0466SNicolas Vasilache } 2285f9e0466SNicolas Vasilache 2295f9e0466SNicolas Vasilache static LogicalResult 2305f9e0466SNicolas Vasilache replaceTransferOpWithLoadOrStore(ConversionPatternRewriter &rewriter, 2315f9e0466SNicolas Vasilache LLVMTypeConverter &typeConverter, Location loc, 2325f9e0466SNicolas Vasilache TransferWriteOp xferOp, 2335f9e0466SNicolas Vasilache ArrayRef<Value> operands, Value dataPtr) { 234affbc0cdSNicolas Vasilache unsigned align; 23519dbb230Saartbik if (failed(getMemRefAlignment(typeConverter, xferOp, align))) 236affbc0cdSNicolas Vasilache return failure(); 2372d2c73c5SJacques Pienaar auto adaptor = TransferWriteOpAdaptor(operands); 238affbc0cdSNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::StoreOp>(xferOp, adaptor.vector(), dataPtr, 239affbc0cdSNicolas Vasilache align); 2405f9e0466SNicolas Vasilache return success(); 2415f9e0466SNicolas Vasilache } 2425f9e0466SNicolas Vasilache 2435f9e0466SNicolas Vasilache static LogicalResult 2445f9e0466SNicolas Vasilache replaceTransferOpWithMasked(ConversionPatternRewriter &rewriter, 2455f9e0466SNicolas Vasilache LLVMTypeConverter &typeConverter, Location loc, 2465f9e0466SNicolas Vasilache TransferWriteOp xferOp, ArrayRef<Value> operands, 2475f9e0466SNicolas Vasilache Value dataPtr, Value mask) { 2485f9e0466SNicolas Vasilache unsigned align; 24919dbb230Saartbik if (failed(getMemRefAlignment(typeConverter, xferOp, align))) 2505f9e0466SNicolas Vasilache return failure(); 2515f9e0466SNicolas Vasilache 2522d2c73c5SJacques Pienaar auto adaptor = TransferWriteOpAdaptor(operands); 2535f9e0466SNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::MaskedStoreOp>( 2545f9e0466SNicolas Vasilache xferOp, adaptor.vector(), dataPtr, mask, 2555f9e0466SNicolas Vasilache rewriter.getI32IntegerAttr(align)); 2565f9e0466SNicolas Vasilache return success(); 2575f9e0466SNicolas Vasilache } 2585f9e0466SNicolas Vasilache 2592d2c73c5SJacques Pienaar static TransferReadOpAdaptor getTransferOpAdapter(TransferReadOp xferOp, 2602d2c73c5SJacques Pienaar ArrayRef<Value> operands) { 2612d2c73c5SJacques Pienaar return TransferReadOpAdaptor(operands); 2625f9e0466SNicolas Vasilache } 2635f9e0466SNicolas Vasilache 2642d2c73c5SJacques Pienaar static TransferWriteOpAdaptor getTransferOpAdapter(TransferWriteOp xferOp, 2652d2c73c5SJacques Pienaar ArrayRef<Value> operands) { 2662d2c73c5SJacques Pienaar return TransferWriteOpAdaptor(operands); 2675f9e0466SNicolas Vasilache } 2685f9e0466SNicolas Vasilache 26990c01357SBenjamin Kramer namespace { 270e83b7b99Saartbik 27163b683a8SNicolas Vasilache /// Conversion pattern for a vector.matrix_multiply. 27263b683a8SNicolas Vasilache /// This is lowered directly to the proper llvm.intr.matrix.multiply. 27363b683a8SNicolas Vasilache class VectorMatmulOpConversion : public ConvertToLLVMPattern { 27463b683a8SNicolas Vasilache public: 27563b683a8SNicolas Vasilache explicit VectorMatmulOpConversion(MLIRContext *context, 27663b683a8SNicolas Vasilache LLVMTypeConverter &typeConverter) 27763b683a8SNicolas Vasilache : ConvertToLLVMPattern(vector::MatmulOp::getOperationName(), context, 27863b683a8SNicolas Vasilache typeConverter) {} 27963b683a8SNicolas Vasilache 2803145427dSRiver Riddle LogicalResult 28163b683a8SNicolas Vasilache matchAndRewrite(Operation *op, ArrayRef<Value> operands, 28263b683a8SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 28363b683a8SNicolas Vasilache auto matmulOp = cast<vector::MatmulOp>(op); 2842d2c73c5SJacques Pienaar auto adaptor = vector::MatmulOpAdaptor(operands); 28563b683a8SNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::MatrixMultiplyOp>( 28663b683a8SNicolas Vasilache op, typeConverter.convertType(matmulOp.res().getType()), adaptor.lhs(), 28763b683a8SNicolas Vasilache adaptor.rhs(), matmulOp.lhs_rows(), matmulOp.lhs_columns(), 28863b683a8SNicolas Vasilache matmulOp.rhs_columns()); 2893145427dSRiver Riddle return success(); 29063b683a8SNicolas Vasilache } 29163b683a8SNicolas Vasilache }; 29263b683a8SNicolas Vasilache 293c295a65dSaartbik /// Conversion pattern for a vector.flat_transpose. 294c295a65dSaartbik /// This is lowered directly to the proper llvm.intr.matrix.transpose. 295c295a65dSaartbik class VectorFlatTransposeOpConversion : public ConvertToLLVMPattern { 296c295a65dSaartbik public: 297c295a65dSaartbik explicit VectorFlatTransposeOpConversion(MLIRContext *context, 298c295a65dSaartbik LLVMTypeConverter &typeConverter) 299c295a65dSaartbik : ConvertToLLVMPattern(vector::FlatTransposeOp::getOperationName(), 300c295a65dSaartbik context, typeConverter) {} 301c295a65dSaartbik 302c295a65dSaartbik LogicalResult 303c295a65dSaartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 304c295a65dSaartbik ConversionPatternRewriter &rewriter) const override { 305c295a65dSaartbik auto transOp = cast<vector::FlatTransposeOp>(op); 3062d2c73c5SJacques Pienaar auto adaptor = vector::FlatTransposeOpAdaptor(operands); 307c295a65dSaartbik rewriter.replaceOpWithNewOp<LLVM::MatrixTransposeOp>( 308c295a65dSaartbik transOp, typeConverter.convertType(transOp.res().getType()), 309c295a65dSaartbik adaptor.matrix(), transOp.rows(), transOp.columns()); 310c295a65dSaartbik return success(); 311c295a65dSaartbik } 312c295a65dSaartbik }; 313c295a65dSaartbik 31439379916Saartbik /// Conversion pattern for a vector.maskedload. 31539379916Saartbik class VectorMaskedLoadOpConversion : public ConvertToLLVMPattern { 31639379916Saartbik public: 31739379916Saartbik explicit VectorMaskedLoadOpConversion(MLIRContext *context, 31839379916Saartbik LLVMTypeConverter &typeConverter) 31939379916Saartbik : ConvertToLLVMPattern(vector::MaskedLoadOp::getOperationName(), context, 32039379916Saartbik typeConverter) {} 32139379916Saartbik 32239379916Saartbik LogicalResult 32339379916Saartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 32439379916Saartbik ConversionPatternRewriter &rewriter) const override { 32539379916Saartbik auto loc = op->getLoc(); 32639379916Saartbik auto load = cast<vector::MaskedLoadOp>(op); 32739379916Saartbik auto adaptor = vector::MaskedLoadOpAdaptor(operands); 32839379916Saartbik 32939379916Saartbik // Resolve alignment. 33039379916Saartbik unsigned align; 33139379916Saartbik if (failed(getMemRefAlignment(typeConverter, load, align))) 33239379916Saartbik return failure(); 33339379916Saartbik 33439379916Saartbik auto vtype = typeConverter.convertType(load.getResultVectorType()); 33539379916Saartbik Value ptr; 33639379916Saartbik if (failed(getBasePtr(rewriter, loc, adaptor.base(), load.getMemRefType(), 33739379916Saartbik vtype, ptr))) 33839379916Saartbik return failure(); 33939379916Saartbik 34039379916Saartbik rewriter.replaceOpWithNewOp<LLVM::MaskedLoadOp>( 34139379916Saartbik load, vtype, ptr, adaptor.mask(), adaptor.pass_thru(), 34239379916Saartbik rewriter.getI32IntegerAttr(align)); 34339379916Saartbik return success(); 34439379916Saartbik } 34539379916Saartbik }; 34639379916Saartbik 34739379916Saartbik /// Conversion pattern for a vector.maskedstore. 34839379916Saartbik class VectorMaskedStoreOpConversion : public ConvertToLLVMPattern { 34939379916Saartbik public: 35039379916Saartbik explicit VectorMaskedStoreOpConversion(MLIRContext *context, 35139379916Saartbik LLVMTypeConverter &typeConverter) 35239379916Saartbik : ConvertToLLVMPattern(vector::MaskedStoreOp::getOperationName(), context, 35339379916Saartbik typeConverter) {} 35439379916Saartbik 35539379916Saartbik LogicalResult 35639379916Saartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 35739379916Saartbik ConversionPatternRewriter &rewriter) const override { 35839379916Saartbik auto loc = op->getLoc(); 35939379916Saartbik auto store = cast<vector::MaskedStoreOp>(op); 36039379916Saartbik auto adaptor = vector::MaskedStoreOpAdaptor(operands); 36139379916Saartbik 36239379916Saartbik // Resolve alignment. 36339379916Saartbik unsigned align; 36439379916Saartbik if (failed(getMemRefAlignment(typeConverter, store, align))) 36539379916Saartbik return failure(); 36639379916Saartbik 36739379916Saartbik auto vtype = typeConverter.convertType(store.getValueVectorType()); 36839379916Saartbik Value ptr; 36939379916Saartbik if (failed(getBasePtr(rewriter, loc, adaptor.base(), store.getMemRefType(), 37039379916Saartbik vtype, ptr))) 37139379916Saartbik return failure(); 37239379916Saartbik 37339379916Saartbik rewriter.replaceOpWithNewOp<LLVM::MaskedStoreOp>( 37439379916Saartbik store, adaptor.value(), ptr, adaptor.mask(), 37539379916Saartbik rewriter.getI32IntegerAttr(align)); 37639379916Saartbik return success(); 37739379916Saartbik } 37839379916Saartbik }; 37939379916Saartbik 38019dbb230Saartbik /// Conversion pattern for a vector.gather. 38119dbb230Saartbik class VectorGatherOpConversion : public ConvertToLLVMPattern { 38219dbb230Saartbik public: 38319dbb230Saartbik explicit VectorGatherOpConversion(MLIRContext *context, 38419dbb230Saartbik LLVMTypeConverter &typeConverter) 38519dbb230Saartbik : ConvertToLLVMPattern(vector::GatherOp::getOperationName(), context, 38619dbb230Saartbik typeConverter) {} 38719dbb230Saartbik 38819dbb230Saartbik LogicalResult 38919dbb230Saartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 39019dbb230Saartbik ConversionPatternRewriter &rewriter) const override { 39119dbb230Saartbik auto loc = op->getLoc(); 39219dbb230Saartbik auto gather = cast<vector::GatherOp>(op); 39319dbb230Saartbik auto adaptor = vector::GatherOpAdaptor(operands); 39419dbb230Saartbik 39519dbb230Saartbik // Resolve alignment. 39619dbb230Saartbik unsigned align; 39719dbb230Saartbik if (failed(getMemRefAlignment(typeConverter, gather, align))) 39819dbb230Saartbik return failure(); 39919dbb230Saartbik 40019dbb230Saartbik // Get index ptrs. 40119dbb230Saartbik VectorType vType = gather.getResultVectorType(); 40219dbb230Saartbik Type iType = gather.getIndicesVectorType().getElementType(); 40319dbb230Saartbik Value ptrs; 404e8dcf5f8Saartbik if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), adaptor.indices(), 405e8dcf5f8Saartbik gather.getMemRefType(), vType, iType, ptrs))) 40619dbb230Saartbik return failure(); 40719dbb230Saartbik 40819dbb230Saartbik // Replace with the gather intrinsic. 40919dbb230Saartbik ValueRange v = (llvm::size(adaptor.pass_thru()) == 0) ? ValueRange({}) 41019dbb230Saartbik : adaptor.pass_thru(); 41119dbb230Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_gather>( 41219dbb230Saartbik gather, typeConverter.convertType(vType), ptrs, adaptor.mask(), v, 41319dbb230Saartbik rewriter.getI32IntegerAttr(align)); 41419dbb230Saartbik return success(); 41519dbb230Saartbik } 41619dbb230Saartbik }; 41719dbb230Saartbik 41819dbb230Saartbik /// Conversion pattern for a vector.scatter. 41919dbb230Saartbik class VectorScatterOpConversion : public ConvertToLLVMPattern { 42019dbb230Saartbik public: 42119dbb230Saartbik explicit VectorScatterOpConversion(MLIRContext *context, 42219dbb230Saartbik LLVMTypeConverter &typeConverter) 42319dbb230Saartbik : ConvertToLLVMPattern(vector::ScatterOp::getOperationName(), context, 42419dbb230Saartbik typeConverter) {} 42519dbb230Saartbik 42619dbb230Saartbik LogicalResult 42719dbb230Saartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 42819dbb230Saartbik ConversionPatternRewriter &rewriter) const override { 42919dbb230Saartbik auto loc = op->getLoc(); 43019dbb230Saartbik auto scatter = cast<vector::ScatterOp>(op); 43119dbb230Saartbik auto adaptor = vector::ScatterOpAdaptor(operands); 43219dbb230Saartbik 43319dbb230Saartbik // Resolve alignment. 43419dbb230Saartbik unsigned align; 43519dbb230Saartbik if (failed(getMemRefAlignment(typeConverter, scatter, align))) 43619dbb230Saartbik return failure(); 43719dbb230Saartbik 43819dbb230Saartbik // Get index ptrs. 43919dbb230Saartbik VectorType vType = scatter.getValueVectorType(); 44019dbb230Saartbik Type iType = scatter.getIndicesVectorType().getElementType(); 44119dbb230Saartbik Value ptrs; 442e8dcf5f8Saartbik if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), adaptor.indices(), 443e8dcf5f8Saartbik scatter.getMemRefType(), vType, iType, ptrs))) 44419dbb230Saartbik return failure(); 44519dbb230Saartbik 44619dbb230Saartbik // Replace with the scatter intrinsic. 44719dbb230Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_scatter>( 44819dbb230Saartbik scatter, adaptor.value(), ptrs, adaptor.mask(), 44919dbb230Saartbik rewriter.getI32IntegerAttr(align)); 45019dbb230Saartbik return success(); 45119dbb230Saartbik } 45219dbb230Saartbik }; 45319dbb230Saartbik 454e8dcf5f8Saartbik /// Conversion pattern for a vector.expandload. 455e8dcf5f8Saartbik class VectorExpandLoadOpConversion : public ConvertToLLVMPattern { 456e8dcf5f8Saartbik public: 457e8dcf5f8Saartbik explicit VectorExpandLoadOpConversion(MLIRContext *context, 458e8dcf5f8Saartbik LLVMTypeConverter &typeConverter) 459e8dcf5f8Saartbik : ConvertToLLVMPattern(vector::ExpandLoadOp::getOperationName(), context, 460e8dcf5f8Saartbik typeConverter) {} 461e8dcf5f8Saartbik 462e8dcf5f8Saartbik LogicalResult 463e8dcf5f8Saartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 464e8dcf5f8Saartbik ConversionPatternRewriter &rewriter) const override { 465e8dcf5f8Saartbik auto loc = op->getLoc(); 466e8dcf5f8Saartbik auto expand = cast<vector::ExpandLoadOp>(op); 467e8dcf5f8Saartbik auto adaptor = vector::ExpandLoadOpAdaptor(operands); 468e8dcf5f8Saartbik 469e8dcf5f8Saartbik Value ptr; 470e8dcf5f8Saartbik if (failed(getBasePtr(rewriter, loc, adaptor.base(), expand.getMemRefType(), 471e8dcf5f8Saartbik ptr))) 472e8dcf5f8Saartbik return failure(); 473e8dcf5f8Saartbik 474e8dcf5f8Saartbik auto vType = expand.getResultVectorType(); 475e8dcf5f8Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_expandload>( 476e8dcf5f8Saartbik op, typeConverter.convertType(vType), ptr, adaptor.mask(), 477e8dcf5f8Saartbik adaptor.pass_thru()); 478e8dcf5f8Saartbik return success(); 479e8dcf5f8Saartbik } 480e8dcf5f8Saartbik }; 481e8dcf5f8Saartbik 482e8dcf5f8Saartbik /// Conversion pattern for a vector.compressstore. 483e8dcf5f8Saartbik class VectorCompressStoreOpConversion : public ConvertToLLVMPattern { 484e8dcf5f8Saartbik public: 485e8dcf5f8Saartbik explicit VectorCompressStoreOpConversion(MLIRContext *context, 486e8dcf5f8Saartbik LLVMTypeConverter &typeConverter) 487e8dcf5f8Saartbik : ConvertToLLVMPattern(vector::CompressStoreOp::getOperationName(), 488e8dcf5f8Saartbik context, typeConverter) {} 489e8dcf5f8Saartbik 490e8dcf5f8Saartbik LogicalResult 491e8dcf5f8Saartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 492e8dcf5f8Saartbik ConversionPatternRewriter &rewriter) const override { 493e8dcf5f8Saartbik auto loc = op->getLoc(); 494e8dcf5f8Saartbik auto compress = cast<vector::CompressStoreOp>(op); 495e8dcf5f8Saartbik auto adaptor = vector::CompressStoreOpAdaptor(operands); 496e8dcf5f8Saartbik 497e8dcf5f8Saartbik Value ptr; 498e8dcf5f8Saartbik if (failed(getBasePtr(rewriter, loc, adaptor.base(), 499e8dcf5f8Saartbik compress.getMemRefType(), ptr))) 500e8dcf5f8Saartbik return failure(); 501e8dcf5f8Saartbik 502e8dcf5f8Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_compressstore>( 503e8dcf5f8Saartbik op, adaptor.value(), ptr, adaptor.mask()); 504e8dcf5f8Saartbik return success(); 505e8dcf5f8Saartbik } 506e8dcf5f8Saartbik }; 507e8dcf5f8Saartbik 50819dbb230Saartbik /// Conversion pattern for all vector reductions. 509870c1fd4SAlex Zinenko class VectorReductionOpConversion : public ConvertToLLVMPattern { 510e83b7b99Saartbik public: 511e83b7b99Saartbik explicit VectorReductionOpConversion(MLIRContext *context, 512ceb1b327Saartbik LLVMTypeConverter &typeConverter, 513ceb1b327Saartbik bool reassociateFP) 514870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::ReductionOp::getOperationName(), context, 515ceb1b327Saartbik typeConverter), 516ceb1b327Saartbik reassociateFPReductions(reassociateFP) {} 517e83b7b99Saartbik 5183145427dSRiver Riddle LogicalResult 519e83b7b99Saartbik matchAndRewrite(Operation *op, ArrayRef<Value> operands, 520e83b7b99Saartbik ConversionPatternRewriter &rewriter) const override { 521e83b7b99Saartbik auto reductionOp = cast<vector::ReductionOp>(op); 522e83b7b99Saartbik auto kind = reductionOp.kind(); 523e83b7b99Saartbik Type eltType = reductionOp.dest().getType(); 5240f04384dSAlex Zinenko Type llvmType = typeConverter.convertType(eltType); 52535b68527SLei Zhang if (eltType.isSignlessInteger(32) || eltType.isSignlessInteger(64)) { 526e83b7b99Saartbik // Integer reductions: add/mul/min/max/and/or/xor. 527e83b7b99Saartbik if (kind == "add") 528e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_add>( 529e83b7b99Saartbik op, llvmType, operands[0]); 530e83b7b99Saartbik else if (kind == "mul") 531e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_mul>( 532e83b7b99Saartbik op, llvmType, operands[0]); 533e83b7b99Saartbik else if (kind == "min") 534e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_smin>( 535e83b7b99Saartbik op, llvmType, operands[0]); 536e83b7b99Saartbik else if (kind == "max") 537e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_smax>( 538e83b7b99Saartbik op, llvmType, operands[0]); 539e83b7b99Saartbik else if (kind == "and") 540e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_and>( 541e83b7b99Saartbik op, llvmType, operands[0]); 542e83b7b99Saartbik else if (kind == "or") 543e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_or>( 544e83b7b99Saartbik op, llvmType, operands[0]); 545e83b7b99Saartbik else if (kind == "xor") 546e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_xor>( 547e83b7b99Saartbik op, llvmType, operands[0]); 548e83b7b99Saartbik else 5493145427dSRiver Riddle return failure(); 5503145427dSRiver Riddle return success(); 551e83b7b99Saartbik 552e83b7b99Saartbik } else if (eltType.isF32() || eltType.isF64()) { 553e83b7b99Saartbik // Floating-point reductions: add/mul/min/max 554e83b7b99Saartbik if (kind == "add") { 5550d924700Saartbik // Optional accumulator (or zero). 5560d924700Saartbik Value acc = operands.size() > 1 ? operands[1] 5570d924700Saartbik : rewriter.create<LLVM::ConstantOp>( 5580d924700Saartbik op->getLoc(), llvmType, 5590d924700Saartbik rewriter.getZeroAttr(eltType)); 560e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_v2_fadd>( 561ceb1b327Saartbik op, llvmType, acc, operands[0], 562ceb1b327Saartbik rewriter.getBoolAttr(reassociateFPReductions)); 563e83b7b99Saartbik } else if (kind == "mul") { 5640d924700Saartbik // Optional accumulator (or one). 5650d924700Saartbik Value acc = operands.size() > 1 5660d924700Saartbik ? operands[1] 5670d924700Saartbik : rewriter.create<LLVM::ConstantOp>( 5680d924700Saartbik op->getLoc(), llvmType, 5690d924700Saartbik rewriter.getFloatAttr(eltType, 1.0)); 570e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_v2_fmul>( 571ceb1b327Saartbik op, llvmType, acc, operands[0], 572ceb1b327Saartbik rewriter.getBoolAttr(reassociateFPReductions)); 573e83b7b99Saartbik } else if (kind == "min") 574e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_fmin>( 575e83b7b99Saartbik op, llvmType, operands[0]); 576e83b7b99Saartbik else if (kind == "max") 577e83b7b99Saartbik rewriter.replaceOpWithNewOp<LLVM::experimental_vector_reduce_fmax>( 578e83b7b99Saartbik op, llvmType, operands[0]); 579e83b7b99Saartbik else 5803145427dSRiver Riddle return failure(); 5813145427dSRiver Riddle return success(); 582e83b7b99Saartbik } 5833145427dSRiver Riddle return failure(); 584e83b7b99Saartbik } 585ceb1b327Saartbik 586ceb1b327Saartbik private: 587ceb1b327Saartbik const bool reassociateFPReductions; 588e83b7b99Saartbik }; 589e83b7b99Saartbik 590870c1fd4SAlex Zinenko class VectorShuffleOpConversion : public ConvertToLLVMPattern { 5911c81adf3SAart Bik public: 5921c81adf3SAart Bik explicit VectorShuffleOpConversion(MLIRContext *context, 5931c81adf3SAart Bik LLVMTypeConverter &typeConverter) 594870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::ShuffleOp::getOperationName(), context, 5951c81adf3SAart Bik typeConverter) {} 5961c81adf3SAart Bik 5973145427dSRiver Riddle LogicalResult 598e62a6956SRiver Riddle matchAndRewrite(Operation *op, ArrayRef<Value> operands, 5991c81adf3SAart Bik ConversionPatternRewriter &rewriter) const override { 6001c81adf3SAart Bik auto loc = op->getLoc(); 6012d2c73c5SJacques Pienaar auto adaptor = vector::ShuffleOpAdaptor(operands); 6021c81adf3SAart Bik auto shuffleOp = cast<vector::ShuffleOp>(op); 6031c81adf3SAart Bik auto v1Type = shuffleOp.getV1VectorType(); 6041c81adf3SAart Bik auto v2Type = shuffleOp.getV2VectorType(); 6051c81adf3SAart Bik auto vectorType = shuffleOp.getVectorType(); 6060f04384dSAlex Zinenko Type llvmType = typeConverter.convertType(vectorType); 6071c81adf3SAart Bik auto maskArrayAttr = shuffleOp.mask(); 6081c81adf3SAart Bik 6091c81adf3SAart Bik // Bail if result type cannot be lowered. 6101c81adf3SAart Bik if (!llvmType) 6113145427dSRiver Riddle return failure(); 6121c81adf3SAart Bik 6131c81adf3SAart Bik // Get rank and dimension sizes. 6141c81adf3SAart Bik int64_t rank = vectorType.getRank(); 6151c81adf3SAart Bik assert(v1Type.getRank() == rank); 6161c81adf3SAart Bik assert(v2Type.getRank() == rank); 6171c81adf3SAart Bik int64_t v1Dim = v1Type.getDimSize(0); 6181c81adf3SAart Bik 6191c81adf3SAart Bik // For rank 1, where both operands have *exactly* the same vector type, 6201c81adf3SAart Bik // there is direct shuffle support in LLVM. Use it! 6211c81adf3SAart Bik if (rank == 1 && v1Type == v2Type) { 622e62a6956SRiver Riddle Value shuffle = rewriter.create<LLVM::ShuffleVectorOp>( 6231c81adf3SAart Bik loc, adaptor.v1(), adaptor.v2(), maskArrayAttr); 6241c81adf3SAart Bik rewriter.replaceOp(op, shuffle); 6253145427dSRiver Riddle return success(); 626b36aaeafSAart Bik } 627b36aaeafSAart Bik 6281c81adf3SAart Bik // For all other cases, insert the individual values individually. 629e62a6956SRiver Riddle Value insert = rewriter.create<LLVM::UndefOp>(loc, llvmType); 6301c81adf3SAart Bik int64_t insPos = 0; 6311c81adf3SAart Bik for (auto en : llvm::enumerate(maskArrayAttr)) { 6321c81adf3SAart Bik int64_t extPos = en.value().cast<IntegerAttr>().getInt(); 633e62a6956SRiver Riddle Value value = adaptor.v1(); 6341c81adf3SAart Bik if (extPos >= v1Dim) { 6351c81adf3SAart Bik extPos -= v1Dim; 6361c81adf3SAart Bik value = adaptor.v2(); 637b36aaeafSAart Bik } 6380f04384dSAlex Zinenko Value extract = extractOne(rewriter, typeConverter, loc, value, llvmType, 6390f04384dSAlex Zinenko rank, extPos); 6400f04384dSAlex Zinenko insert = insertOne(rewriter, typeConverter, loc, insert, extract, 6410f04384dSAlex Zinenko llvmType, rank, insPos++); 6421c81adf3SAart Bik } 6431c81adf3SAart Bik rewriter.replaceOp(op, insert); 6443145427dSRiver Riddle return success(); 645b36aaeafSAart Bik } 646b36aaeafSAart Bik }; 647b36aaeafSAart Bik 648870c1fd4SAlex Zinenko class VectorExtractElementOpConversion : public ConvertToLLVMPattern { 649cd5dab8aSAart Bik public: 650cd5dab8aSAart Bik explicit VectorExtractElementOpConversion(MLIRContext *context, 651cd5dab8aSAart Bik LLVMTypeConverter &typeConverter) 652870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::ExtractElementOp::getOperationName(), 653870c1fd4SAlex Zinenko context, typeConverter) {} 654cd5dab8aSAart Bik 6553145427dSRiver Riddle LogicalResult 656e62a6956SRiver Riddle matchAndRewrite(Operation *op, ArrayRef<Value> operands, 657cd5dab8aSAart Bik ConversionPatternRewriter &rewriter) const override { 6582d2c73c5SJacques Pienaar auto adaptor = vector::ExtractElementOpAdaptor(operands); 659cd5dab8aSAart Bik auto extractEltOp = cast<vector::ExtractElementOp>(op); 660cd5dab8aSAart Bik auto vectorType = extractEltOp.getVectorType(); 6610f04384dSAlex Zinenko auto llvmType = typeConverter.convertType(vectorType.getElementType()); 662cd5dab8aSAart Bik 663cd5dab8aSAart Bik // Bail if result type cannot be lowered. 664cd5dab8aSAart Bik if (!llvmType) 6653145427dSRiver Riddle return failure(); 666cd5dab8aSAart Bik 667cd5dab8aSAart Bik rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>( 668cd5dab8aSAart Bik op, llvmType, adaptor.vector(), adaptor.position()); 6693145427dSRiver Riddle return success(); 670cd5dab8aSAart Bik } 671cd5dab8aSAart Bik }; 672cd5dab8aSAart Bik 673870c1fd4SAlex Zinenko class VectorExtractOpConversion : public ConvertToLLVMPattern { 6745c0c51a9SNicolas Vasilache public: 6759826fe5cSAart Bik explicit VectorExtractOpConversion(MLIRContext *context, 6765c0c51a9SNicolas Vasilache LLVMTypeConverter &typeConverter) 677870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::ExtractOp::getOperationName(), context, 6785c0c51a9SNicolas Vasilache typeConverter) {} 6795c0c51a9SNicolas Vasilache 6803145427dSRiver Riddle LogicalResult 681e62a6956SRiver Riddle matchAndRewrite(Operation *op, ArrayRef<Value> operands, 6825c0c51a9SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 6835c0c51a9SNicolas Vasilache auto loc = op->getLoc(); 6842d2c73c5SJacques Pienaar auto adaptor = vector::ExtractOpAdaptor(operands); 685d37f2725SAart Bik auto extractOp = cast<vector::ExtractOp>(op); 6869826fe5cSAart Bik auto vectorType = extractOp.getVectorType(); 6872bdf33ccSRiver Riddle auto resultType = extractOp.getResult().getType(); 6880f04384dSAlex Zinenko auto llvmResultType = typeConverter.convertType(resultType); 6895c0c51a9SNicolas Vasilache auto positionArrayAttr = extractOp.position(); 6909826fe5cSAart Bik 6919826fe5cSAart Bik // Bail if result type cannot be lowered. 6929826fe5cSAart Bik if (!llvmResultType) 6933145427dSRiver Riddle return failure(); 6949826fe5cSAart Bik 6955c0c51a9SNicolas Vasilache // One-shot extraction of vector from array (only requires extractvalue). 6965c0c51a9SNicolas Vasilache if (resultType.isa<VectorType>()) { 697e62a6956SRiver Riddle Value extracted = rewriter.create<LLVM::ExtractValueOp>( 6985c0c51a9SNicolas Vasilache loc, llvmResultType, adaptor.vector(), positionArrayAttr); 6995c0c51a9SNicolas Vasilache rewriter.replaceOp(op, extracted); 7003145427dSRiver Riddle return success(); 7015c0c51a9SNicolas Vasilache } 7025c0c51a9SNicolas Vasilache 7039826fe5cSAart Bik // Potential extraction of 1-D vector from array. 7045c0c51a9SNicolas Vasilache auto *context = op->getContext(); 705e62a6956SRiver Riddle Value extracted = adaptor.vector(); 7065c0c51a9SNicolas Vasilache auto positionAttrs = positionArrayAttr.getValue(); 7075c0c51a9SNicolas Vasilache if (positionAttrs.size() > 1) { 7089826fe5cSAart Bik auto oneDVectorType = reducedVectorTypeBack(vectorType); 7095c0c51a9SNicolas Vasilache auto nMinusOnePositionAttrs = 7105c0c51a9SNicolas Vasilache ArrayAttr::get(positionAttrs.drop_back(), context); 7115c0c51a9SNicolas Vasilache extracted = rewriter.create<LLVM::ExtractValueOp>( 7120f04384dSAlex Zinenko loc, typeConverter.convertType(oneDVectorType), extracted, 7135c0c51a9SNicolas Vasilache nMinusOnePositionAttrs); 7145c0c51a9SNicolas Vasilache } 7155c0c51a9SNicolas Vasilache 7165c0c51a9SNicolas Vasilache // Remaining extraction of element from 1-D LLVM vector 7175c0c51a9SNicolas Vasilache auto position = positionAttrs.back().cast<IntegerAttr>(); 718*5446ec85SAlex Zinenko auto i64Type = LLVM::LLVMType::getInt64Ty(rewriter.getContext()); 7191d47564aSAart Bik auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position); 7205c0c51a9SNicolas Vasilache extracted = 7215c0c51a9SNicolas Vasilache rewriter.create<LLVM::ExtractElementOp>(loc, extracted, constant); 7225c0c51a9SNicolas Vasilache rewriter.replaceOp(op, extracted); 7235c0c51a9SNicolas Vasilache 7243145427dSRiver Riddle return success(); 7255c0c51a9SNicolas Vasilache } 7265c0c51a9SNicolas Vasilache }; 7275c0c51a9SNicolas Vasilache 728681f929fSNicolas Vasilache /// Conversion pattern that turns a vector.fma on a 1-D vector 729681f929fSNicolas Vasilache /// into an llvm.intr.fmuladd. This is a trivial 1-1 conversion. 730681f929fSNicolas Vasilache /// This does not match vectors of n >= 2 rank. 731681f929fSNicolas Vasilache /// 732681f929fSNicolas Vasilache /// Example: 733681f929fSNicolas Vasilache /// ``` 734681f929fSNicolas Vasilache /// vector.fma %a, %a, %a : vector<8xf32> 735681f929fSNicolas Vasilache /// ``` 736681f929fSNicolas Vasilache /// is converted to: 737681f929fSNicolas Vasilache /// ``` 7383bffe602SBenjamin Kramer /// llvm.intr.fmuladd %va, %va, %va: 739681f929fSNicolas Vasilache /// (!llvm<"<8 x float>">, !llvm<"<8 x float>">, !llvm<"<8 x float>">) 740681f929fSNicolas Vasilache /// -> !llvm<"<8 x float>"> 741681f929fSNicolas Vasilache /// ``` 742870c1fd4SAlex Zinenko class VectorFMAOp1DConversion : public ConvertToLLVMPattern { 743681f929fSNicolas Vasilache public: 744681f929fSNicolas Vasilache explicit VectorFMAOp1DConversion(MLIRContext *context, 745681f929fSNicolas Vasilache LLVMTypeConverter &typeConverter) 746870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::FMAOp::getOperationName(), context, 747681f929fSNicolas Vasilache typeConverter) {} 748681f929fSNicolas Vasilache 7493145427dSRiver Riddle LogicalResult 750681f929fSNicolas Vasilache matchAndRewrite(Operation *op, ArrayRef<Value> operands, 751681f929fSNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 7522d2c73c5SJacques Pienaar auto adaptor = vector::FMAOpAdaptor(operands); 753681f929fSNicolas Vasilache vector::FMAOp fmaOp = cast<vector::FMAOp>(op); 754681f929fSNicolas Vasilache VectorType vType = fmaOp.getVectorType(); 755681f929fSNicolas Vasilache if (vType.getRank() != 1) 7563145427dSRiver Riddle return failure(); 7573bffe602SBenjamin Kramer rewriter.replaceOpWithNewOp<LLVM::FMulAddOp>(op, adaptor.lhs(), 7583bffe602SBenjamin Kramer adaptor.rhs(), adaptor.acc()); 7593145427dSRiver Riddle return success(); 760681f929fSNicolas Vasilache } 761681f929fSNicolas Vasilache }; 762681f929fSNicolas Vasilache 763870c1fd4SAlex Zinenko class VectorInsertElementOpConversion : public ConvertToLLVMPattern { 764cd5dab8aSAart Bik public: 765cd5dab8aSAart Bik explicit VectorInsertElementOpConversion(MLIRContext *context, 766cd5dab8aSAart Bik LLVMTypeConverter &typeConverter) 767870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::InsertElementOp::getOperationName(), 768870c1fd4SAlex Zinenko context, typeConverter) {} 769cd5dab8aSAart Bik 7703145427dSRiver Riddle LogicalResult 771e62a6956SRiver Riddle matchAndRewrite(Operation *op, ArrayRef<Value> operands, 772cd5dab8aSAart Bik ConversionPatternRewriter &rewriter) const override { 7732d2c73c5SJacques Pienaar auto adaptor = vector::InsertElementOpAdaptor(operands); 774cd5dab8aSAart Bik auto insertEltOp = cast<vector::InsertElementOp>(op); 775cd5dab8aSAart Bik auto vectorType = insertEltOp.getDestVectorType(); 7760f04384dSAlex Zinenko auto llvmType = typeConverter.convertType(vectorType); 777cd5dab8aSAart Bik 778cd5dab8aSAart Bik // Bail if result type cannot be lowered. 779cd5dab8aSAart Bik if (!llvmType) 7803145427dSRiver Riddle return failure(); 781cd5dab8aSAart Bik 782cd5dab8aSAart Bik rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>( 783cd5dab8aSAart Bik op, llvmType, adaptor.dest(), adaptor.source(), adaptor.position()); 7843145427dSRiver Riddle return success(); 785cd5dab8aSAart Bik } 786cd5dab8aSAart Bik }; 787cd5dab8aSAart Bik 788870c1fd4SAlex Zinenko class VectorInsertOpConversion : public ConvertToLLVMPattern { 7899826fe5cSAart Bik public: 7909826fe5cSAart Bik explicit VectorInsertOpConversion(MLIRContext *context, 7919826fe5cSAart Bik LLVMTypeConverter &typeConverter) 792870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::InsertOp::getOperationName(), context, 7939826fe5cSAart Bik typeConverter) {} 7949826fe5cSAart Bik 7953145427dSRiver Riddle LogicalResult 796e62a6956SRiver Riddle matchAndRewrite(Operation *op, ArrayRef<Value> operands, 7979826fe5cSAart Bik ConversionPatternRewriter &rewriter) const override { 7989826fe5cSAart Bik auto loc = op->getLoc(); 7992d2c73c5SJacques Pienaar auto adaptor = vector::InsertOpAdaptor(operands); 8009826fe5cSAart Bik auto insertOp = cast<vector::InsertOp>(op); 8019826fe5cSAart Bik auto sourceType = insertOp.getSourceType(); 8029826fe5cSAart Bik auto destVectorType = insertOp.getDestVectorType(); 8030f04384dSAlex Zinenko auto llvmResultType = typeConverter.convertType(destVectorType); 8049826fe5cSAart Bik auto positionArrayAttr = insertOp.position(); 8059826fe5cSAart Bik 8069826fe5cSAart Bik // Bail if result type cannot be lowered. 8079826fe5cSAart Bik if (!llvmResultType) 8083145427dSRiver Riddle return failure(); 8099826fe5cSAart Bik 8109826fe5cSAart Bik // One-shot insertion of a vector into an array (only requires insertvalue). 8119826fe5cSAart Bik if (sourceType.isa<VectorType>()) { 812e62a6956SRiver Riddle Value inserted = rewriter.create<LLVM::InsertValueOp>( 8139826fe5cSAart Bik loc, llvmResultType, adaptor.dest(), adaptor.source(), 8149826fe5cSAart Bik positionArrayAttr); 8159826fe5cSAart Bik rewriter.replaceOp(op, inserted); 8163145427dSRiver Riddle return success(); 8179826fe5cSAart Bik } 8189826fe5cSAart Bik 8199826fe5cSAart Bik // Potential extraction of 1-D vector from array. 8209826fe5cSAart Bik auto *context = op->getContext(); 821e62a6956SRiver Riddle Value extracted = adaptor.dest(); 8229826fe5cSAart Bik auto positionAttrs = positionArrayAttr.getValue(); 8239826fe5cSAart Bik auto position = positionAttrs.back().cast<IntegerAttr>(); 8249826fe5cSAart Bik auto oneDVectorType = destVectorType; 8259826fe5cSAart Bik if (positionAttrs.size() > 1) { 8269826fe5cSAart Bik oneDVectorType = reducedVectorTypeBack(destVectorType); 8279826fe5cSAart Bik auto nMinusOnePositionAttrs = 8289826fe5cSAart Bik ArrayAttr::get(positionAttrs.drop_back(), context); 8299826fe5cSAart Bik extracted = rewriter.create<LLVM::ExtractValueOp>( 8300f04384dSAlex Zinenko loc, typeConverter.convertType(oneDVectorType), extracted, 8319826fe5cSAart Bik nMinusOnePositionAttrs); 8329826fe5cSAart Bik } 8339826fe5cSAart Bik 8349826fe5cSAart Bik // Insertion of an element into a 1-D LLVM vector. 835*5446ec85SAlex Zinenko auto i64Type = LLVM::LLVMType::getInt64Ty(rewriter.getContext()); 8361d47564aSAart Bik auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position); 837e62a6956SRiver Riddle Value inserted = rewriter.create<LLVM::InsertElementOp>( 8380f04384dSAlex Zinenko loc, typeConverter.convertType(oneDVectorType), extracted, 8390f04384dSAlex Zinenko adaptor.source(), constant); 8409826fe5cSAart Bik 8419826fe5cSAart Bik // Potential insertion of resulting 1-D vector into array. 8429826fe5cSAart Bik if (positionAttrs.size() > 1) { 8439826fe5cSAart Bik auto nMinusOnePositionAttrs = 8449826fe5cSAart Bik ArrayAttr::get(positionAttrs.drop_back(), context); 8459826fe5cSAart Bik inserted = rewriter.create<LLVM::InsertValueOp>(loc, llvmResultType, 8469826fe5cSAart Bik adaptor.dest(), inserted, 8479826fe5cSAart Bik nMinusOnePositionAttrs); 8489826fe5cSAart Bik } 8499826fe5cSAart Bik 8509826fe5cSAart Bik rewriter.replaceOp(op, inserted); 8513145427dSRiver Riddle return success(); 8529826fe5cSAart Bik } 8539826fe5cSAart Bik }; 8549826fe5cSAart Bik 855681f929fSNicolas Vasilache /// Rank reducing rewrite for n-D FMA into (n-1)-D FMA where n > 1. 856681f929fSNicolas Vasilache /// 857681f929fSNicolas Vasilache /// Example: 858681f929fSNicolas Vasilache /// ``` 859681f929fSNicolas Vasilache /// %d = vector.fma %a, %b, %c : vector<2x4xf32> 860681f929fSNicolas Vasilache /// ``` 861681f929fSNicolas Vasilache /// is rewritten into: 862681f929fSNicolas Vasilache /// ``` 863681f929fSNicolas Vasilache /// %r = splat %f0: vector<2x4xf32> 864681f929fSNicolas Vasilache /// %va = vector.extractvalue %a[0] : vector<2x4xf32> 865681f929fSNicolas Vasilache /// %vb = vector.extractvalue %b[0] : vector<2x4xf32> 866681f929fSNicolas Vasilache /// %vc = vector.extractvalue %c[0] : vector<2x4xf32> 867681f929fSNicolas Vasilache /// %vd = vector.fma %va, %vb, %vc : vector<4xf32> 868681f929fSNicolas Vasilache /// %r2 = vector.insertvalue %vd, %r[0] : vector<4xf32> into vector<2x4xf32> 869681f929fSNicolas Vasilache /// %va2 = vector.extractvalue %a2[1] : vector<2x4xf32> 870681f929fSNicolas Vasilache /// %vb2 = vector.extractvalue %b2[1] : vector<2x4xf32> 871681f929fSNicolas Vasilache /// %vc2 = vector.extractvalue %c2[1] : vector<2x4xf32> 872681f929fSNicolas Vasilache /// %vd2 = vector.fma %va2, %vb2, %vc2 : vector<4xf32> 873681f929fSNicolas Vasilache /// %r3 = vector.insertvalue %vd2, %r2[1] : vector<4xf32> into vector<2x4xf32> 874681f929fSNicolas Vasilache /// // %r3 holds the final value. 875681f929fSNicolas Vasilache /// ``` 876681f929fSNicolas Vasilache class VectorFMAOpNDRewritePattern : public OpRewritePattern<FMAOp> { 877681f929fSNicolas Vasilache public: 878681f929fSNicolas Vasilache using OpRewritePattern<FMAOp>::OpRewritePattern; 879681f929fSNicolas Vasilache 8803145427dSRiver Riddle LogicalResult matchAndRewrite(FMAOp op, 881681f929fSNicolas Vasilache PatternRewriter &rewriter) const override { 882681f929fSNicolas Vasilache auto vType = op.getVectorType(); 883681f929fSNicolas Vasilache if (vType.getRank() < 2) 8843145427dSRiver Riddle return failure(); 885681f929fSNicolas Vasilache 886681f929fSNicolas Vasilache auto loc = op.getLoc(); 887681f929fSNicolas Vasilache auto elemType = vType.getElementType(); 888681f929fSNicolas Vasilache Value zero = rewriter.create<ConstantOp>(loc, elemType, 889681f929fSNicolas Vasilache rewriter.getZeroAttr(elemType)); 890681f929fSNicolas Vasilache Value desc = rewriter.create<SplatOp>(loc, vType, zero); 891681f929fSNicolas Vasilache for (int64_t i = 0, e = vType.getShape().front(); i != e; ++i) { 892681f929fSNicolas Vasilache Value extrLHS = rewriter.create<ExtractOp>(loc, op.lhs(), i); 893681f929fSNicolas Vasilache Value extrRHS = rewriter.create<ExtractOp>(loc, op.rhs(), i); 894681f929fSNicolas Vasilache Value extrACC = rewriter.create<ExtractOp>(loc, op.acc(), i); 895681f929fSNicolas Vasilache Value fma = rewriter.create<FMAOp>(loc, extrLHS, extrRHS, extrACC); 896681f929fSNicolas Vasilache desc = rewriter.create<InsertOp>(loc, fma, desc, i); 897681f929fSNicolas Vasilache } 898681f929fSNicolas Vasilache rewriter.replaceOp(op, desc); 8993145427dSRiver Riddle return success(); 900681f929fSNicolas Vasilache } 901681f929fSNicolas Vasilache }; 902681f929fSNicolas Vasilache 9032d515e49SNicolas Vasilache // When ranks are different, InsertStridedSlice needs to extract a properly 9042d515e49SNicolas Vasilache // ranked vector from the destination vector into which to insert. This pattern 9052d515e49SNicolas Vasilache // only takes care of this part and forwards the rest of the conversion to 9062d515e49SNicolas Vasilache // another pattern that converts InsertStridedSlice for operands of the same 9072d515e49SNicolas Vasilache // rank. 9082d515e49SNicolas Vasilache // 9092d515e49SNicolas Vasilache // RewritePattern for InsertStridedSliceOp where source and destination vectors 9102d515e49SNicolas Vasilache // have different ranks. In this case: 9112d515e49SNicolas Vasilache // 1. the proper subvector is extracted from the destination vector 9122d515e49SNicolas Vasilache // 2. a new InsertStridedSlice op is created to insert the source in the 9132d515e49SNicolas Vasilache // destination subvector 9142d515e49SNicolas Vasilache // 3. the destination subvector is inserted back in the proper place 9152d515e49SNicolas Vasilache // 4. the op is replaced by the result of step 3. 9162d515e49SNicolas Vasilache // The new InsertStridedSlice from step 2. will be picked up by a 9172d515e49SNicolas Vasilache // `VectorInsertStridedSliceOpSameRankRewritePattern`. 9182d515e49SNicolas Vasilache class VectorInsertStridedSliceOpDifferentRankRewritePattern 9192d515e49SNicolas Vasilache : public OpRewritePattern<InsertStridedSliceOp> { 9202d515e49SNicolas Vasilache public: 9212d515e49SNicolas Vasilache using OpRewritePattern<InsertStridedSliceOp>::OpRewritePattern; 9222d515e49SNicolas Vasilache 9233145427dSRiver Riddle LogicalResult matchAndRewrite(InsertStridedSliceOp op, 9242d515e49SNicolas Vasilache PatternRewriter &rewriter) const override { 9252d515e49SNicolas Vasilache auto srcType = op.getSourceVectorType(); 9262d515e49SNicolas Vasilache auto dstType = op.getDestVectorType(); 9272d515e49SNicolas Vasilache 9282d515e49SNicolas Vasilache if (op.offsets().getValue().empty()) 9293145427dSRiver Riddle return failure(); 9302d515e49SNicolas Vasilache 9312d515e49SNicolas Vasilache auto loc = op.getLoc(); 9322d515e49SNicolas Vasilache int64_t rankDiff = dstType.getRank() - srcType.getRank(); 9332d515e49SNicolas Vasilache assert(rankDiff >= 0); 9342d515e49SNicolas Vasilache if (rankDiff == 0) 9353145427dSRiver Riddle return failure(); 9362d515e49SNicolas Vasilache 9372d515e49SNicolas Vasilache int64_t rankRest = dstType.getRank() - rankDiff; 9382d515e49SNicolas Vasilache // Extract / insert the subvector of matching rank and InsertStridedSlice 9392d515e49SNicolas Vasilache // on it. 9402d515e49SNicolas Vasilache Value extracted = 9412d515e49SNicolas Vasilache rewriter.create<ExtractOp>(loc, op.dest(), 9422d515e49SNicolas Vasilache getI64SubArray(op.offsets(), /*dropFront=*/0, 9432d515e49SNicolas Vasilache /*dropFront=*/rankRest)); 9442d515e49SNicolas Vasilache // A different pattern will kick in for InsertStridedSlice with matching 9452d515e49SNicolas Vasilache // ranks. 9462d515e49SNicolas Vasilache auto stridedSliceInnerOp = rewriter.create<InsertStridedSliceOp>( 9472d515e49SNicolas Vasilache loc, op.source(), extracted, 9482d515e49SNicolas Vasilache getI64SubArray(op.offsets(), /*dropFront=*/rankDiff), 949c8fc76a9Saartbik getI64SubArray(op.strides(), /*dropFront=*/0)); 9502d515e49SNicolas Vasilache rewriter.replaceOpWithNewOp<InsertOp>( 9512d515e49SNicolas Vasilache op, stridedSliceInnerOp.getResult(), op.dest(), 9522d515e49SNicolas Vasilache getI64SubArray(op.offsets(), /*dropFront=*/0, 9532d515e49SNicolas Vasilache /*dropFront=*/rankRest)); 9543145427dSRiver Riddle return success(); 9552d515e49SNicolas Vasilache } 9562d515e49SNicolas Vasilache }; 9572d515e49SNicolas Vasilache 9582d515e49SNicolas Vasilache // RewritePattern for InsertStridedSliceOp where source and destination vectors 9592d515e49SNicolas Vasilache // have the same rank. In this case, we reduce 9602d515e49SNicolas Vasilache // 1. the proper subvector is extracted from the destination vector 9612d515e49SNicolas Vasilache // 2. a new InsertStridedSlice op is created to insert the source in the 9622d515e49SNicolas Vasilache // destination subvector 9632d515e49SNicolas Vasilache // 3. the destination subvector is inserted back in the proper place 9642d515e49SNicolas Vasilache // 4. the op is replaced by the result of step 3. 9652d515e49SNicolas Vasilache // The new InsertStridedSlice from step 2. will be picked up by a 9662d515e49SNicolas Vasilache // `VectorInsertStridedSliceOpSameRankRewritePattern`. 9672d515e49SNicolas Vasilache class VectorInsertStridedSliceOpSameRankRewritePattern 9682d515e49SNicolas Vasilache : public OpRewritePattern<InsertStridedSliceOp> { 9692d515e49SNicolas Vasilache public: 9702d515e49SNicolas Vasilache using OpRewritePattern<InsertStridedSliceOp>::OpRewritePattern; 9712d515e49SNicolas Vasilache 9723145427dSRiver Riddle LogicalResult matchAndRewrite(InsertStridedSliceOp op, 9732d515e49SNicolas Vasilache PatternRewriter &rewriter) const override { 9742d515e49SNicolas Vasilache auto srcType = op.getSourceVectorType(); 9752d515e49SNicolas Vasilache auto dstType = op.getDestVectorType(); 9762d515e49SNicolas Vasilache 9772d515e49SNicolas Vasilache if (op.offsets().getValue().empty()) 9783145427dSRiver Riddle return failure(); 9792d515e49SNicolas Vasilache 9802d515e49SNicolas Vasilache int64_t rankDiff = dstType.getRank() - srcType.getRank(); 9812d515e49SNicolas Vasilache assert(rankDiff >= 0); 9822d515e49SNicolas Vasilache if (rankDiff != 0) 9833145427dSRiver Riddle return failure(); 9842d515e49SNicolas Vasilache 9852d515e49SNicolas Vasilache if (srcType == dstType) { 9862d515e49SNicolas Vasilache rewriter.replaceOp(op, op.source()); 9873145427dSRiver Riddle return success(); 9882d515e49SNicolas Vasilache } 9892d515e49SNicolas Vasilache 9902d515e49SNicolas Vasilache int64_t offset = 9912d515e49SNicolas Vasilache op.offsets().getValue().front().cast<IntegerAttr>().getInt(); 9922d515e49SNicolas Vasilache int64_t size = srcType.getShape().front(); 9932d515e49SNicolas Vasilache int64_t stride = 9942d515e49SNicolas Vasilache op.strides().getValue().front().cast<IntegerAttr>().getInt(); 9952d515e49SNicolas Vasilache 9962d515e49SNicolas Vasilache auto loc = op.getLoc(); 9972d515e49SNicolas Vasilache Value res = op.dest(); 9982d515e49SNicolas Vasilache // For each slice of the source vector along the most major dimension. 9992d515e49SNicolas Vasilache for (int64_t off = offset, e = offset + size * stride, idx = 0; off < e; 10002d515e49SNicolas Vasilache off += stride, ++idx) { 10012d515e49SNicolas Vasilache // 1. extract the proper subvector (or element) from source 10022d515e49SNicolas Vasilache Value extractedSource = extractOne(rewriter, loc, op.source(), idx); 10032d515e49SNicolas Vasilache if (extractedSource.getType().isa<VectorType>()) { 10042d515e49SNicolas Vasilache // 2. If we have a vector, extract the proper subvector from destination 10052d515e49SNicolas Vasilache // Otherwise we are at the element level and no need to recurse. 10062d515e49SNicolas Vasilache Value extractedDest = extractOne(rewriter, loc, op.dest(), off); 10072d515e49SNicolas Vasilache // 3. Reduce the problem to lowering a new InsertStridedSlice op with 10082d515e49SNicolas Vasilache // smaller rank. 1009bd1ccfe6SRiver Riddle extractedSource = rewriter.create<InsertStridedSliceOp>( 10102d515e49SNicolas Vasilache loc, extractedSource, extractedDest, 10112d515e49SNicolas Vasilache getI64SubArray(op.offsets(), /* dropFront=*/1), 10122d515e49SNicolas Vasilache getI64SubArray(op.strides(), /* dropFront=*/1)); 10132d515e49SNicolas Vasilache } 10142d515e49SNicolas Vasilache // 4. Insert the extractedSource into the res vector. 10152d515e49SNicolas Vasilache res = insertOne(rewriter, loc, extractedSource, res, off); 10162d515e49SNicolas Vasilache } 10172d515e49SNicolas Vasilache 10182d515e49SNicolas Vasilache rewriter.replaceOp(op, res); 10193145427dSRiver Riddle return success(); 10202d515e49SNicolas Vasilache } 1021bd1ccfe6SRiver Riddle /// This pattern creates recursive InsertStridedSliceOp, but the recursion is 1022bd1ccfe6SRiver Riddle /// bounded as the rank is strictly decreasing. 1023bd1ccfe6SRiver Riddle bool hasBoundedRewriteRecursion() const final { return true; } 10242d515e49SNicolas Vasilache }; 10252d515e49SNicolas Vasilache 1026870c1fd4SAlex Zinenko class VectorTypeCastOpConversion : public ConvertToLLVMPattern { 10275c0c51a9SNicolas Vasilache public: 10285c0c51a9SNicolas Vasilache explicit VectorTypeCastOpConversion(MLIRContext *context, 10295c0c51a9SNicolas Vasilache LLVMTypeConverter &typeConverter) 1030870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::TypeCastOp::getOperationName(), context, 10315c0c51a9SNicolas Vasilache typeConverter) {} 10325c0c51a9SNicolas Vasilache 10333145427dSRiver Riddle LogicalResult 1034e62a6956SRiver Riddle matchAndRewrite(Operation *op, ArrayRef<Value> operands, 10355c0c51a9SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 10365c0c51a9SNicolas Vasilache auto loc = op->getLoc(); 10375c0c51a9SNicolas Vasilache vector::TypeCastOp castOp = cast<vector::TypeCastOp>(op); 10385c0c51a9SNicolas Vasilache MemRefType sourceMemRefType = 10392bdf33ccSRiver Riddle castOp.getOperand().getType().cast<MemRefType>(); 10405c0c51a9SNicolas Vasilache MemRefType targetMemRefType = 10412bdf33ccSRiver Riddle castOp.getResult().getType().cast<MemRefType>(); 10425c0c51a9SNicolas Vasilache 10435c0c51a9SNicolas Vasilache // Only static shape casts supported atm. 10445c0c51a9SNicolas Vasilache if (!sourceMemRefType.hasStaticShape() || 10455c0c51a9SNicolas Vasilache !targetMemRefType.hasStaticShape()) 10463145427dSRiver Riddle return failure(); 10475c0c51a9SNicolas Vasilache 10485c0c51a9SNicolas Vasilache auto llvmSourceDescriptorTy = 10492bdf33ccSRiver Riddle operands[0].getType().dyn_cast<LLVM::LLVMType>(); 10505c0c51a9SNicolas Vasilache if (!llvmSourceDescriptorTy || !llvmSourceDescriptorTy.isStructTy()) 10513145427dSRiver Riddle return failure(); 10525c0c51a9SNicolas Vasilache MemRefDescriptor sourceMemRef(operands[0]); 10535c0c51a9SNicolas Vasilache 10540f04384dSAlex Zinenko auto llvmTargetDescriptorTy = typeConverter.convertType(targetMemRefType) 10555c0c51a9SNicolas Vasilache .dyn_cast_or_null<LLVM::LLVMType>(); 10565c0c51a9SNicolas Vasilache if (!llvmTargetDescriptorTy || !llvmTargetDescriptorTy.isStructTy()) 10573145427dSRiver Riddle return failure(); 10585c0c51a9SNicolas Vasilache 10595c0c51a9SNicolas Vasilache int64_t offset; 10605c0c51a9SNicolas Vasilache SmallVector<int64_t, 4> strides; 10615c0c51a9SNicolas Vasilache auto successStrides = 10625c0c51a9SNicolas Vasilache getStridesAndOffset(sourceMemRefType, strides, offset); 10635c0c51a9SNicolas Vasilache bool isContiguous = (strides.back() == 1); 10645c0c51a9SNicolas Vasilache if (isContiguous) { 10655c0c51a9SNicolas Vasilache auto sizes = sourceMemRefType.getShape(); 10665c0c51a9SNicolas Vasilache for (int index = 0, e = strides.size() - 2; index < e; ++index) { 10675c0c51a9SNicolas Vasilache if (strides[index] != strides[index + 1] * sizes[index + 1]) { 10685c0c51a9SNicolas Vasilache isContiguous = false; 10695c0c51a9SNicolas Vasilache break; 10705c0c51a9SNicolas Vasilache } 10715c0c51a9SNicolas Vasilache } 10725c0c51a9SNicolas Vasilache } 10735c0c51a9SNicolas Vasilache // Only contiguous source tensors supported atm. 10745c0c51a9SNicolas Vasilache if (failed(successStrides) || !isContiguous) 10753145427dSRiver Riddle return failure(); 10765c0c51a9SNicolas Vasilache 1077*5446ec85SAlex Zinenko auto int64Ty = LLVM::LLVMType::getInt64Ty(rewriter.getContext()); 10785c0c51a9SNicolas Vasilache 10795c0c51a9SNicolas Vasilache // Create descriptor. 10805c0c51a9SNicolas Vasilache auto desc = MemRefDescriptor::undef(rewriter, loc, llvmTargetDescriptorTy); 10815c0c51a9SNicolas Vasilache Type llvmTargetElementTy = desc.getElementType(); 10825c0c51a9SNicolas Vasilache // Set allocated ptr. 1083e62a6956SRiver Riddle Value allocated = sourceMemRef.allocatedPtr(rewriter, loc); 10845c0c51a9SNicolas Vasilache allocated = 10855c0c51a9SNicolas Vasilache rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, allocated); 10865c0c51a9SNicolas Vasilache desc.setAllocatedPtr(rewriter, loc, allocated); 10875c0c51a9SNicolas Vasilache // Set aligned ptr. 1088e62a6956SRiver Riddle Value ptr = sourceMemRef.alignedPtr(rewriter, loc); 10895c0c51a9SNicolas Vasilache ptr = rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, ptr); 10905c0c51a9SNicolas Vasilache desc.setAlignedPtr(rewriter, loc, ptr); 10915c0c51a9SNicolas Vasilache // Fill offset 0. 10925c0c51a9SNicolas Vasilache auto attr = rewriter.getIntegerAttr(rewriter.getIndexType(), 0); 10935c0c51a9SNicolas Vasilache auto zero = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, attr); 10945c0c51a9SNicolas Vasilache desc.setOffset(rewriter, loc, zero); 10955c0c51a9SNicolas Vasilache 10965c0c51a9SNicolas Vasilache // Fill size and stride descriptors in memref. 10975c0c51a9SNicolas Vasilache for (auto indexedSize : llvm::enumerate(targetMemRefType.getShape())) { 10985c0c51a9SNicolas Vasilache int64_t index = indexedSize.index(); 10995c0c51a9SNicolas Vasilache auto sizeAttr = 11005c0c51a9SNicolas Vasilache rewriter.getIntegerAttr(rewriter.getIndexType(), indexedSize.value()); 11015c0c51a9SNicolas Vasilache auto size = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, sizeAttr); 11025c0c51a9SNicolas Vasilache desc.setSize(rewriter, loc, index, size); 11035c0c51a9SNicolas Vasilache auto strideAttr = 11045c0c51a9SNicolas Vasilache rewriter.getIntegerAttr(rewriter.getIndexType(), strides[index]); 11055c0c51a9SNicolas Vasilache auto stride = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, strideAttr); 11065c0c51a9SNicolas Vasilache desc.setStride(rewriter, loc, index, stride); 11075c0c51a9SNicolas Vasilache } 11085c0c51a9SNicolas Vasilache 11095c0c51a9SNicolas Vasilache rewriter.replaceOp(op, {desc}); 11103145427dSRiver Riddle return success(); 11115c0c51a9SNicolas Vasilache } 11125c0c51a9SNicolas Vasilache }; 11135c0c51a9SNicolas Vasilache 11148345b86dSNicolas Vasilache /// Conversion pattern that converts a 1-D vector transfer read/write op in a 11158345b86dSNicolas Vasilache /// sequence of: 1116be16075bSWen-Heng (Jack) Chung /// 1. Bitcast or addrspacecast to vector form. 11178345b86dSNicolas Vasilache /// 2. Create an offsetVector = [ offset + 0 .. offset + vector_length - 1 ]. 11188345b86dSNicolas Vasilache /// 3. Create a mask where offsetVector is compared against memref upper bound. 11198345b86dSNicolas Vasilache /// 4. Rewrite op as a masked read or write. 11208345b86dSNicolas Vasilache template <typename ConcreteOp> 11218345b86dSNicolas Vasilache class VectorTransferConversion : public ConvertToLLVMPattern { 11228345b86dSNicolas Vasilache public: 11238345b86dSNicolas Vasilache explicit VectorTransferConversion(MLIRContext *context, 11248345b86dSNicolas Vasilache LLVMTypeConverter &typeConv) 11258345b86dSNicolas Vasilache : ConvertToLLVMPattern(ConcreteOp::getOperationName(), context, 11268345b86dSNicolas Vasilache typeConv) {} 11278345b86dSNicolas Vasilache 11288345b86dSNicolas Vasilache LogicalResult 11298345b86dSNicolas Vasilache matchAndRewrite(Operation *op, ArrayRef<Value> operands, 11308345b86dSNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 11318345b86dSNicolas Vasilache auto xferOp = cast<ConcreteOp>(op); 11328345b86dSNicolas Vasilache auto adaptor = getTransferOpAdapter(xferOp, operands); 1133b2c79c50SNicolas Vasilache 1134b2c79c50SNicolas Vasilache if (xferOp.getVectorType().getRank() > 1 || 1135b2c79c50SNicolas Vasilache llvm::size(xferOp.indices()) == 0) 11368345b86dSNicolas Vasilache return failure(); 11375f9e0466SNicolas Vasilache if (xferOp.permutation_map() != 11385f9e0466SNicolas Vasilache AffineMap::getMinorIdentityMap(xferOp.permutation_map().getNumInputs(), 11395f9e0466SNicolas Vasilache xferOp.getVectorType().getRank(), 11405f9e0466SNicolas Vasilache op->getContext())) 11418345b86dSNicolas Vasilache return failure(); 11428345b86dSNicolas Vasilache 11438345b86dSNicolas Vasilache auto toLLVMTy = [&](Type t) { return typeConverter.convertType(t); }; 11448345b86dSNicolas Vasilache 11458345b86dSNicolas Vasilache Location loc = op->getLoc(); 11468345b86dSNicolas Vasilache Type i64Type = rewriter.getIntegerType(64); 11478345b86dSNicolas Vasilache MemRefType memRefType = xferOp.getMemRefType(); 11488345b86dSNicolas Vasilache 11498345b86dSNicolas Vasilache // 1. Get the source/dst address as an LLVM vector pointer. 1150be16075bSWen-Heng (Jack) Chung // The vector pointer would always be on address space 0, therefore 1151be16075bSWen-Heng (Jack) Chung // addrspacecast shall be used when source/dst memrefs are not on 1152be16075bSWen-Heng (Jack) Chung // address space 0. 11538345b86dSNicolas Vasilache // TODO: support alignment when possible. 11548345b86dSNicolas Vasilache Value dataPtr = getDataPtr(loc, memRefType, adaptor.memref(), 1155d3a98076SAlex Zinenko adaptor.indices(), rewriter); 11568345b86dSNicolas Vasilache auto vecTy = 11578345b86dSNicolas Vasilache toLLVMTy(xferOp.getVectorType()).template cast<LLVM::LLVMType>(); 1158be16075bSWen-Heng (Jack) Chung Value vectorDataPtr; 1159be16075bSWen-Heng (Jack) Chung if (memRefType.getMemorySpace() == 0) 1160be16075bSWen-Heng (Jack) Chung vectorDataPtr = 11618345b86dSNicolas Vasilache rewriter.create<LLVM::BitcastOp>(loc, vecTy.getPointerTo(), dataPtr); 1162be16075bSWen-Heng (Jack) Chung else 1163be16075bSWen-Heng (Jack) Chung vectorDataPtr = rewriter.create<LLVM::AddrSpaceCastOp>( 1164be16075bSWen-Heng (Jack) Chung loc, vecTy.getPointerTo(), dataPtr); 11658345b86dSNicolas Vasilache 11661870e787SNicolas Vasilache if (!xferOp.isMaskedDim(0)) 11671870e787SNicolas Vasilache return replaceTransferOpWithLoadOrStore(rewriter, typeConverter, loc, 11681870e787SNicolas Vasilache xferOp, operands, vectorDataPtr); 11691870e787SNicolas Vasilache 11708345b86dSNicolas Vasilache // 2. Create a vector with linear indices [ 0 .. vector_length - 1 ]. 11718345b86dSNicolas Vasilache unsigned vecWidth = vecTy.getVectorNumElements(); 11728345b86dSNicolas Vasilache VectorType vectorCmpType = VectorType::get(vecWidth, i64Type); 11738345b86dSNicolas Vasilache SmallVector<int64_t, 8> indices; 11748345b86dSNicolas Vasilache indices.reserve(vecWidth); 11758345b86dSNicolas Vasilache for (unsigned i = 0; i < vecWidth; ++i) 11768345b86dSNicolas Vasilache indices.push_back(i); 11778345b86dSNicolas Vasilache Value linearIndices = rewriter.create<ConstantOp>( 11788345b86dSNicolas Vasilache loc, vectorCmpType, 11798345b86dSNicolas Vasilache DenseElementsAttr::get(vectorCmpType, ArrayRef<int64_t>(indices))); 11808345b86dSNicolas Vasilache linearIndices = rewriter.create<LLVM::DialectCastOp>( 11818345b86dSNicolas Vasilache loc, toLLVMTy(vectorCmpType), linearIndices); 11828345b86dSNicolas Vasilache 11838345b86dSNicolas Vasilache // 3. Create offsetVector = [ offset + 0 .. offset + vector_length - 1 ]. 11849db53a18SRiver Riddle // TODO: when the leaf transfer rank is k > 1 we need the last 1185b2c79c50SNicolas Vasilache // `k` dimensions here. 1186b2c79c50SNicolas Vasilache unsigned lastIndex = llvm::size(xferOp.indices()) - 1; 1187b2c79c50SNicolas Vasilache Value offsetIndex = *(xferOp.indices().begin() + lastIndex); 1188b2c79c50SNicolas Vasilache offsetIndex = rewriter.create<IndexCastOp>(loc, i64Type, offsetIndex); 11898345b86dSNicolas Vasilache Value base = rewriter.create<SplatOp>(loc, vectorCmpType, offsetIndex); 11908345b86dSNicolas Vasilache Value offsetVector = rewriter.create<AddIOp>(loc, base, linearIndices); 11918345b86dSNicolas Vasilache 11928345b86dSNicolas Vasilache // 4. Let dim the memref dimension, compute the vector comparison mask: 11938345b86dSNicolas Vasilache // [ offset + 0 .. offset + vector_length - 1 ] < [ dim .. dim ] 1194b2c79c50SNicolas Vasilache Value dim = rewriter.create<DimOp>(loc, xferOp.memref(), lastIndex); 1195b2c79c50SNicolas Vasilache dim = rewriter.create<IndexCastOp>(loc, i64Type, dim); 11968345b86dSNicolas Vasilache dim = rewriter.create<SplatOp>(loc, vectorCmpType, dim); 11978345b86dSNicolas Vasilache Value mask = 11988345b86dSNicolas Vasilache rewriter.create<CmpIOp>(loc, CmpIPredicate::slt, offsetVector, dim); 11998345b86dSNicolas Vasilache mask = rewriter.create<LLVM::DialectCastOp>(loc, toLLVMTy(mask.getType()), 12008345b86dSNicolas Vasilache mask); 12018345b86dSNicolas Vasilache 12028345b86dSNicolas Vasilache // 5. Rewrite as a masked read / write. 12031870e787SNicolas Vasilache return replaceTransferOpWithMasked(rewriter, typeConverter, loc, xferOp, 1204a99f62c4SAlex Zinenko operands, vectorDataPtr, mask); 12058345b86dSNicolas Vasilache } 12068345b86dSNicolas Vasilache }; 12078345b86dSNicolas Vasilache 1208870c1fd4SAlex Zinenko class VectorPrintOpConversion : public ConvertToLLVMPattern { 1209d9b500d3SAart Bik public: 1210d9b500d3SAart Bik explicit VectorPrintOpConversion(MLIRContext *context, 1211d9b500d3SAart Bik LLVMTypeConverter &typeConverter) 1212870c1fd4SAlex Zinenko : ConvertToLLVMPattern(vector::PrintOp::getOperationName(), context, 1213d9b500d3SAart Bik typeConverter) {} 1214d9b500d3SAart Bik 1215d9b500d3SAart Bik // Proof-of-concept lowering implementation that relies on a small 1216d9b500d3SAart Bik // runtime support library, which only needs to provide a few 1217d9b500d3SAart Bik // printing methods (single value for all data types, opening/closing 1218d9b500d3SAart Bik // bracket, comma, newline). The lowering fully unrolls a vector 1219d9b500d3SAart Bik // in terms of these elementary printing operations. The advantage 1220d9b500d3SAart Bik // of this approach is that the library can remain unaware of all 1221d9b500d3SAart Bik // low-level implementation details of vectors while still supporting 1222d9b500d3SAart Bik // output of any shaped and dimensioned vector. Due to full unrolling, 1223d9b500d3SAart Bik // this approach is less suited for very large vectors though. 1224d9b500d3SAart Bik // 12259db53a18SRiver Riddle // TODO: rely solely on libc in future? something else? 1226d9b500d3SAart Bik // 12273145427dSRiver Riddle LogicalResult 1228e62a6956SRiver Riddle matchAndRewrite(Operation *op, ArrayRef<Value> operands, 1229d9b500d3SAart Bik ConversionPatternRewriter &rewriter) const override { 1230d9b500d3SAart Bik auto printOp = cast<vector::PrintOp>(op); 12312d2c73c5SJacques Pienaar auto adaptor = vector::PrintOpAdaptor(operands); 1232d9b500d3SAart Bik Type printType = printOp.getPrintType(); 1233d9b500d3SAart Bik 12340f04384dSAlex Zinenko if (typeConverter.convertType(printType) == nullptr) 12353145427dSRiver Riddle return failure(); 1236d9b500d3SAart Bik 1237d9b500d3SAart Bik // Make sure element type has runtime support (currently just Float/Double). 1238d9b500d3SAart Bik VectorType vectorType = printType.dyn_cast<VectorType>(); 1239d9b500d3SAart Bik Type eltType = vectorType ? vectorType.getElementType() : printType; 1240d9b500d3SAart Bik int64_t rank = vectorType ? vectorType.getRank() : 0; 1241d9b500d3SAart Bik Operation *printer; 1242c9eeeb38Saartbik if (eltType.isSignlessInteger(1) || eltType.isSignlessInteger(32)) 1243e52414b1Saartbik printer = getPrintI32(op); 124435b68527SLei Zhang else if (eltType.isSignlessInteger(64)) 1245e52414b1Saartbik printer = getPrintI64(op); 1246e52414b1Saartbik else if (eltType.isF32()) 1247d9b500d3SAart Bik printer = getPrintFloat(op); 1248d9b500d3SAart Bik else if (eltType.isF64()) 1249d9b500d3SAart Bik printer = getPrintDouble(op); 1250d9b500d3SAart Bik else 12513145427dSRiver Riddle return failure(); 1252d9b500d3SAart Bik 1253d9b500d3SAart Bik // Unroll vector into elementary print calls. 1254d9b500d3SAart Bik emitRanks(rewriter, op, adaptor.source(), vectorType, printer, rank); 1255d9b500d3SAart Bik emitCall(rewriter, op->getLoc(), getPrintNewline(op)); 1256d9b500d3SAart Bik rewriter.eraseOp(op); 12573145427dSRiver Riddle return success(); 1258d9b500d3SAart Bik } 1259d9b500d3SAart Bik 1260d9b500d3SAart Bik private: 1261d9b500d3SAart Bik void emitRanks(ConversionPatternRewriter &rewriter, Operation *op, 1262e62a6956SRiver Riddle Value value, VectorType vectorType, Operation *printer, 1263d9b500d3SAart Bik int64_t rank) const { 1264d9b500d3SAart Bik Location loc = op->getLoc(); 1265d9b500d3SAart Bik if (rank == 0) { 1266*5446ec85SAlex Zinenko if (value.getType() == LLVM::LLVMType::getInt1Ty(rewriter.getContext())) { 1267c9eeeb38Saartbik // Convert i1 (bool) to i32 so we can use the print_i32 method. 1268c9eeeb38Saartbik // This avoids the need for a print_i1 method with an unclear ABI. 1269*5446ec85SAlex Zinenko auto i32Type = LLVM::LLVMType::getInt32Ty(rewriter.getContext()); 1270c9eeeb38Saartbik auto trueVal = rewriter.create<ConstantOp>( 1271c9eeeb38Saartbik loc, i32Type, rewriter.getI32IntegerAttr(1)); 1272c9eeeb38Saartbik auto falseVal = rewriter.create<ConstantOp>( 1273c9eeeb38Saartbik loc, i32Type, rewriter.getI32IntegerAttr(0)); 1274c9eeeb38Saartbik value = rewriter.create<SelectOp>(loc, value, trueVal, falseVal); 1275c9eeeb38Saartbik } 1276d9b500d3SAart Bik emitCall(rewriter, loc, printer, value); 1277d9b500d3SAart Bik return; 1278d9b500d3SAart Bik } 1279d9b500d3SAart Bik 1280d9b500d3SAart Bik emitCall(rewriter, loc, getPrintOpen(op)); 1281d9b500d3SAart Bik Operation *printComma = getPrintComma(op); 1282d9b500d3SAart Bik int64_t dim = vectorType.getDimSize(0); 1283d9b500d3SAart Bik for (int64_t d = 0; d < dim; ++d) { 1284d9b500d3SAart Bik auto reducedType = 1285d9b500d3SAart Bik rank > 1 ? reducedVectorTypeFront(vectorType) : nullptr; 12860f04384dSAlex Zinenko auto llvmType = typeConverter.convertType( 1287d9b500d3SAart Bik rank > 1 ? reducedType : vectorType.getElementType()); 1288e62a6956SRiver Riddle Value nestedVal = 12890f04384dSAlex Zinenko extractOne(rewriter, typeConverter, loc, value, llvmType, rank, d); 1290d9b500d3SAart Bik emitRanks(rewriter, op, nestedVal, reducedType, printer, rank - 1); 1291d9b500d3SAart Bik if (d != dim - 1) 1292d9b500d3SAart Bik emitCall(rewriter, loc, printComma); 1293d9b500d3SAart Bik } 1294d9b500d3SAart Bik emitCall(rewriter, loc, getPrintClose(op)); 1295d9b500d3SAart Bik } 1296d9b500d3SAart Bik 1297d9b500d3SAart Bik // Helper to emit a call. 1298d9b500d3SAart Bik static void emitCall(ConversionPatternRewriter &rewriter, Location loc, 1299d9b500d3SAart Bik Operation *ref, ValueRange params = ValueRange()) { 1300d9b500d3SAart Bik rewriter.create<LLVM::CallOp>(loc, ArrayRef<Type>{}, 1301d9b500d3SAart Bik rewriter.getSymbolRefAttr(ref), params); 1302d9b500d3SAart Bik } 1303d9b500d3SAart Bik 1304d9b500d3SAart Bik // Helper for printer method declaration (first hit) and lookup. 1305*5446ec85SAlex Zinenko static Operation *getPrint(Operation *op, StringRef name, 1306*5446ec85SAlex Zinenko ArrayRef<LLVM::LLVMType> params) { 1307d9b500d3SAart Bik auto module = op->getParentOfType<ModuleOp>(); 1308d9b500d3SAart Bik auto func = module.lookupSymbol<LLVM::LLVMFuncOp>(name); 1309d9b500d3SAart Bik if (func) 1310d9b500d3SAart Bik return func; 1311d9b500d3SAart Bik OpBuilder moduleBuilder(module.getBodyRegion()); 1312d9b500d3SAart Bik return moduleBuilder.create<LLVM::LLVMFuncOp>( 1313d9b500d3SAart Bik op->getLoc(), name, 1314*5446ec85SAlex Zinenko LLVM::LLVMType::getFunctionTy( 1315*5446ec85SAlex Zinenko LLVM::LLVMType::getVoidTy(op->getContext()), params, 1316*5446ec85SAlex Zinenko /*isVarArg=*/false)); 1317d9b500d3SAart Bik } 1318d9b500d3SAart Bik 1319d9b500d3SAart Bik // Helpers for method names. 1320e52414b1Saartbik Operation *getPrintI32(Operation *op) const { 1321*5446ec85SAlex Zinenko return getPrint(op, "print_i32", 1322*5446ec85SAlex Zinenko LLVM::LLVMType::getInt32Ty(op->getContext())); 1323e52414b1Saartbik } 1324e52414b1Saartbik Operation *getPrintI64(Operation *op) const { 1325*5446ec85SAlex Zinenko return getPrint(op, "print_i64", 1326*5446ec85SAlex Zinenko LLVM::LLVMType::getInt64Ty(op->getContext())); 1327e52414b1Saartbik } 1328d9b500d3SAart Bik Operation *getPrintFloat(Operation *op) const { 1329*5446ec85SAlex Zinenko return getPrint(op, "print_f32", 1330*5446ec85SAlex Zinenko LLVM::LLVMType::getFloatTy(op->getContext())); 1331d9b500d3SAart Bik } 1332d9b500d3SAart Bik Operation *getPrintDouble(Operation *op) const { 1333*5446ec85SAlex Zinenko return getPrint(op, "print_f64", 1334*5446ec85SAlex Zinenko LLVM::LLVMType::getDoubleTy(op->getContext())); 1335d9b500d3SAart Bik } 1336d9b500d3SAart Bik Operation *getPrintOpen(Operation *op) const { 1337*5446ec85SAlex Zinenko return getPrint(op, "print_open", {}); 1338d9b500d3SAart Bik } 1339d9b500d3SAart Bik Operation *getPrintClose(Operation *op) const { 1340*5446ec85SAlex Zinenko return getPrint(op, "print_close", {}); 1341d9b500d3SAart Bik } 1342d9b500d3SAart Bik Operation *getPrintComma(Operation *op) const { 1343*5446ec85SAlex Zinenko return getPrint(op, "print_comma", {}); 1344d9b500d3SAart Bik } 1345d9b500d3SAart Bik Operation *getPrintNewline(Operation *op) const { 1346*5446ec85SAlex Zinenko return getPrint(op, "print_newline", {}); 1347d9b500d3SAart Bik } 1348d9b500d3SAart Bik }; 1349d9b500d3SAart Bik 1350334a4159SReid Tatge /// Progressive lowering of ExtractStridedSliceOp to either: 135165678d93SNicolas Vasilache /// 1. extractelement + insertelement for the 1-D case 135265678d93SNicolas Vasilache /// 2. extract + optional strided_slice + insert for the n-D case. 1353334a4159SReid Tatge class VectorStridedSliceOpConversion 1354334a4159SReid Tatge : public OpRewritePattern<ExtractStridedSliceOp> { 135565678d93SNicolas Vasilache public: 1356334a4159SReid Tatge using OpRewritePattern<ExtractStridedSliceOp>::OpRewritePattern; 135765678d93SNicolas Vasilache 1358334a4159SReid Tatge LogicalResult matchAndRewrite(ExtractStridedSliceOp op, 135965678d93SNicolas Vasilache PatternRewriter &rewriter) const override { 136065678d93SNicolas Vasilache auto dstType = op.getResult().getType().cast<VectorType>(); 136165678d93SNicolas Vasilache 136265678d93SNicolas Vasilache assert(!op.offsets().getValue().empty() && "Unexpected empty offsets"); 136365678d93SNicolas Vasilache 136465678d93SNicolas Vasilache int64_t offset = 136565678d93SNicolas Vasilache op.offsets().getValue().front().cast<IntegerAttr>().getInt(); 136665678d93SNicolas Vasilache int64_t size = op.sizes().getValue().front().cast<IntegerAttr>().getInt(); 136765678d93SNicolas Vasilache int64_t stride = 136865678d93SNicolas Vasilache op.strides().getValue().front().cast<IntegerAttr>().getInt(); 136965678d93SNicolas Vasilache 137065678d93SNicolas Vasilache auto loc = op.getLoc(); 137165678d93SNicolas Vasilache auto elemType = dstType.getElementType(); 137235b68527SLei Zhang assert(elemType.isSignlessIntOrIndexOrFloat()); 137365678d93SNicolas Vasilache Value zero = rewriter.create<ConstantOp>(loc, elemType, 137465678d93SNicolas Vasilache rewriter.getZeroAttr(elemType)); 137565678d93SNicolas Vasilache Value res = rewriter.create<SplatOp>(loc, dstType, zero); 137665678d93SNicolas Vasilache for (int64_t off = offset, e = offset + size * stride, idx = 0; off < e; 137765678d93SNicolas Vasilache off += stride, ++idx) { 137865678d93SNicolas Vasilache Value extracted = extractOne(rewriter, loc, op.vector(), off); 137965678d93SNicolas Vasilache if (op.offsets().getValue().size() > 1) { 1380334a4159SReid Tatge extracted = rewriter.create<ExtractStridedSliceOp>( 138165678d93SNicolas Vasilache loc, extracted, getI64SubArray(op.offsets(), /* dropFront=*/1), 138265678d93SNicolas Vasilache getI64SubArray(op.sizes(), /* dropFront=*/1), 138365678d93SNicolas Vasilache getI64SubArray(op.strides(), /* dropFront=*/1)); 138465678d93SNicolas Vasilache } 138565678d93SNicolas Vasilache res = insertOne(rewriter, loc, extracted, res, idx); 138665678d93SNicolas Vasilache } 138765678d93SNicolas Vasilache rewriter.replaceOp(op, {res}); 13883145427dSRiver Riddle return success(); 138965678d93SNicolas Vasilache } 1390334a4159SReid Tatge /// This pattern creates recursive ExtractStridedSliceOp, but the recursion is 1391bd1ccfe6SRiver Riddle /// bounded as the rank is strictly decreasing. 1392bd1ccfe6SRiver Riddle bool hasBoundedRewriteRecursion() const final { return true; } 139365678d93SNicolas Vasilache }; 139465678d93SNicolas Vasilache 1395df186507SBenjamin Kramer } // namespace 1396df186507SBenjamin Kramer 13975c0c51a9SNicolas Vasilache /// Populate the given list with patterns that convert from Vector to LLVM. 13985c0c51a9SNicolas Vasilache void mlir::populateVectorToLLVMConversionPatterns( 1399ceb1b327Saartbik LLVMTypeConverter &converter, OwningRewritePatternList &patterns, 1400ceb1b327Saartbik bool reassociateFPReductions) { 140165678d93SNicolas Vasilache MLIRContext *ctx = converter.getDialect()->getContext(); 14028345b86dSNicolas Vasilache // clang-format off 1403681f929fSNicolas Vasilache patterns.insert<VectorFMAOpNDRewritePattern, 1404681f929fSNicolas Vasilache VectorInsertStridedSliceOpDifferentRankRewritePattern, 14052d515e49SNicolas Vasilache VectorInsertStridedSliceOpSameRankRewritePattern, 14062d515e49SNicolas Vasilache VectorStridedSliceOpConversion>(ctx); 1407ceb1b327Saartbik patterns.insert<VectorReductionOpConversion>( 1408ceb1b327Saartbik ctx, converter, reassociateFPReductions); 14098345b86dSNicolas Vasilache patterns 1410ceb1b327Saartbik .insert<VectorShuffleOpConversion, 14118345b86dSNicolas Vasilache VectorExtractElementOpConversion, 14128345b86dSNicolas Vasilache VectorExtractOpConversion, 14138345b86dSNicolas Vasilache VectorFMAOp1DConversion, 14148345b86dSNicolas Vasilache VectorInsertElementOpConversion, 14158345b86dSNicolas Vasilache VectorInsertOpConversion, 14168345b86dSNicolas Vasilache VectorPrintOpConversion, 14178345b86dSNicolas Vasilache VectorTransferConversion<TransferReadOp>, 14188345b86dSNicolas Vasilache VectorTransferConversion<TransferWriteOp>, 141919dbb230Saartbik VectorTypeCastOpConversion, 142039379916Saartbik VectorMaskedLoadOpConversion, 142139379916Saartbik VectorMaskedStoreOpConversion, 142219dbb230Saartbik VectorGatherOpConversion, 1423e8dcf5f8Saartbik VectorScatterOpConversion, 1424e8dcf5f8Saartbik VectorExpandLoadOpConversion, 1425e8dcf5f8Saartbik VectorCompressStoreOpConversion>(ctx, converter); 14268345b86dSNicolas Vasilache // clang-format on 14275c0c51a9SNicolas Vasilache } 14285c0c51a9SNicolas Vasilache 142963b683a8SNicolas Vasilache void mlir::populateVectorToLLVMMatrixConversionPatterns( 143063b683a8SNicolas Vasilache LLVMTypeConverter &converter, OwningRewritePatternList &patterns) { 143163b683a8SNicolas Vasilache MLIRContext *ctx = converter.getDialect()->getContext(); 143263b683a8SNicolas Vasilache patterns.insert<VectorMatmulOpConversion>(ctx, converter); 1433c295a65dSaartbik patterns.insert<VectorFlatTransposeOpConversion>(ctx, converter); 143463b683a8SNicolas Vasilache } 143563b683a8SNicolas Vasilache 14365c0c51a9SNicolas Vasilache namespace { 1437722f909fSRiver Riddle struct LowerVectorToLLVMPass 14381834ad4aSRiver Riddle : public ConvertVectorToLLVMBase<LowerVectorToLLVMPass> { 14391bfdf7c7Saartbik LowerVectorToLLVMPass(const LowerVectorToLLVMOptions &options) { 14401bfdf7c7Saartbik this->reassociateFPReductions = options.reassociateFPReductions; 14411bfdf7c7Saartbik } 1442722f909fSRiver Riddle void runOnOperation() override; 14435c0c51a9SNicolas Vasilache }; 14445c0c51a9SNicolas Vasilache } // namespace 14455c0c51a9SNicolas Vasilache 1446722f909fSRiver Riddle void LowerVectorToLLVMPass::runOnOperation() { 1447078776a6Saartbik // Perform progressive lowering of operations on slices and 1448b21c7999Saartbik // all contraction operations. Also applies folding and DCE. 1449459cf6e5Saartbik { 14505c0c51a9SNicolas Vasilache OwningRewritePatternList patterns; 1451b1c688dbSaartbik populateVectorToVectorCanonicalizationPatterns(patterns, &getContext()); 1452459cf6e5Saartbik populateVectorSlicesLoweringPatterns(patterns, &getContext()); 1453b21c7999Saartbik populateVectorContractLoweringPatterns(patterns, &getContext()); 1454a5b9316bSUday Bondhugula applyPatternsAndFoldGreedily(getOperation(), patterns); 1455459cf6e5Saartbik } 1456459cf6e5Saartbik 1457459cf6e5Saartbik // Convert to the LLVM IR dialect. 14585c0c51a9SNicolas Vasilache LLVMTypeConverter converter(&getContext()); 1459459cf6e5Saartbik OwningRewritePatternList patterns; 146063b683a8SNicolas Vasilache populateVectorToLLVMMatrixConversionPatterns(converter, patterns); 1461ceb1b327Saartbik populateVectorToLLVMConversionPatterns(converter, patterns, 1462ceb1b327Saartbik reassociateFPReductions); 1463bbf3ef85SNicolas Vasilache populateVectorToLLVMMatrixConversionPatterns(converter, patterns); 14645c0c51a9SNicolas Vasilache populateStdToLLVMConversionPatterns(converter, patterns); 14655c0c51a9SNicolas Vasilache 14662a00ae39STim Shen LLVMConversionTarget target(getContext()); 14678d67d187SRiver Riddle if (failed(applyPartialConversion(getOperation(), target, patterns))) { 14685c0c51a9SNicolas Vasilache signalPassFailure(); 14695c0c51a9SNicolas Vasilache } 14705c0c51a9SNicolas Vasilache } 14715c0c51a9SNicolas Vasilache 14721bfdf7c7Saartbik std::unique_ptr<OperationPass<ModuleOp>> 14731bfdf7c7Saartbik mlir::createConvertVectorToLLVMPass(const LowerVectorToLLVMOptions &options) { 14741bfdf7c7Saartbik return std::make_unique<LowerVectorToLLVMPass>(options); 14755c0c51a9SNicolas Vasilache } 1476