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 1175e5f0aaSAlex Zinenko #include "mlir/Conversion/LLVMCommon/VectorPattern.h" 12a54f4eaeSMogball #include "mlir/Dialect/Arithmetic/IR/Arithmetic.h" 13e332c22cSNicolas Vasilache #include "mlir/Dialect/LLVMIR/FunctionCallUtils.h" 145c0c51a9SNicolas Vasilache #include "mlir/Dialect/LLVMIR/LLVMDialect.h" 15e2310704SJulian Gross #include "mlir/Dialect/MemRef/IR/MemRef.h" 1669d757c0SRob Suderman #include "mlir/Dialect/StandardOps/IR/Ops.h" 17d054b80bSNicolas Vasilache #include "mlir/Dialect/Vector/VectorTransforms.h" 1809f7a55fSRiver Riddle #include "mlir/IR/BuiltinTypes.h" 1929a50c58SStephen Neuendorffer #include "mlir/Support/MathExtras.h" 20929189a4SWilliam S. Moses #include "mlir/Target/LLVMIR/TypeToLLVM.h" 215c0c51a9SNicolas Vasilache #include "mlir/Transforms/DialectConversion.h" 225c0c51a9SNicolas Vasilache 235c0c51a9SNicolas Vasilache using namespace mlir; 2465678d93SNicolas Vasilache using namespace mlir::vector; 255c0c51a9SNicolas Vasilache 269826fe5cSAart Bik // Helper to reduce vector type by one rank at front. 279826fe5cSAart Bik static VectorType reducedVectorTypeFront(VectorType tp) { 289826fe5cSAart Bik assert((tp.getRank() > 1) && "unlowerable vector type"); 299826fe5cSAart Bik return VectorType::get(tp.getShape().drop_front(), tp.getElementType()); 309826fe5cSAart Bik } 319826fe5cSAart Bik 329826fe5cSAart Bik // Helper to reduce vector type by *all* but one rank at back. 339826fe5cSAart Bik static VectorType reducedVectorTypeBack(VectorType tp) { 349826fe5cSAart Bik assert((tp.getRank() > 1) && "unlowerable vector type"); 359826fe5cSAart Bik return VectorType::get(tp.getShape().take_back(), tp.getElementType()); 369826fe5cSAart Bik } 379826fe5cSAart Bik 381c81adf3SAart Bik // Helper that picks the proper sequence for inserting. 39e62a6956SRiver Riddle static Value insertOne(ConversionPatternRewriter &rewriter, 400f04384dSAlex Zinenko LLVMTypeConverter &typeConverter, Location loc, 410f04384dSAlex Zinenko Value val1, Value val2, Type llvmType, int64_t rank, 420f04384dSAlex Zinenko int64_t pos) { 43e7026abaSNicolas Vasilache assert(rank > 0 && "0-D vector corner case should have been handled already"); 441c81adf3SAart Bik if (rank == 1) { 451c81adf3SAart Bik auto idxType = rewriter.getIndexType(); 461c81adf3SAart Bik auto constant = rewriter.create<LLVM::ConstantOp>( 470f04384dSAlex Zinenko loc, typeConverter.convertType(idxType), 481c81adf3SAart Bik rewriter.getIntegerAttr(idxType, pos)); 491c81adf3SAart Bik return rewriter.create<LLVM::InsertElementOp>(loc, llvmType, val1, val2, 501c81adf3SAart Bik constant); 511c81adf3SAart Bik } 521c81adf3SAart Bik return rewriter.create<LLVM::InsertValueOp>(loc, llvmType, val1, val2, 531c81adf3SAart Bik rewriter.getI64ArrayAttr(pos)); 541c81adf3SAart Bik } 551c81adf3SAart Bik 561c81adf3SAart Bik // Helper that picks the proper sequence for extracting. 57e62a6956SRiver Riddle static Value extractOne(ConversionPatternRewriter &rewriter, 580f04384dSAlex Zinenko LLVMTypeConverter &typeConverter, Location loc, 590f04384dSAlex Zinenko Value val, Type llvmType, int64_t rank, int64_t pos) { 60e7026abaSNicolas Vasilache assert(rank > 0 && "0-D vector corner case should have been handled already"); 611c81adf3SAart Bik if (rank == 1) { 621c81adf3SAart Bik auto idxType = rewriter.getIndexType(); 631c81adf3SAart Bik auto constant = rewriter.create<LLVM::ConstantOp>( 640f04384dSAlex Zinenko loc, typeConverter.convertType(idxType), 651c81adf3SAart Bik rewriter.getIntegerAttr(idxType, pos)); 661c81adf3SAart Bik return rewriter.create<LLVM::ExtractElementOp>(loc, llvmType, val, 671c81adf3SAart Bik constant); 681c81adf3SAart Bik } 691c81adf3SAart Bik return rewriter.create<LLVM::ExtractValueOp>(loc, llvmType, val, 701c81adf3SAart Bik rewriter.getI64ArrayAttr(pos)); 711c81adf3SAart Bik } 721c81adf3SAart Bik 7326c8f908SThomas Raoux // Helper that returns data layout alignment of a memref. 7426c8f908SThomas Raoux LogicalResult getMemRefAlignment(LLVMTypeConverter &typeConverter, 7526c8f908SThomas Raoux MemRefType memrefType, unsigned &align) { 7626c8f908SThomas Raoux Type elementTy = typeConverter.convertType(memrefType.getElementType()); 775f9e0466SNicolas Vasilache if (!elementTy) 785f9e0466SNicolas Vasilache return failure(); 795f9e0466SNicolas Vasilache 80b2ab375dSAlex Zinenko // TODO: this should use the MLIR data layout when it becomes available and 81b2ab375dSAlex Zinenko // stop depending on translation. 8287a89e0fSAlex Zinenko llvm::LLVMContext llvmContext; 8387a89e0fSAlex Zinenko align = LLVM::TypeToLLVMIRTranslator(llvmContext) 84c69c9e0fSAlex Zinenko .getPreferredAlignment(elementTy, typeConverter.getDataLayout()); 855f9e0466SNicolas Vasilache return success(); 865f9e0466SNicolas Vasilache } 875f9e0466SNicolas Vasilache 8829a50c58SStephen Neuendorffer // Return the minimal alignment value that satisfies all the AssumeAlignment 8929a50c58SStephen Neuendorffer // uses of `value`. If no such uses exist, return 1. 9029a50c58SStephen Neuendorffer static unsigned getAssumedAlignment(Value value) { 9129a50c58SStephen Neuendorffer unsigned align = 1; 9229a50c58SStephen Neuendorffer for (auto &u : value.getUses()) { 9329a50c58SStephen Neuendorffer Operation *owner = u.getOwner(); 9429a50c58SStephen Neuendorffer if (auto op = dyn_cast<memref::AssumeAlignmentOp>(owner)) 9529a50c58SStephen Neuendorffer align = mlir::lcm(align, op.alignment()); 9629a50c58SStephen Neuendorffer } 9729a50c58SStephen Neuendorffer return align; 9829a50c58SStephen Neuendorffer } 9929a50c58SStephen Neuendorffer 10029a50c58SStephen Neuendorffer // Helper that returns data layout alignment of a memref associated with a 10129a50c58SStephen Neuendorffer // load, store, scatter, or gather op, including additional information from 10229a50c58SStephen Neuendorffer // assume_alignment calls on the source of the transfer 10329a50c58SStephen Neuendorffer template <class OpAdaptor> 10429a50c58SStephen Neuendorffer LogicalResult getMemRefOpAlignment(LLVMTypeConverter &typeConverter, 10529a50c58SStephen Neuendorffer OpAdaptor op, unsigned &align) { 10629a50c58SStephen Neuendorffer if (failed(getMemRefAlignment(typeConverter, op.getMemRefType(), align))) 10729a50c58SStephen Neuendorffer return failure(); 10829a50c58SStephen Neuendorffer align = std::max(align, getAssumedAlignment(op.base())); 10929a50c58SStephen Neuendorffer return success(); 11029a50c58SStephen Neuendorffer } 11129a50c58SStephen Neuendorffer 112df5ccf5aSAart Bik // Add an index vector component to a base pointer. This almost always succeeds 113df5ccf5aSAart Bik // unless the last stride is non-unit or the memory space is not zero. 114df5ccf5aSAart Bik static LogicalResult getIndexedPtrs(ConversionPatternRewriter &rewriter, 115df5ccf5aSAart Bik Location loc, Value memref, Value base, 116df5ccf5aSAart Bik Value index, MemRefType memRefType, 117df5ccf5aSAart Bik VectorType vType, Value &ptrs) { 11819dbb230Saartbik int64_t offset; 11919dbb230Saartbik SmallVector<int64_t, 4> strides; 12019dbb230Saartbik auto successStrides = getStridesAndOffset(memRefType, strides, offset); 121df5ccf5aSAart Bik if (failed(successStrides) || strides.back() != 1 || 12237eca08eSVladislav Vinogradov memRefType.getMemorySpaceAsInt() != 0) 123e8dcf5f8Saartbik return failure(); 1243a577f54SChristian Sigg auto pType = MemRefDescriptor(memref).getElementPtrType(); 125bd30a796SAlex Zinenko auto ptrsType = LLVM::getFixedVectorType(pType, vType.getDimSize(0)); 126df5ccf5aSAart Bik ptrs = rewriter.create<LLVM::GEPOp>(loc, ptrsType, base, index); 12719dbb230Saartbik return success(); 12819dbb230Saartbik } 12919dbb230Saartbik 130a57def30SAart Bik // Casts a strided element pointer to a vector pointer. The vector pointer 13108c681f6SAndrew Pritchard // will be in the same address space as the incoming memref type. 132a57def30SAart Bik static Value castDataPtr(ConversionPatternRewriter &rewriter, Location loc, 133a57def30SAart Bik Value ptr, MemRefType memRefType, Type vt) { 13437eca08eSVladislav Vinogradov auto pType = LLVM::LLVMPointerType::get(vt, memRefType.getMemorySpaceAsInt()); 135a57def30SAart Bik return rewriter.create<LLVM::BitcastOp>(loc, pType, ptr); 136a57def30SAart Bik } 137a57def30SAart Bik 13890c01357SBenjamin Kramer namespace { 139e83b7b99Saartbik 140cf5c517cSDiego Caballero /// Conversion pattern for a vector.bitcast. 141cf5c517cSDiego Caballero class VectorBitCastOpConversion 142cf5c517cSDiego Caballero : public ConvertOpToLLVMPattern<vector::BitCastOp> { 143cf5c517cSDiego Caballero public: 144cf5c517cSDiego Caballero using ConvertOpToLLVMPattern<vector::BitCastOp>::ConvertOpToLLVMPattern; 145cf5c517cSDiego Caballero 146cf5c517cSDiego Caballero LogicalResult 147ef976337SRiver Riddle matchAndRewrite(vector::BitCastOp bitCastOp, OpAdaptor adaptor, 148cf5c517cSDiego Caballero ConversionPatternRewriter &rewriter) const override { 149cf5c517cSDiego Caballero // Only 1-D vectors can be lowered to LLVM. 150cf5c517cSDiego Caballero VectorType resultTy = bitCastOp.getType(); 151cf5c517cSDiego Caballero if (resultTy.getRank() != 1) 152cf5c517cSDiego Caballero return failure(); 153cf5c517cSDiego Caballero Type newResultTy = typeConverter->convertType(resultTy); 154cf5c517cSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::BitcastOp>(bitCastOp, newResultTy, 155ef976337SRiver Riddle adaptor.getOperands()[0]); 156cf5c517cSDiego Caballero return success(); 157cf5c517cSDiego Caballero } 158cf5c517cSDiego Caballero }; 159cf5c517cSDiego Caballero 16063b683a8SNicolas Vasilache /// Conversion pattern for a vector.matrix_multiply. 16163b683a8SNicolas Vasilache /// This is lowered directly to the proper llvm.intr.matrix.multiply. 162563879b6SRahul Joshi class VectorMatmulOpConversion 163563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::MatmulOp> { 16463b683a8SNicolas Vasilache public: 165563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::MatmulOp>::ConvertOpToLLVMPattern; 16663b683a8SNicolas Vasilache 1673145427dSRiver Riddle LogicalResult 168ef976337SRiver Riddle matchAndRewrite(vector::MatmulOp matmulOp, OpAdaptor adaptor, 16963b683a8SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 17063b683a8SNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::MatrixMultiplyOp>( 171563879b6SRahul Joshi matmulOp, typeConverter->convertType(matmulOp.res().getType()), 172563879b6SRahul Joshi adaptor.lhs(), adaptor.rhs(), matmulOp.lhs_rows(), 173563879b6SRahul Joshi matmulOp.lhs_columns(), matmulOp.rhs_columns()); 1743145427dSRiver Riddle return success(); 17563b683a8SNicolas Vasilache } 17663b683a8SNicolas Vasilache }; 17763b683a8SNicolas Vasilache 178c295a65dSaartbik /// Conversion pattern for a vector.flat_transpose. 179c295a65dSaartbik /// This is lowered directly to the proper llvm.intr.matrix.transpose. 180563879b6SRahul Joshi class VectorFlatTransposeOpConversion 181563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::FlatTransposeOp> { 182c295a65dSaartbik public: 183563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::FlatTransposeOp>::ConvertOpToLLVMPattern; 184c295a65dSaartbik 185c295a65dSaartbik LogicalResult 186ef976337SRiver Riddle matchAndRewrite(vector::FlatTransposeOp transOp, OpAdaptor adaptor, 187c295a65dSaartbik ConversionPatternRewriter &rewriter) const override { 188c295a65dSaartbik rewriter.replaceOpWithNewOp<LLVM::MatrixTransposeOp>( 189dcec2ca5SChristian Sigg transOp, typeConverter->convertType(transOp.res().getType()), 190c295a65dSaartbik adaptor.matrix(), transOp.rows(), transOp.columns()); 191c295a65dSaartbik return success(); 192c295a65dSaartbik } 193c295a65dSaartbik }; 194c295a65dSaartbik 195ee66e43aSDiego Caballero /// Overloaded utility that replaces a vector.load, vector.store, 196ee66e43aSDiego Caballero /// vector.maskedload and vector.maskedstore with their respective LLVM 197ee66e43aSDiego Caballero /// couterparts. 198ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::LoadOp loadOp, 199ee66e43aSDiego Caballero vector::LoadOpAdaptor adaptor, 200ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 201ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 202ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::LoadOp>(loadOp, ptr, align); 20339379916Saartbik } 20439379916Saartbik 205ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::MaskedLoadOp loadOp, 206ee66e43aSDiego Caballero vector::MaskedLoadOpAdaptor adaptor, 207ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 208ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 209ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::MaskedLoadOp>( 210ee66e43aSDiego Caballero loadOp, vectorTy, ptr, adaptor.mask(), adaptor.pass_thru(), align); 211ee66e43aSDiego Caballero } 212ee66e43aSDiego Caballero 213ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::StoreOp storeOp, 214ee66e43aSDiego Caballero vector::StoreOpAdaptor adaptor, 215ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 216ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 217ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::StoreOp>(storeOp, adaptor.valueToStore(), 218ee66e43aSDiego Caballero ptr, align); 219ee66e43aSDiego Caballero } 220ee66e43aSDiego Caballero 221ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::MaskedStoreOp storeOp, 222ee66e43aSDiego Caballero vector::MaskedStoreOpAdaptor adaptor, 223ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 224ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 225ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::MaskedStoreOp>( 226ee66e43aSDiego Caballero storeOp, adaptor.valueToStore(), ptr, adaptor.mask(), align); 227ee66e43aSDiego Caballero } 228ee66e43aSDiego Caballero 229ee66e43aSDiego Caballero /// Conversion pattern for a vector.load, vector.store, vector.maskedload, and 230ee66e43aSDiego Caballero /// vector.maskedstore. 231ee66e43aSDiego Caballero template <class LoadOrStoreOp, class LoadOrStoreOpAdaptor> 232ee66e43aSDiego Caballero class VectorLoadStoreConversion : public ConvertOpToLLVMPattern<LoadOrStoreOp> { 23339379916Saartbik public: 234ee66e43aSDiego Caballero using ConvertOpToLLVMPattern<LoadOrStoreOp>::ConvertOpToLLVMPattern; 23539379916Saartbik 23639379916Saartbik LogicalResult 237ef976337SRiver Riddle matchAndRewrite(LoadOrStoreOp loadOrStoreOp, 238ef976337SRiver Riddle typename LoadOrStoreOp::Adaptor adaptor, 23939379916Saartbik ConversionPatternRewriter &rewriter) const override { 240ee66e43aSDiego Caballero // Only 1-D vectors can be lowered to LLVM. 241ee66e43aSDiego Caballero VectorType vectorTy = loadOrStoreOp.getVectorType(); 242ee66e43aSDiego Caballero if (vectorTy.getRank() > 1) 243ee66e43aSDiego Caballero return failure(); 244ee66e43aSDiego Caballero 245ee66e43aSDiego Caballero auto loc = loadOrStoreOp->getLoc(); 246ee66e43aSDiego Caballero MemRefType memRefTy = loadOrStoreOp.getMemRefType(); 24739379916Saartbik 24839379916Saartbik // Resolve alignment. 24939379916Saartbik unsigned align; 25029a50c58SStephen Neuendorffer if (failed(getMemRefOpAlignment(*this->getTypeConverter(), loadOrStoreOp, 25129a50c58SStephen Neuendorffer align))) 25239379916Saartbik return failure(); 25339379916Saartbik 254a57def30SAart Bik // Resolve address. 255ee66e43aSDiego Caballero auto vtype = this->typeConverter->convertType(loadOrStoreOp.getVectorType()) 256ee66e43aSDiego Caballero .template cast<VectorType>(); 257ee66e43aSDiego Caballero Value dataPtr = this->getStridedElementPtr(loc, memRefTy, adaptor.base(), 258a57def30SAart Bik adaptor.indices(), rewriter); 259ee66e43aSDiego Caballero Value ptr = castDataPtr(rewriter, loc, dataPtr, memRefTy, vtype); 26039379916Saartbik 261ee66e43aSDiego Caballero replaceLoadOrStoreOp(loadOrStoreOp, adaptor, vtype, ptr, align, rewriter); 26239379916Saartbik return success(); 26339379916Saartbik } 26439379916Saartbik }; 26539379916Saartbik 26619dbb230Saartbik /// Conversion pattern for a vector.gather. 267563879b6SRahul Joshi class VectorGatherOpConversion 268563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::GatherOp> { 26919dbb230Saartbik public: 270563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::GatherOp>::ConvertOpToLLVMPattern; 27119dbb230Saartbik 27219dbb230Saartbik LogicalResult 273ef976337SRiver Riddle matchAndRewrite(vector::GatherOp gather, OpAdaptor adaptor, 27419dbb230Saartbik ConversionPatternRewriter &rewriter) const override { 275563879b6SRahul Joshi auto loc = gather->getLoc(); 276df5ccf5aSAart Bik MemRefType memRefType = gather.getMemRefType(); 27719dbb230Saartbik 27819dbb230Saartbik // Resolve alignment. 27919dbb230Saartbik unsigned align; 28029a50c58SStephen Neuendorffer if (failed(getMemRefOpAlignment(*getTypeConverter(), gather, align))) 28119dbb230Saartbik return failure(); 28219dbb230Saartbik 283df5ccf5aSAart Bik // Resolve address. 28419dbb230Saartbik Value ptrs; 285df5ccf5aSAart Bik VectorType vType = gather.getVectorType(); 286df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 287df5ccf5aSAart Bik adaptor.indices(), rewriter); 288df5ccf5aSAart Bik if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), ptr, 289df5ccf5aSAart Bik adaptor.index_vec(), memRefType, vType, ptrs))) 29019dbb230Saartbik return failure(); 29119dbb230Saartbik 29219dbb230Saartbik // Replace with the gather intrinsic. 29319dbb230Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_gather>( 294dcec2ca5SChristian Sigg gather, typeConverter->convertType(vType), ptrs, adaptor.mask(), 2950c2a4d3cSBenjamin Kramer adaptor.pass_thru(), rewriter.getI32IntegerAttr(align)); 29619dbb230Saartbik return success(); 29719dbb230Saartbik } 29819dbb230Saartbik }; 29919dbb230Saartbik 30019dbb230Saartbik /// Conversion pattern for a vector.scatter. 301563879b6SRahul Joshi class VectorScatterOpConversion 302563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ScatterOp> { 30319dbb230Saartbik public: 304563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ScatterOp>::ConvertOpToLLVMPattern; 30519dbb230Saartbik 30619dbb230Saartbik LogicalResult 307ef976337SRiver Riddle matchAndRewrite(vector::ScatterOp scatter, OpAdaptor adaptor, 30819dbb230Saartbik ConversionPatternRewriter &rewriter) const override { 309563879b6SRahul Joshi auto loc = scatter->getLoc(); 310df5ccf5aSAart Bik MemRefType memRefType = scatter.getMemRefType(); 31119dbb230Saartbik 31219dbb230Saartbik // Resolve alignment. 31319dbb230Saartbik unsigned align; 31429a50c58SStephen Neuendorffer if (failed(getMemRefOpAlignment(*getTypeConverter(), scatter, align))) 31519dbb230Saartbik return failure(); 31619dbb230Saartbik 317df5ccf5aSAart Bik // Resolve address. 31819dbb230Saartbik Value ptrs; 319df5ccf5aSAart Bik VectorType vType = scatter.getVectorType(); 320df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 321df5ccf5aSAart Bik adaptor.indices(), rewriter); 322df5ccf5aSAart Bik if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), ptr, 323df5ccf5aSAart Bik adaptor.index_vec(), memRefType, vType, ptrs))) 32419dbb230Saartbik return failure(); 32519dbb230Saartbik 32619dbb230Saartbik // Replace with the scatter intrinsic. 32719dbb230Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_scatter>( 328656674a7SDiego Caballero scatter, adaptor.valueToStore(), ptrs, adaptor.mask(), 32919dbb230Saartbik rewriter.getI32IntegerAttr(align)); 33019dbb230Saartbik return success(); 33119dbb230Saartbik } 33219dbb230Saartbik }; 33319dbb230Saartbik 334e8dcf5f8Saartbik /// Conversion pattern for a vector.expandload. 335563879b6SRahul Joshi class VectorExpandLoadOpConversion 336563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ExpandLoadOp> { 337e8dcf5f8Saartbik public: 338563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ExpandLoadOp>::ConvertOpToLLVMPattern; 339e8dcf5f8Saartbik 340e8dcf5f8Saartbik LogicalResult 341ef976337SRiver Riddle matchAndRewrite(vector::ExpandLoadOp expand, OpAdaptor adaptor, 342e8dcf5f8Saartbik ConversionPatternRewriter &rewriter) const override { 343563879b6SRahul Joshi auto loc = expand->getLoc(); 344a57def30SAart Bik MemRefType memRefType = expand.getMemRefType(); 345e8dcf5f8Saartbik 346a57def30SAart Bik // Resolve address. 347656674a7SDiego Caballero auto vtype = typeConverter->convertType(expand.getVectorType()); 348df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 349a57def30SAart Bik adaptor.indices(), rewriter); 350e8dcf5f8Saartbik 351e8dcf5f8Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_expandload>( 352a57def30SAart Bik expand, vtype, ptr, adaptor.mask(), adaptor.pass_thru()); 353e8dcf5f8Saartbik return success(); 354e8dcf5f8Saartbik } 355e8dcf5f8Saartbik }; 356e8dcf5f8Saartbik 357e8dcf5f8Saartbik /// Conversion pattern for a vector.compressstore. 358563879b6SRahul Joshi class VectorCompressStoreOpConversion 359563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::CompressStoreOp> { 360e8dcf5f8Saartbik public: 361563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::CompressStoreOp>::ConvertOpToLLVMPattern; 362e8dcf5f8Saartbik 363e8dcf5f8Saartbik LogicalResult 364ef976337SRiver Riddle matchAndRewrite(vector::CompressStoreOp compress, OpAdaptor adaptor, 365e8dcf5f8Saartbik ConversionPatternRewriter &rewriter) const override { 366563879b6SRahul Joshi auto loc = compress->getLoc(); 367a57def30SAart Bik MemRefType memRefType = compress.getMemRefType(); 368e8dcf5f8Saartbik 369a57def30SAart Bik // Resolve address. 370df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 371a57def30SAart Bik adaptor.indices(), rewriter); 372e8dcf5f8Saartbik 373e8dcf5f8Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_compressstore>( 374656674a7SDiego Caballero compress, adaptor.valueToStore(), ptr, adaptor.mask()); 375e8dcf5f8Saartbik return success(); 376e8dcf5f8Saartbik } 377e8dcf5f8Saartbik }; 378e8dcf5f8Saartbik 37919dbb230Saartbik /// Conversion pattern for all vector reductions. 380563879b6SRahul Joshi class VectorReductionOpConversion 381563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ReductionOp> { 382e83b7b99Saartbik public: 383563879b6SRahul Joshi explicit VectorReductionOpConversion(LLVMTypeConverter &typeConv, 384060c9dd1Saartbik bool reassociateFPRed) 385563879b6SRahul Joshi : ConvertOpToLLVMPattern<vector::ReductionOp>(typeConv), 386060c9dd1Saartbik reassociateFPReductions(reassociateFPRed) {} 387e83b7b99Saartbik 3883145427dSRiver Riddle LogicalResult 389ef976337SRiver Riddle matchAndRewrite(vector::ReductionOp reductionOp, OpAdaptor adaptor, 390e83b7b99Saartbik ConversionPatternRewriter &rewriter) const override { 391e83b7b99Saartbik auto kind = reductionOp.kind(); 392e83b7b99Saartbik Type eltType = reductionOp.dest().getType(); 393dcec2ca5SChristian Sigg Type llvmType = typeConverter->convertType(eltType); 394ef976337SRiver Riddle Value operand = adaptor.getOperands()[0]; 395e9628955SAart Bik if (eltType.isIntOrIndex()) { 396e83b7b99Saartbik // Integer reductions: add/mul/min/max/and/or/xor. 397e83b7b99Saartbik if (kind == "add") 398ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_add>(reductionOp, 399ef976337SRiver Riddle llvmType, operand); 400e83b7b99Saartbik else if (kind == "mul") 401ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_mul>(reductionOp, 402ef976337SRiver Riddle llvmType, operand); 403eaf2588aSDiego Caballero else if (kind == "minui") 404322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_umin>( 405ef976337SRiver Riddle reductionOp, llvmType, operand); 406eaf2588aSDiego Caballero else if (kind == "minsi") 407322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_smin>( 408ef976337SRiver Riddle reductionOp, llvmType, operand); 409eaf2588aSDiego Caballero else if (kind == "maxui") 410322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_umax>( 411ef976337SRiver Riddle reductionOp, llvmType, operand); 412eaf2588aSDiego Caballero else if (kind == "maxsi") 413322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_smax>( 414ef976337SRiver Riddle reductionOp, llvmType, operand); 415e83b7b99Saartbik else if (kind == "and") 416ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_and>(reductionOp, 417ef976337SRiver Riddle llvmType, operand); 418e83b7b99Saartbik else if (kind == "or") 419ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_or>(reductionOp, 420ef976337SRiver Riddle llvmType, operand); 421e83b7b99Saartbik else if (kind == "xor") 422ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_xor>(reductionOp, 423ef976337SRiver Riddle llvmType, operand); 424e83b7b99Saartbik else 4253145427dSRiver Riddle return failure(); 4263145427dSRiver Riddle return success(); 427dcec2ca5SChristian Sigg } 428e83b7b99Saartbik 429dcec2ca5SChristian Sigg if (!eltType.isa<FloatType>()) 430dcec2ca5SChristian Sigg return failure(); 431dcec2ca5SChristian Sigg 432e83b7b99Saartbik // Floating-point reductions: add/mul/min/max 433e83b7b99Saartbik if (kind == "add") { 4340d924700Saartbik // Optional accumulator (or zero). 435ef976337SRiver Riddle Value acc = adaptor.getOperands().size() > 1 436ef976337SRiver Riddle ? adaptor.getOperands()[1] 4370d924700Saartbik : rewriter.create<LLVM::ConstantOp>( 438563879b6SRahul Joshi reductionOp->getLoc(), llvmType, 4390d924700Saartbik rewriter.getZeroAttr(eltType)); 440322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fadd>( 441ef976337SRiver Riddle reductionOp, llvmType, acc, operand, 442ceb1b327Saartbik rewriter.getBoolAttr(reassociateFPReductions)); 443e83b7b99Saartbik } else if (kind == "mul") { 4440d924700Saartbik // Optional accumulator (or one). 445ef976337SRiver Riddle Value acc = adaptor.getOperands().size() > 1 446ef976337SRiver Riddle ? adaptor.getOperands()[1] 4470d924700Saartbik : rewriter.create<LLVM::ConstantOp>( 448563879b6SRahul Joshi reductionOp->getLoc(), llvmType, 4490d924700Saartbik rewriter.getFloatAttr(eltType, 1.0)); 450322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmul>( 451ef976337SRiver Riddle reductionOp, llvmType, acc, operand, 452ceb1b327Saartbik rewriter.getBoolAttr(reassociateFPReductions)); 453eaf2588aSDiego Caballero } else if (kind == "minf") 454eaf2588aSDiego Caballero // FIXME: MLIR's 'minf' and LLVM's 'vector_reduce_fmin' do not handle 455eaf2588aSDiego Caballero // NaNs/-0.0/+0.0 in the same way. 456ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmin>(reductionOp, 457ef976337SRiver Riddle llvmType, operand); 458eaf2588aSDiego Caballero else if (kind == "maxf") 459eaf2588aSDiego Caballero // FIXME: MLIR's 'maxf' and LLVM's 'vector_reduce_fmax' do not handle 460eaf2588aSDiego Caballero // NaNs/-0.0/+0.0 in the same way. 461ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmax>(reductionOp, 462ef976337SRiver Riddle llvmType, operand); 463e83b7b99Saartbik else 4643145427dSRiver Riddle return failure(); 4653145427dSRiver Riddle return success(); 466e83b7b99Saartbik } 467ceb1b327Saartbik 468ceb1b327Saartbik private: 469ceb1b327Saartbik const bool reassociateFPReductions; 470e83b7b99Saartbik }; 471e83b7b99Saartbik 472563879b6SRahul Joshi class VectorShuffleOpConversion 473563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ShuffleOp> { 4741c81adf3SAart Bik public: 475563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ShuffleOp>::ConvertOpToLLVMPattern; 4761c81adf3SAart Bik 4773145427dSRiver Riddle LogicalResult 478ef976337SRiver Riddle matchAndRewrite(vector::ShuffleOp shuffleOp, OpAdaptor adaptor, 4791c81adf3SAart Bik ConversionPatternRewriter &rewriter) const override { 480563879b6SRahul Joshi auto loc = shuffleOp->getLoc(); 4811c81adf3SAart Bik auto v1Type = shuffleOp.getV1VectorType(); 4821c81adf3SAart Bik auto v2Type = shuffleOp.getV2VectorType(); 4831c81adf3SAart Bik auto vectorType = shuffleOp.getVectorType(); 484dcec2ca5SChristian Sigg Type llvmType = typeConverter->convertType(vectorType); 4851c81adf3SAart Bik auto maskArrayAttr = shuffleOp.mask(); 4861c81adf3SAart Bik 4871c81adf3SAart Bik // Bail if result type cannot be lowered. 4881c81adf3SAart Bik if (!llvmType) 4893145427dSRiver Riddle return failure(); 4901c81adf3SAart Bik 4911c81adf3SAart Bik // Get rank and dimension sizes. 4921c81adf3SAart Bik int64_t rank = vectorType.getRank(); 4931c81adf3SAart Bik assert(v1Type.getRank() == rank); 4941c81adf3SAart Bik assert(v2Type.getRank() == rank); 4951c81adf3SAart Bik int64_t v1Dim = v1Type.getDimSize(0); 4961c81adf3SAart Bik 4971c81adf3SAart Bik // For rank 1, where both operands have *exactly* the same vector type, 4981c81adf3SAart Bik // there is direct shuffle support in LLVM. Use it! 4991c81adf3SAart Bik if (rank == 1 && v1Type == v2Type) { 500563879b6SRahul Joshi Value llvmShuffleOp = rewriter.create<LLVM::ShuffleVectorOp>( 5011c81adf3SAart Bik loc, adaptor.v1(), adaptor.v2(), maskArrayAttr); 502563879b6SRahul Joshi rewriter.replaceOp(shuffleOp, llvmShuffleOp); 5033145427dSRiver Riddle return success(); 504b36aaeafSAart Bik } 505b36aaeafSAart Bik 5061c81adf3SAart Bik // For all other cases, insert the individual values individually. 5075a8a159bSMehdi Amini Type eltType; 5085a8a159bSMehdi Amini if (auto arrayType = llvmType.dyn_cast<LLVM::LLVMArrayType>()) 5095a8a159bSMehdi Amini eltType = arrayType.getElementType(); 5105a8a159bSMehdi Amini else 5115a8a159bSMehdi Amini eltType = llvmType.cast<VectorType>().getElementType(); 512e62a6956SRiver Riddle Value insert = rewriter.create<LLVM::UndefOp>(loc, llvmType); 5131c81adf3SAart Bik int64_t insPos = 0; 5141c81adf3SAart Bik for (auto en : llvm::enumerate(maskArrayAttr)) { 5151c81adf3SAart Bik int64_t extPos = en.value().cast<IntegerAttr>().getInt(); 516e62a6956SRiver Riddle Value value = adaptor.v1(); 5171c81adf3SAart Bik if (extPos >= v1Dim) { 5181c81adf3SAart Bik extPos -= v1Dim; 5191c81adf3SAart Bik value = adaptor.v2(); 520b36aaeafSAart Bik } 521dcec2ca5SChristian Sigg Value extract = extractOne(rewriter, *getTypeConverter(), loc, value, 5225a8a159bSMehdi Amini eltType, rank, extPos); 523dcec2ca5SChristian Sigg insert = insertOne(rewriter, *getTypeConverter(), loc, insert, extract, 5240f04384dSAlex Zinenko llvmType, rank, insPos++); 5251c81adf3SAart Bik } 526563879b6SRahul Joshi rewriter.replaceOp(shuffleOp, insert); 5273145427dSRiver Riddle return success(); 528b36aaeafSAart Bik } 529b36aaeafSAart Bik }; 530b36aaeafSAart Bik 531563879b6SRahul Joshi class VectorExtractElementOpConversion 532563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ExtractElementOp> { 533cd5dab8aSAart Bik public: 534563879b6SRahul Joshi using ConvertOpToLLVMPattern< 535563879b6SRahul Joshi vector::ExtractElementOp>::ConvertOpToLLVMPattern; 536cd5dab8aSAart Bik 5373145427dSRiver Riddle LogicalResult 538ef976337SRiver Riddle matchAndRewrite(vector::ExtractElementOp extractEltOp, OpAdaptor adaptor, 539cd5dab8aSAart Bik ConversionPatternRewriter &rewriter) const override { 540cd5dab8aSAart Bik auto vectorType = extractEltOp.getVectorType(); 541dcec2ca5SChristian Sigg auto llvmType = typeConverter->convertType(vectorType.getElementType()); 542cd5dab8aSAart Bik 543cd5dab8aSAart Bik // Bail if result type cannot be lowered. 544cd5dab8aSAart Bik if (!llvmType) 5453145427dSRiver Riddle return failure(); 546cd5dab8aSAart Bik 547e7026abaSNicolas Vasilache if (vectorType.getRank() == 0) { 548e7026abaSNicolas Vasilache Location loc = extractEltOp.getLoc(); 549e7026abaSNicolas Vasilache auto idxType = rewriter.getIndexType(); 550e7026abaSNicolas Vasilache auto zero = rewriter.create<LLVM::ConstantOp>( 551e7026abaSNicolas Vasilache loc, typeConverter->convertType(idxType), 552e7026abaSNicolas Vasilache rewriter.getIntegerAttr(idxType, 0)); 553e7026abaSNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>( 554e7026abaSNicolas Vasilache extractEltOp, llvmType, adaptor.vector(), zero); 555e7026abaSNicolas Vasilache return success(); 556e7026abaSNicolas Vasilache } 557e7026abaSNicolas Vasilache 558cd5dab8aSAart Bik rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>( 559563879b6SRahul Joshi extractEltOp, llvmType, adaptor.vector(), adaptor.position()); 5603145427dSRiver Riddle return success(); 561cd5dab8aSAart Bik } 562cd5dab8aSAart Bik }; 563cd5dab8aSAart Bik 564563879b6SRahul Joshi class VectorExtractOpConversion 565563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ExtractOp> { 5665c0c51a9SNicolas Vasilache public: 567563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ExtractOp>::ConvertOpToLLVMPattern; 5685c0c51a9SNicolas Vasilache 5693145427dSRiver Riddle LogicalResult 570ef976337SRiver Riddle matchAndRewrite(vector::ExtractOp extractOp, OpAdaptor adaptor, 5715c0c51a9SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 572563879b6SRahul Joshi auto loc = extractOp->getLoc(); 5739826fe5cSAart Bik auto vectorType = extractOp.getVectorType(); 5742bdf33ccSRiver Riddle auto resultType = extractOp.getResult().getType(); 575dcec2ca5SChristian Sigg auto llvmResultType = typeConverter->convertType(resultType); 5765c0c51a9SNicolas Vasilache auto positionArrayAttr = extractOp.position(); 5779826fe5cSAart Bik 5789826fe5cSAart Bik // Bail if result type cannot be lowered. 5799826fe5cSAart Bik if (!llvmResultType) 5803145427dSRiver Riddle return failure(); 5819826fe5cSAart Bik 582864adf39SMatthias Springer // Extract entire vector. Should be handled by folder, but just to be safe. 583864adf39SMatthias Springer if (positionArrayAttr.empty()) { 584864adf39SMatthias Springer rewriter.replaceOp(extractOp, adaptor.vector()); 585864adf39SMatthias Springer return success(); 586864adf39SMatthias Springer } 587864adf39SMatthias Springer 5885c0c51a9SNicolas Vasilache // One-shot extraction of vector from array (only requires extractvalue). 5895c0c51a9SNicolas Vasilache if (resultType.isa<VectorType>()) { 590e62a6956SRiver Riddle Value extracted = rewriter.create<LLVM::ExtractValueOp>( 5915c0c51a9SNicolas Vasilache loc, llvmResultType, adaptor.vector(), positionArrayAttr); 592563879b6SRahul Joshi rewriter.replaceOp(extractOp, extracted); 5933145427dSRiver Riddle return success(); 5945c0c51a9SNicolas Vasilache } 5955c0c51a9SNicolas Vasilache 5969826fe5cSAart Bik // Potential extraction of 1-D vector from array. 597563879b6SRahul Joshi auto *context = extractOp->getContext(); 598e62a6956SRiver Riddle Value extracted = adaptor.vector(); 5995c0c51a9SNicolas Vasilache auto positionAttrs = positionArrayAttr.getValue(); 6005c0c51a9SNicolas Vasilache if (positionAttrs.size() > 1) { 6019826fe5cSAart Bik auto oneDVectorType = reducedVectorTypeBack(vectorType); 6025c0c51a9SNicolas Vasilache auto nMinusOnePositionAttrs = 603c2c83e97STres Popp ArrayAttr::get(context, positionAttrs.drop_back()); 6045c0c51a9SNicolas Vasilache extracted = rewriter.create<LLVM::ExtractValueOp>( 605dcec2ca5SChristian Sigg loc, typeConverter->convertType(oneDVectorType), extracted, 6065c0c51a9SNicolas Vasilache nMinusOnePositionAttrs); 6075c0c51a9SNicolas Vasilache } 6085c0c51a9SNicolas Vasilache 6095c0c51a9SNicolas Vasilache // Remaining extraction of element from 1-D LLVM vector 6105c0c51a9SNicolas Vasilache auto position = positionAttrs.back().cast<IntegerAttr>(); 6112230bf99SAlex Zinenko auto i64Type = IntegerType::get(rewriter.getContext(), 64); 6121d47564aSAart Bik auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position); 6135c0c51a9SNicolas Vasilache extracted = 6145c0c51a9SNicolas Vasilache rewriter.create<LLVM::ExtractElementOp>(loc, extracted, constant); 615563879b6SRahul Joshi rewriter.replaceOp(extractOp, extracted); 6165c0c51a9SNicolas Vasilache 6173145427dSRiver Riddle return success(); 6185c0c51a9SNicolas Vasilache } 6195c0c51a9SNicolas Vasilache }; 6205c0c51a9SNicolas Vasilache 621681f929fSNicolas Vasilache /// Conversion pattern that turns a vector.fma on a 1-D vector 622681f929fSNicolas Vasilache /// into an llvm.intr.fmuladd. This is a trivial 1-1 conversion. 623681f929fSNicolas Vasilache /// This does not match vectors of n >= 2 rank. 624681f929fSNicolas Vasilache /// 625681f929fSNicolas Vasilache /// Example: 626681f929fSNicolas Vasilache /// ``` 627681f929fSNicolas Vasilache /// vector.fma %a, %a, %a : vector<8xf32> 628681f929fSNicolas Vasilache /// ``` 629681f929fSNicolas Vasilache /// is converted to: 630681f929fSNicolas Vasilache /// ``` 6313bffe602SBenjamin Kramer /// llvm.intr.fmuladd %va, %va, %va: 632dd5165a9SAlex Zinenko /// (!llvm."<8 x f32>">, !llvm<"<8 x f32>">, !llvm<"<8 x f32>">) 633dd5165a9SAlex Zinenko /// -> !llvm."<8 x f32>"> 634681f929fSNicolas Vasilache /// ``` 635563879b6SRahul Joshi class VectorFMAOp1DConversion : public ConvertOpToLLVMPattern<vector::FMAOp> { 636681f929fSNicolas Vasilache public: 637563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::FMAOp>::ConvertOpToLLVMPattern; 638681f929fSNicolas Vasilache 6393145427dSRiver Riddle LogicalResult 640ef976337SRiver Riddle matchAndRewrite(vector::FMAOp fmaOp, OpAdaptor adaptor, 641681f929fSNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 642681f929fSNicolas Vasilache VectorType vType = fmaOp.getVectorType(); 643681f929fSNicolas Vasilache if (vType.getRank() != 1) 6443145427dSRiver Riddle return failure(); 645563879b6SRahul Joshi rewriter.replaceOpWithNewOp<LLVM::FMulAddOp>(fmaOp, adaptor.lhs(), 6463bffe602SBenjamin Kramer adaptor.rhs(), adaptor.acc()); 6473145427dSRiver Riddle return success(); 648681f929fSNicolas Vasilache } 649681f929fSNicolas Vasilache }; 650681f929fSNicolas Vasilache 651563879b6SRahul Joshi class VectorInsertElementOpConversion 652563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::InsertElementOp> { 653cd5dab8aSAart Bik public: 654563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::InsertElementOp>::ConvertOpToLLVMPattern; 655cd5dab8aSAart Bik 6563145427dSRiver Riddle LogicalResult 657ef976337SRiver Riddle matchAndRewrite(vector::InsertElementOp insertEltOp, OpAdaptor adaptor, 658cd5dab8aSAart Bik ConversionPatternRewriter &rewriter) const override { 659cd5dab8aSAart Bik auto vectorType = insertEltOp.getDestVectorType(); 660dcec2ca5SChristian Sigg auto llvmType = typeConverter->convertType(vectorType); 661cd5dab8aSAart Bik 662cd5dab8aSAart Bik // Bail if result type cannot be lowered. 663cd5dab8aSAart Bik if (!llvmType) 6643145427dSRiver Riddle return failure(); 665cd5dab8aSAart Bik 666*3ff4e5f2SNicolas Vasilache if (vectorType.getRank() == 0) { 667*3ff4e5f2SNicolas Vasilache Location loc = insertEltOp.getLoc(); 668*3ff4e5f2SNicolas Vasilache auto idxType = rewriter.getIndexType(); 669*3ff4e5f2SNicolas Vasilache auto zero = rewriter.create<LLVM::ConstantOp>( 670*3ff4e5f2SNicolas Vasilache loc, typeConverter->convertType(idxType), 671*3ff4e5f2SNicolas Vasilache rewriter.getIntegerAttr(idxType, 0)); 672*3ff4e5f2SNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>( 673*3ff4e5f2SNicolas Vasilache insertEltOp, llvmType, adaptor.dest(), adaptor.source(), zero); 674*3ff4e5f2SNicolas Vasilache return success(); 675*3ff4e5f2SNicolas Vasilache } 676*3ff4e5f2SNicolas Vasilache 677cd5dab8aSAart Bik rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>( 678563879b6SRahul Joshi insertEltOp, llvmType, adaptor.dest(), adaptor.source(), 679563879b6SRahul Joshi adaptor.position()); 6803145427dSRiver Riddle return success(); 681cd5dab8aSAart Bik } 682cd5dab8aSAart Bik }; 683cd5dab8aSAart Bik 684563879b6SRahul Joshi class VectorInsertOpConversion 685563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::InsertOp> { 6869826fe5cSAart Bik public: 687563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::InsertOp>::ConvertOpToLLVMPattern; 6889826fe5cSAart Bik 6893145427dSRiver Riddle LogicalResult 690ef976337SRiver Riddle matchAndRewrite(vector::InsertOp insertOp, OpAdaptor adaptor, 6919826fe5cSAart Bik ConversionPatternRewriter &rewriter) const override { 692563879b6SRahul Joshi auto loc = insertOp->getLoc(); 6939826fe5cSAart Bik auto sourceType = insertOp.getSourceType(); 6949826fe5cSAart Bik auto destVectorType = insertOp.getDestVectorType(); 695dcec2ca5SChristian Sigg auto llvmResultType = typeConverter->convertType(destVectorType); 6969826fe5cSAart Bik auto positionArrayAttr = insertOp.position(); 6979826fe5cSAart Bik 6989826fe5cSAart Bik // Bail if result type cannot be lowered. 6999826fe5cSAart Bik if (!llvmResultType) 7003145427dSRiver Riddle return failure(); 7019826fe5cSAart Bik 702864adf39SMatthias Springer // Overwrite entire vector with value. Should be handled by folder, but 703864adf39SMatthias Springer // just to be safe. 704864adf39SMatthias Springer if (positionArrayAttr.empty()) { 705864adf39SMatthias Springer rewriter.replaceOp(insertOp, adaptor.source()); 706864adf39SMatthias Springer return success(); 707864adf39SMatthias Springer } 708864adf39SMatthias Springer 7099826fe5cSAart Bik // One-shot insertion of a vector into an array (only requires insertvalue). 7109826fe5cSAart Bik if (sourceType.isa<VectorType>()) { 711e62a6956SRiver Riddle Value inserted = rewriter.create<LLVM::InsertValueOp>( 7129826fe5cSAart Bik loc, llvmResultType, adaptor.dest(), adaptor.source(), 7139826fe5cSAart Bik positionArrayAttr); 714563879b6SRahul Joshi rewriter.replaceOp(insertOp, inserted); 7153145427dSRiver Riddle return success(); 7169826fe5cSAart Bik } 7179826fe5cSAart Bik 7189826fe5cSAart Bik // Potential extraction of 1-D vector from array. 719563879b6SRahul Joshi auto *context = insertOp->getContext(); 720e62a6956SRiver Riddle Value extracted = adaptor.dest(); 7219826fe5cSAart Bik auto positionAttrs = positionArrayAttr.getValue(); 7229826fe5cSAart Bik auto position = positionAttrs.back().cast<IntegerAttr>(); 7239826fe5cSAart Bik auto oneDVectorType = destVectorType; 7249826fe5cSAart Bik if (positionAttrs.size() > 1) { 7259826fe5cSAart Bik oneDVectorType = reducedVectorTypeBack(destVectorType); 7269826fe5cSAart Bik auto nMinusOnePositionAttrs = 727c2c83e97STres Popp ArrayAttr::get(context, positionAttrs.drop_back()); 7289826fe5cSAart Bik extracted = rewriter.create<LLVM::ExtractValueOp>( 729dcec2ca5SChristian Sigg loc, typeConverter->convertType(oneDVectorType), extracted, 7309826fe5cSAart Bik nMinusOnePositionAttrs); 7319826fe5cSAart Bik } 7329826fe5cSAart Bik 7339826fe5cSAart Bik // Insertion of an element into a 1-D LLVM vector. 7342230bf99SAlex Zinenko auto i64Type = IntegerType::get(rewriter.getContext(), 64); 7351d47564aSAart Bik auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position); 736e62a6956SRiver Riddle Value inserted = rewriter.create<LLVM::InsertElementOp>( 737dcec2ca5SChristian Sigg loc, typeConverter->convertType(oneDVectorType), extracted, 7380f04384dSAlex Zinenko adaptor.source(), constant); 7399826fe5cSAart Bik 7409826fe5cSAart Bik // Potential insertion of resulting 1-D vector into array. 7419826fe5cSAart Bik if (positionAttrs.size() > 1) { 7429826fe5cSAart Bik auto nMinusOnePositionAttrs = 743c2c83e97STres Popp ArrayAttr::get(context, positionAttrs.drop_back()); 7449826fe5cSAart Bik inserted = rewriter.create<LLVM::InsertValueOp>(loc, llvmResultType, 7459826fe5cSAart Bik adaptor.dest(), inserted, 7469826fe5cSAart Bik nMinusOnePositionAttrs); 7479826fe5cSAart Bik } 7489826fe5cSAart Bik 749563879b6SRahul Joshi rewriter.replaceOp(insertOp, inserted); 7503145427dSRiver Riddle return success(); 7519826fe5cSAart Bik } 7529826fe5cSAart Bik }; 7539826fe5cSAart Bik 754681f929fSNicolas Vasilache /// Rank reducing rewrite for n-D FMA into (n-1)-D FMA where n > 1. 755681f929fSNicolas Vasilache /// 756681f929fSNicolas Vasilache /// Example: 757681f929fSNicolas Vasilache /// ``` 758681f929fSNicolas Vasilache /// %d = vector.fma %a, %b, %c : vector<2x4xf32> 759681f929fSNicolas Vasilache /// ``` 760681f929fSNicolas Vasilache /// is rewritten into: 761681f929fSNicolas Vasilache /// ``` 762681f929fSNicolas Vasilache /// %r = splat %f0: vector<2x4xf32> 763681f929fSNicolas Vasilache /// %va = vector.extractvalue %a[0] : vector<2x4xf32> 764681f929fSNicolas Vasilache /// %vb = vector.extractvalue %b[0] : vector<2x4xf32> 765681f929fSNicolas Vasilache /// %vc = vector.extractvalue %c[0] : vector<2x4xf32> 766681f929fSNicolas Vasilache /// %vd = vector.fma %va, %vb, %vc : vector<4xf32> 767681f929fSNicolas Vasilache /// %r2 = vector.insertvalue %vd, %r[0] : vector<4xf32> into vector<2x4xf32> 768681f929fSNicolas Vasilache /// %va2 = vector.extractvalue %a2[1] : vector<2x4xf32> 769681f929fSNicolas Vasilache /// %vb2 = vector.extractvalue %b2[1] : vector<2x4xf32> 770681f929fSNicolas Vasilache /// %vc2 = vector.extractvalue %c2[1] : vector<2x4xf32> 771681f929fSNicolas Vasilache /// %vd2 = vector.fma %va2, %vb2, %vc2 : vector<4xf32> 772681f929fSNicolas Vasilache /// %r3 = vector.insertvalue %vd2, %r2[1] : vector<4xf32> into vector<2x4xf32> 773681f929fSNicolas Vasilache /// // %r3 holds the final value. 774681f929fSNicolas Vasilache /// ``` 775681f929fSNicolas Vasilache class VectorFMAOpNDRewritePattern : public OpRewritePattern<FMAOp> { 776681f929fSNicolas Vasilache public: 777681f929fSNicolas Vasilache using OpRewritePattern<FMAOp>::OpRewritePattern; 778681f929fSNicolas Vasilache 779ee80ffbfSNicolas Vasilache void initialize() { 780ee80ffbfSNicolas Vasilache // This pattern recursively unpacks one dimension at a time. The recursion 781ee80ffbfSNicolas Vasilache // bounded as the rank is strictly decreasing. 782ee80ffbfSNicolas Vasilache setHasBoundedRewriteRecursion(); 783ee80ffbfSNicolas Vasilache } 784ee80ffbfSNicolas Vasilache 7853145427dSRiver Riddle LogicalResult matchAndRewrite(FMAOp op, 786681f929fSNicolas Vasilache PatternRewriter &rewriter) const override { 787681f929fSNicolas Vasilache auto vType = op.getVectorType(); 788681f929fSNicolas Vasilache if (vType.getRank() < 2) 7893145427dSRiver Riddle return failure(); 790681f929fSNicolas Vasilache 791681f929fSNicolas Vasilache auto loc = op.getLoc(); 792681f929fSNicolas Vasilache auto elemType = vType.getElementType(); 793a54f4eaeSMogball Value zero = rewriter.create<arith::ConstantOp>( 794a54f4eaeSMogball loc, elemType, rewriter.getZeroAttr(elemType)); 795681f929fSNicolas Vasilache Value desc = rewriter.create<SplatOp>(loc, vType, zero); 796681f929fSNicolas Vasilache for (int64_t i = 0, e = vType.getShape().front(); i != e; ++i) { 797681f929fSNicolas Vasilache Value extrLHS = rewriter.create<ExtractOp>(loc, op.lhs(), i); 798681f929fSNicolas Vasilache Value extrRHS = rewriter.create<ExtractOp>(loc, op.rhs(), i); 799681f929fSNicolas Vasilache Value extrACC = rewriter.create<ExtractOp>(loc, op.acc(), i); 800681f929fSNicolas Vasilache Value fma = rewriter.create<FMAOp>(loc, extrLHS, extrRHS, extrACC); 801681f929fSNicolas Vasilache desc = rewriter.create<InsertOp>(loc, fma, desc, i); 802681f929fSNicolas Vasilache } 803681f929fSNicolas Vasilache rewriter.replaceOp(op, desc); 8043145427dSRiver Riddle return success(); 805681f929fSNicolas Vasilache } 806681f929fSNicolas Vasilache }; 807681f929fSNicolas Vasilache 80830e6033bSNicolas Vasilache /// Returns the strides if the memory underlying `memRefType` has a contiguous 80930e6033bSNicolas Vasilache /// static layout. 81030e6033bSNicolas Vasilache static llvm::Optional<SmallVector<int64_t, 4>> 81130e6033bSNicolas Vasilache computeContiguousStrides(MemRefType memRefType) { 8122bf491c7SBenjamin Kramer int64_t offset; 81330e6033bSNicolas Vasilache SmallVector<int64_t, 4> strides; 81430e6033bSNicolas Vasilache if (failed(getStridesAndOffset(memRefType, strides, offset))) 81530e6033bSNicolas Vasilache return None; 81630e6033bSNicolas Vasilache if (!strides.empty() && strides.back() != 1) 81730e6033bSNicolas Vasilache return None; 81830e6033bSNicolas Vasilache // If no layout or identity layout, this is contiguous by definition. 819e41ebbecSVladislav Vinogradov if (memRefType.getLayout().isIdentity()) 82030e6033bSNicolas Vasilache return strides; 82130e6033bSNicolas Vasilache 82230e6033bSNicolas Vasilache // Otherwise, we must determine contiguity form shapes. This can only ever 82330e6033bSNicolas Vasilache // work in static cases because MemRefType is underspecified to represent 82430e6033bSNicolas Vasilache // contiguous dynamic shapes in other ways than with just empty/identity 82530e6033bSNicolas Vasilache // layout. 8262bf491c7SBenjamin Kramer auto sizes = memRefType.getShape(); 8275017b0f8SMatthias Springer for (int index = 0, e = strides.size() - 1; index < e; ++index) { 82830e6033bSNicolas Vasilache if (ShapedType::isDynamic(sizes[index + 1]) || 82930e6033bSNicolas Vasilache ShapedType::isDynamicStrideOrOffset(strides[index]) || 83030e6033bSNicolas Vasilache ShapedType::isDynamicStrideOrOffset(strides[index + 1])) 83130e6033bSNicolas Vasilache return None; 83230e6033bSNicolas Vasilache if (strides[index] != strides[index + 1] * sizes[index + 1]) 83330e6033bSNicolas Vasilache return None; 8342bf491c7SBenjamin Kramer } 83530e6033bSNicolas Vasilache return strides; 8362bf491c7SBenjamin Kramer } 8372bf491c7SBenjamin Kramer 838563879b6SRahul Joshi class VectorTypeCastOpConversion 839563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::TypeCastOp> { 8405c0c51a9SNicolas Vasilache public: 841563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::TypeCastOp>::ConvertOpToLLVMPattern; 8425c0c51a9SNicolas Vasilache 8433145427dSRiver Riddle LogicalResult 844ef976337SRiver Riddle matchAndRewrite(vector::TypeCastOp castOp, OpAdaptor adaptor, 8455c0c51a9SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 846563879b6SRahul Joshi auto loc = castOp->getLoc(); 8475c0c51a9SNicolas Vasilache MemRefType sourceMemRefType = 8482bdf33ccSRiver Riddle castOp.getOperand().getType().cast<MemRefType>(); 8499eb3e564SChris Lattner MemRefType targetMemRefType = castOp.getType(); 8505c0c51a9SNicolas Vasilache 8515c0c51a9SNicolas Vasilache // Only static shape casts supported atm. 8525c0c51a9SNicolas Vasilache if (!sourceMemRefType.hasStaticShape() || 8535c0c51a9SNicolas Vasilache !targetMemRefType.hasStaticShape()) 8543145427dSRiver Riddle return failure(); 8555c0c51a9SNicolas Vasilache 8565c0c51a9SNicolas Vasilache auto llvmSourceDescriptorTy = 857ef976337SRiver Riddle adaptor.getOperands()[0].getType().dyn_cast<LLVM::LLVMStructType>(); 8588de43b92SAlex Zinenko if (!llvmSourceDescriptorTy) 8593145427dSRiver Riddle return failure(); 860ef976337SRiver Riddle MemRefDescriptor sourceMemRef(adaptor.getOperands()[0]); 8615c0c51a9SNicolas Vasilache 862dcec2ca5SChristian Sigg auto llvmTargetDescriptorTy = typeConverter->convertType(targetMemRefType) 8638de43b92SAlex Zinenko .dyn_cast_or_null<LLVM::LLVMStructType>(); 8648de43b92SAlex Zinenko if (!llvmTargetDescriptorTy) 8653145427dSRiver Riddle return failure(); 8665c0c51a9SNicolas Vasilache 86730e6033bSNicolas Vasilache // Only contiguous source buffers supported atm. 86830e6033bSNicolas Vasilache auto sourceStrides = computeContiguousStrides(sourceMemRefType); 86930e6033bSNicolas Vasilache if (!sourceStrides) 87030e6033bSNicolas Vasilache return failure(); 87130e6033bSNicolas Vasilache auto targetStrides = computeContiguousStrides(targetMemRefType); 87230e6033bSNicolas Vasilache if (!targetStrides) 87330e6033bSNicolas Vasilache return failure(); 87430e6033bSNicolas Vasilache // Only support static strides for now, regardless of contiguity. 87530e6033bSNicolas Vasilache if (llvm::any_of(*targetStrides, [](int64_t stride) { 87630e6033bSNicolas Vasilache return ShapedType::isDynamicStrideOrOffset(stride); 87730e6033bSNicolas Vasilache })) 8783145427dSRiver Riddle return failure(); 8795c0c51a9SNicolas Vasilache 8802230bf99SAlex Zinenko auto int64Ty = IntegerType::get(rewriter.getContext(), 64); 8815c0c51a9SNicolas Vasilache 8825c0c51a9SNicolas Vasilache // Create descriptor. 8835c0c51a9SNicolas Vasilache auto desc = MemRefDescriptor::undef(rewriter, loc, llvmTargetDescriptorTy); 8843a577f54SChristian Sigg Type llvmTargetElementTy = desc.getElementPtrType(); 8855c0c51a9SNicolas Vasilache // Set allocated ptr. 886e62a6956SRiver Riddle Value allocated = sourceMemRef.allocatedPtr(rewriter, loc); 8875c0c51a9SNicolas Vasilache allocated = 8885c0c51a9SNicolas Vasilache rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, allocated); 8895c0c51a9SNicolas Vasilache desc.setAllocatedPtr(rewriter, loc, allocated); 8905c0c51a9SNicolas Vasilache // Set aligned ptr. 891e62a6956SRiver Riddle Value ptr = sourceMemRef.alignedPtr(rewriter, loc); 8925c0c51a9SNicolas Vasilache ptr = rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, ptr); 8935c0c51a9SNicolas Vasilache desc.setAlignedPtr(rewriter, loc, ptr); 8945c0c51a9SNicolas Vasilache // Fill offset 0. 8955c0c51a9SNicolas Vasilache auto attr = rewriter.getIntegerAttr(rewriter.getIndexType(), 0); 8965c0c51a9SNicolas Vasilache auto zero = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, attr); 8975c0c51a9SNicolas Vasilache desc.setOffset(rewriter, loc, zero); 8985c0c51a9SNicolas Vasilache 8995c0c51a9SNicolas Vasilache // Fill size and stride descriptors in memref. 9005c0c51a9SNicolas Vasilache for (auto indexedSize : llvm::enumerate(targetMemRefType.getShape())) { 9015c0c51a9SNicolas Vasilache int64_t index = indexedSize.index(); 9025c0c51a9SNicolas Vasilache auto sizeAttr = 9035c0c51a9SNicolas Vasilache rewriter.getIntegerAttr(rewriter.getIndexType(), indexedSize.value()); 9045c0c51a9SNicolas Vasilache auto size = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, sizeAttr); 9055c0c51a9SNicolas Vasilache desc.setSize(rewriter, loc, index, size); 90630e6033bSNicolas Vasilache auto strideAttr = rewriter.getIntegerAttr(rewriter.getIndexType(), 90730e6033bSNicolas Vasilache (*targetStrides)[index]); 9085c0c51a9SNicolas Vasilache auto stride = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, strideAttr); 9095c0c51a9SNicolas Vasilache desc.setStride(rewriter, loc, index, stride); 9105c0c51a9SNicolas Vasilache } 9115c0c51a9SNicolas Vasilache 912563879b6SRahul Joshi rewriter.replaceOp(castOp, {desc}); 9133145427dSRiver Riddle return success(); 9145c0c51a9SNicolas Vasilache } 9155c0c51a9SNicolas Vasilache }; 9165c0c51a9SNicolas Vasilache 917563879b6SRahul Joshi class VectorPrintOpConversion : public ConvertOpToLLVMPattern<vector::PrintOp> { 918d9b500d3SAart Bik public: 919563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::PrintOp>::ConvertOpToLLVMPattern; 920d9b500d3SAart Bik 921d9b500d3SAart Bik // Proof-of-concept lowering implementation that relies on a small 922d9b500d3SAart Bik // runtime support library, which only needs to provide a few 923d9b500d3SAart Bik // printing methods (single value for all data types, opening/closing 924d9b500d3SAart Bik // bracket, comma, newline). The lowering fully unrolls a vector 925d9b500d3SAart Bik // in terms of these elementary printing operations. The advantage 926d9b500d3SAart Bik // of this approach is that the library can remain unaware of all 927d9b500d3SAart Bik // low-level implementation details of vectors while still supporting 928d9b500d3SAart Bik // output of any shaped and dimensioned vector. Due to full unrolling, 929d9b500d3SAart Bik // this approach is less suited for very large vectors though. 930d9b500d3SAart Bik // 9319db53a18SRiver Riddle // TODO: rely solely on libc in future? something else? 932d9b500d3SAart Bik // 9333145427dSRiver Riddle LogicalResult 934ef976337SRiver Riddle matchAndRewrite(vector::PrintOp printOp, OpAdaptor adaptor, 935d9b500d3SAart Bik ConversionPatternRewriter &rewriter) const override { 936d9b500d3SAart Bik Type printType = printOp.getPrintType(); 937d9b500d3SAart Bik 938dcec2ca5SChristian Sigg if (typeConverter->convertType(printType) == nullptr) 9393145427dSRiver Riddle return failure(); 940d9b500d3SAart Bik 941b8880f5fSAart Bik // Make sure element type has runtime support. 942b8880f5fSAart Bik PrintConversion conversion = PrintConversion::None; 943d9b500d3SAart Bik VectorType vectorType = printType.dyn_cast<VectorType>(); 944d9b500d3SAart Bik Type eltType = vectorType ? vectorType.getElementType() : printType; 945d9b500d3SAart Bik Operation *printer; 946b8880f5fSAart Bik if (eltType.isF32()) { 947e332c22cSNicolas Vasilache printer = 948e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintF32Fn(printOp->getParentOfType<ModuleOp>()); 949b8880f5fSAart Bik } else if (eltType.isF64()) { 950e332c22cSNicolas Vasilache printer = 951e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintF64Fn(printOp->getParentOfType<ModuleOp>()); 95254759cefSAart Bik } else if (eltType.isIndex()) { 953e332c22cSNicolas Vasilache printer = 954e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintU64Fn(printOp->getParentOfType<ModuleOp>()); 955b8880f5fSAart Bik } else if (auto intTy = eltType.dyn_cast<IntegerType>()) { 956b8880f5fSAart Bik // Integers need a zero or sign extension on the operand 957b8880f5fSAart Bik // (depending on the source type) as well as a signed or 958b8880f5fSAart Bik // unsigned print method. Up to 64-bit is supported. 959b8880f5fSAart Bik unsigned width = intTy.getWidth(); 960b8880f5fSAart Bik if (intTy.isUnsigned()) { 96154759cefSAart Bik if (width <= 64) { 962b8880f5fSAart Bik if (width < 64) 963b8880f5fSAart Bik conversion = PrintConversion::ZeroExt64; 964e332c22cSNicolas Vasilache printer = LLVM::lookupOrCreatePrintU64Fn( 965e332c22cSNicolas Vasilache printOp->getParentOfType<ModuleOp>()); 966b8880f5fSAart Bik } else { 9673145427dSRiver Riddle return failure(); 968b8880f5fSAart Bik } 969b8880f5fSAart Bik } else { 970b8880f5fSAart Bik assert(intTy.isSignless() || intTy.isSigned()); 97154759cefSAart Bik if (width <= 64) { 972b8880f5fSAart Bik // Note that we *always* zero extend booleans (1-bit integers), 973b8880f5fSAart Bik // so that true/false is printed as 1/0 rather than -1/0. 974b8880f5fSAart Bik if (width == 1) 97554759cefSAart Bik conversion = PrintConversion::ZeroExt64; 97654759cefSAart Bik else if (width < 64) 977b8880f5fSAart Bik conversion = PrintConversion::SignExt64; 978e332c22cSNicolas Vasilache printer = LLVM::lookupOrCreatePrintI64Fn( 979e332c22cSNicolas Vasilache printOp->getParentOfType<ModuleOp>()); 980b8880f5fSAart Bik } else { 981b8880f5fSAart Bik return failure(); 982b8880f5fSAart Bik } 983b8880f5fSAart Bik } 984b8880f5fSAart Bik } else { 985b8880f5fSAart Bik return failure(); 986b8880f5fSAart Bik } 987d9b500d3SAart Bik 988d9b500d3SAart Bik // Unroll vector into elementary print calls. 989b8880f5fSAart Bik int64_t rank = vectorType ? vectorType.getRank() : 0; 990563879b6SRahul Joshi emitRanks(rewriter, printOp, adaptor.source(), vectorType, printer, rank, 991b8880f5fSAart Bik conversion); 992e332c22cSNicolas Vasilache emitCall(rewriter, printOp->getLoc(), 993e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintNewlineFn( 994e332c22cSNicolas Vasilache printOp->getParentOfType<ModuleOp>())); 995563879b6SRahul Joshi rewriter.eraseOp(printOp); 9963145427dSRiver Riddle return success(); 997d9b500d3SAart Bik } 998d9b500d3SAart Bik 999d9b500d3SAart Bik private: 1000b8880f5fSAart Bik enum class PrintConversion { 100130e6033bSNicolas Vasilache // clang-format off 1002b8880f5fSAart Bik None, 1003b8880f5fSAart Bik ZeroExt64, 1004b8880f5fSAart Bik SignExt64 100530e6033bSNicolas Vasilache // clang-format on 1006b8880f5fSAart Bik }; 1007b8880f5fSAart Bik 1008d9b500d3SAart Bik void emitRanks(ConversionPatternRewriter &rewriter, Operation *op, 1009e62a6956SRiver Riddle Value value, VectorType vectorType, Operation *printer, 1010b8880f5fSAart Bik int64_t rank, PrintConversion conversion) const { 1011d9b500d3SAart Bik Location loc = op->getLoc(); 1012d9b500d3SAart Bik if (rank == 0) { 1013b8880f5fSAart Bik switch (conversion) { 1014b8880f5fSAart Bik case PrintConversion::ZeroExt64: 1015a54f4eaeSMogball value = rewriter.create<arith::ExtUIOp>( 10162230bf99SAlex Zinenko loc, value, IntegerType::get(rewriter.getContext(), 64)); 1017b8880f5fSAart Bik break; 1018b8880f5fSAart Bik case PrintConversion::SignExt64: 1019a54f4eaeSMogball value = rewriter.create<arith::ExtSIOp>( 10202230bf99SAlex Zinenko loc, value, IntegerType::get(rewriter.getContext(), 64)); 1021b8880f5fSAart Bik break; 1022b8880f5fSAart Bik case PrintConversion::None: 1023b8880f5fSAart Bik break; 1024c9eeeb38Saartbik } 1025d9b500d3SAart Bik emitCall(rewriter, loc, printer, value); 1026d9b500d3SAart Bik return; 1027d9b500d3SAart Bik } 1028d9b500d3SAart Bik 1029e332c22cSNicolas Vasilache emitCall(rewriter, loc, 1030e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintOpenFn(op->getParentOfType<ModuleOp>())); 1031e332c22cSNicolas Vasilache Operation *printComma = 1032e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintCommaFn(op->getParentOfType<ModuleOp>()); 1033d9b500d3SAart Bik int64_t dim = vectorType.getDimSize(0); 1034d9b500d3SAart Bik for (int64_t d = 0; d < dim; ++d) { 1035d9b500d3SAart Bik auto reducedType = 1036d9b500d3SAart Bik rank > 1 ? reducedVectorTypeFront(vectorType) : nullptr; 1037dcec2ca5SChristian Sigg auto llvmType = typeConverter->convertType( 1038d9b500d3SAart Bik rank > 1 ? reducedType : vectorType.getElementType()); 1039dcec2ca5SChristian Sigg Value nestedVal = extractOne(rewriter, *getTypeConverter(), loc, value, 1040dcec2ca5SChristian Sigg llvmType, rank, d); 1041b8880f5fSAart Bik emitRanks(rewriter, op, nestedVal, reducedType, printer, rank - 1, 1042b8880f5fSAart Bik conversion); 1043d9b500d3SAart Bik if (d != dim - 1) 1044d9b500d3SAart Bik emitCall(rewriter, loc, printComma); 1045d9b500d3SAart Bik } 1046e332c22cSNicolas Vasilache emitCall(rewriter, loc, 1047e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintCloseFn(op->getParentOfType<ModuleOp>())); 1048d9b500d3SAart Bik } 1049d9b500d3SAart Bik 1050d9b500d3SAart Bik // Helper to emit a call. 1051d9b500d3SAart Bik static void emitCall(ConversionPatternRewriter &rewriter, Location loc, 1052d9b500d3SAart Bik Operation *ref, ValueRange params = ValueRange()) { 1053faf1c224SChris Lattner rewriter.create<LLVM::CallOp>(loc, TypeRange(), SymbolRefAttr::get(ref), 1054faf1c224SChris Lattner params); 1055d9b500d3SAart Bik } 1056d9b500d3SAart Bik }; 1057d9b500d3SAart Bik 1058df186507SBenjamin Kramer } // namespace 1059df186507SBenjamin Kramer 10605c0c51a9SNicolas Vasilache /// Populate the given list with patterns that convert from Vector to LLVM. 10615c0c51a9SNicolas Vasilache void mlir::populateVectorToLLVMConversionPatterns( 1062dc4e913bSChris Lattner LLVMTypeConverter &converter, RewritePatternSet &patterns, 106365a3f289SMatthias Springer bool reassociateFPReductions) { 106465678d93SNicolas Vasilache MLIRContext *ctx = converter.getDialect()->getContext(); 1065eda2ebd7SNicolas Vasilache patterns.add<VectorFMAOpNDRewritePattern>(ctx); 1066eda2ebd7SNicolas Vasilache populateVectorInsertExtractStridedSliceTransforms(patterns); 1067dc4e913bSChris Lattner patterns.add<VectorReductionOpConversion>(converter, reassociateFPReductions); 10688345b86dSNicolas Vasilache patterns 1069dc4e913bSChris Lattner .add<VectorBitCastOpConversion, VectorShuffleOpConversion, 1070dc4e913bSChris Lattner VectorExtractElementOpConversion, VectorExtractOpConversion, 1071dc4e913bSChris Lattner VectorFMAOp1DConversion, VectorInsertElementOpConversion, 1072dc4e913bSChris Lattner VectorInsertOpConversion, VectorPrintOpConversion, 107319dbb230Saartbik VectorTypeCastOpConversion, 1074dc4e913bSChris Lattner VectorLoadStoreConversion<vector::LoadOp, vector::LoadOpAdaptor>, 1075ee66e43aSDiego Caballero VectorLoadStoreConversion<vector::MaskedLoadOp, 1076ee66e43aSDiego Caballero vector::MaskedLoadOpAdaptor>, 1077dc4e913bSChris Lattner VectorLoadStoreConversion<vector::StoreOp, vector::StoreOpAdaptor>, 1078ee66e43aSDiego Caballero VectorLoadStoreConversion<vector::MaskedStoreOp, 1079ee66e43aSDiego Caballero vector::MaskedStoreOpAdaptor>, 1080dc4e913bSChris Lattner VectorGatherOpConversion, VectorScatterOpConversion, 1081d1a9e9a7SMatthias Springer VectorExpandLoadOpConversion, VectorCompressStoreOpConversion>( 1082d1a9e9a7SMatthias Springer converter); 1083d1a9e9a7SMatthias Springer // Transfer ops with rank > 1 are handled by VectorToSCF. 1084d1a9e9a7SMatthias Springer populateVectorTransferLoweringPatterns(patterns, /*maxTransferRank=*/1); 10855c0c51a9SNicolas Vasilache } 10865c0c51a9SNicolas Vasilache 108763b683a8SNicolas Vasilache void mlir::populateVectorToLLVMMatrixConversionPatterns( 1088dc4e913bSChris Lattner LLVMTypeConverter &converter, RewritePatternSet &patterns) { 1089dc4e913bSChris Lattner patterns.add<VectorMatmulOpConversion>(converter); 1090dc4e913bSChris Lattner patterns.add<VectorFlatTransposeOpConversion>(converter); 109163b683a8SNicolas Vasilache } 1092