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"
174d60f47bSRob Suderman #include "mlir/Dialect/Vector/VectorOps.h"
18*eda2ebd7SNicolas Vasilache #include "mlir/Dialect/Vector/VectorRewritePatterns.h"
1909f7a55fSRiver Riddle #include "mlir/IR/BuiltinTypes.h"
2029a50c58SStephen Neuendorffer #include "mlir/Support/MathExtras.h"
21929189a4SWilliam S. Moses #include "mlir/Target/LLVMIR/TypeToLLVM.h"
225c0c51a9SNicolas Vasilache #include "mlir/Transforms/DialectConversion.h"
235c0c51a9SNicolas Vasilache 
245c0c51a9SNicolas Vasilache using namespace mlir;
2565678d93SNicolas Vasilache using namespace mlir::vector;
265c0c51a9SNicolas Vasilache 
279826fe5cSAart Bik // Helper to reduce vector type by one rank at front.
289826fe5cSAart Bik static VectorType reducedVectorTypeFront(VectorType tp) {
299826fe5cSAart Bik   assert((tp.getRank() > 1) && "unlowerable vector type");
309826fe5cSAart Bik   return VectorType::get(tp.getShape().drop_front(), tp.getElementType());
319826fe5cSAart Bik }
329826fe5cSAart Bik 
339826fe5cSAart Bik // Helper to reduce vector type by *all* but one rank at back.
349826fe5cSAart Bik static VectorType reducedVectorTypeBack(VectorType tp) {
359826fe5cSAart Bik   assert((tp.getRank() > 1) && "unlowerable vector type");
369826fe5cSAart Bik   return VectorType::get(tp.getShape().take_back(), tp.getElementType());
379826fe5cSAart Bik }
389826fe5cSAart Bik 
391c81adf3SAart Bik // Helper that picks the proper sequence for inserting.
40e62a6956SRiver Riddle static Value insertOne(ConversionPatternRewriter &rewriter,
410f04384dSAlex Zinenko                        LLVMTypeConverter &typeConverter, Location loc,
420f04384dSAlex Zinenko                        Value val1, Value val2, Type llvmType, int64_t rank,
430f04384dSAlex Zinenko                        int64_t pos) {
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) {
601c81adf3SAart Bik   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 
8729a50c58SStephen Neuendorffer // Return the minimal alignment value that satisfies all the AssumeAlignment
8829a50c58SStephen Neuendorffer // uses of `value`. If no such uses exist, return 1.
8929a50c58SStephen Neuendorffer static unsigned getAssumedAlignment(Value value) {
9029a50c58SStephen Neuendorffer   unsigned align = 1;
9129a50c58SStephen Neuendorffer   for (auto &u : value.getUses()) {
9229a50c58SStephen Neuendorffer     Operation *owner = u.getOwner();
9329a50c58SStephen Neuendorffer     if (auto op = dyn_cast<memref::AssumeAlignmentOp>(owner))
9429a50c58SStephen Neuendorffer       align = mlir::lcm(align, op.alignment());
9529a50c58SStephen Neuendorffer   }
9629a50c58SStephen Neuendorffer   return align;
9729a50c58SStephen Neuendorffer }
9829a50c58SStephen Neuendorffer 
9929a50c58SStephen Neuendorffer // Helper that returns data layout alignment of a memref associated with a
10029a50c58SStephen Neuendorffer // load, store, scatter, or gather op, including additional information from
10129a50c58SStephen Neuendorffer // assume_alignment calls on the source of the transfer
10229a50c58SStephen Neuendorffer template <class OpAdaptor>
10329a50c58SStephen Neuendorffer LogicalResult getMemRefOpAlignment(LLVMTypeConverter &typeConverter,
10429a50c58SStephen Neuendorffer                                    OpAdaptor op, unsigned &align) {
10529a50c58SStephen Neuendorffer   if (failed(getMemRefAlignment(typeConverter, op.getMemRefType(), align)))
10629a50c58SStephen Neuendorffer     return failure();
10729a50c58SStephen Neuendorffer   align = std::max(align, getAssumedAlignment(op.base()));
10829a50c58SStephen Neuendorffer   return success();
10929a50c58SStephen Neuendorffer }
11029a50c58SStephen Neuendorffer 
111df5ccf5aSAart Bik // Add an index vector component to a base pointer. This almost always succeeds
112df5ccf5aSAart Bik // unless the last stride is non-unit or the memory space is not zero.
113df5ccf5aSAart Bik static LogicalResult getIndexedPtrs(ConversionPatternRewriter &rewriter,
114df5ccf5aSAart Bik                                     Location loc, Value memref, Value base,
115df5ccf5aSAart Bik                                     Value index, MemRefType memRefType,
116df5ccf5aSAart Bik                                     VectorType vType, Value &ptrs) {
11719dbb230Saartbik   int64_t offset;
11819dbb230Saartbik   SmallVector<int64_t, 4> strides;
11919dbb230Saartbik   auto successStrides = getStridesAndOffset(memRefType, strides, offset);
120df5ccf5aSAart Bik   if (failed(successStrides) || strides.back() != 1 ||
12137eca08eSVladislav Vinogradov       memRefType.getMemorySpaceAsInt() != 0)
122e8dcf5f8Saartbik     return failure();
1233a577f54SChristian Sigg   auto pType = MemRefDescriptor(memref).getElementPtrType();
124bd30a796SAlex Zinenko   auto ptrsType = LLVM::getFixedVectorType(pType, vType.getDimSize(0));
125df5ccf5aSAart Bik   ptrs = rewriter.create<LLVM::GEPOp>(loc, ptrsType, base, index);
12619dbb230Saartbik   return success();
12719dbb230Saartbik }
12819dbb230Saartbik 
129a57def30SAart Bik // Casts a strided element pointer to a vector pointer.  The vector pointer
13008c681f6SAndrew Pritchard // will be in the same address space as the incoming memref type.
131a57def30SAart Bik static Value castDataPtr(ConversionPatternRewriter &rewriter, Location loc,
132a57def30SAart Bik                          Value ptr, MemRefType memRefType, Type vt) {
13337eca08eSVladislav Vinogradov   auto pType = LLVM::LLVMPointerType::get(vt, memRefType.getMemorySpaceAsInt());
134a57def30SAart Bik   return rewriter.create<LLVM::BitcastOp>(loc, pType, ptr);
135a57def30SAart Bik }
136a57def30SAart Bik 
13790c01357SBenjamin Kramer namespace {
138e83b7b99Saartbik 
139cf5c517cSDiego Caballero /// Conversion pattern for a vector.bitcast.
140cf5c517cSDiego Caballero class VectorBitCastOpConversion
141cf5c517cSDiego Caballero     : public ConvertOpToLLVMPattern<vector::BitCastOp> {
142cf5c517cSDiego Caballero public:
143cf5c517cSDiego Caballero   using ConvertOpToLLVMPattern<vector::BitCastOp>::ConvertOpToLLVMPattern;
144cf5c517cSDiego Caballero 
145cf5c517cSDiego Caballero   LogicalResult
146ef976337SRiver Riddle   matchAndRewrite(vector::BitCastOp bitCastOp, OpAdaptor adaptor,
147cf5c517cSDiego Caballero                   ConversionPatternRewriter &rewriter) const override {
148cf5c517cSDiego Caballero     // Only 1-D vectors can be lowered to LLVM.
149cf5c517cSDiego Caballero     VectorType resultTy = bitCastOp.getType();
150cf5c517cSDiego Caballero     if (resultTy.getRank() != 1)
151cf5c517cSDiego Caballero       return failure();
152cf5c517cSDiego Caballero     Type newResultTy = typeConverter->convertType(resultTy);
153cf5c517cSDiego Caballero     rewriter.replaceOpWithNewOp<LLVM::BitcastOp>(bitCastOp, newResultTy,
154ef976337SRiver Riddle                                                  adaptor.getOperands()[0]);
155cf5c517cSDiego Caballero     return success();
156cf5c517cSDiego Caballero   }
157cf5c517cSDiego Caballero };
158cf5c517cSDiego Caballero 
15963b683a8SNicolas Vasilache /// Conversion pattern for a vector.matrix_multiply.
16063b683a8SNicolas Vasilache /// This is lowered directly to the proper llvm.intr.matrix.multiply.
161563879b6SRahul Joshi class VectorMatmulOpConversion
162563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::MatmulOp> {
16363b683a8SNicolas Vasilache public:
164563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::MatmulOp>::ConvertOpToLLVMPattern;
16563b683a8SNicolas Vasilache 
1663145427dSRiver Riddle   LogicalResult
167ef976337SRiver Riddle   matchAndRewrite(vector::MatmulOp matmulOp, OpAdaptor adaptor,
16863b683a8SNicolas Vasilache                   ConversionPatternRewriter &rewriter) const override {
16963b683a8SNicolas Vasilache     rewriter.replaceOpWithNewOp<LLVM::MatrixMultiplyOp>(
170563879b6SRahul Joshi         matmulOp, typeConverter->convertType(matmulOp.res().getType()),
171563879b6SRahul Joshi         adaptor.lhs(), adaptor.rhs(), matmulOp.lhs_rows(),
172563879b6SRahul Joshi         matmulOp.lhs_columns(), matmulOp.rhs_columns());
1733145427dSRiver Riddle     return success();
17463b683a8SNicolas Vasilache   }
17563b683a8SNicolas Vasilache };
17663b683a8SNicolas Vasilache 
177c295a65dSaartbik /// Conversion pattern for a vector.flat_transpose.
178c295a65dSaartbik /// This is lowered directly to the proper llvm.intr.matrix.transpose.
179563879b6SRahul Joshi class VectorFlatTransposeOpConversion
180563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::FlatTransposeOp> {
181c295a65dSaartbik public:
182563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::FlatTransposeOp>::ConvertOpToLLVMPattern;
183c295a65dSaartbik 
184c295a65dSaartbik   LogicalResult
185ef976337SRiver Riddle   matchAndRewrite(vector::FlatTransposeOp transOp, OpAdaptor adaptor,
186c295a65dSaartbik                   ConversionPatternRewriter &rewriter) const override {
187c295a65dSaartbik     rewriter.replaceOpWithNewOp<LLVM::MatrixTransposeOp>(
188dcec2ca5SChristian Sigg         transOp, typeConverter->convertType(transOp.res().getType()),
189c295a65dSaartbik         adaptor.matrix(), transOp.rows(), transOp.columns());
190c295a65dSaartbik     return success();
191c295a65dSaartbik   }
192c295a65dSaartbik };
193c295a65dSaartbik 
194ee66e43aSDiego Caballero /// Overloaded utility that replaces a vector.load, vector.store,
195ee66e43aSDiego Caballero /// vector.maskedload and vector.maskedstore with their respective LLVM
196ee66e43aSDiego Caballero /// couterparts.
197ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::LoadOp loadOp,
198ee66e43aSDiego Caballero                                  vector::LoadOpAdaptor adaptor,
199ee66e43aSDiego Caballero                                  VectorType vectorTy, Value ptr, unsigned align,
200ee66e43aSDiego Caballero                                  ConversionPatternRewriter &rewriter) {
201ee66e43aSDiego Caballero   rewriter.replaceOpWithNewOp<LLVM::LoadOp>(loadOp, ptr, align);
20239379916Saartbik }
20339379916Saartbik 
204ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::MaskedLoadOp loadOp,
205ee66e43aSDiego Caballero                                  vector::MaskedLoadOpAdaptor adaptor,
206ee66e43aSDiego Caballero                                  VectorType vectorTy, Value ptr, unsigned align,
207ee66e43aSDiego Caballero                                  ConversionPatternRewriter &rewriter) {
208ee66e43aSDiego Caballero   rewriter.replaceOpWithNewOp<LLVM::MaskedLoadOp>(
209ee66e43aSDiego Caballero       loadOp, vectorTy, ptr, adaptor.mask(), adaptor.pass_thru(), align);
210ee66e43aSDiego Caballero }
211ee66e43aSDiego Caballero 
212ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::StoreOp storeOp,
213ee66e43aSDiego Caballero                                  vector::StoreOpAdaptor adaptor,
214ee66e43aSDiego Caballero                                  VectorType vectorTy, Value ptr, unsigned align,
215ee66e43aSDiego Caballero                                  ConversionPatternRewriter &rewriter) {
216ee66e43aSDiego Caballero   rewriter.replaceOpWithNewOp<LLVM::StoreOp>(storeOp, adaptor.valueToStore(),
217ee66e43aSDiego Caballero                                              ptr, align);
218ee66e43aSDiego Caballero }
219ee66e43aSDiego Caballero 
220ee66e43aSDiego Caballero static void replaceLoadOrStoreOp(vector::MaskedStoreOp storeOp,
221ee66e43aSDiego Caballero                                  vector::MaskedStoreOpAdaptor adaptor,
222ee66e43aSDiego Caballero                                  VectorType vectorTy, Value ptr, unsigned align,
223ee66e43aSDiego Caballero                                  ConversionPatternRewriter &rewriter) {
224ee66e43aSDiego Caballero   rewriter.replaceOpWithNewOp<LLVM::MaskedStoreOp>(
225ee66e43aSDiego Caballero       storeOp, adaptor.valueToStore(), ptr, adaptor.mask(), align);
226ee66e43aSDiego Caballero }
227ee66e43aSDiego Caballero 
228ee66e43aSDiego Caballero /// Conversion pattern for a vector.load, vector.store, vector.maskedload, and
229ee66e43aSDiego Caballero /// vector.maskedstore.
230ee66e43aSDiego Caballero template <class LoadOrStoreOp, class LoadOrStoreOpAdaptor>
231ee66e43aSDiego Caballero class VectorLoadStoreConversion : public ConvertOpToLLVMPattern<LoadOrStoreOp> {
23239379916Saartbik public:
233ee66e43aSDiego Caballero   using ConvertOpToLLVMPattern<LoadOrStoreOp>::ConvertOpToLLVMPattern;
23439379916Saartbik 
23539379916Saartbik   LogicalResult
236ef976337SRiver Riddle   matchAndRewrite(LoadOrStoreOp loadOrStoreOp,
237ef976337SRiver Riddle                   typename LoadOrStoreOp::Adaptor adaptor,
23839379916Saartbik                   ConversionPatternRewriter &rewriter) const override {
239ee66e43aSDiego Caballero     // Only 1-D vectors can be lowered to LLVM.
240ee66e43aSDiego Caballero     VectorType vectorTy = loadOrStoreOp.getVectorType();
241ee66e43aSDiego Caballero     if (vectorTy.getRank() > 1)
242ee66e43aSDiego Caballero       return failure();
243ee66e43aSDiego Caballero 
244ee66e43aSDiego Caballero     auto loc = loadOrStoreOp->getLoc();
245ee66e43aSDiego Caballero     MemRefType memRefTy = loadOrStoreOp.getMemRefType();
24639379916Saartbik 
24739379916Saartbik     // Resolve alignment.
24839379916Saartbik     unsigned align;
24929a50c58SStephen Neuendorffer     if (failed(getMemRefOpAlignment(*this->getTypeConverter(), loadOrStoreOp,
25029a50c58SStephen Neuendorffer                                     align)))
25139379916Saartbik       return failure();
25239379916Saartbik 
253a57def30SAart Bik     // Resolve address.
254ee66e43aSDiego Caballero     auto vtype = this->typeConverter->convertType(loadOrStoreOp.getVectorType())
255ee66e43aSDiego Caballero                      .template cast<VectorType>();
256ee66e43aSDiego Caballero     Value dataPtr = this->getStridedElementPtr(loc, memRefTy, adaptor.base(),
257a57def30SAart Bik                                                adaptor.indices(), rewriter);
258ee66e43aSDiego Caballero     Value ptr = castDataPtr(rewriter, loc, dataPtr, memRefTy, vtype);
25939379916Saartbik 
260ee66e43aSDiego Caballero     replaceLoadOrStoreOp(loadOrStoreOp, adaptor, vtype, ptr, align, rewriter);
26139379916Saartbik     return success();
26239379916Saartbik   }
26339379916Saartbik };
26439379916Saartbik 
26519dbb230Saartbik /// Conversion pattern for a vector.gather.
266563879b6SRahul Joshi class VectorGatherOpConversion
267563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::GatherOp> {
26819dbb230Saartbik public:
269563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::GatherOp>::ConvertOpToLLVMPattern;
27019dbb230Saartbik 
27119dbb230Saartbik   LogicalResult
272ef976337SRiver Riddle   matchAndRewrite(vector::GatherOp gather, OpAdaptor adaptor,
27319dbb230Saartbik                   ConversionPatternRewriter &rewriter) const override {
274563879b6SRahul Joshi     auto loc = gather->getLoc();
275df5ccf5aSAart Bik     MemRefType memRefType = gather.getMemRefType();
27619dbb230Saartbik 
27719dbb230Saartbik     // Resolve alignment.
27819dbb230Saartbik     unsigned align;
27929a50c58SStephen Neuendorffer     if (failed(getMemRefOpAlignment(*getTypeConverter(), gather, align)))
28019dbb230Saartbik       return failure();
28119dbb230Saartbik 
282df5ccf5aSAart Bik     // Resolve address.
28319dbb230Saartbik     Value ptrs;
284df5ccf5aSAart Bik     VectorType vType = gather.getVectorType();
285df5ccf5aSAart Bik     Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(),
286df5ccf5aSAart Bik                                      adaptor.indices(), rewriter);
287df5ccf5aSAart Bik     if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), ptr,
288df5ccf5aSAart Bik                               adaptor.index_vec(), memRefType, vType, ptrs)))
28919dbb230Saartbik       return failure();
29019dbb230Saartbik 
29119dbb230Saartbik     // Replace with the gather intrinsic.
29219dbb230Saartbik     rewriter.replaceOpWithNewOp<LLVM::masked_gather>(
293dcec2ca5SChristian Sigg         gather, typeConverter->convertType(vType), ptrs, adaptor.mask(),
2940c2a4d3cSBenjamin Kramer         adaptor.pass_thru(), rewriter.getI32IntegerAttr(align));
29519dbb230Saartbik     return success();
29619dbb230Saartbik   }
29719dbb230Saartbik };
29819dbb230Saartbik 
29919dbb230Saartbik /// Conversion pattern for a vector.scatter.
300563879b6SRahul Joshi class VectorScatterOpConversion
301563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::ScatterOp> {
30219dbb230Saartbik public:
303563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::ScatterOp>::ConvertOpToLLVMPattern;
30419dbb230Saartbik 
30519dbb230Saartbik   LogicalResult
306ef976337SRiver Riddle   matchAndRewrite(vector::ScatterOp scatter, OpAdaptor adaptor,
30719dbb230Saartbik                   ConversionPatternRewriter &rewriter) const override {
308563879b6SRahul Joshi     auto loc = scatter->getLoc();
309df5ccf5aSAart Bik     MemRefType memRefType = scatter.getMemRefType();
31019dbb230Saartbik 
31119dbb230Saartbik     // Resolve alignment.
31219dbb230Saartbik     unsigned align;
31329a50c58SStephen Neuendorffer     if (failed(getMemRefOpAlignment(*getTypeConverter(), scatter, align)))
31419dbb230Saartbik       return failure();
31519dbb230Saartbik 
316df5ccf5aSAart Bik     // Resolve address.
31719dbb230Saartbik     Value ptrs;
318df5ccf5aSAart Bik     VectorType vType = scatter.getVectorType();
319df5ccf5aSAart Bik     Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(),
320df5ccf5aSAart Bik                                      adaptor.indices(), rewriter);
321df5ccf5aSAart Bik     if (failed(getIndexedPtrs(rewriter, loc, adaptor.base(), ptr,
322df5ccf5aSAart Bik                               adaptor.index_vec(), memRefType, vType, ptrs)))
32319dbb230Saartbik       return failure();
32419dbb230Saartbik 
32519dbb230Saartbik     // Replace with the scatter intrinsic.
32619dbb230Saartbik     rewriter.replaceOpWithNewOp<LLVM::masked_scatter>(
327656674a7SDiego Caballero         scatter, adaptor.valueToStore(), ptrs, adaptor.mask(),
32819dbb230Saartbik         rewriter.getI32IntegerAttr(align));
32919dbb230Saartbik     return success();
33019dbb230Saartbik   }
33119dbb230Saartbik };
33219dbb230Saartbik 
333e8dcf5f8Saartbik /// Conversion pattern for a vector.expandload.
334563879b6SRahul Joshi class VectorExpandLoadOpConversion
335563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::ExpandLoadOp> {
336e8dcf5f8Saartbik public:
337563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::ExpandLoadOp>::ConvertOpToLLVMPattern;
338e8dcf5f8Saartbik 
339e8dcf5f8Saartbik   LogicalResult
340ef976337SRiver Riddle   matchAndRewrite(vector::ExpandLoadOp expand, OpAdaptor adaptor,
341e8dcf5f8Saartbik                   ConversionPatternRewriter &rewriter) const override {
342563879b6SRahul Joshi     auto loc = expand->getLoc();
343a57def30SAart Bik     MemRefType memRefType = expand.getMemRefType();
344e8dcf5f8Saartbik 
345a57def30SAart Bik     // Resolve address.
346656674a7SDiego Caballero     auto vtype = typeConverter->convertType(expand.getVectorType());
347df5ccf5aSAart Bik     Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(),
348a57def30SAart Bik                                      adaptor.indices(), rewriter);
349e8dcf5f8Saartbik 
350e8dcf5f8Saartbik     rewriter.replaceOpWithNewOp<LLVM::masked_expandload>(
351a57def30SAart Bik         expand, vtype, ptr, adaptor.mask(), adaptor.pass_thru());
352e8dcf5f8Saartbik     return success();
353e8dcf5f8Saartbik   }
354e8dcf5f8Saartbik };
355e8dcf5f8Saartbik 
356e8dcf5f8Saartbik /// Conversion pattern for a vector.compressstore.
357563879b6SRahul Joshi class VectorCompressStoreOpConversion
358563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::CompressStoreOp> {
359e8dcf5f8Saartbik public:
360563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::CompressStoreOp>::ConvertOpToLLVMPattern;
361e8dcf5f8Saartbik 
362e8dcf5f8Saartbik   LogicalResult
363ef976337SRiver Riddle   matchAndRewrite(vector::CompressStoreOp compress, OpAdaptor adaptor,
364e8dcf5f8Saartbik                   ConversionPatternRewriter &rewriter) const override {
365563879b6SRahul Joshi     auto loc = compress->getLoc();
366a57def30SAart Bik     MemRefType memRefType = compress.getMemRefType();
367e8dcf5f8Saartbik 
368a57def30SAart Bik     // Resolve address.
369df5ccf5aSAart Bik     Value ptr = getStridedElementPtr(loc, memRefType, adaptor.base(),
370a57def30SAart Bik                                      adaptor.indices(), rewriter);
371e8dcf5f8Saartbik 
372e8dcf5f8Saartbik     rewriter.replaceOpWithNewOp<LLVM::masked_compressstore>(
373656674a7SDiego Caballero         compress, adaptor.valueToStore(), ptr, adaptor.mask());
374e8dcf5f8Saartbik     return success();
375e8dcf5f8Saartbik   }
376e8dcf5f8Saartbik };
377e8dcf5f8Saartbik 
37819dbb230Saartbik /// Conversion pattern for all vector reductions.
379563879b6SRahul Joshi class VectorReductionOpConversion
380563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::ReductionOp> {
381e83b7b99Saartbik public:
382563879b6SRahul Joshi   explicit VectorReductionOpConversion(LLVMTypeConverter &typeConv,
383060c9dd1Saartbik                                        bool reassociateFPRed)
384563879b6SRahul Joshi       : ConvertOpToLLVMPattern<vector::ReductionOp>(typeConv),
385060c9dd1Saartbik         reassociateFPReductions(reassociateFPRed) {}
386e83b7b99Saartbik 
3873145427dSRiver Riddle   LogicalResult
388ef976337SRiver Riddle   matchAndRewrite(vector::ReductionOp reductionOp, OpAdaptor adaptor,
389e83b7b99Saartbik                   ConversionPatternRewriter &rewriter) const override {
390e83b7b99Saartbik     auto kind = reductionOp.kind();
391e83b7b99Saartbik     Type eltType = reductionOp.dest().getType();
392dcec2ca5SChristian Sigg     Type llvmType = typeConverter->convertType(eltType);
393ef976337SRiver Riddle     Value operand = adaptor.getOperands()[0];
394e9628955SAart Bik     if (eltType.isIntOrIndex()) {
395e83b7b99Saartbik       // Integer reductions: add/mul/min/max/and/or/xor.
396e83b7b99Saartbik       if (kind == "add")
397ef976337SRiver Riddle         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_add>(reductionOp,
398ef976337SRiver Riddle                                                              llvmType, operand);
399e83b7b99Saartbik       else if (kind == "mul")
400ef976337SRiver Riddle         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_mul>(reductionOp,
401ef976337SRiver Riddle                                                              llvmType, operand);
402eaf2588aSDiego Caballero       else if (kind == "minui")
403322d0afdSAmara Emerson         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_umin>(
404ef976337SRiver Riddle             reductionOp, llvmType, operand);
405eaf2588aSDiego Caballero       else if (kind == "minsi")
406322d0afdSAmara Emerson         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_smin>(
407ef976337SRiver Riddle             reductionOp, llvmType, operand);
408eaf2588aSDiego Caballero       else if (kind == "maxui")
409322d0afdSAmara Emerson         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_umax>(
410ef976337SRiver Riddle             reductionOp, llvmType, operand);
411eaf2588aSDiego Caballero       else if (kind == "maxsi")
412322d0afdSAmara Emerson         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_smax>(
413ef976337SRiver Riddle             reductionOp, llvmType, operand);
414e83b7b99Saartbik       else if (kind == "and")
415ef976337SRiver Riddle         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_and>(reductionOp,
416ef976337SRiver Riddle                                                              llvmType, operand);
417e83b7b99Saartbik       else if (kind == "or")
418ef976337SRiver Riddle         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_or>(reductionOp,
419ef976337SRiver Riddle                                                             llvmType, operand);
420e83b7b99Saartbik       else if (kind == "xor")
421ef976337SRiver Riddle         rewriter.replaceOpWithNewOp<LLVM::vector_reduce_xor>(reductionOp,
422ef976337SRiver Riddle                                                              llvmType, operand);
423e83b7b99Saartbik       else
4243145427dSRiver Riddle         return failure();
4253145427dSRiver Riddle       return success();
426dcec2ca5SChristian Sigg     }
427e83b7b99Saartbik 
428dcec2ca5SChristian Sigg     if (!eltType.isa<FloatType>())
429dcec2ca5SChristian Sigg       return failure();
430dcec2ca5SChristian Sigg 
431e83b7b99Saartbik     // Floating-point reductions: add/mul/min/max
432e83b7b99Saartbik     if (kind == "add") {
4330d924700Saartbik       // Optional accumulator (or zero).
434ef976337SRiver Riddle       Value acc = adaptor.getOperands().size() > 1
435ef976337SRiver Riddle                       ? adaptor.getOperands()[1]
4360d924700Saartbik                       : rewriter.create<LLVM::ConstantOp>(
437563879b6SRahul Joshi                             reductionOp->getLoc(), llvmType,
4380d924700Saartbik                             rewriter.getZeroAttr(eltType));
439322d0afdSAmara Emerson       rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fadd>(
440ef976337SRiver Riddle           reductionOp, llvmType, acc, operand,
441ceb1b327Saartbik           rewriter.getBoolAttr(reassociateFPReductions));
442e83b7b99Saartbik     } else if (kind == "mul") {
4430d924700Saartbik       // Optional accumulator (or one).
444ef976337SRiver Riddle       Value acc = adaptor.getOperands().size() > 1
445ef976337SRiver Riddle                       ? adaptor.getOperands()[1]
4460d924700Saartbik                       : rewriter.create<LLVM::ConstantOp>(
447563879b6SRahul Joshi                             reductionOp->getLoc(), llvmType,
4480d924700Saartbik                             rewriter.getFloatAttr(eltType, 1.0));
449322d0afdSAmara Emerson       rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmul>(
450ef976337SRiver Riddle           reductionOp, llvmType, acc, operand,
451ceb1b327Saartbik           rewriter.getBoolAttr(reassociateFPReductions));
452eaf2588aSDiego Caballero     } else if (kind == "minf")
453eaf2588aSDiego Caballero       // FIXME: MLIR's 'minf' and LLVM's 'vector_reduce_fmin' do not handle
454eaf2588aSDiego Caballero       // NaNs/-0.0/+0.0 in the same way.
455ef976337SRiver Riddle       rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmin>(reductionOp,
456ef976337SRiver Riddle                                                             llvmType, operand);
457eaf2588aSDiego Caballero     else if (kind == "maxf")
458eaf2588aSDiego Caballero       // FIXME: MLIR's 'maxf' and LLVM's 'vector_reduce_fmax' do not handle
459eaf2588aSDiego Caballero       // NaNs/-0.0/+0.0 in the same way.
460ef976337SRiver Riddle       rewriter.replaceOpWithNewOp<LLVM::vector_reduce_fmax>(reductionOp,
461ef976337SRiver Riddle                                                             llvmType, operand);
462e83b7b99Saartbik     else
4633145427dSRiver Riddle       return failure();
4643145427dSRiver Riddle     return success();
465e83b7b99Saartbik   }
466ceb1b327Saartbik 
467ceb1b327Saartbik private:
468ceb1b327Saartbik   const bool reassociateFPReductions;
469e83b7b99Saartbik };
470e83b7b99Saartbik 
471563879b6SRahul Joshi class VectorShuffleOpConversion
472563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::ShuffleOp> {
4731c81adf3SAart Bik public:
474563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::ShuffleOp>::ConvertOpToLLVMPattern;
4751c81adf3SAart Bik 
4763145427dSRiver Riddle   LogicalResult
477ef976337SRiver Riddle   matchAndRewrite(vector::ShuffleOp shuffleOp, OpAdaptor adaptor,
4781c81adf3SAart Bik                   ConversionPatternRewriter &rewriter) const override {
479563879b6SRahul Joshi     auto loc = shuffleOp->getLoc();
4801c81adf3SAart Bik     auto v1Type = shuffleOp.getV1VectorType();
4811c81adf3SAart Bik     auto v2Type = shuffleOp.getV2VectorType();
4821c81adf3SAart Bik     auto vectorType = shuffleOp.getVectorType();
483dcec2ca5SChristian Sigg     Type llvmType = typeConverter->convertType(vectorType);
4841c81adf3SAart Bik     auto maskArrayAttr = shuffleOp.mask();
4851c81adf3SAart Bik 
4861c81adf3SAart Bik     // Bail if result type cannot be lowered.
4871c81adf3SAart Bik     if (!llvmType)
4883145427dSRiver Riddle       return failure();
4891c81adf3SAart Bik 
4901c81adf3SAart Bik     // Get rank and dimension sizes.
4911c81adf3SAart Bik     int64_t rank = vectorType.getRank();
4921c81adf3SAart Bik     assert(v1Type.getRank() == rank);
4931c81adf3SAart Bik     assert(v2Type.getRank() == rank);
4941c81adf3SAart Bik     int64_t v1Dim = v1Type.getDimSize(0);
4951c81adf3SAart Bik 
4961c81adf3SAart Bik     // For rank 1, where both operands have *exactly* the same vector type,
4971c81adf3SAart Bik     // there is direct shuffle support in LLVM. Use it!
4981c81adf3SAart Bik     if (rank == 1 && v1Type == v2Type) {
499563879b6SRahul Joshi       Value llvmShuffleOp = rewriter.create<LLVM::ShuffleVectorOp>(
5001c81adf3SAart Bik           loc, adaptor.v1(), adaptor.v2(), maskArrayAttr);
501563879b6SRahul Joshi       rewriter.replaceOp(shuffleOp, llvmShuffleOp);
5023145427dSRiver Riddle       return success();
503b36aaeafSAart Bik     }
504b36aaeafSAart Bik 
5051c81adf3SAart Bik     // For all other cases, insert the individual values individually.
5065a8a159bSMehdi Amini     Type eltType;
5075a8a159bSMehdi Amini     llvm::errs() << llvmType << "\n";
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 
547cd5dab8aSAart Bik     rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>(
548563879b6SRahul Joshi         extractEltOp, llvmType, adaptor.vector(), adaptor.position());
5493145427dSRiver Riddle     return success();
550cd5dab8aSAart Bik   }
551cd5dab8aSAart Bik };
552cd5dab8aSAart Bik 
553563879b6SRahul Joshi class VectorExtractOpConversion
554563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::ExtractOp> {
5555c0c51a9SNicolas Vasilache public:
556563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::ExtractOp>::ConvertOpToLLVMPattern;
5575c0c51a9SNicolas Vasilache 
5583145427dSRiver Riddle   LogicalResult
559ef976337SRiver Riddle   matchAndRewrite(vector::ExtractOp extractOp, OpAdaptor adaptor,
5605c0c51a9SNicolas Vasilache                   ConversionPatternRewriter &rewriter) const override {
561563879b6SRahul Joshi     auto loc = extractOp->getLoc();
5629826fe5cSAart Bik     auto vectorType = extractOp.getVectorType();
5632bdf33ccSRiver Riddle     auto resultType = extractOp.getResult().getType();
564dcec2ca5SChristian Sigg     auto llvmResultType = typeConverter->convertType(resultType);
5655c0c51a9SNicolas Vasilache     auto positionArrayAttr = extractOp.position();
5669826fe5cSAart Bik 
5679826fe5cSAart Bik     // Bail if result type cannot be lowered.
5689826fe5cSAart Bik     if (!llvmResultType)
5693145427dSRiver Riddle       return failure();
5709826fe5cSAart Bik 
571864adf39SMatthias Springer     // Extract entire vector. Should be handled by folder, but just to be safe.
572864adf39SMatthias Springer     if (positionArrayAttr.empty()) {
573864adf39SMatthias Springer       rewriter.replaceOp(extractOp, adaptor.vector());
574864adf39SMatthias Springer       return success();
575864adf39SMatthias Springer     }
576864adf39SMatthias Springer 
5775c0c51a9SNicolas Vasilache     // One-shot extraction of vector from array (only requires extractvalue).
5785c0c51a9SNicolas Vasilache     if (resultType.isa<VectorType>()) {
579e62a6956SRiver Riddle       Value extracted = rewriter.create<LLVM::ExtractValueOp>(
5805c0c51a9SNicolas Vasilache           loc, llvmResultType, adaptor.vector(), positionArrayAttr);
581563879b6SRahul Joshi       rewriter.replaceOp(extractOp, extracted);
5823145427dSRiver Riddle       return success();
5835c0c51a9SNicolas Vasilache     }
5845c0c51a9SNicolas Vasilache 
5859826fe5cSAart Bik     // Potential extraction of 1-D vector from array.
586563879b6SRahul Joshi     auto *context = extractOp->getContext();
587e62a6956SRiver Riddle     Value extracted = adaptor.vector();
5885c0c51a9SNicolas Vasilache     auto positionAttrs = positionArrayAttr.getValue();
5895c0c51a9SNicolas Vasilache     if (positionAttrs.size() > 1) {
5909826fe5cSAart Bik       auto oneDVectorType = reducedVectorTypeBack(vectorType);
5915c0c51a9SNicolas Vasilache       auto nMinusOnePositionAttrs =
592c2c83e97STres Popp           ArrayAttr::get(context, positionAttrs.drop_back());
5935c0c51a9SNicolas Vasilache       extracted = rewriter.create<LLVM::ExtractValueOp>(
594dcec2ca5SChristian Sigg           loc, typeConverter->convertType(oneDVectorType), extracted,
5955c0c51a9SNicolas Vasilache           nMinusOnePositionAttrs);
5965c0c51a9SNicolas Vasilache     }
5975c0c51a9SNicolas Vasilache 
5985c0c51a9SNicolas Vasilache     // Remaining extraction of element from 1-D LLVM vector
5995c0c51a9SNicolas Vasilache     auto position = positionAttrs.back().cast<IntegerAttr>();
6002230bf99SAlex Zinenko     auto i64Type = IntegerType::get(rewriter.getContext(), 64);
6011d47564aSAart Bik     auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position);
6025c0c51a9SNicolas Vasilache     extracted =
6035c0c51a9SNicolas Vasilache         rewriter.create<LLVM::ExtractElementOp>(loc, extracted, constant);
604563879b6SRahul Joshi     rewriter.replaceOp(extractOp, extracted);
6055c0c51a9SNicolas Vasilache 
6063145427dSRiver Riddle     return success();
6075c0c51a9SNicolas Vasilache   }
6085c0c51a9SNicolas Vasilache };
6095c0c51a9SNicolas Vasilache 
610681f929fSNicolas Vasilache /// Conversion pattern that turns a vector.fma on a 1-D vector
611681f929fSNicolas Vasilache /// into an llvm.intr.fmuladd. This is a trivial 1-1 conversion.
612681f929fSNicolas Vasilache /// This does not match vectors of n >= 2 rank.
613681f929fSNicolas Vasilache ///
614681f929fSNicolas Vasilache /// Example:
615681f929fSNicolas Vasilache /// ```
616681f929fSNicolas Vasilache ///  vector.fma %a, %a, %a : vector<8xf32>
617681f929fSNicolas Vasilache /// ```
618681f929fSNicolas Vasilache /// is converted to:
619681f929fSNicolas Vasilache /// ```
6203bffe602SBenjamin Kramer ///  llvm.intr.fmuladd %va, %va, %va:
621dd5165a9SAlex Zinenko ///    (!llvm."<8 x f32>">, !llvm<"<8 x f32>">, !llvm<"<8 x f32>">)
622dd5165a9SAlex Zinenko ///    -> !llvm."<8 x f32>">
623681f929fSNicolas Vasilache /// ```
624563879b6SRahul Joshi class VectorFMAOp1DConversion : public ConvertOpToLLVMPattern<vector::FMAOp> {
625681f929fSNicolas Vasilache public:
626563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::FMAOp>::ConvertOpToLLVMPattern;
627681f929fSNicolas Vasilache 
6283145427dSRiver Riddle   LogicalResult
629ef976337SRiver Riddle   matchAndRewrite(vector::FMAOp fmaOp, OpAdaptor adaptor,
630681f929fSNicolas Vasilache                   ConversionPatternRewriter &rewriter) const override {
631681f929fSNicolas Vasilache     VectorType vType = fmaOp.getVectorType();
632681f929fSNicolas Vasilache     if (vType.getRank() != 1)
6333145427dSRiver Riddle       return failure();
634563879b6SRahul Joshi     rewriter.replaceOpWithNewOp<LLVM::FMulAddOp>(fmaOp, adaptor.lhs(),
6353bffe602SBenjamin Kramer                                                  adaptor.rhs(), adaptor.acc());
6363145427dSRiver Riddle     return success();
637681f929fSNicolas Vasilache   }
638681f929fSNicolas Vasilache };
639681f929fSNicolas Vasilache 
640563879b6SRahul Joshi class VectorInsertElementOpConversion
641563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::InsertElementOp> {
642cd5dab8aSAart Bik public:
643563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::InsertElementOp>::ConvertOpToLLVMPattern;
644cd5dab8aSAart Bik 
6453145427dSRiver Riddle   LogicalResult
646ef976337SRiver Riddle   matchAndRewrite(vector::InsertElementOp insertEltOp, OpAdaptor adaptor,
647cd5dab8aSAart Bik                   ConversionPatternRewriter &rewriter) const override {
648cd5dab8aSAart Bik     auto vectorType = insertEltOp.getDestVectorType();
649dcec2ca5SChristian Sigg     auto llvmType = typeConverter->convertType(vectorType);
650cd5dab8aSAart Bik 
651cd5dab8aSAart Bik     // Bail if result type cannot be lowered.
652cd5dab8aSAart Bik     if (!llvmType)
6533145427dSRiver Riddle       return failure();
654cd5dab8aSAart Bik 
655cd5dab8aSAart Bik     rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>(
656563879b6SRahul Joshi         insertEltOp, llvmType, adaptor.dest(), adaptor.source(),
657563879b6SRahul Joshi         adaptor.position());
6583145427dSRiver Riddle     return success();
659cd5dab8aSAart Bik   }
660cd5dab8aSAart Bik };
661cd5dab8aSAart Bik 
662563879b6SRahul Joshi class VectorInsertOpConversion
663563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::InsertOp> {
6649826fe5cSAart Bik public:
665563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::InsertOp>::ConvertOpToLLVMPattern;
6669826fe5cSAart Bik 
6673145427dSRiver Riddle   LogicalResult
668ef976337SRiver Riddle   matchAndRewrite(vector::InsertOp insertOp, OpAdaptor adaptor,
6699826fe5cSAart Bik                   ConversionPatternRewriter &rewriter) const override {
670563879b6SRahul Joshi     auto loc = insertOp->getLoc();
6719826fe5cSAart Bik     auto sourceType = insertOp.getSourceType();
6729826fe5cSAart Bik     auto destVectorType = insertOp.getDestVectorType();
673dcec2ca5SChristian Sigg     auto llvmResultType = typeConverter->convertType(destVectorType);
6749826fe5cSAart Bik     auto positionArrayAttr = insertOp.position();
6759826fe5cSAart Bik 
6769826fe5cSAart Bik     // Bail if result type cannot be lowered.
6779826fe5cSAart Bik     if (!llvmResultType)
6783145427dSRiver Riddle       return failure();
6799826fe5cSAart Bik 
680864adf39SMatthias Springer     // Overwrite entire vector with value. Should be handled by folder, but
681864adf39SMatthias Springer     // just to be safe.
682864adf39SMatthias Springer     if (positionArrayAttr.empty()) {
683864adf39SMatthias Springer       rewriter.replaceOp(insertOp, adaptor.source());
684864adf39SMatthias Springer       return success();
685864adf39SMatthias Springer     }
686864adf39SMatthias Springer 
6879826fe5cSAart Bik     // One-shot insertion of a vector into an array (only requires insertvalue).
6889826fe5cSAart Bik     if (sourceType.isa<VectorType>()) {
689e62a6956SRiver Riddle       Value inserted = rewriter.create<LLVM::InsertValueOp>(
6909826fe5cSAart Bik           loc, llvmResultType, adaptor.dest(), adaptor.source(),
6919826fe5cSAart Bik           positionArrayAttr);
692563879b6SRahul Joshi       rewriter.replaceOp(insertOp, inserted);
6933145427dSRiver Riddle       return success();
6949826fe5cSAart Bik     }
6959826fe5cSAart Bik 
6969826fe5cSAart Bik     // Potential extraction of 1-D vector from array.
697563879b6SRahul Joshi     auto *context = insertOp->getContext();
698e62a6956SRiver Riddle     Value extracted = adaptor.dest();
6999826fe5cSAart Bik     auto positionAttrs = positionArrayAttr.getValue();
7009826fe5cSAart Bik     auto position = positionAttrs.back().cast<IntegerAttr>();
7019826fe5cSAart Bik     auto oneDVectorType = destVectorType;
7029826fe5cSAart Bik     if (positionAttrs.size() > 1) {
7039826fe5cSAart Bik       oneDVectorType = reducedVectorTypeBack(destVectorType);
7049826fe5cSAart Bik       auto nMinusOnePositionAttrs =
705c2c83e97STres Popp           ArrayAttr::get(context, positionAttrs.drop_back());
7069826fe5cSAart Bik       extracted = rewriter.create<LLVM::ExtractValueOp>(
707dcec2ca5SChristian Sigg           loc, typeConverter->convertType(oneDVectorType), extracted,
7089826fe5cSAart Bik           nMinusOnePositionAttrs);
7099826fe5cSAart Bik     }
7109826fe5cSAart Bik 
7119826fe5cSAart Bik     // Insertion of an element into a 1-D LLVM vector.
7122230bf99SAlex Zinenko     auto i64Type = IntegerType::get(rewriter.getContext(), 64);
7131d47564aSAart Bik     auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position);
714e62a6956SRiver Riddle     Value inserted = rewriter.create<LLVM::InsertElementOp>(
715dcec2ca5SChristian Sigg         loc, typeConverter->convertType(oneDVectorType), extracted,
7160f04384dSAlex Zinenko         adaptor.source(), constant);
7179826fe5cSAart Bik 
7189826fe5cSAart Bik     // Potential insertion of resulting 1-D vector into array.
7199826fe5cSAart Bik     if (positionAttrs.size() > 1) {
7209826fe5cSAart Bik       auto nMinusOnePositionAttrs =
721c2c83e97STres Popp           ArrayAttr::get(context, positionAttrs.drop_back());
7229826fe5cSAart Bik       inserted = rewriter.create<LLVM::InsertValueOp>(loc, llvmResultType,
7239826fe5cSAart Bik                                                       adaptor.dest(), inserted,
7249826fe5cSAart Bik                                                       nMinusOnePositionAttrs);
7259826fe5cSAart Bik     }
7269826fe5cSAart Bik 
727563879b6SRahul Joshi     rewriter.replaceOp(insertOp, inserted);
7283145427dSRiver Riddle     return success();
7299826fe5cSAart Bik   }
7309826fe5cSAart Bik };
7319826fe5cSAart Bik 
732681f929fSNicolas Vasilache /// Rank reducing rewrite for n-D FMA into (n-1)-D FMA where n > 1.
733681f929fSNicolas Vasilache ///
734681f929fSNicolas Vasilache /// Example:
735681f929fSNicolas Vasilache /// ```
736681f929fSNicolas Vasilache ///   %d = vector.fma %a, %b, %c : vector<2x4xf32>
737681f929fSNicolas Vasilache /// ```
738681f929fSNicolas Vasilache /// is rewritten into:
739681f929fSNicolas Vasilache /// ```
740681f929fSNicolas Vasilache ///  %r = splat %f0: vector<2x4xf32>
741681f929fSNicolas Vasilache ///  %va = vector.extractvalue %a[0] : vector<2x4xf32>
742681f929fSNicolas Vasilache ///  %vb = vector.extractvalue %b[0] : vector<2x4xf32>
743681f929fSNicolas Vasilache ///  %vc = vector.extractvalue %c[0] : vector<2x4xf32>
744681f929fSNicolas Vasilache ///  %vd = vector.fma %va, %vb, %vc : vector<4xf32>
745681f929fSNicolas Vasilache ///  %r2 = vector.insertvalue %vd, %r[0] : vector<4xf32> into vector<2x4xf32>
746681f929fSNicolas Vasilache ///  %va2 = vector.extractvalue %a2[1] : vector<2x4xf32>
747681f929fSNicolas Vasilache ///  %vb2 = vector.extractvalue %b2[1] : vector<2x4xf32>
748681f929fSNicolas Vasilache ///  %vc2 = vector.extractvalue %c2[1] : vector<2x4xf32>
749681f929fSNicolas Vasilache ///  %vd2 = vector.fma %va2, %vb2, %vc2 : vector<4xf32>
750681f929fSNicolas Vasilache ///  %r3 = vector.insertvalue %vd2, %r2[1] : vector<4xf32> into vector<2x4xf32>
751681f929fSNicolas Vasilache ///  // %r3 holds the final value.
752681f929fSNicolas Vasilache /// ```
753681f929fSNicolas Vasilache class VectorFMAOpNDRewritePattern : public OpRewritePattern<FMAOp> {
754681f929fSNicolas Vasilache public:
755681f929fSNicolas Vasilache   using OpRewritePattern<FMAOp>::OpRewritePattern;
756681f929fSNicolas Vasilache 
7573145427dSRiver Riddle   LogicalResult matchAndRewrite(FMAOp op,
758681f929fSNicolas Vasilache                                 PatternRewriter &rewriter) const override {
759681f929fSNicolas Vasilache     auto vType = op.getVectorType();
760681f929fSNicolas Vasilache     if (vType.getRank() < 2)
7613145427dSRiver Riddle       return failure();
762681f929fSNicolas Vasilache 
763681f929fSNicolas Vasilache     auto loc = op.getLoc();
764681f929fSNicolas Vasilache     auto elemType = vType.getElementType();
765a54f4eaeSMogball     Value zero = rewriter.create<arith::ConstantOp>(
766a54f4eaeSMogball         loc, elemType, rewriter.getZeroAttr(elemType));
767681f929fSNicolas Vasilache     Value desc = rewriter.create<SplatOp>(loc, vType, zero);
768681f929fSNicolas Vasilache     for (int64_t i = 0, e = vType.getShape().front(); i != e; ++i) {
769681f929fSNicolas Vasilache       Value extrLHS = rewriter.create<ExtractOp>(loc, op.lhs(), i);
770681f929fSNicolas Vasilache       Value extrRHS = rewriter.create<ExtractOp>(loc, op.rhs(), i);
771681f929fSNicolas Vasilache       Value extrACC = rewriter.create<ExtractOp>(loc, op.acc(), i);
772681f929fSNicolas Vasilache       Value fma = rewriter.create<FMAOp>(loc, extrLHS, extrRHS, extrACC);
773681f929fSNicolas Vasilache       desc = rewriter.create<InsertOp>(loc, fma, desc, i);
774681f929fSNicolas Vasilache     }
775681f929fSNicolas Vasilache     rewriter.replaceOp(op, desc);
7763145427dSRiver Riddle     return success();
777681f929fSNicolas Vasilache   }
778681f929fSNicolas Vasilache };
779681f929fSNicolas Vasilache 
78030e6033bSNicolas Vasilache /// Returns the strides if the memory underlying `memRefType` has a contiguous
78130e6033bSNicolas Vasilache /// static layout.
78230e6033bSNicolas Vasilache static llvm::Optional<SmallVector<int64_t, 4>>
78330e6033bSNicolas Vasilache computeContiguousStrides(MemRefType memRefType) {
7842bf491c7SBenjamin Kramer   int64_t offset;
78530e6033bSNicolas Vasilache   SmallVector<int64_t, 4> strides;
78630e6033bSNicolas Vasilache   if (failed(getStridesAndOffset(memRefType, strides, offset)))
78730e6033bSNicolas Vasilache     return None;
78830e6033bSNicolas Vasilache   if (!strides.empty() && strides.back() != 1)
78930e6033bSNicolas Vasilache     return None;
79030e6033bSNicolas Vasilache   // If no layout or identity layout, this is contiguous by definition.
791e41ebbecSVladislav Vinogradov   if (memRefType.getLayout().isIdentity())
79230e6033bSNicolas Vasilache     return strides;
79330e6033bSNicolas Vasilache 
79430e6033bSNicolas Vasilache   // Otherwise, we must determine contiguity form shapes. This can only ever
79530e6033bSNicolas Vasilache   // work in static cases because MemRefType is underspecified to represent
79630e6033bSNicolas Vasilache   // contiguous dynamic shapes in other ways than with just empty/identity
79730e6033bSNicolas Vasilache   // layout.
7982bf491c7SBenjamin Kramer   auto sizes = memRefType.getShape();
7995017b0f8SMatthias Springer   for (int index = 0, e = strides.size() - 1; index < e; ++index) {
80030e6033bSNicolas Vasilache     if (ShapedType::isDynamic(sizes[index + 1]) ||
80130e6033bSNicolas Vasilache         ShapedType::isDynamicStrideOrOffset(strides[index]) ||
80230e6033bSNicolas Vasilache         ShapedType::isDynamicStrideOrOffset(strides[index + 1]))
80330e6033bSNicolas Vasilache       return None;
80430e6033bSNicolas Vasilache     if (strides[index] != strides[index + 1] * sizes[index + 1])
80530e6033bSNicolas Vasilache       return None;
8062bf491c7SBenjamin Kramer   }
80730e6033bSNicolas Vasilache   return strides;
8082bf491c7SBenjamin Kramer }
8092bf491c7SBenjamin Kramer 
810563879b6SRahul Joshi class VectorTypeCastOpConversion
811563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::TypeCastOp> {
8125c0c51a9SNicolas Vasilache public:
813563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::TypeCastOp>::ConvertOpToLLVMPattern;
8145c0c51a9SNicolas Vasilache 
8153145427dSRiver Riddle   LogicalResult
816ef976337SRiver Riddle   matchAndRewrite(vector::TypeCastOp castOp, OpAdaptor adaptor,
8175c0c51a9SNicolas Vasilache                   ConversionPatternRewriter &rewriter) const override {
818563879b6SRahul Joshi     auto loc = castOp->getLoc();
8195c0c51a9SNicolas Vasilache     MemRefType sourceMemRefType =
8202bdf33ccSRiver Riddle         castOp.getOperand().getType().cast<MemRefType>();
8219eb3e564SChris Lattner     MemRefType targetMemRefType = castOp.getType();
8225c0c51a9SNicolas Vasilache 
8235c0c51a9SNicolas Vasilache     // Only static shape casts supported atm.
8245c0c51a9SNicolas Vasilache     if (!sourceMemRefType.hasStaticShape() ||
8255c0c51a9SNicolas Vasilache         !targetMemRefType.hasStaticShape())
8263145427dSRiver Riddle       return failure();
8275c0c51a9SNicolas Vasilache 
8285c0c51a9SNicolas Vasilache     auto llvmSourceDescriptorTy =
829ef976337SRiver Riddle         adaptor.getOperands()[0].getType().dyn_cast<LLVM::LLVMStructType>();
8308de43b92SAlex Zinenko     if (!llvmSourceDescriptorTy)
8313145427dSRiver Riddle       return failure();
832ef976337SRiver Riddle     MemRefDescriptor sourceMemRef(adaptor.getOperands()[0]);
8335c0c51a9SNicolas Vasilache 
834dcec2ca5SChristian Sigg     auto llvmTargetDescriptorTy = typeConverter->convertType(targetMemRefType)
8358de43b92SAlex Zinenko                                       .dyn_cast_or_null<LLVM::LLVMStructType>();
8368de43b92SAlex Zinenko     if (!llvmTargetDescriptorTy)
8373145427dSRiver Riddle       return failure();
8385c0c51a9SNicolas Vasilache 
83930e6033bSNicolas Vasilache     // Only contiguous source buffers supported atm.
84030e6033bSNicolas Vasilache     auto sourceStrides = computeContiguousStrides(sourceMemRefType);
84130e6033bSNicolas Vasilache     if (!sourceStrides)
84230e6033bSNicolas Vasilache       return failure();
84330e6033bSNicolas Vasilache     auto targetStrides = computeContiguousStrides(targetMemRefType);
84430e6033bSNicolas Vasilache     if (!targetStrides)
84530e6033bSNicolas Vasilache       return failure();
84630e6033bSNicolas Vasilache     // Only support static strides for now, regardless of contiguity.
84730e6033bSNicolas Vasilache     if (llvm::any_of(*targetStrides, [](int64_t stride) {
84830e6033bSNicolas Vasilache           return ShapedType::isDynamicStrideOrOffset(stride);
84930e6033bSNicolas Vasilache         }))
8503145427dSRiver Riddle       return failure();
8515c0c51a9SNicolas Vasilache 
8522230bf99SAlex Zinenko     auto int64Ty = IntegerType::get(rewriter.getContext(), 64);
8535c0c51a9SNicolas Vasilache 
8545c0c51a9SNicolas Vasilache     // Create descriptor.
8555c0c51a9SNicolas Vasilache     auto desc = MemRefDescriptor::undef(rewriter, loc, llvmTargetDescriptorTy);
8563a577f54SChristian Sigg     Type llvmTargetElementTy = desc.getElementPtrType();
8575c0c51a9SNicolas Vasilache     // Set allocated ptr.
858e62a6956SRiver Riddle     Value allocated = sourceMemRef.allocatedPtr(rewriter, loc);
8595c0c51a9SNicolas Vasilache     allocated =
8605c0c51a9SNicolas Vasilache         rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, allocated);
8615c0c51a9SNicolas Vasilache     desc.setAllocatedPtr(rewriter, loc, allocated);
8625c0c51a9SNicolas Vasilache     // Set aligned ptr.
863e62a6956SRiver Riddle     Value ptr = sourceMemRef.alignedPtr(rewriter, loc);
8645c0c51a9SNicolas Vasilache     ptr = rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, ptr);
8655c0c51a9SNicolas Vasilache     desc.setAlignedPtr(rewriter, loc, ptr);
8665c0c51a9SNicolas Vasilache     // Fill offset 0.
8675c0c51a9SNicolas Vasilache     auto attr = rewriter.getIntegerAttr(rewriter.getIndexType(), 0);
8685c0c51a9SNicolas Vasilache     auto zero = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, attr);
8695c0c51a9SNicolas Vasilache     desc.setOffset(rewriter, loc, zero);
8705c0c51a9SNicolas Vasilache 
8715c0c51a9SNicolas Vasilache     // Fill size and stride descriptors in memref.
8725c0c51a9SNicolas Vasilache     for (auto indexedSize : llvm::enumerate(targetMemRefType.getShape())) {
8735c0c51a9SNicolas Vasilache       int64_t index = indexedSize.index();
8745c0c51a9SNicolas Vasilache       auto sizeAttr =
8755c0c51a9SNicolas Vasilache           rewriter.getIntegerAttr(rewriter.getIndexType(), indexedSize.value());
8765c0c51a9SNicolas Vasilache       auto size = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, sizeAttr);
8775c0c51a9SNicolas Vasilache       desc.setSize(rewriter, loc, index, size);
87830e6033bSNicolas Vasilache       auto strideAttr = rewriter.getIntegerAttr(rewriter.getIndexType(),
87930e6033bSNicolas Vasilache                                                 (*targetStrides)[index]);
8805c0c51a9SNicolas Vasilache       auto stride = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, strideAttr);
8815c0c51a9SNicolas Vasilache       desc.setStride(rewriter, loc, index, stride);
8825c0c51a9SNicolas Vasilache     }
8835c0c51a9SNicolas Vasilache 
884563879b6SRahul Joshi     rewriter.replaceOp(castOp, {desc});
8853145427dSRiver Riddle     return success();
8865c0c51a9SNicolas Vasilache   }
8875c0c51a9SNicolas Vasilache };
8885c0c51a9SNicolas Vasilache 
889563879b6SRahul Joshi class VectorPrintOpConversion : public ConvertOpToLLVMPattern<vector::PrintOp> {
890d9b500d3SAart Bik public:
891563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::PrintOp>::ConvertOpToLLVMPattern;
892d9b500d3SAart Bik 
893d9b500d3SAart Bik   // Proof-of-concept lowering implementation that relies on a small
894d9b500d3SAart Bik   // runtime support library, which only needs to provide a few
895d9b500d3SAart Bik   // printing methods (single value for all data types, opening/closing
896d9b500d3SAart Bik   // bracket, comma, newline). The lowering fully unrolls a vector
897d9b500d3SAart Bik   // in terms of these elementary printing operations. The advantage
898d9b500d3SAart Bik   // of this approach is that the library can remain unaware of all
899d9b500d3SAart Bik   // low-level implementation details of vectors while still supporting
900d9b500d3SAart Bik   // output of any shaped and dimensioned vector. Due to full unrolling,
901d9b500d3SAart Bik   // this approach is less suited for very large vectors though.
902d9b500d3SAart Bik   //
9039db53a18SRiver Riddle   // TODO: rely solely on libc in future? something else?
904d9b500d3SAart Bik   //
9053145427dSRiver Riddle   LogicalResult
906ef976337SRiver Riddle   matchAndRewrite(vector::PrintOp printOp, OpAdaptor adaptor,
907d9b500d3SAart Bik                   ConversionPatternRewriter &rewriter) const override {
908d9b500d3SAart Bik     Type printType = printOp.getPrintType();
909d9b500d3SAart Bik 
910dcec2ca5SChristian Sigg     if (typeConverter->convertType(printType) == nullptr)
9113145427dSRiver Riddle       return failure();
912d9b500d3SAart Bik 
913b8880f5fSAart Bik     // Make sure element type has runtime support.
914b8880f5fSAart Bik     PrintConversion conversion = PrintConversion::None;
915d9b500d3SAart Bik     VectorType vectorType = printType.dyn_cast<VectorType>();
916d9b500d3SAart Bik     Type eltType = vectorType ? vectorType.getElementType() : printType;
917d9b500d3SAart Bik     Operation *printer;
918b8880f5fSAart Bik     if (eltType.isF32()) {
919e332c22cSNicolas Vasilache       printer =
920e332c22cSNicolas Vasilache           LLVM::lookupOrCreatePrintF32Fn(printOp->getParentOfType<ModuleOp>());
921b8880f5fSAart Bik     } else if (eltType.isF64()) {
922e332c22cSNicolas Vasilache       printer =
923e332c22cSNicolas Vasilache           LLVM::lookupOrCreatePrintF64Fn(printOp->getParentOfType<ModuleOp>());
92454759cefSAart Bik     } else if (eltType.isIndex()) {
925e332c22cSNicolas Vasilache       printer =
926e332c22cSNicolas Vasilache           LLVM::lookupOrCreatePrintU64Fn(printOp->getParentOfType<ModuleOp>());
927b8880f5fSAart Bik     } else if (auto intTy = eltType.dyn_cast<IntegerType>()) {
928b8880f5fSAart Bik       // Integers need a zero or sign extension on the operand
929b8880f5fSAart Bik       // (depending on the source type) as well as a signed or
930b8880f5fSAart Bik       // unsigned print method. Up to 64-bit is supported.
931b8880f5fSAart Bik       unsigned width = intTy.getWidth();
932b8880f5fSAart Bik       if (intTy.isUnsigned()) {
93354759cefSAart Bik         if (width <= 64) {
934b8880f5fSAart Bik           if (width < 64)
935b8880f5fSAart Bik             conversion = PrintConversion::ZeroExt64;
936e332c22cSNicolas Vasilache           printer = LLVM::lookupOrCreatePrintU64Fn(
937e332c22cSNicolas Vasilache               printOp->getParentOfType<ModuleOp>());
938b8880f5fSAart Bik         } else {
9393145427dSRiver Riddle           return failure();
940b8880f5fSAart Bik         }
941b8880f5fSAart Bik       } else {
942b8880f5fSAart Bik         assert(intTy.isSignless() || intTy.isSigned());
94354759cefSAart Bik         if (width <= 64) {
944b8880f5fSAart Bik           // Note that we *always* zero extend booleans (1-bit integers),
945b8880f5fSAart Bik           // so that true/false is printed as 1/0 rather than -1/0.
946b8880f5fSAart Bik           if (width == 1)
94754759cefSAart Bik             conversion = PrintConversion::ZeroExt64;
94854759cefSAart Bik           else if (width < 64)
949b8880f5fSAart Bik             conversion = PrintConversion::SignExt64;
950e332c22cSNicolas Vasilache           printer = LLVM::lookupOrCreatePrintI64Fn(
951e332c22cSNicolas Vasilache               printOp->getParentOfType<ModuleOp>());
952b8880f5fSAart Bik         } else {
953b8880f5fSAart Bik           return failure();
954b8880f5fSAart Bik         }
955b8880f5fSAart Bik       }
956b8880f5fSAart Bik     } else {
957b8880f5fSAart Bik       return failure();
958b8880f5fSAart Bik     }
959d9b500d3SAart Bik 
960d9b500d3SAart Bik     // Unroll vector into elementary print calls.
961b8880f5fSAart Bik     int64_t rank = vectorType ? vectorType.getRank() : 0;
962563879b6SRahul Joshi     emitRanks(rewriter, printOp, adaptor.source(), vectorType, printer, rank,
963b8880f5fSAart Bik               conversion);
964e332c22cSNicolas Vasilache     emitCall(rewriter, printOp->getLoc(),
965e332c22cSNicolas Vasilache              LLVM::lookupOrCreatePrintNewlineFn(
966e332c22cSNicolas Vasilache                  printOp->getParentOfType<ModuleOp>()));
967563879b6SRahul Joshi     rewriter.eraseOp(printOp);
9683145427dSRiver Riddle     return success();
969d9b500d3SAart Bik   }
970d9b500d3SAart Bik 
971d9b500d3SAart Bik private:
972b8880f5fSAart Bik   enum class PrintConversion {
97330e6033bSNicolas Vasilache     // clang-format off
974b8880f5fSAart Bik     None,
975b8880f5fSAart Bik     ZeroExt64,
976b8880f5fSAart Bik     SignExt64
97730e6033bSNicolas Vasilache     // clang-format on
978b8880f5fSAart Bik   };
979b8880f5fSAart Bik 
980d9b500d3SAart Bik   void emitRanks(ConversionPatternRewriter &rewriter, Operation *op,
981e62a6956SRiver Riddle                  Value value, VectorType vectorType, Operation *printer,
982b8880f5fSAart Bik                  int64_t rank, PrintConversion conversion) const {
983d9b500d3SAart Bik     Location loc = op->getLoc();
984d9b500d3SAart Bik     if (rank == 0) {
985b8880f5fSAart Bik       switch (conversion) {
986b8880f5fSAart Bik       case PrintConversion::ZeroExt64:
987a54f4eaeSMogball         value = rewriter.create<arith::ExtUIOp>(
9882230bf99SAlex Zinenko             loc, value, IntegerType::get(rewriter.getContext(), 64));
989b8880f5fSAart Bik         break;
990b8880f5fSAart Bik       case PrintConversion::SignExt64:
991a54f4eaeSMogball         value = rewriter.create<arith::ExtSIOp>(
9922230bf99SAlex Zinenko             loc, value, IntegerType::get(rewriter.getContext(), 64));
993b8880f5fSAart Bik         break;
994b8880f5fSAart Bik       case PrintConversion::None:
995b8880f5fSAart Bik         break;
996c9eeeb38Saartbik       }
997d9b500d3SAart Bik       emitCall(rewriter, loc, printer, value);
998d9b500d3SAart Bik       return;
999d9b500d3SAart Bik     }
1000d9b500d3SAart Bik 
1001e332c22cSNicolas Vasilache     emitCall(rewriter, loc,
1002e332c22cSNicolas Vasilache              LLVM::lookupOrCreatePrintOpenFn(op->getParentOfType<ModuleOp>()));
1003e332c22cSNicolas Vasilache     Operation *printComma =
1004e332c22cSNicolas Vasilache         LLVM::lookupOrCreatePrintCommaFn(op->getParentOfType<ModuleOp>());
1005d9b500d3SAart Bik     int64_t dim = vectorType.getDimSize(0);
1006d9b500d3SAart Bik     for (int64_t d = 0; d < dim; ++d) {
1007d9b500d3SAart Bik       auto reducedType =
1008d9b500d3SAart Bik           rank > 1 ? reducedVectorTypeFront(vectorType) : nullptr;
1009dcec2ca5SChristian Sigg       auto llvmType = typeConverter->convertType(
1010d9b500d3SAart Bik           rank > 1 ? reducedType : vectorType.getElementType());
1011dcec2ca5SChristian Sigg       Value nestedVal = extractOne(rewriter, *getTypeConverter(), loc, value,
1012dcec2ca5SChristian Sigg                                    llvmType, rank, d);
1013b8880f5fSAart Bik       emitRanks(rewriter, op, nestedVal, reducedType, printer, rank - 1,
1014b8880f5fSAart Bik                 conversion);
1015d9b500d3SAart Bik       if (d != dim - 1)
1016d9b500d3SAart Bik         emitCall(rewriter, loc, printComma);
1017d9b500d3SAart Bik     }
1018e332c22cSNicolas Vasilache     emitCall(rewriter, loc,
1019e332c22cSNicolas Vasilache              LLVM::lookupOrCreatePrintCloseFn(op->getParentOfType<ModuleOp>()));
1020d9b500d3SAart Bik   }
1021d9b500d3SAart Bik 
1022d9b500d3SAart Bik   // Helper to emit a call.
1023d9b500d3SAart Bik   static void emitCall(ConversionPatternRewriter &rewriter, Location loc,
1024d9b500d3SAart Bik                        Operation *ref, ValueRange params = ValueRange()) {
1025faf1c224SChris Lattner     rewriter.create<LLVM::CallOp>(loc, TypeRange(), SymbolRefAttr::get(ref),
1026faf1c224SChris Lattner                                   params);
1027d9b500d3SAart Bik   }
1028d9b500d3SAart Bik };
1029d9b500d3SAart Bik 
1030df186507SBenjamin Kramer } // namespace
1031df186507SBenjamin Kramer 
10325c0c51a9SNicolas Vasilache /// Populate the given list with patterns that convert from Vector to LLVM.
10335c0c51a9SNicolas Vasilache void mlir::populateVectorToLLVMConversionPatterns(
1034dc4e913bSChris Lattner     LLVMTypeConverter &converter, RewritePatternSet &patterns,
103565a3f289SMatthias Springer     bool reassociateFPReductions) {
103665678d93SNicolas Vasilache   MLIRContext *ctx = converter.getDialect()->getContext();
1037*eda2ebd7SNicolas Vasilache   patterns.add<VectorFMAOpNDRewritePattern>(ctx);
1038*eda2ebd7SNicolas Vasilache   populateVectorInsertExtractStridedSliceTransforms(patterns);
1039dc4e913bSChris Lattner   patterns.add<VectorReductionOpConversion>(converter, reassociateFPReductions);
10408345b86dSNicolas Vasilache   patterns
1041dc4e913bSChris Lattner       .add<VectorBitCastOpConversion, VectorShuffleOpConversion,
1042dc4e913bSChris Lattner            VectorExtractElementOpConversion, VectorExtractOpConversion,
1043dc4e913bSChris Lattner            VectorFMAOp1DConversion, VectorInsertElementOpConversion,
1044dc4e913bSChris Lattner            VectorInsertOpConversion, VectorPrintOpConversion,
104519dbb230Saartbik            VectorTypeCastOpConversion,
1046dc4e913bSChris Lattner            VectorLoadStoreConversion<vector::LoadOp, vector::LoadOpAdaptor>,
1047ee66e43aSDiego Caballero            VectorLoadStoreConversion<vector::MaskedLoadOp,
1048ee66e43aSDiego Caballero                                      vector::MaskedLoadOpAdaptor>,
1049dc4e913bSChris Lattner            VectorLoadStoreConversion<vector::StoreOp, vector::StoreOpAdaptor>,
1050ee66e43aSDiego Caballero            VectorLoadStoreConversion<vector::MaskedStoreOp,
1051ee66e43aSDiego Caballero                                      vector::MaskedStoreOpAdaptor>,
1052dc4e913bSChris Lattner            VectorGatherOpConversion, VectorScatterOpConversion,
1053d1a9e9a7SMatthias Springer            VectorExpandLoadOpConversion, VectorCompressStoreOpConversion>(
1054d1a9e9a7SMatthias Springer           converter);
1055d1a9e9a7SMatthias Springer   // Transfer ops with rank > 1 are handled by VectorToSCF.
1056d1a9e9a7SMatthias Springer   populateVectorTransferLoweringPatterns(patterns, /*maxTransferRank=*/1);
10575c0c51a9SNicolas Vasilache }
10585c0c51a9SNicolas Vasilache 
105963b683a8SNicolas Vasilache void mlir::populateVectorToLLVMMatrixConversionPatterns(
1060dc4e913bSChris Lattner     LLVMTypeConverter &converter, RewritePatternSet &patterns) {
1061dc4e913bSChris Lattner   patterns.add<VectorMatmulOpConversion>(converter);
1062dc4e913bSChris Lattner   patterns.add<VectorFlatTransposeOpConversion>(converter);
106363b683a8SNicolas Vasilache }
1064