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) { 60cc311a15SMichal Terepeta if (rank <= 1) { 611c81adf3SAart Bik auto idxType = rewriter.getIndexType(); 621c81adf3SAart Bik auto constant = rewriter.create<LLVM::ConstantOp>( 630f04384dSAlex Zinenko loc, typeConverter.convertType(idxType), 641c81adf3SAart Bik rewriter.getIntegerAttr(idxType, pos)); 651c81adf3SAart Bik return rewriter.create<LLVM::ExtractElementOp>(loc, llvmType, val, 661c81adf3SAart Bik constant); 671c81adf3SAart Bik } 681c81adf3SAart Bik return rewriter.create<LLVM::ExtractValueOp>(loc, llvmType, val, 691c81adf3SAart Bik rewriter.getI64ArrayAttr(pos)); 701c81adf3SAart Bik } 711c81adf3SAart Bik 7226c8f908SThomas Raoux // Helper that returns data layout alignment of a memref. 7326c8f908SThomas Raoux LogicalResult getMemRefAlignment(LLVMTypeConverter &typeConverter, 7426c8f908SThomas Raoux MemRefType memrefType, unsigned &align) { 7526c8f908SThomas Raoux Type elementTy = typeConverter.convertType(memrefType.getElementType()); 765f9e0466SNicolas Vasilache if (!elementTy) 775f9e0466SNicolas Vasilache return failure(); 785f9e0466SNicolas Vasilache 79b2ab375dSAlex Zinenko // TODO: this should use the MLIR data layout when it becomes available and 80b2ab375dSAlex Zinenko // stop depending on translation. 8187a89e0fSAlex Zinenko llvm::LLVMContext llvmContext; 8287a89e0fSAlex Zinenko align = LLVM::TypeToLLVMIRTranslator(llvmContext) 83c69c9e0fSAlex Zinenko .getPreferredAlignment(elementTy, typeConverter.getDataLayout()); 845f9e0466SNicolas Vasilache return success(); 855f9e0466SNicolas Vasilache } 865f9e0466SNicolas Vasilache 87df5ccf5aSAart Bik // Add an index vector component to a base pointer. This almost always succeeds 88df5ccf5aSAart Bik // unless the last stride is non-unit or the memory space is not zero. 89df5ccf5aSAart Bik static LogicalResult getIndexedPtrs(ConversionPatternRewriter &rewriter, 90df5ccf5aSAart Bik Location loc, Value memref, Value base, 91df5ccf5aSAart Bik Value index, MemRefType memRefType, 92df5ccf5aSAart Bik VectorType vType, Value &ptrs) { 9319dbb230Saartbik int64_t offset; 9419dbb230Saartbik SmallVector<int64_t, 4> strides; 9519dbb230Saartbik auto successStrides = getStridesAndOffset(memRefType, strides, offset); 96df5ccf5aSAart Bik if (failed(successStrides) || strides.back() != 1 || 9737eca08eSVladislav Vinogradov memRefType.getMemorySpaceAsInt() != 0) 98e8dcf5f8Saartbik return failure(); 993a577f54SChristian Sigg auto pType = MemRefDescriptor(memref).getElementPtrType(); 100bd30a796SAlex Zinenko auto ptrsType = LLVM::getFixedVectorType(pType, vType.getDimSize(0)); 101df5ccf5aSAart Bik ptrs = rewriter.create<LLVM::GEPOp>(loc, ptrsType, base, index); 10219dbb230Saartbik return success(); 10319dbb230Saartbik } 10419dbb230Saartbik 105a57def30SAart Bik // Casts a strided element pointer to a vector pointer. The vector pointer 10608c681f6SAndrew Pritchard // will be in the same address space as the incoming memref type. 107a57def30SAart Bik static Value castDataPtr(ConversionPatternRewriter &rewriter, Location loc, 108a57def30SAart Bik Value ptr, MemRefType memRefType, Type vt) { 10937eca08eSVladislav Vinogradov auto pType = LLVM::LLVMPointerType::get(vt, memRefType.getMemorySpaceAsInt()); 110a57def30SAart Bik return rewriter.create<LLVM::BitcastOp>(loc, pType, ptr); 111a57def30SAart Bik } 112a57def30SAart Bik 11390c01357SBenjamin Kramer namespace { 114e83b7b99Saartbik 115cf5c517cSDiego Caballero /// Conversion pattern for a vector.bitcast. 116cf5c517cSDiego Caballero class VectorBitCastOpConversion 117cf5c517cSDiego Caballero : public ConvertOpToLLVMPattern<vector::BitCastOp> { 118cf5c517cSDiego Caballero public: 119cf5c517cSDiego Caballero using ConvertOpToLLVMPattern<vector::BitCastOp>::ConvertOpToLLVMPattern; 120cf5c517cSDiego Caballero 121cf5c517cSDiego Caballero LogicalResult 122ef976337SRiver Riddle matchAndRewrite(vector::BitCastOp bitCastOp, OpAdaptor adaptor, 123cf5c517cSDiego Caballero ConversionPatternRewriter &rewriter) const override { 124*1423e8bfSMichal Terepeta // Only 0-D and 1-D vectors can be lowered to LLVM. 125*1423e8bfSMichal Terepeta VectorType resultTy = bitCastOp.getResultVectorType(); 126*1423e8bfSMichal Terepeta if (resultTy.getRank() > 1) 127cf5c517cSDiego Caballero return failure(); 128cf5c517cSDiego Caballero Type newResultTy = typeConverter->convertType(resultTy); 129cf5c517cSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::BitcastOp>(bitCastOp, newResultTy, 130ef976337SRiver Riddle adaptor.getOperands()[0]); 131cf5c517cSDiego Caballero return success(); 132cf5c517cSDiego Caballero } 133cf5c517cSDiego Caballero }; 134cf5c517cSDiego Caballero 13563b683a8SNicolas Vasilache /// Conversion pattern for a vector.matrix_multiply. 13663b683a8SNicolas Vasilache /// This is lowered directly to the proper llvm.intr.matrix.multiply. 137563879b6SRahul Joshi class VectorMatmulOpConversion 138563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::MatmulOp> { 13963b683a8SNicolas Vasilache public: 140563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::MatmulOp>::ConvertOpToLLVMPattern; 14163b683a8SNicolas Vasilache 1423145427dSRiver Riddle LogicalResult 143ef976337SRiver Riddle matchAndRewrite(vector::MatmulOp matmulOp, OpAdaptor adaptor, 14463b683a8SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 14563b683a8SNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::MatrixMultiplyOp>( 146563879b6SRahul Joshi matmulOp, typeConverter->convertType(matmulOp.res().getType()), 147563879b6SRahul Joshi adaptor.lhs(), adaptor.rhs(), matmulOp.lhs_rows(), 148563879b6SRahul Joshi matmulOp.lhs_columns(), matmulOp.rhs_columns()); 1493145427dSRiver Riddle return success(); 15063b683a8SNicolas Vasilache } 15163b683a8SNicolas Vasilache }; 15263b683a8SNicolas Vasilache 153c295a65dSaartbik /// Conversion pattern for a vector.flat_transpose. 154c295a65dSaartbik /// This is lowered directly to the proper llvm.intr.matrix.transpose. 155563879b6SRahul Joshi class VectorFlatTransposeOpConversion 156563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::FlatTransposeOp> { 157c295a65dSaartbik public: 158563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::FlatTransposeOp>::ConvertOpToLLVMPattern; 159c295a65dSaartbik 160c295a65dSaartbik LogicalResult 161ef976337SRiver Riddle matchAndRewrite(vector::FlatTransposeOp transOp, OpAdaptor adaptor, 162c295a65dSaartbik ConversionPatternRewriter &rewriter) const override { 163c295a65dSaartbik rewriter.replaceOpWithNewOp<LLVM::MatrixTransposeOp>( 164dcec2ca5SChristian Sigg transOp, typeConverter->convertType(transOp.res().getType()), 165c295a65dSaartbik adaptor.matrix(), transOp.rows(), transOp.columns()); 166c295a65dSaartbik return success(); 167c295a65dSaartbik } 168c295a65dSaartbik }; 169c295a65dSaartbik 170ee66e43aSDiego Caballero /// Overloaded utility that replaces a vector.load, vector.store, 171ee66e43aSDiego Caballero /// vector.maskedload and vector.maskedstore with their respective LLVM 172ee66e43aSDiego Caballero /// couterparts. 173ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::LoadOp loadOp, 174ee66e43aSDiego Caballero vector::LoadOpAdaptor adaptor, 175ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 176ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 177ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::LoadOp>(loadOp, ptr, align); 17839379916Saartbik } 17939379916Saartbik 180ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::MaskedLoadOp loadOp, 181ee66e43aSDiego Caballero vector::MaskedLoadOpAdaptor adaptor, 182ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 183ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 184ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::MaskedLoadOp>( 185ee66e43aSDiego Caballero loadOp, vectorTy, ptr, adaptor.mask(), adaptor.pass_thru(), align); 186ee66e43aSDiego Caballero } 187ee66e43aSDiego Caballero 188ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::StoreOp storeOp, 189ee66e43aSDiego Caballero vector::StoreOpAdaptor adaptor, 190ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 191ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 192ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::StoreOp>(storeOp, adaptor.valueToStore(), 193ee66e43aSDiego Caballero ptr, align); 194ee66e43aSDiego Caballero } 195ee66e43aSDiego Caballero 196ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::MaskedStoreOp storeOp, 197ee66e43aSDiego Caballero vector::MaskedStoreOpAdaptor adaptor, 198ee66e43aSDiego Caballero VectorType vectorTy, Value ptr, unsigned align, 199ee66e43aSDiego Caballero ConversionPatternRewriter &rewriter) { 200ee66e43aSDiego Caballero rewriter.replaceOpWithNewOp<LLVM::MaskedStoreOp>( 201ee66e43aSDiego Caballero storeOp, adaptor.valueToStore(), ptr, adaptor.mask(), align); 202ee66e43aSDiego Caballero } 203ee66e43aSDiego Caballero 204ee66e43aSDiego Caballero /// Conversion pattern for a vector.load, vector.store, vector.maskedload, and 205ee66e43aSDiego Caballero /// vector.maskedstore. 206ee66e43aSDiego Caballero template <class LoadOrStoreOp, class LoadOrStoreOpAdaptor> 207ee66e43aSDiego Caballero class VectorLoadStoreConversion : public ConvertOpToLLVMPattern<LoadOrStoreOp> { 20839379916Saartbik public: 209ee66e43aSDiego Caballero using ConvertOpToLLVMPattern<LoadOrStoreOp>::ConvertOpToLLVMPattern; 21039379916Saartbik 21139379916Saartbik LogicalResult 212ef976337SRiver Riddle matchAndRewrite(LoadOrStoreOp loadOrStoreOp, 213ef976337SRiver Riddle typename LoadOrStoreOp::Adaptor adaptor, 21439379916Saartbik ConversionPatternRewriter &rewriter) const override { 215ee66e43aSDiego Caballero // Only 1-D vectors can be lowered to LLVM. 216ee66e43aSDiego Caballero VectorType vectorTy = loadOrStoreOp.getVectorType(); 217ee66e43aSDiego Caballero if (vectorTy.getRank() > 1) 218ee66e43aSDiego Caballero return failure(); 219ee66e43aSDiego Caballero 220ee66e43aSDiego Caballero auto loc = loadOrStoreOp->getLoc(); 221ee66e43aSDiego Caballero MemRefType memRefTy = loadOrStoreOp.getMemRefType(); 22239379916Saartbik 22339379916Saartbik // Resolve alignment. 22439379916Saartbik unsigned align; 22573863648SStephen Neuendorffer if (failed(getMemRefAlignment(*this->getTypeConverter(), memRefTy, align))) 22639379916Saartbik return failure(); 22739379916Saartbik 228a57def30SAart Bik // Resolve address. 229ee66e43aSDiego Caballero auto vtype = this->typeConverter->convertType(loadOrStoreOp.getVectorType()) 230ee66e43aSDiego Caballero .template cast<VectorType>(); 231ee66e43aSDiego Caballero Value dataPtr = this->getStridedElementPtr(loc, memRefTy, adaptor.base(), 232a57def30SAart Bik adaptor.indices(), rewriter); 233ee66e43aSDiego Caballero Value ptr = castDataPtr(rewriter, loc, dataPtr, memRefTy, vtype); 23439379916Saartbik 235ee66e43aSDiego Caballero replaceLoadOrStoreOp(loadOrStoreOp, adaptor, vtype, ptr, align, rewriter); 23639379916Saartbik return success(); 23739379916Saartbik } 23839379916Saartbik }; 23939379916Saartbik 24019dbb230Saartbik /// Conversion pattern for a vector.gather. 241563879b6SRahul Joshi class VectorGatherOpConversion 242563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::GatherOp> { 24319dbb230Saartbik public: 244563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::GatherOp>::ConvertOpToLLVMPattern; 24519dbb230Saartbik 24619dbb230Saartbik LogicalResult 247ef976337SRiver Riddle matchAndRewrite(vector::GatherOp gather, OpAdaptor adaptor, 24819dbb230Saartbik ConversionPatternRewriter &rewriter) const override { 249563879b6SRahul Joshi auto loc = gather->getLoc(); 250df5ccf5aSAart Bik MemRefType memRefType = gather.getMemRefType(); 25119dbb230Saartbik 25219dbb230Saartbik // Resolve alignment. 25319dbb230Saartbik unsigned align; 25473863648SStephen Neuendorffer if (failed(getMemRefAlignment(*getTypeConverter(), memRefType, align))) 25519dbb230Saartbik return failure(); 25619dbb230Saartbik 257df5ccf5aSAart Bik // Resolve address. 25819dbb230Saartbik Value ptrs; 259df5ccf5aSAart Bik VectorType vType = gather.getVectorType(); 260df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 261df5ccf5aSAart Bik adaptor.indices(), rewriter); 262df5ccf5aSAart Bik if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), ptr, 263df5ccf5aSAart Bik adaptor.index_vec(), memRefType, vType, ptrs))) 26419dbb230Saartbik return failure(); 26519dbb230Saartbik 26619dbb230Saartbik // Replace with the gather intrinsic. 26719dbb230Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_gather>( 268dcec2ca5SChristian Sigg gather, typeConverter->convertType(vType), ptrs, adaptor.mask(), 2690c2a4d3cSBenjamin Kramer adaptor.pass_thru(), rewriter.getI32IntegerAttr(align)); 27019dbb230Saartbik return success(); 27119dbb230Saartbik } 27219dbb230Saartbik }; 27319dbb230Saartbik 27419dbb230Saartbik /// Conversion pattern for a vector.scatter. 275563879b6SRahul Joshi class VectorScatterOpConversion 276563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ScatterOp> { 27719dbb230Saartbik public: 278563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ScatterOp>::ConvertOpToLLVMPattern; 27919dbb230Saartbik 28019dbb230Saartbik LogicalResult 281ef976337SRiver Riddle matchAndRewrite(vector::ScatterOp scatter, OpAdaptor adaptor, 28219dbb230Saartbik ConversionPatternRewriter &rewriter) const override { 283563879b6SRahul Joshi auto loc = scatter->getLoc(); 284df5ccf5aSAart Bik MemRefType memRefType = scatter.getMemRefType(); 28519dbb230Saartbik 28619dbb230Saartbik // Resolve alignment. 28719dbb230Saartbik unsigned align; 28873863648SStephen Neuendorffer if (failed(getMemRefAlignment(*getTypeConverter(), memRefType, align))) 28919dbb230Saartbik return failure(); 29019dbb230Saartbik 291df5ccf5aSAart Bik // Resolve address. 29219dbb230Saartbik Value ptrs; 293df5ccf5aSAart Bik VectorType vType = scatter.getVectorType(); 294df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 295df5ccf5aSAart Bik adaptor.indices(), rewriter); 296df5ccf5aSAart Bik if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), ptr, 297df5ccf5aSAart Bik adaptor.index_vec(), memRefType, vType, ptrs))) 29819dbb230Saartbik return failure(); 29919dbb230Saartbik 30019dbb230Saartbik // Replace with the scatter intrinsic. 30119dbb230Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_scatter>( 302656674a7SDiego Caballero scatter, adaptor.valueToStore(), ptrs, adaptor.mask(), 30319dbb230Saartbik rewriter.getI32IntegerAttr(align)); 30419dbb230Saartbik return success(); 30519dbb230Saartbik } 30619dbb230Saartbik }; 30719dbb230Saartbik 308e8dcf5f8Saartbik /// Conversion pattern for a vector.expandload. 309563879b6SRahul Joshi class VectorExpandLoadOpConversion 310563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ExpandLoadOp> { 311e8dcf5f8Saartbik public: 312563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ExpandLoadOp>::ConvertOpToLLVMPattern; 313e8dcf5f8Saartbik 314e8dcf5f8Saartbik LogicalResult 315ef976337SRiver Riddle matchAndRewrite(vector::ExpandLoadOp expand, OpAdaptor adaptor, 316e8dcf5f8Saartbik ConversionPatternRewriter &rewriter) const override { 317563879b6SRahul Joshi auto loc = expand->getLoc(); 318a57def30SAart Bik MemRefType memRefType = expand.getMemRefType(); 319e8dcf5f8Saartbik 320a57def30SAart Bik // Resolve address. 321656674a7SDiego Caballero auto vtype = typeConverter->convertType(expand.getVectorType()); 322df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 323a57def30SAart Bik adaptor.indices(), rewriter); 324e8dcf5f8Saartbik 325e8dcf5f8Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_expandload>( 326a57def30SAart Bik expand, vtype, ptr, adaptor.mask(), adaptor.pass_thru()); 327e8dcf5f8Saartbik return success(); 328e8dcf5f8Saartbik } 329e8dcf5f8Saartbik }; 330e8dcf5f8Saartbik 331e8dcf5f8Saartbik /// Conversion pattern for a vector.compressstore. 332563879b6SRahul Joshi class VectorCompressStoreOpConversion 333563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::CompressStoreOp> { 334e8dcf5f8Saartbik public: 335563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::CompressStoreOp>::ConvertOpToLLVMPattern; 336e8dcf5f8Saartbik 337e8dcf5f8Saartbik LogicalResult 338ef976337SRiver Riddle matchAndRewrite(vector::CompressStoreOp compress, OpAdaptor adaptor, 339e8dcf5f8Saartbik ConversionPatternRewriter &rewriter) const override { 340563879b6SRahul Joshi auto loc = compress->getLoc(); 341a57def30SAart Bik MemRefType memRefType = compress.getMemRefType(); 342e8dcf5f8Saartbik 343a57def30SAart Bik // Resolve address. 344df5ccf5aSAart Bik Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(), 345a57def30SAart Bik adaptor.indices(), rewriter); 346e8dcf5f8Saartbik 347e8dcf5f8Saartbik rewriter.replaceOpWithNewOp<LLVM::masked_compressstore>( 348656674a7SDiego Caballero compress, adaptor.valueToStore(), ptr, adaptor.mask()); 349e8dcf5f8Saartbik return success(); 350e8dcf5f8Saartbik } 351e8dcf5f8Saartbik }; 352e8dcf5f8Saartbik 35319dbb230Saartbik /// Conversion pattern for all vector reductions. 354563879b6SRahul Joshi class VectorReductionOpConversion 355563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ReductionOp> { 356e83b7b99Saartbik public: 357563879b6SRahul Joshi explicit VectorReductionOpConversion(LLVMTypeConverter &typeConv, 358060c9dd1Saartbik bool reassociateFPRed) 359563879b6SRahul Joshi : ConvertOpToLLVMPattern<vector::ReductionOp>(typeConv), 360060c9dd1Saartbik reassociateFPReductions(reassociateFPRed) {} 361e83b7b99Saartbik 3623145427dSRiver Riddle LogicalResult 363ef976337SRiver Riddle matchAndRewrite(vector::ReductionOp reductionOp, OpAdaptor adaptor, 364e83b7b99Saartbik ConversionPatternRewriter &rewriter) const override { 365e83b7b99Saartbik auto kind = reductionOp.kind(); 366e83b7b99Saartbik Type eltType = reductionOp.dest().getType(); 367dcec2ca5SChristian Sigg Type llvmType = typeConverter->convertType(eltType); 368ef976337SRiver Riddle Value operand = adaptor.getOperands()[0]; 369e9628955SAart Bik if (eltType.isIntOrIndex()) { 370e83b7b99Saartbik // Integer reductions: add/mul/min/max/and/or/xor. 371e83b7b99Saartbik if (kind == "add") 372ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_add>(reductionOp, 373ef976337SRiver Riddle llvmType, operand); 374e83b7b99Saartbik else if (kind == "mul") 375ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_mul>(reductionOp, 376ef976337SRiver Riddle llvmType, operand); 377eaf2588aSDiego Caballero else if (kind == "minui") 378322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_umin>( 379ef976337SRiver Riddle reductionOp, llvmType, operand); 380eaf2588aSDiego Caballero else if (kind == "minsi") 381322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_smin>( 382ef976337SRiver Riddle reductionOp, llvmType, operand); 383eaf2588aSDiego Caballero else if (kind == "maxui") 384322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_umax>( 385ef976337SRiver Riddle reductionOp, llvmType, operand); 386eaf2588aSDiego Caballero else if (kind == "maxsi") 387322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_smax>( 388ef976337SRiver Riddle reductionOp, llvmType, operand); 389e83b7b99Saartbik else if (kind == "and") 390ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_and>(reductionOp, 391ef976337SRiver Riddle llvmType, operand); 392e83b7b99Saartbik else if (kind == "or") 393ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_or>(reductionOp, 394ef976337SRiver Riddle llvmType, operand); 395e83b7b99Saartbik else if (kind == "xor") 396ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_xor>(reductionOp, 397ef976337SRiver Riddle llvmType, operand); 398e83b7b99Saartbik else 3993145427dSRiver Riddle return failure(); 4003145427dSRiver Riddle return success(); 401dcec2ca5SChristian Sigg } 402e83b7b99Saartbik 403dcec2ca5SChristian Sigg if (!eltType.isa<FloatType>()) 404dcec2ca5SChristian Sigg return failure(); 405dcec2ca5SChristian Sigg 406e83b7b99Saartbik // Floating-point reductions: add/mul/min/max 407e83b7b99Saartbik if (kind == "add") { 4080d924700Saartbik // Optional accumulator (or zero). 409ef976337SRiver Riddle Value acc = adaptor.getOperands().size() > 1 410ef976337SRiver Riddle ? adaptor.getOperands()[1] 4110d924700Saartbik : rewriter.create<LLVM::ConstantOp>( 412563879b6SRahul Joshi reductionOp->getLoc(), llvmType, 4130d924700Saartbik rewriter.getZeroAttr(eltType)); 414322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fadd>( 415ef976337SRiver Riddle reductionOp, llvmType, acc, operand, 416ceb1b327Saartbik rewriter.getBoolAttr(reassociateFPReductions)); 417e83b7b99Saartbik } else if (kind == "mul") { 4180d924700Saartbik // Optional accumulator (or one). 419ef976337SRiver Riddle Value acc = adaptor.getOperands().size() > 1 420ef976337SRiver Riddle ? adaptor.getOperands()[1] 4210d924700Saartbik : rewriter.create<LLVM::ConstantOp>( 422563879b6SRahul Joshi reductionOp->getLoc(), llvmType, 4230d924700Saartbik rewriter.getFloatAttr(eltType, 1.0)); 424322d0afdSAmara Emerson rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmul>( 425ef976337SRiver Riddle reductionOp, llvmType, acc, operand, 426ceb1b327Saartbik rewriter.getBoolAttr(reassociateFPReductions)); 427eaf2588aSDiego Caballero } else if (kind == "minf") 428eaf2588aSDiego Caballero // FIXME: MLIR's 'minf' and LLVM's 'vector_reduce_fmin' do not handle 429eaf2588aSDiego Caballero // NaNs/-0.0/+0.0 in the same way. 430ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmin>(reductionOp, 431ef976337SRiver Riddle llvmType, operand); 432eaf2588aSDiego Caballero else if (kind == "maxf") 433eaf2588aSDiego Caballero // FIXME: MLIR's 'maxf' and LLVM's 'vector_reduce_fmax' do not handle 434eaf2588aSDiego Caballero // NaNs/-0.0/+0.0 in the same way. 435ef976337SRiver Riddle rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmax>(reductionOp, 436ef976337SRiver Riddle llvmType, operand); 437e83b7b99Saartbik else 4383145427dSRiver Riddle return failure(); 4393145427dSRiver Riddle return success(); 440e83b7b99Saartbik } 441ceb1b327Saartbik 442ceb1b327Saartbik private: 443ceb1b327Saartbik const bool reassociateFPReductions; 444e83b7b99Saartbik }; 445e83b7b99Saartbik 446563879b6SRahul Joshi class VectorShuffleOpConversion 447563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ShuffleOp> { 4481c81adf3SAart Bik public: 449563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ShuffleOp>::ConvertOpToLLVMPattern; 4501c81adf3SAart Bik 4513145427dSRiver Riddle LogicalResult 452ef976337SRiver Riddle matchAndRewrite(vector::ShuffleOp shuffleOp, OpAdaptor adaptor, 4531c81adf3SAart Bik ConversionPatternRewriter &rewriter) const override { 454563879b6SRahul Joshi auto loc = shuffleOp->getLoc(); 4551c81adf3SAart Bik auto v1Type = shuffleOp.getV1VectorType(); 4561c81adf3SAart Bik auto v2Type = shuffleOp.getV2VectorType(); 4571c81adf3SAart Bik auto vectorType = shuffleOp.getVectorType(); 458dcec2ca5SChristian Sigg Type llvmType = typeConverter->convertType(vectorType); 4591c81adf3SAart Bik auto maskArrayAttr = shuffleOp.mask(); 4601c81adf3SAart Bik 4611c81adf3SAart Bik // Bail if result type cannot be lowered. 4621c81adf3SAart Bik if (!llvmType) 4633145427dSRiver Riddle return failure(); 4641c81adf3SAart Bik 4651c81adf3SAart Bik // Get rank and dimension sizes. 4661c81adf3SAart Bik int64_t rank = vectorType.getRank(); 4671c81adf3SAart Bik assert(v1Type.getRank() == rank); 4681c81adf3SAart Bik assert(v2Type.getRank() == rank); 4691c81adf3SAart Bik int64_t v1Dim = v1Type.getDimSize(0); 4701c81adf3SAart Bik 4711c81adf3SAart Bik // For rank 1, where both operands have *exactly* the same vector type, 4721c81adf3SAart Bik // there is direct shuffle support in LLVM. Use it! 4731c81adf3SAart Bik if (rank == 1 && v1Type == v2Type) { 474563879b6SRahul Joshi Value llvmShuffleOp = rewriter.create<LLVM::ShuffleVectorOp>( 4751c81adf3SAart Bik loc, adaptor.v1(), adaptor.v2(), maskArrayAttr); 476563879b6SRahul Joshi rewriter.replaceOp(shuffleOp, llvmShuffleOp); 4773145427dSRiver Riddle return success(); 478b36aaeafSAart Bik } 479b36aaeafSAart Bik 4801c81adf3SAart Bik // For all other cases, insert the individual values individually. 4815a8a159bSMehdi Amini Type eltType; 4825a8a159bSMehdi Amini if (auto arrayType = llvmType.dyn_cast<LLVM::LLVMArrayType>()) 4835a8a159bSMehdi Amini eltType = arrayType.getElementType(); 4845a8a159bSMehdi Amini else 4855a8a159bSMehdi Amini eltType = llvmType.cast<VectorType>().getElementType(); 486e62a6956SRiver Riddle Value insert = rewriter.create<LLVM::UndefOp>(loc, llvmType); 4871c81adf3SAart Bik int64_t insPos = 0; 4881c81adf3SAart Bik for (auto en : llvm::enumerate(maskArrayAttr)) { 4891c81adf3SAart Bik int64_t extPos = en.value().cast<IntegerAttr>().getInt(); 490e62a6956SRiver Riddle Value value = adaptor.v1(); 4911c81adf3SAart Bik if (extPos >= v1Dim) { 4921c81adf3SAart Bik extPos -= v1Dim; 4931c81adf3SAart Bik value = adaptor.v2(); 494b36aaeafSAart Bik } 495dcec2ca5SChristian Sigg Value extract = extractOne(rewriter, *getTypeConverter(), loc, value, 4965a8a159bSMehdi Amini eltType, rank, extPos); 497dcec2ca5SChristian Sigg insert = insertOne(rewriter, *getTypeConverter(), loc, insert, extract, 4980f04384dSAlex Zinenko llvmType, rank, insPos++); 4991c81adf3SAart Bik } 500563879b6SRahul Joshi rewriter.replaceOp(shuffleOp, insert); 5013145427dSRiver Riddle return success(); 502b36aaeafSAart Bik } 503b36aaeafSAart Bik }; 504b36aaeafSAart Bik 505563879b6SRahul Joshi class VectorExtractElementOpConversion 506563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ExtractElementOp> { 507cd5dab8aSAart Bik public: 508563879b6SRahul Joshi using ConvertOpToLLVMPattern< 509563879b6SRahul Joshi vector::ExtractElementOp>::ConvertOpToLLVMPattern; 510cd5dab8aSAart Bik 5113145427dSRiver Riddle LogicalResult 512ef976337SRiver Riddle matchAndRewrite(vector::ExtractElementOp extractEltOp, OpAdaptor adaptor, 513cd5dab8aSAart Bik ConversionPatternRewriter &rewriter) const override { 514cd5dab8aSAart Bik auto vectorType = extractEltOp.getVectorType(); 515dcec2ca5SChristian Sigg auto llvmType = typeConverter->convertType(vectorType.getElementType()); 516cd5dab8aSAart Bik 517cd5dab8aSAart Bik // Bail if result type cannot be lowered. 518cd5dab8aSAart Bik if (!llvmType) 5193145427dSRiver Riddle return failure(); 520cd5dab8aSAart Bik 521e7026abaSNicolas Vasilache if (vectorType.getRank() == 0) { 522e7026abaSNicolas Vasilache Location loc = extractEltOp.getLoc(); 523e7026abaSNicolas Vasilache auto idxType = rewriter.getIndexType(); 524e7026abaSNicolas Vasilache auto zero = rewriter.create<LLVM::ConstantOp>( 525e7026abaSNicolas Vasilache loc, typeConverter->convertType(idxType), 526e7026abaSNicolas Vasilache rewriter.getIntegerAttr(idxType, 0)); 527e7026abaSNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>( 528e7026abaSNicolas Vasilache extractEltOp, llvmType, adaptor.vector(), zero); 529e7026abaSNicolas Vasilache return success(); 530e7026abaSNicolas Vasilache } 531e7026abaSNicolas Vasilache 532cd5dab8aSAart Bik rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>( 533563879b6SRahul Joshi extractEltOp, llvmType, adaptor.vector(), adaptor.position()); 5343145427dSRiver Riddle return success(); 535cd5dab8aSAart Bik } 536cd5dab8aSAart Bik }; 537cd5dab8aSAart Bik 538563879b6SRahul Joshi class VectorExtractOpConversion 539563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::ExtractOp> { 5405c0c51a9SNicolas Vasilache public: 541563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::ExtractOp>::ConvertOpToLLVMPattern; 5425c0c51a9SNicolas Vasilache 5433145427dSRiver Riddle LogicalResult 544ef976337SRiver Riddle matchAndRewrite(vector::ExtractOp extractOp, OpAdaptor adaptor, 5455c0c51a9SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 546563879b6SRahul Joshi auto loc = extractOp->getLoc(); 5479826fe5cSAart Bik auto vectorType = extractOp.getVectorType(); 5482bdf33ccSRiver Riddle auto resultType = extractOp.getResult().getType(); 549dcec2ca5SChristian Sigg auto llvmResultType = typeConverter->convertType(resultType); 5505c0c51a9SNicolas Vasilache auto positionArrayAttr = extractOp.position(); 5519826fe5cSAart Bik 5529826fe5cSAart Bik // Bail if result type cannot be lowered. 5539826fe5cSAart Bik if (!llvmResultType) 5543145427dSRiver Riddle return failure(); 5559826fe5cSAart Bik 556864adf39SMatthias Springer // Extract entire vector. Should be handled by folder, but just to be safe. 557864adf39SMatthias Springer if (positionArrayAttr.empty()) { 558864adf39SMatthias Springer rewriter.replaceOp(extractOp, adaptor.vector()); 559864adf39SMatthias Springer return success(); 560864adf39SMatthias Springer } 561864adf39SMatthias Springer 5625c0c51a9SNicolas Vasilache // One-shot extraction of vector from array (only requires extractvalue). 5635c0c51a9SNicolas Vasilache if (resultType.isa<VectorType>()) { 564e62a6956SRiver Riddle Value extracted = rewriter.create<LLVM::ExtractValueOp>( 5655c0c51a9SNicolas Vasilache loc, llvmResultType, adaptor.vector(), positionArrayAttr); 566563879b6SRahul Joshi rewriter.replaceOp(extractOp, extracted); 5673145427dSRiver Riddle return success(); 5685c0c51a9SNicolas Vasilache } 5695c0c51a9SNicolas Vasilache 5709826fe5cSAart Bik // Potential extraction of 1-D vector from array. 571563879b6SRahul Joshi auto *context = extractOp->getContext(); 572e62a6956SRiver Riddle Value extracted = adaptor.vector(); 5735c0c51a9SNicolas Vasilache auto positionAttrs = positionArrayAttr.getValue(); 5745c0c51a9SNicolas Vasilache if (positionAttrs.size() > 1) { 5759826fe5cSAart Bik auto oneDVectorType = reducedVectorTypeBack(vectorType); 5765c0c51a9SNicolas Vasilache auto nMinusOnePositionAttrs = 577c2c83e97STres Popp ArrayAttr::get(context, positionAttrs.drop_back()); 5785c0c51a9SNicolas Vasilache extracted = rewriter.create<LLVM::ExtractValueOp>( 579dcec2ca5SChristian Sigg loc, typeConverter->convertType(oneDVectorType), extracted, 5805c0c51a9SNicolas Vasilache nMinusOnePositionAttrs); 5815c0c51a9SNicolas Vasilache } 5825c0c51a9SNicolas Vasilache 5835c0c51a9SNicolas Vasilache // Remaining extraction of element from 1-D LLVM vector 5845c0c51a9SNicolas Vasilache auto position = positionAttrs.back().cast<IntegerAttr>(); 5852230bf99SAlex Zinenko auto i64Type = IntegerType::get(rewriter.getContext(), 64); 5861d47564aSAart Bik auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position); 5875c0c51a9SNicolas Vasilache extracted = 5885c0c51a9SNicolas Vasilache rewriter.create<LLVM::ExtractElementOp>(loc, extracted, constant); 589563879b6SRahul Joshi rewriter.replaceOp(extractOp, extracted); 5905c0c51a9SNicolas Vasilache 5913145427dSRiver Riddle return success(); 5925c0c51a9SNicolas Vasilache } 5935c0c51a9SNicolas Vasilache }; 5945c0c51a9SNicolas Vasilache 595681f929fSNicolas Vasilache /// Conversion pattern that turns a vector.fma on a 1-D vector 596681f929fSNicolas Vasilache /// into an llvm.intr.fmuladd. This is a trivial 1-1 conversion. 597681f929fSNicolas Vasilache /// This does not match vectors of n >= 2 rank. 598681f929fSNicolas Vasilache /// 599681f929fSNicolas Vasilache /// Example: 600681f929fSNicolas Vasilache /// ``` 601681f929fSNicolas Vasilache /// vector.fma %a, %a, %a : vector<8xf32> 602681f929fSNicolas Vasilache /// ``` 603681f929fSNicolas Vasilache /// is converted to: 604681f929fSNicolas Vasilache /// ``` 6053bffe602SBenjamin Kramer /// llvm.intr.fmuladd %va, %va, %va: 606dd5165a9SAlex Zinenko /// (!llvm."<8 x f32>">, !llvm<"<8 x f32>">, !llvm<"<8 x f32>">) 607dd5165a9SAlex Zinenko /// -> !llvm."<8 x f32>"> 608681f929fSNicolas Vasilache /// ``` 609563879b6SRahul Joshi class VectorFMAOp1DConversion : public ConvertOpToLLVMPattern<vector::FMAOp> { 610681f929fSNicolas Vasilache public: 611563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::FMAOp>::ConvertOpToLLVMPattern; 612681f929fSNicolas Vasilache 6133145427dSRiver Riddle LogicalResult 614ef976337SRiver Riddle matchAndRewrite(vector::FMAOp fmaOp, OpAdaptor adaptor, 615681f929fSNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 616681f929fSNicolas Vasilache VectorType vType = fmaOp.getVectorType(); 617681f929fSNicolas Vasilache if (vType.getRank() != 1) 6183145427dSRiver Riddle return failure(); 619563879b6SRahul Joshi rewriter.replaceOpWithNewOp<LLVM::FMulAddOp>(fmaOp, adaptor.lhs(), 6203bffe602SBenjamin Kramer adaptor.rhs(), adaptor.acc()); 6213145427dSRiver Riddle return success(); 622681f929fSNicolas Vasilache } 623681f929fSNicolas Vasilache }; 624681f929fSNicolas Vasilache 625563879b6SRahul Joshi class VectorInsertElementOpConversion 626563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::InsertElementOp> { 627cd5dab8aSAart Bik public: 628563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::InsertElementOp>::ConvertOpToLLVMPattern; 629cd5dab8aSAart Bik 6303145427dSRiver Riddle LogicalResult 631ef976337SRiver Riddle matchAndRewrite(vector::InsertElementOp insertEltOp, OpAdaptor adaptor, 632cd5dab8aSAart Bik ConversionPatternRewriter &rewriter) const override { 633cd5dab8aSAart Bik auto vectorType = insertEltOp.getDestVectorType(); 634dcec2ca5SChristian Sigg auto llvmType = typeConverter->convertType(vectorType); 635cd5dab8aSAart Bik 636cd5dab8aSAart Bik // Bail if result type cannot be lowered. 637cd5dab8aSAart Bik if (!llvmType) 6383145427dSRiver Riddle return failure(); 639cd5dab8aSAart Bik 6403ff4e5f2SNicolas Vasilache if (vectorType.getRank() == 0) { 6413ff4e5f2SNicolas Vasilache Location loc = insertEltOp.getLoc(); 6423ff4e5f2SNicolas Vasilache auto idxType = rewriter.getIndexType(); 6433ff4e5f2SNicolas Vasilache auto zero = rewriter.create<LLVM::ConstantOp>( 6443ff4e5f2SNicolas Vasilache loc, typeConverter->convertType(idxType), 6453ff4e5f2SNicolas Vasilache rewriter.getIntegerAttr(idxType, 0)); 6463ff4e5f2SNicolas Vasilache rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>( 6473ff4e5f2SNicolas Vasilache insertEltOp, llvmType, adaptor.dest(), adaptor.source(), zero); 6483ff4e5f2SNicolas Vasilache return success(); 6493ff4e5f2SNicolas Vasilache } 6503ff4e5f2SNicolas Vasilache 651cd5dab8aSAart Bik rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>( 652563879b6SRahul Joshi insertEltOp, llvmType, adaptor.dest(), adaptor.source(), 653563879b6SRahul Joshi adaptor.position()); 6543145427dSRiver Riddle return success(); 655cd5dab8aSAart Bik } 656cd5dab8aSAart Bik }; 657cd5dab8aSAart Bik 658563879b6SRahul Joshi class VectorInsertOpConversion 659563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::InsertOp> { 6609826fe5cSAart Bik public: 661563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::InsertOp>::ConvertOpToLLVMPattern; 6629826fe5cSAart Bik 6633145427dSRiver Riddle LogicalResult 664ef976337SRiver Riddle matchAndRewrite(vector::InsertOp insertOp, OpAdaptor adaptor, 6659826fe5cSAart Bik ConversionPatternRewriter &rewriter) const override { 666563879b6SRahul Joshi auto loc = insertOp->getLoc(); 6679826fe5cSAart Bik auto sourceType = insertOp.getSourceType(); 6689826fe5cSAart Bik auto destVectorType = insertOp.getDestVectorType(); 669dcec2ca5SChristian Sigg auto llvmResultType = typeConverter->convertType(destVectorType); 6709826fe5cSAart Bik auto positionArrayAttr = insertOp.position(); 6719826fe5cSAart Bik 6729826fe5cSAart Bik // Bail if result type cannot be lowered. 6739826fe5cSAart Bik if (!llvmResultType) 6743145427dSRiver Riddle return failure(); 6759826fe5cSAart Bik 676864adf39SMatthias Springer // Overwrite entire vector with value. Should be handled by folder, but 677864adf39SMatthias Springer // just to be safe. 678864adf39SMatthias Springer if (positionArrayAttr.empty()) { 679864adf39SMatthias Springer rewriter.replaceOp(insertOp, adaptor.source()); 680864adf39SMatthias Springer return success(); 681864adf39SMatthias Springer } 682864adf39SMatthias Springer 6839826fe5cSAart Bik // One-shot insertion of a vector into an array (only requires insertvalue). 6849826fe5cSAart Bik if (sourceType.isa<VectorType>()) { 685e62a6956SRiver Riddle Value inserted = rewriter.create<LLVM::InsertValueOp>( 6869826fe5cSAart Bik loc, llvmResultType, adaptor.dest(), adaptor.source(), 6879826fe5cSAart Bik positionArrayAttr); 688563879b6SRahul Joshi rewriter.replaceOp(insertOp, inserted); 6893145427dSRiver Riddle return success(); 6909826fe5cSAart Bik } 6919826fe5cSAart Bik 6929826fe5cSAart Bik // Potential extraction of 1-D vector from array. 693563879b6SRahul Joshi auto *context = insertOp->getContext(); 694e62a6956SRiver Riddle Value extracted = adaptor.dest(); 6959826fe5cSAart Bik auto positionAttrs = positionArrayAttr.getValue(); 6969826fe5cSAart Bik auto position = positionAttrs.back().cast<IntegerAttr>(); 6979826fe5cSAart Bik auto oneDVectorType = destVectorType; 6989826fe5cSAart Bik if (positionAttrs.size() > 1) { 6999826fe5cSAart Bik oneDVectorType = reducedVectorTypeBack(destVectorType); 7009826fe5cSAart Bik auto nMinusOnePositionAttrs = 701c2c83e97STres Popp ArrayAttr::get(context, positionAttrs.drop_back()); 7029826fe5cSAart Bik extracted = rewriter.create<LLVM::ExtractValueOp>( 703dcec2ca5SChristian Sigg loc, typeConverter->convertType(oneDVectorType), extracted, 7049826fe5cSAart Bik nMinusOnePositionAttrs); 7059826fe5cSAart Bik } 7069826fe5cSAart Bik 7079826fe5cSAart Bik // Insertion of an element into a 1-D LLVM vector. 7082230bf99SAlex Zinenko auto i64Type = IntegerType::get(rewriter.getContext(), 64); 7091d47564aSAart Bik auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position); 710e62a6956SRiver Riddle Value inserted = rewriter.create<LLVM::InsertElementOp>( 711dcec2ca5SChristian Sigg loc, typeConverter->convertType(oneDVectorType), extracted, 7120f04384dSAlex Zinenko adaptor.source(), constant); 7139826fe5cSAart Bik 7149826fe5cSAart Bik // Potential insertion of resulting 1-D vector into array. 7159826fe5cSAart Bik if (positionAttrs.size() > 1) { 7169826fe5cSAart Bik auto nMinusOnePositionAttrs = 717c2c83e97STres Popp ArrayAttr::get(context, positionAttrs.drop_back()); 7189826fe5cSAart Bik inserted = rewriter.create<LLVM::InsertValueOp>(loc, llvmResultType, 7199826fe5cSAart Bik adaptor.dest(), inserted, 7209826fe5cSAart Bik nMinusOnePositionAttrs); 7219826fe5cSAart Bik } 7229826fe5cSAart Bik 723563879b6SRahul Joshi rewriter.replaceOp(insertOp, inserted); 7243145427dSRiver Riddle return success(); 7259826fe5cSAart Bik } 7269826fe5cSAart Bik }; 7279826fe5cSAart Bik 728681f929fSNicolas Vasilache /// Rank reducing rewrite for n-D FMA into (n-1)-D FMA where n > 1. 729681f929fSNicolas Vasilache /// 730681f929fSNicolas Vasilache /// Example: 731681f929fSNicolas Vasilache /// ``` 732681f929fSNicolas Vasilache /// %d = vector.fma %a, %b, %c : vector<2x4xf32> 733681f929fSNicolas Vasilache /// ``` 734681f929fSNicolas Vasilache /// is rewritten into: 735681f929fSNicolas Vasilache /// ``` 736681f929fSNicolas Vasilache /// %r = splat %f0: vector<2x4xf32> 737681f929fSNicolas Vasilache /// %va = vector.extractvalue %a[0] : vector<2x4xf32> 738681f929fSNicolas Vasilache /// %vb = vector.extractvalue %b[0] : vector<2x4xf32> 739681f929fSNicolas Vasilache /// %vc = vector.extractvalue %c[0] : vector<2x4xf32> 740681f929fSNicolas Vasilache /// %vd = vector.fma %va, %vb, %vc : vector<4xf32> 741681f929fSNicolas Vasilache /// %r2 = vector.insertvalue %vd, %r[0] : vector<4xf32> into vector<2x4xf32> 742681f929fSNicolas Vasilache /// %va2 = vector.extractvalue %a2[1] : vector<2x4xf32> 743681f929fSNicolas Vasilache /// %vb2 = vector.extractvalue %b2[1] : vector<2x4xf32> 744681f929fSNicolas Vasilache /// %vc2 = vector.extractvalue %c2[1] : vector<2x4xf32> 745681f929fSNicolas Vasilache /// %vd2 = vector.fma %va2, %vb2, %vc2 : vector<4xf32> 746681f929fSNicolas Vasilache /// %r3 = vector.insertvalue %vd2, %r2[1] : vector<4xf32> into vector<2x4xf32> 747681f929fSNicolas Vasilache /// // %r3 holds the final value. 748681f929fSNicolas Vasilache /// ``` 749681f929fSNicolas Vasilache class VectorFMAOpNDRewritePattern : public OpRewritePattern<FMAOp> { 750681f929fSNicolas Vasilache public: 751681f929fSNicolas Vasilache using OpRewritePattern<FMAOp>::OpRewritePattern; 752681f929fSNicolas Vasilache 753ee80ffbfSNicolas Vasilache void initialize() { 754ee80ffbfSNicolas Vasilache // This pattern recursively unpacks one dimension at a time. The recursion 755ee80ffbfSNicolas Vasilache // bounded as the rank is strictly decreasing. 756ee80ffbfSNicolas Vasilache setHasBoundedRewriteRecursion(); 757ee80ffbfSNicolas Vasilache } 758ee80ffbfSNicolas Vasilache 7593145427dSRiver Riddle LogicalResult matchAndRewrite(FMAOp op, 760681f929fSNicolas Vasilache PatternRewriter &rewriter) const override { 761681f929fSNicolas Vasilache auto vType = op.getVectorType(); 762681f929fSNicolas Vasilache if (vType.getRank() < 2) 7633145427dSRiver Riddle return failure(); 764681f929fSNicolas Vasilache 765681f929fSNicolas Vasilache auto loc = op.getLoc(); 766681f929fSNicolas Vasilache auto elemType = vType.getElementType(); 767a54f4eaeSMogball Value zero = rewriter.create<arith::ConstantOp>( 768a54f4eaeSMogball loc, elemType, rewriter.getZeroAttr(elemType)); 769681f929fSNicolas Vasilache Value desc = rewriter.create<SplatOp>(loc, vType, zero); 770681f929fSNicolas Vasilache for (int64_t i = 0, e = vType.getShape().front(); i != e; ++i) { 771681f929fSNicolas Vasilache Value extrLHS = rewriter.create<ExtractOp>(loc, op.lhs(), i); 772681f929fSNicolas Vasilache Value extrRHS = rewriter.create<ExtractOp>(loc, op.rhs(), i); 773681f929fSNicolas Vasilache Value extrACC = rewriter.create<ExtractOp>(loc, op.acc(), i); 774681f929fSNicolas Vasilache Value fma = rewriter.create<FMAOp>(loc, extrLHS, extrRHS, extrACC); 775681f929fSNicolas Vasilache desc = rewriter.create<InsertOp>(loc, fma, desc, i); 776681f929fSNicolas Vasilache } 777681f929fSNicolas Vasilache rewriter.replaceOp(op, desc); 7783145427dSRiver Riddle return success(); 779681f929fSNicolas Vasilache } 780681f929fSNicolas Vasilache }; 781681f929fSNicolas Vasilache 78230e6033bSNicolas Vasilache /// Returns the strides if the memory underlying `memRefType` has a contiguous 78330e6033bSNicolas Vasilache /// static layout. 78430e6033bSNicolas Vasilache static llvm::Optional<SmallVector<int64_t, 4>> 78530e6033bSNicolas Vasilache computeContiguousStrides(MemRefType memRefType) { 7862bf491c7SBenjamin Kramer int64_t offset; 78730e6033bSNicolas Vasilache SmallVector<int64_t, 4> strides; 78830e6033bSNicolas Vasilache if (failed(getStridesAndOffset(memRefType, strides, offset))) 78930e6033bSNicolas Vasilache return None; 79030e6033bSNicolas Vasilache if (!strides.empty() && strides.back() != 1) 79130e6033bSNicolas Vasilache return None; 79230e6033bSNicolas Vasilache // If no layout or identity layout, this is contiguous by definition. 793e41ebbecSVladislav Vinogradov if (memRefType.getLayout().isIdentity()) 79430e6033bSNicolas Vasilache return strides; 79530e6033bSNicolas Vasilache 79630e6033bSNicolas Vasilache // Otherwise, we must determine contiguity form shapes. This can only ever 79730e6033bSNicolas Vasilache // work in static cases because MemRefType is underspecified to represent 79830e6033bSNicolas Vasilache // contiguous dynamic shapes in other ways than with just empty/identity 79930e6033bSNicolas Vasilache // layout. 8002bf491c7SBenjamin Kramer auto sizes = memRefType.getShape(); 8015017b0f8SMatthias Springer for (int index = 0, e = strides.size() - 1; index < e; ++index) { 80230e6033bSNicolas Vasilache if (ShapedType::isDynamic(sizes[index + 1]) || 80330e6033bSNicolas Vasilache ShapedType::isDynamicStrideOrOffset(strides[index]) || 80430e6033bSNicolas Vasilache ShapedType::isDynamicStrideOrOffset(strides[index + 1])) 80530e6033bSNicolas Vasilache return None; 80630e6033bSNicolas Vasilache if (strides[index] != strides[index + 1] * sizes[index + 1]) 80730e6033bSNicolas Vasilache return None; 8082bf491c7SBenjamin Kramer } 80930e6033bSNicolas Vasilache return strides; 8102bf491c7SBenjamin Kramer } 8112bf491c7SBenjamin Kramer 812563879b6SRahul Joshi class VectorTypeCastOpConversion 813563879b6SRahul Joshi : public ConvertOpToLLVMPattern<vector::TypeCastOp> { 8145c0c51a9SNicolas Vasilache public: 815563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::TypeCastOp>::ConvertOpToLLVMPattern; 8165c0c51a9SNicolas Vasilache 8173145427dSRiver Riddle LogicalResult 818ef976337SRiver Riddle matchAndRewrite(vector::TypeCastOp castOp, OpAdaptor adaptor, 8195c0c51a9SNicolas Vasilache ConversionPatternRewriter &rewriter) const override { 820563879b6SRahul Joshi auto loc = castOp->getLoc(); 8215c0c51a9SNicolas Vasilache MemRefType sourceMemRefType = 8222bdf33ccSRiver Riddle castOp.getOperand().getType().cast<MemRefType>(); 8239eb3e564SChris Lattner MemRefType targetMemRefType = castOp.getType(); 8245c0c51a9SNicolas Vasilache 8255c0c51a9SNicolas Vasilache // Only static shape casts supported atm. 8265c0c51a9SNicolas Vasilache if (!sourceMemRefType.hasStaticShape() || 8275c0c51a9SNicolas Vasilache !targetMemRefType.hasStaticShape()) 8283145427dSRiver Riddle return failure(); 8295c0c51a9SNicolas Vasilache 8305c0c51a9SNicolas Vasilache auto llvmSourceDescriptorTy = 831ef976337SRiver Riddle adaptor.getOperands()[0].getType().dyn_cast<LLVM::LLVMStructType>(); 8328de43b92SAlex Zinenko if (!llvmSourceDescriptorTy) 8333145427dSRiver Riddle return failure(); 834ef976337SRiver Riddle MemRefDescriptor sourceMemRef(adaptor.getOperands()[0]); 8355c0c51a9SNicolas Vasilache 836dcec2ca5SChristian Sigg auto llvmTargetDescriptorTy = typeConverter->convertType(targetMemRefType) 8378de43b92SAlex Zinenko .dyn_cast_or_null<LLVM::LLVMStructType>(); 8388de43b92SAlex Zinenko if (!llvmTargetDescriptorTy) 8393145427dSRiver Riddle return failure(); 8405c0c51a9SNicolas Vasilache 84130e6033bSNicolas Vasilache // Only contiguous source buffers supported atm. 84230e6033bSNicolas Vasilache auto sourceStrides = computeContiguousStrides(sourceMemRefType); 84330e6033bSNicolas Vasilache if (!sourceStrides) 84430e6033bSNicolas Vasilache return failure(); 84530e6033bSNicolas Vasilache auto targetStrides = computeContiguousStrides(targetMemRefType); 84630e6033bSNicolas Vasilache if (!targetStrides) 84730e6033bSNicolas Vasilache return failure(); 84830e6033bSNicolas Vasilache // Only support static strides for now, regardless of contiguity. 84930e6033bSNicolas Vasilache if (llvm::any_of(*targetStrides, [](int64_t stride) { 85030e6033bSNicolas Vasilache return ShapedType::isDynamicStrideOrOffset(stride); 85130e6033bSNicolas Vasilache })) 8523145427dSRiver Riddle return failure(); 8535c0c51a9SNicolas Vasilache 8542230bf99SAlex Zinenko auto int64Ty = IntegerType::get(rewriter.getContext(), 64); 8555c0c51a9SNicolas Vasilache 8565c0c51a9SNicolas Vasilache // Create descriptor. 8575c0c51a9SNicolas Vasilache auto desc = MemRefDescriptor::undef(rewriter, loc, llvmTargetDescriptorTy); 8583a577f54SChristian Sigg Type llvmTargetElementTy = desc.getElementPtrType(); 8595c0c51a9SNicolas Vasilache // Set allocated ptr. 860e62a6956SRiver Riddle Value allocated = sourceMemRef.allocatedPtr(rewriter, loc); 8615c0c51a9SNicolas Vasilache allocated = 8625c0c51a9SNicolas Vasilache rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, allocated); 8635c0c51a9SNicolas Vasilache desc.setAllocatedPtr(rewriter, loc, allocated); 8645c0c51a9SNicolas Vasilache // Set aligned ptr. 865e62a6956SRiver Riddle Value ptr = sourceMemRef.alignedPtr(rewriter, loc); 8665c0c51a9SNicolas Vasilache ptr = rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, ptr); 8675c0c51a9SNicolas Vasilache desc.setAlignedPtr(rewriter, loc, ptr); 8685c0c51a9SNicolas Vasilache // Fill offset 0. 8695c0c51a9SNicolas Vasilache auto attr = rewriter.getIntegerAttr(rewriter.getIndexType(), 0); 8705c0c51a9SNicolas Vasilache auto zero = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, attr); 8715c0c51a9SNicolas Vasilache desc.setOffset(rewriter, loc, zero); 8725c0c51a9SNicolas Vasilache 8735c0c51a9SNicolas Vasilache // Fill size and stride descriptors in memref. 8745c0c51a9SNicolas Vasilache for (auto indexedSize : llvm::enumerate(targetMemRefType.getShape())) { 8755c0c51a9SNicolas Vasilache int64_t index = indexedSize.index(); 8765c0c51a9SNicolas Vasilache auto sizeAttr = 8775c0c51a9SNicolas Vasilache rewriter.getIntegerAttr(rewriter.getIndexType(), indexedSize.value()); 8785c0c51a9SNicolas Vasilache auto size = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, sizeAttr); 8795c0c51a9SNicolas Vasilache desc.setSize(rewriter, loc, index, size); 88030e6033bSNicolas Vasilache auto strideAttr = rewriter.getIntegerAttr(rewriter.getIndexType(), 88130e6033bSNicolas Vasilache (*targetStrides)[index]); 8825c0c51a9SNicolas Vasilache auto stride = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, strideAttr); 8835c0c51a9SNicolas Vasilache desc.setStride(rewriter, loc, index, stride); 8845c0c51a9SNicolas Vasilache } 8855c0c51a9SNicolas Vasilache 886563879b6SRahul Joshi rewriter.replaceOp(castOp, {desc}); 8873145427dSRiver Riddle return success(); 8885c0c51a9SNicolas Vasilache } 8895c0c51a9SNicolas Vasilache }; 8905c0c51a9SNicolas Vasilache 891563879b6SRahul Joshi class VectorPrintOpConversion : public ConvertOpToLLVMPattern<vector::PrintOp> { 892d9b500d3SAart Bik public: 893563879b6SRahul Joshi using ConvertOpToLLVMPattern<vector::PrintOp>::ConvertOpToLLVMPattern; 894d9b500d3SAart Bik 895d9b500d3SAart Bik // Proof-of-concept lowering implementation that relies on a small 896d9b500d3SAart Bik // runtime support library, which only needs to provide a few 897d9b500d3SAart Bik // printing methods (single value for all data types, opening/closing 898d9b500d3SAart Bik // bracket, comma, newline). The lowering fully unrolls a vector 899d9b500d3SAart Bik // in terms of these elementary printing operations. The advantage 900d9b500d3SAart Bik // of this approach is that the library can remain unaware of all 901d9b500d3SAart Bik // low-level implementation details of vectors while still supporting 902d9b500d3SAart Bik // output of any shaped and dimensioned vector. Due to full unrolling, 903d9b500d3SAart Bik // this approach is less suited for very large vectors though. 904d9b500d3SAart Bik // 9059db53a18SRiver Riddle // TODO: rely solely on libc in future? something else? 906d9b500d3SAart Bik // 9073145427dSRiver Riddle LogicalResult 908ef976337SRiver Riddle matchAndRewrite(vector::PrintOp printOp, OpAdaptor adaptor, 909d9b500d3SAart Bik ConversionPatternRewriter &rewriter) const override { 910d9b500d3SAart Bik Type printType = printOp.getPrintType(); 911d9b500d3SAart Bik 912dcec2ca5SChristian Sigg if (typeConverter->convertType(printType) == nullptr) 9133145427dSRiver Riddle return failure(); 914d9b500d3SAart Bik 915b8880f5fSAart Bik // Make sure element type has runtime support. 916b8880f5fSAart Bik PrintConversion conversion = PrintConversion::None; 917d9b500d3SAart Bik VectorType vectorType = printType.dyn_cast<VectorType>(); 918d9b500d3SAart Bik Type eltType = vectorType ? vectorType.getElementType() : printType; 919d9b500d3SAart Bik Operation *printer; 920b8880f5fSAart Bik if (eltType.isF32()) { 921e332c22cSNicolas Vasilache printer = 922e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintF32Fn(printOp->getParentOfType<ModuleOp>()); 923b8880f5fSAart Bik } else if (eltType.isF64()) { 924e332c22cSNicolas Vasilache printer = 925e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintF64Fn(printOp->getParentOfType<ModuleOp>()); 92654759cefSAart Bik } else if (eltType.isIndex()) { 927e332c22cSNicolas Vasilache printer = 928e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintU64Fn(printOp->getParentOfType<ModuleOp>()); 929b8880f5fSAart Bik } else if (auto intTy = eltType.dyn_cast<IntegerType>()) { 930b8880f5fSAart Bik // Integers need a zero or sign extension on the operand 931b8880f5fSAart Bik // (depending on the source type) as well as a signed or 932b8880f5fSAart Bik // unsigned print method. Up to 64-bit is supported. 933b8880f5fSAart Bik unsigned width = intTy.getWidth(); 934b8880f5fSAart Bik if (intTy.isUnsigned()) { 93554759cefSAart Bik if (width <= 64) { 936b8880f5fSAart Bik if (width < 64) 937b8880f5fSAart Bik conversion = PrintConversion::ZeroExt64; 938e332c22cSNicolas Vasilache printer = LLVM::lookupOrCreatePrintU64Fn( 939e332c22cSNicolas Vasilache printOp->getParentOfType<ModuleOp>()); 940b8880f5fSAart Bik } else { 9413145427dSRiver Riddle return failure(); 942b8880f5fSAart Bik } 943b8880f5fSAart Bik } else { 944b8880f5fSAart Bik assert(intTy.isSignless() || intTy.isSigned()); 94554759cefSAart Bik if (width <= 64) { 946b8880f5fSAart Bik // Note that we *always* zero extend booleans (1-bit integers), 947b8880f5fSAart Bik // so that true/false is printed as 1/0 rather than -1/0. 948b8880f5fSAart Bik if (width == 1) 94954759cefSAart Bik conversion = PrintConversion::ZeroExt64; 95054759cefSAart Bik else if (width < 64) 951b8880f5fSAart Bik conversion = PrintConversion::SignExt64; 952e332c22cSNicolas Vasilache printer = LLVM::lookupOrCreatePrintI64Fn( 953e332c22cSNicolas Vasilache printOp->getParentOfType<ModuleOp>()); 954b8880f5fSAart Bik } else { 955b8880f5fSAart Bik return failure(); 956b8880f5fSAart Bik } 957b8880f5fSAart Bik } 958b8880f5fSAart Bik } else { 959b8880f5fSAart Bik return failure(); 960b8880f5fSAart Bik } 961d9b500d3SAart Bik 962d9b500d3SAart Bik // Unroll vector into elementary print calls. 963b8880f5fSAart Bik int64_t rank = vectorType ? vectorType.getRank() : 0; 964cc311a15SMichal Terepeta Type type = vectorType ? vectorType : eltType; 965cc311a15SMichal Terepeta emitRanks(rewriter, printOp, adaptor.source(), type, printer, rank, 966b8880f5fSAart Bik conversion); 967e332c22cSNicolas Vasilache emitCall(rewriter, printOp->getLoc(), 968e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintNewlineFn( 969e332c22cSNicolas Vasilache printOp->getParentOfType<ModuleOp>())); 970563879b6SRahul Joshi rewriter.eraseOp(printOp); 9713145427dSRiver Riddle return success(); 972d9b500d3SAart Bik } 973d9b500d3SAart Bik 974d9b500d3SAart Bik private: 975b8880f5fSAart Bik enum class PrintConversion { 97630e6033bSNicolas Vasilache // clang-format off 977b8880f5fSAart Bik None, 978b8880f5fSAart Bik ZeroExt64, 979b8880f5fSAart Bik SignExt64 98030e6033bSNicolas Vasilache // clang-format on 981b8880f5fSAart Bik }; 982b8880f5fSAart Bik 983d9b500d3SAart Bik void emitRanks(ConversionPatternRewriter &rewriter, Operation *op, 984cc311a15SMichal Terepeta Value value, Type type, Operation *printer, int64_t rank, 985cc311a15SMichal Terepeta PrintConversion conversion) const { 986cc311a15SMichal Terepeta VectorType vectorType = type.dyn_cast<VectorType>(); 987d9b500d3SAart Bik Location loc = op->getLoc(); 988cc311a15SMichal Terepeta if (!vectorType) { 989cc311a15SMichal Terepeta assert(rank == 0 && "The scalar case expects rank == 0"); 990b8880f5fSAart Bik switch (conversion) { 991b8880f5fSAart Bik case PrintConversion::ZeroExt64: 992a54f4eaeSMogball value = rewriter.create<arith::ExtUIOp>( 9932230bf99SAlex Zinenko loc, value, IntegerType::get(rewriter.getContext(), 64)); 994b8880f5fSAart Bik break; 995b8880f5fSAart Bik case PrintConversion::SignExt64: 996a54f4eaeSMogball value = rewriter.create<arith::ExtSIOp>( 9972230bf99SAlex Zinenko loc, value, IntegerType::get(rewriter.getContext(), 64)); 998b8880f5fSAart Bik break; 999b8880f5fSAart Bik case PrintConversion::None: 1000b8880f5fSAart Bik break; 1001c9eeeb38Saartbik } 1002d9b500d3SAart Bik emitCall(rewriter, loc, printer, value); 1003d9b500d3SAart Bik return; 1004d9b500d3SAart Bik } 1005d9b500d3SAart Bik 1006e332c22cSNicolas Vasilache emitCall(rewriter, loc, 1007e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintOpenFn(op->getParentOfType<ModuleOp>())); 1008e332c22cSNicolas Vasilache Operation *printComma = 1009e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintCommaFn(op->getParentOfType<ModuleOp>()); 1010cc311a15SMichal Terepeta 1011cc311a15SMichal Terepeta if (rank <= 1) { 1012cc311a15SMichal Terepeta auto reducedType = vectorType.getElementType(); 1013cc311a15SMichal Terepeta auto llvmType = typeConverter->convertType(reducedType); 1014cc311a15SMichal Terepeta int64_t dim = rank == 0 ? 1 : vectorType.getDimSize(0); 1015cc311a15SMichal Terepeta for (int64_t d = 0; d < dim; ++d) { 1016cc311a15SMichal Terepeta Value nestedVal = extractOne(rewriter, *getTypeConverter(), loc, value, 1017cc311a15SMichal Terepeta llvmType, /*rank=*/0, /*pos=*/d); 1018cc311a15SMichal Terepeta emitRanks(rewriter, op, nestedVal, reducedType, printer, /*rank=*/0, 1019cc311a15SMichal Terepeta conversion); 1020cc311a15SMichal Terepeta if (d != dim - 1) 1021cc311a15SMichal Terepeta emitCall(rewriter, loc, printComma); 1022cc311a15SMichal Terepeta } 1023cc311a15SMichal Terepeta emitCall( 1024cc311a15SMichal Terepeta rewriter, loc, 1025cc311a15SMichal Terepeta LLVM::lookupOrCreatePrintCloseFn(op->getParentOfType<ModuleOp>())); 1026cc311a15SMichal Terepeta return; 1027cc311a15SMichal Terepeta } 1028cc311a15SMichal Terepeta 1029d9b500d3SAart Bik int64_t dim = vectorType.getDimSize(0); 1030d9b500d3SAart Bik for (int64_t d = 0; d < dim; ++d) { 1031cc311a15SMichal Terepeta auto reducedType = reducedVectorTypeFront(vectorType); 1032cc311a15SMichal Terepeta auto llvmType = typeConverter->convertType(reducedType); 1033dcec2ca5SChristian Sigg Value nestedVal = extractOne(rewriter, *getTypeConverter(), loc, value, 1034dcec2ca5SChristian Sigg llvmType, rank, d); 1035b8880f5fSAart Bik emitRanks(rewriter, op, nestedVal, reducedType, printer, rank - 1, 1036b8880f5fSAart Bik conversion); 1037d9b500d3SAart Bik if (d != dim - 1) 1038d9b500d3SAart Bik emitCall(rewriter, loc, printComma); 1039d9b500d3SAart Bik } 1040e332c22cSNicolas Vasilache emitCall(rewriter, loc, 1041e332c22cSNicolas Vasilache LLVM::lookupOrCreatePrintCloseFn(op->getParentOfType<ModuleOp>())); 1042d9b500d3SAart Bik } 1043d9b500d3SAart Bik 1044d9b500d3SAart Bik // Helper to emit a call. 1045d9b500d3SAart Bik static void emitCall(ConversionPatternRewriter &rewriter, Location loc, 1046d9b500d3SAart Bik Operation *ref, ValueRange params = ValueRange()) { 1047faf1c224SChris Lattner rewriter.create<LLVM::CallOp>(loc, TypeRange(), SymbolRefAttr::get(ref), 1048faf1c224SChris Lattner params); 1049d9b500d3SAart Bik } 1050d9b500d3SAart Bik }; 1051d9b500d3SAart Bik 1052df186507SBenjamin Kramer } // namespace 1053df186507SBenjamin Kramer 10545c0c51a9SNicolas Vasilache /// Populate the given list with patterns that convert from Vector to LLVM. 10555c0c51a9SNicolas Vasilache void mlir::populateVectorToLLVMConversionPatterns( 1056dc4e913bSChris Lattner LLVMTypeConverter &converter, RewritePatternSet &patterns, 105765a3f289SMatthias Springer bool reassociateFPReductions) { 105865678d93SNicolas Vasilache MLIRContext *ctx = converter.getDialect()->getContext(); 1059eda2ebd7SNicolas Vasilache patterns.add<VectorFMAOpNDRewritePattern>(ctx); 1060eda2ebd7SNicolas Vasilache populateVectorInsertExtractStridedSliceTransforms(patterns); 1061dc4e913bSChris Lattner patterns.add<VectorReductionOpConversion>(converter, reassociateFPReductions); 10628345b86dSNicolas Vasilache patterns 1063dc4e913bSChris Lattner .add<VectorBitCastOpConversion, VectorShuffleOpConversion, 1064dc4e913bSChris Lattner VectorExtractElementOpConversion, VectorExtractOpConversion, 1065dc4e913bSChris Lattner VectorFMAOp1DConversion, VectorInsertElementOpConversion, 1066dc4e913bSChris Lattner VectorInsertOpConversion, VectorPrintOpConversion, 106719dbb230Saartbik VectorTypeCastOpConversion, 1068dc4e913bSChris Lattner VectorLoadStoreConversion<vector::LoadOp, vector::LoadOpAdaptor>, 1069ee66e43aSDiego Caballero VectorLoadStoreConversion<vector::MaskedLoadOp, 1070ee66e43aSDiego Caballero vector::MaskedLoadOpAdaptor>, 1071dc4e913bSChris Lattner VectorLoadStoreConversion<vector::StoreOp, vector::StoreOpAdaptor>, 1072ee66e43aSDiego Caballero VectorLoadStoreConversion<vector::MaskedStoreOp, 1073ee66e43aSDiego Caballero vector::MaskedStoreOpAdaptor>, 1074dc4e913bSChris Lattner VectorGatherOpConversion, VectorScatterOpConversion, 1075d1a9e9a7SMatthias Springer VectorExpandLoadOpConversion, VectorCompressStoreOpConversion>( 1076d1a9e9a7SMatthias Springer converter); 1077d1a9e9a7SMatthias Springer // Transfer ops with rank > 1 are handled by VectorToSCF. 1078d1a9e9a7SMatthias Springer populateVectorTransferLoweringPatterns(patterns, /*maxTransferRank=*/1); 10795c0c51a9SNicolas Vasilache } 10805c0c51a9SNicolas Vasilache 108163b683a8SNicolas Vasilache void mlir::populateVectorToLLVMMatrixConversionPatterns( 1082dc4e913bSChris Lattner LLVMTypeConverter &converter, RewritePatternSet &patterns) { 1083dc4e913bSChris Lattner patterns.add<VectorMatmulOpConversion>(converter); 1084dc4e913bSChris Lattner patterns.add<VectorFlatTransposeOpConversion>(converter); 108563b683a8SNicolas Vasilache } 1086