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) {
60*cc311a15SMichal 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 
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     if (auto arrayType = llvmType.dyn_cast<LLVM::LLVMArrayType>())
5085a8a159bSMehdi Amini       eltType = arrayType.getElementType();
5095a8a159bSMehdi Amini     else
5105a8a159bSMehdi Amini       eltType = llvmType.cast<VectorType>().getElementType();
511e62a6956SRiver Riddle     Value insert = rewriter.create<LLVM::UndefOp>(loc, llvmType);
5121c81adf3SAart Bik     int64_t insPos = 0;
5131c81adf3SAart Bik     for (auto en : llvm::enumerate(maskArrayAttr)) {
5141c81adf3SAart Bik       int64_t extPos = en.value().cast<IntegerAttr>().getInt();
515e62a6956SRiver Riddle       Value value = adaptor.v1();
5161c81adf3SAart Bik       if (extPos >= v1Dim) {
5171c81adf3SAart Bik         extPos -= v1Dim;
5181c81adf3SAart Bik         value = adaptor.v2();
519b36aaeafSAart Bik       }
520dcec2ca5SChristian Sigg       Value extract = extractOne(rewriter, *getTypeConverter(), loc, value,
5215a8a159bSMehdi Amini                                  eltType, rank, extPos);
522dcec2ca5SChristian Sigg       insert = insertOne(rewriter, *getTypeConverter(), loc, insert, extract,
5230f04384dSAlex Zinenko                          llvmType, rank, insPos++);
5241c81adf3SAart Bik     }
525563879b6SRahul Joshi     rewriter.replaceOp(shuffleOp, insert);
5263145427dSRiver Riddle     return success();
527b36aaeafSAart Bik   }
528b36aaeafSAart Bik };
529b36aaeafSAart Bik 
530563879b6SRahul Joshi class VectorExtractElementOpConversion
531563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::ExtractElementOp> {
532cd5dab8aSAart Bik public:
533563879b6SRahul Joshi   using ConvertOpToLLVMPattern<
534563879b6SRahul Joshi       vector::ExtractElementOp>::ConvertOpToLLVMPattern;
535cd5dab8aSAart Bik 
5363145427dSRiver Riddle   LogicalResult
537ef976337SRiver Riddle   matchAndRewrite(vector::ExtractElementOp extractEltOp, OpAdaptor adaptor,
538cd5dab8aSAart Bik                   ConversionPatternRewriter &rewriter) const override {
539cd5dab8aSAart Bik     auto vectorType = extractEltOp.getVectorType();
540dcec2ca5SChristian Sigg     auto llvmType = typeConverter->convertType(vectorType.getElementType());
541cd5dab8aSAart Bik 
542cd5dab8aSAart Bik     // Bail if result type cannot be lowered.
543cd5dab8aSAart Bik     if (!llvmType)
5443145427dSRiver Riddle       return failure();
545cd5dab8aSAart Bik 
546e7026abaSNicolas Vasilache     if (vectorType.getRank() == 0) {
547e7026abaSNicolas Vasilache       Location loc = extractEltOp.getLoc();
548e7026abaSNicolas Vasilache       auto idxType = rewriter.getIndexType();
549e7026abaSNicolas Vasilache       auto zero = rewriter.create<LLVM::ConstantOp>(
550e7026abaSNicolas Vasilache           loc, typeConverter->convertType(idxType),
551e7026abaSNicolas Vasilache           rewriter.getIntegerAttr(idxType, 0));
552e7026abaSNicolas Vasilache       rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>(
553e7026abaSNicolas Vasilache           extractEltOp, llvmType, adaptor.vector(), zero);
554e7026abaSNicolas Vasilache       return success();
555e7026abaSNicolas Vasilache     }
556e7026abaSNicolas Vasilache 
557cd5dab8aSAart Bik     rewriter.replaceOpWithNewOp<LLVM::ExtractElementOp>(
558563879b6SRahul Joshi         extractEltOp, llvmType, adaptor.vector(), adaptor.position());
5593145427dSRiver Riddle     return success();
560cd5dab8aSAart Bik   }
561cd5dab8aSAart Bik };
562cd5dab8aSAart Bik 
563563879b6SRahul Joshi class VectorExtractOpConversion
564563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::ExtractOp> {
5655c0c51a9SNicolas Vasilache public:
566563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::ExtractOp>::ConvertOpToLLVMPattern;
5675c0c51a9SNicolas Vasilache 
5683145427dSRiver Riddle   LogicalResult
569ef976337SRiver Riddle   matchAndRewrite(vector::ExtractOp extractOp, OpAdaptor adaptor,
5705c0c51a9SNicolas Vasilache                   ConversionPatternRewriter &rewriter) const override {
571563879b6SRahul Joshi     auto loc = extractOp->getLoc();
5729826fe5cSAart Bik     auto vectorType = extractOp.getVectorType();
5732bdf33ccSRiver Riddle     auto resultType = extractOp.getResult().getType();
574dcec2ca5SChristian Sigg     auto llvmResultType = typeConverter->convertType(resultType);
5755c0c51a9SNicolas Vasilache     auto positionArrayAttr = extractOp.position();
5769826fe5cSAart Bik 
5779826fe5cSAart Bik     // Bail if result type cannot be lowered.
5789826fe5cSAart Bik     if (!llvmResultType)
5793145427dSRiver Riddle       return failure();
5809826fe5cSAart Bik 
581864adf39SMatthias Springer     // Extract entire vector. Should be handled by folder, but just to be safe.
582864adf39SMatthias Springer     if (positionArrayAttr.empty()) {
583864adf39SMatthias Springer       rewriter.replaceOp(extractOp, adaptor.vector());
584864adf39SMatthias Springer       return success();
585864adf39SMatthias Springer     }
586864adf39SMatthias Springer 
5875c0c51a9SNicolas Vasilache     // One-shot extraction of vector from array (only requires extractvalue).
5885c0c51a9SNicolas Vasilache     if (resultType.isa<VectorType>()) {
589e62a6956SRiver Riddle       Value extracted = rewriter.create<LLVM::ExtractValueOp>(
5905c0c51a9SNicolas Vasilache           loc, llvmResultType, adaptor.vector(), positionArrayAttr);
591563879b6SRahul Joshi       rewriter.replaceOp(extractOp, extracted);
5923145427dSRiver Riddle       return success();
5935c0c51a9SNicolas Vasilache     }
5945c0c51a9SNicolas Vasilache 
5959826fe5cSAart Bik     // Potential extraction of 1-D vector from array.
596563879b6SRahul Joshi     auto *context = extractOp->getContext();
597e62a6956SRiver Riddle     Value extracted = adaptor.vector();
5985c0c51a9SNicolas Vasilache     auto positionAttrs = positionArrayAttr.getValue();
5995c0c51a9SNicolas Vasilache     if (positionAttrs.size() > 1) {
6009826fe5cSAart Bik       auto oneDVectorType = reducedVectorTypeBack(vectorType);
6015c0c51a9SNicolas Vasilache       auto nMinusOnePositionAttrs =
602c2c83e97STres Popp           ArrayAttr::get(context, positionAttrs.drop_back());
6035c0c51a9SNicolas Vasilache       extracted = rewriter.create<LLVM::ExtractValueOp>(
604dcec2ca5SChristian Sigg           loc, typeConverter->convertType(oneDVectorType), extracted,
6055c0c51a9SNicolas Vasilache           nMinusOnePositionAttrs);
6065c0c51a9SNicolas Vasilache     }
6075c0c51a9SNicolas Vasilache 
6085c0c51a9SNicolas Vasilache     // Remaining extraction of element from 1-D LLVM vector
6095c0c51a9SNicolas Vasilache     auto position = positionAttrs.back().cast<IntegerAttr>();
6102230bf99SAlex Zinenko     auto i64Type = IntegerType::get(rewriter.getContext(), 64);
6111d47564aSAart Bik     auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position);
6125c0c51a9SNicolas Vasilache     extracted =
6135c0c51a9SNicolas Vasilache         rewriter.create<LLVM::ExtractElementOp>(loc, extracted, constant);
614563879b6SRahul Joshi     rewriter.replaceOp(extractOp, extracted);
6155c0c51a9SNicolas Vasilache 
6163145427dSRiver Riddle     return success();
6175c0c51a9SNicolas Vasilache   }
6185c0c51a9SNicolas Vasilache };
6195c0c51a9SNicolas Vasilache 
620681f929fSNicolas Vasilache /// Conversion pattern that turns a vector.fma on a 1-D vector
621681f929fSNicolas Vasilache /// into an llvm.intr.fmuladd. This is a trivial 1-1 conversion.
622681f929fSNicolas Vasilache /// This does not match vectors of n >= 2 rank.
623681f929fSNicolas Vasilache ///
624681f929fSNicolas Vasilache /// Example:
625681f929fSNicolas Vasilache /// ```
626681f929fSNicolas Vasilache ///  vector.fma %a, %a, %a : vector<8xf32>
627681f929fSNicolas Vasilache /// ```
628681f929fSNicolas Vasilache /// is converted to:
629681f929fSNicolas Vasilache /// ```
6303bffe602SBenjamin Kramer ///  llvm.intr.fmuladd %va, %va, %va:
631dd5165a9SAlex Zinenko ///    (!llvm."<8 x f32>">, !llvm<"<8 x f32>">, !llvm<"<8 x f32>">)
632dd5165a9SAlex Zinenko ///    -> !llvm."<8 x f32>">
633681f929fSNicolas Vasilache /// ```
634563879b6SRahul Joshi class VectorFMAOp1DConversion : public ConvertOpToLLVMPattern<vector::FMAOp> {
635681f929fSNicolas Vasilache public:
636563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::FMAOp>::ConvertOpToLLVMPattern;
637681f929fSNicolas Vasilache 
6383145427dSRiver Riddle   LogicalResult
639ef976337SRiver Riddle   matchAndRewrite(vector::FMAOp fmaOp, OpAdaptor adaptor,
640681f929fSNicolas Vasilache                   ConversionPatternRewriter &rewriter) const override {
641681f929fSNicolas Vasilache     VectorType vType = fmaOp.getVectorType();
642681f929fSNicolas Vasilache     if (vType.getRank() != 1)
6433145427dSRiver Riddle       return failure();
644563879b6SRahul Joshi     rewriter.replaceOpWithNewOp<LLVM::FMulAddOp>(fmaOp, adaptor.lhs(),
6453bffe602SBenjamin Kramer                                                  adaptor.rhs(), adaptor.acc());
6463145427dSRiver Riddle     return success();
647681f929fSNicolas Vasilache   }
648681f929fSNicolas Vasilache };
649681f929fSNicolas Vasilache 
650563879b6SRahul Joshi class VectorInsertElementOpConversion
651563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::InsertElementOp> {
652cd5dab8aSAart Bik public:
653563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::InsertElementOp>::ConvertOpToLLVMPattern;
654cd5dab8aSAart Bik 
6553145427dSRiver Riddle   LogicalResult
656ef976337SRiver Riddle   matchAndRewrite(vector::InsertElementOp insertEltOp, OpAdaptor adaptor,
657cd5dab8aSAart Bik                   ConversionPatternRewriter &rewriter) const override {
658cd5dab8aSAart Bik     auto vectorType = insertEltOp.getDestVectorType();
659dcec2ca5SChristian Sigg     auto llvmType = typeConverter->convertType(vectorType);
660cd5dab8aSAart Bik 
661cd5dab8aSAart Bik     // Bail if result type cannot be lowered.
662cd5dab8aSAart Bik     if (!llvmType)
6633145427dSRiver Riddle       return failure();
664cd5dab8aSAart Bik 
6653ff4e5f2SNicolas Vasilache     if (vectorType.getRank() == 0) {
6663ff4e5f2SNicolas Vasilache       Location loc = insertEltOp.getLoc();
6673ff4e5f2SNicolas Vasilache       auto idxType = rewriter.getIndexType();
6683ff4e5f2SNicolas Vasilache       auto zero = rewriter.create<LLVM::ConstantOp>(
6693ff4e5f2SNicolas Vasilache           loc, typeConverter->convertType(idxType),
6703ff4e5f2SNicolas Vasilache           rewriter.getIntegerAttr(idxType, 0));
6713ff4e5f2SNicolas Vasilache       rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>(
6723ff4e5f2SNicolas Vasilache           insertEltOp, llvmType, adaptor.dest(), adaptor.source(), zero);
6733ff4e5f2SNicolas Vasilache       return success();
6743ff4e5f2SNicolas Vasilache     }
6753ff4e5f2SNicolas Vasilache 
676cd5dab8aSAart Bik     rewriter.replaceOpWithNewOp<LLVM::InsertElementOp>(
677563879b6SRahul Joshi         insertEltOp, llvmType, adaptor.dest(), adaptor.source(),
678563879b6SRahul Joshi         adaptor.position());
6793145427dSRiver Riddle     return success();
680cd5dab8aSAart Bik   }
681cd5dab8aSAart Bik };
682cd5dab8aSAart Bik 
683563879b6SRahul Joshi class VectorInsertOpConversion
684563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::InsertOp> {
6859826fe5cSAart Bik public:
686563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::InsertOp>::ConvertOpToLLVMPattern;
6879826fe5cSAart Bik 
6883145427dSRiver Riddle   LogicalResult
689ef976337SRiver Riddle   matchAndRewrite(vector::InsertOp insertOp, OpAdaptor adaptor,
6909826fe5cSAart Bik                   ConversionPatternRewriter &rewriter) const override {
691563879b6SRahul Joshi     auto loc = insertOp->getLoc();
6929826fe5cSAart Bik     auto sourceType = insertOp.getSourceType();
6939826fe5cSAart Bik     auto destVectorType = insertOp.getDestVectorType();
694dcec2ca5SChristian Sigg     auto llvmResultType = typeConverter->convertType(destVectorType);
6959826fe5cSAart Bik     auto positionArrayAttr = insertOp.position();
6969826fe5cSAart Bik 
6979826fe5cSAart Bik     // Bail if result type cannot be lowered.
6989826fe5cSAart Bik     if (!llvmResultType)
6993145427dSRiver Riddle       return failure();
7009826fe5cSAart Bik 
701864adf39SMatthias Springer     // Overwrite entire vector with value. Should be handled by folder, but
702864adf39SMatthias Springer     // just to be safe.
703864adf39SMatthias Springer     if (positionArrayAttr.empty()) {
704864adf39SMatthias Springer       rewriter.replaceOp(insertOp, adaptor.source());
705864adf39SMatthias Springer       return success();
706864adf39SMatthias Springer     }
707864adf39SMatthias Springer 
7089826fe5cSAart Bik     // One-shot insertion of a vector into an array (only requires insertvalue).
7099826fe5cSAart Bik     if (sourceType.isa<VectorType>()) {
710e62a6956SRiver Riddle       Value inserted = rewriter.create<LLVM::InsertValueOp>(
7119826fe5cSAart Bik           loc, llvmResultType, adaptor.dest(), adaptor.source(),
7129826fe5cSAart Bik           positionArrayAttr);
713563879b6SRahul Joshi       rewriter.replaceOp(insertOp, inserted);
7143145427dSRiver Riddle       return success();
7159826fe5cSAart Bik     }
7169826fe5cSAart Bik 
7179826fe5cSAart Bik     // Potential extraction of 1-D vector from array.
718563879b6SRahul Joshi     auto *context = insertOp->getContext();
719e62a6956SRiver Riddle     Value extracted = adaptor.dest();
7209826fe5cSAart Bik     auto positionAttrs = positionArrayAttr.getValue();
7219826fe5cSAart Bik     auto position = positionAttrs.back().cast<IntegerAttr>();
7229826fe5cSAart Bik     auto oneDVectorType = destVectorType;
7239826fe5cSAart Bik     if (positionAttrs.size() > 1) {
7249826fe5cSAart Bik       oneDVectorType = reducedVectorTypeBack(destVectorType);
7259826fe5cSAart Bik       auto nMinusOnePositionAttrs =
726c2c83e97STres Popp           ArrayAttr::get(context, positionAttrs.drop_back());
7279826fe5cSAart Bik       extracted = rewriter.create<LLVM::ExtractValueOp>(
728dcec2ca5SChristian Sigg           loc, typeConverter->convertType(oneDVectorType), extracted,
7299826fe5cSAart Bik           nMinusOnePositionAttrs);
7309826fe5cSAart Bik     }
7319826fe5cSAart Bik 
7329826fe5cSAart Bik     // Insertion of an element into a 1-D LLVM vector.
7332230bf99SAlex Zinenko     auto i64Type = IntegerType::get(rewriter.getContext(), 64);
7341d47564aSAart Bik     auto constant = rewriter.create<LLVM::ConstantOp>(loc, i64Type, position);
735e62a6956SRiver Riddle     Value inserted = rewriter.create<LLVM::InsertElementOp>(
736dcec2ca5SChristian Sigg         loc, typeConverter->convertType(oneDVectorType), extracted,
7370f04384dSAlex Zinenko         adaptor.source(), constant);
7389826fe5cSAart Bik 
7399826fe5cSAart Bik     // Potential insertion of resulting 1-D vector into array.
7409826fe5cSAart Bik     if (positionAttrs.size() > 1) {
7419826fe5cSAart Bik       auto nMinusOnePositionAttrs =
742c2c83e97STres Popp           ArrayAttr::get(context, positionAttrs.drop_back());
7439826fe5cSAart Bik       inserted = rewriter.create<LLVM::InsertValueOp>(loc, llvmResultType,
7449826fe5cSAart Bik                                                       adaptor.dest(), inserted,
7459826fe5cSAart Bik                                                       nMinusOnePositionAttrs);
7469826fe5cSAart Bik     }
7479826fe5cSAart Bik 
748563879b6SRahul Joshi     rewriter.replaceOp(insertOp, inserted);
7493145427dSRiver Riddle     return success();
7509826fe5cSAart Bik   }
7519826fe5cSAart Bik };
7529826fe5cSAart Bik 
753681f929fSNicolas Vasilache /// Rank reducing rewrite for n-D FMA into (n-1)-D FMA where n > 1.
754681f929fSNicolas Vasilache ///
755681f929fSNicolas Vasilache /// Example:
756681f929fSNicolas Vasilache /// ```
757681f929fSNicolas Vasilache ///   %d = vector.fma %a, %b, %c : vector<2x4xf32>
758681f929fSNicolas Vasilache /// ```
759681f929fSNicolas Vasilache /// is rewritten into:
760681f929fSNicolas Vasilache /// ```
761681f929fSNicolas Vasilache ///  %r = splat %f0: vector<2x4xf32>
762681f929fSNicolas Vasilache ///  %va = vector.extractvalue %a[0] : vector<2x4xf32>
763681f929fSNicolas Vasilache ///  %vb = vector.extractvalue %b[0] : vector<2x4xf32>
764681f929fSNicolas Vasilache ///  %vc = vector.extractvalue %c[0] : vector<2x4xf32>
765681f929fSNicolas Vasilache ///  %vd = vector.fma %va, %vb, %vc : vector<4xf32>
766681f929fSNicolas Vasilache ///  %r2 = vector.insertvalue %vd, %r[0] : vector<4xf32> into vector<2x4xf32>
767681f929fSNicolas Vasilache ///  %va2 = vector.extractvalue %a2[1] : vector<2x4xf32>
768681f929fSNicolas Vasilache ///  %vb2 = vector.extractvalue %b2[1] : vector<2x4xf32>
769681f929fSNicolas Vasilache ///  %vc2 = vector.extractvalue %c2[1] : vector<2x4xf32>
770681f929fSNicolas Vasilache ///  %vd2 = vector.fma %va2, %vb2, %vc2 : vector<4xf32>
771681f929fSNicolas Vasilache ///  %r3 = vector.insertvalue %vd2, %r2[1] : vector<4xf32> into vector<2x4xf32>
772681f929fSNicolas Vasilache ///  // %r3 holds the final value.
773681f929fSNicolas Vasilache /// ```
774681f929fSNicolas Vasilache class VectorFMAOpNDRewritePattern : public OpRewritePattern<FMAOp> {
775681f929fSNicolas Vasilache public:
776681f929fSNicolas Vasilache   using OpRewritePattern<FMAOp>::OpRewritePattern;
777681f929fSNicolas Vasilache 
778ee80ffbfSNicolas Vasilache   void initialize() {
779ee80ffbfSNicolas Vasilache     // This pattern recursively unpacks one dimension at a time. The recursion
780ee80ffbfSNicolas Vasilache     // bounded as the rank is strictly decreasing.
781ee80ffbfSNicolas Vasilache     setHasBoundedRewriteRecursion();
782ee80ffbfSNicolas Vasilache   }
783ee80ffbfSNicolas Vasilache 
7843145427dSRiver Riddle   LogicalResult matchAndRewrite(FMAOp op,
785681f929fSNicolas Vasilache                                 PatternRewriter &rewriter) const override {
786681f929fSNicolas Vasilache     auto vType = op.getVectorType();
787681f929fSNicolas Vasilache     if (vType.getRank() < 2)
7883145427dSRiver Riddle       return failure();
789681f929fSNicolas Vasilache 
790681f929fSNicolas Vasilache     auto loc = op.getLoc();
791681f929fSNicolas Vasilache     auto elemType = vType.getElementType();
792a54f4eaeSMogball     Value zero = rewriter.create<arith::ConstantOp>(
793a54f4eaeSMogball         loc, elemType, rewriter.getZeroAttr(elemType));
794681f929fSNicolas Vasilache     Value desc = rewriter.create<SplatOp>(loc, vType, zero);
795681f929fSNicolas Vasilache     for (int64_t i = 0, e = vType.getShape().front(); i != e; ++i) {
796681f929fSNicolas Vasilache       Value extrLHS = rewriter.create<ExtractOp>(loc, op.lhs(), i);
797681f929fSNicolas Vasilache       Value extrRHS = rewriter.create<ExtractOp>(loc, op.rhs(), i);
798681f929fSNicolas Vasilache       Value extrACC = rewriter.create<ExtractOp>(loc, op.acc(), i);
799681f929fSNicolas Vasilache       Value fma = rewriter.create<FMAOp>(loc, extrLHS, extrRHS, extrACC);
800681f929fSNicolas Vasilache       desc = rewriter.create<InsertOp>(loc, fma, desc, i);
801681f929fSNicolas Vasilache     }
802681f929fSNicolas Vasilache     rewriter.replaceOp(op, desc);
8033145427dSRiver Riddle     return success();
804681f929fSNicolas Vasilache   }
805681f929fSNicolas Vasilache };
806681f929fSNicolas Vasilache 
80730e6033bSNicolas Vasilache /// Returns the strides if the memory underlying `memRefType` has a contiguous
80830e6033bSNicolas Vasilache /// static layout.
80930e6033bSNicolas Vasilache static llvm::Optional<SmallVector<int64_t, 4>>
81030e6033bSNicolas Vasilache computeContiguousStrides(MemRefType memRefType) {
8112bf491c7SBenjamin Kramer   int64_t offset;
81230e6033bSNicolas Vasilache   SmallVector<int64_t, 4> strides;
81330e6033bSNicolas Vasilache   if (failed(getStridesAndOffset(memRefType, strides, offset)))
81430e6033bSNicolas Vasilache     return None;
81530e6033bSNicolas Vasilache   if (!strides.empty() && strides.back() != 1)
81630e6033bSNicolas Vasilache     return None;
81730e6033bSNicolas Vasilache   // If no layout or identity layout, this is contiguous by definition.
818e41ebbecSVladislav Vinogradov   if (memRefType.getLayout().isIdentity())
81930e6033bSNicolas Vasilache     return strides;
82030e6033bSNicolas Vasilache 
82130e6033bSNicolas Vasilache   // Otherwise, we must determine contiguity form shapes. This can only ever
82230e6033bSNicolas Vasilache   // work in static cases because MemRefType is underspecified to represent
82330e6033bSNicolas Vasilache   // contiguous dynamic shapes in other ways than with just empty/identity
82430e6033bSNicolas Vasilache   // layout.
8252bf491c7SBenjamin Kramer   auto sizes = memRefType.getShape();
8265017b0f8SMatthias Springer   for (int index = 0, e = strides.size() - 1; index < e; ++index) {
82730e6033bSNicolas Vasilache     if (ShapedType::isDynamic(sizes[index + 1]) ||
82830e6033bSNicolas Vasilache         ShapedType::isDynamicStrideOrOffset(strides[index]) ||
82930e6033bSNicolas Vasilache         ShapedType::isDynamicStrideOrOffset(strides[index + 1]))
83030e6033bSNicolas Vasilache       return None;
83130e6033bSNicolas Vasilache     if (strides[index] != strides[index + 1] * sizes[index + 1])
83230e6033bSNicolas Vasilache       return None;
8332bf491c7SBenjamin Kramer   }
83430e6033bSNicolas Vasilache   return strides;
8352bf491c7SBenjamin Kramer }
8362bf491c7SBenjamin Kramer 
837563879b6SRahul Joshi class VectorTypeCastOpConversion
838563879b6SRahul Joshi     : public ConvertOpToLLVMPattern<vector::TypeCastOp> {
8395c0c51a9SNicolas Vasilache public:
840563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::TypeCastOp>::ConvertOpToLLVMPattern;
8415c0c51a9SNicolas Vasilache 
8423145427dSRiver Riddle   LogicalResult
843ef976337SRiver Riddle   matchAndRewrite(vector::TypeCastOp castOp, OpAdaptor adaptor,
8445c0c51a9SNicolas Vasilache                   ConversionPatternRewriter &rewriter) const override {
845563879b6SRahul Joshi     auto loc = castOp->getLoc();
8465c0c51a9SNicolas Vasilache     MemRefType sourceMemRefType =
8472bdf33ccSRiver Riddle         castOp.getOperand().getType().cast<MemRefType>();
8489eb3e564SChris Lattner     MemRefType targetMemRefType = castOp.getType();
8495c0c51a9SNicolas Vasilache 
8505c0c51a9SNicolas Vasilache     // Only static shape casts supported atm.
8515c0c51a9SNicolas Vasilache     if (!sourceMemRefType.hasStaticShape() ||
8525c0c51a9SNicolas Vasilache         !targetMemRefType.hasStaticShape())
8533145427dSRiver Riddle       return failure();
8545c0c51a9SNicolas Vasilache 
8555c0c51a9SNicolas Vasilache     auto llvmSourceDescriptorTy =
856ef976337SRiver Riddle         adaptor.getOperands()[0].getType().dyn_cast<LLVM::LLVMStructType>();
8578de43b92SAlex Zinenko     if (!llvmSourceDescriptorTy)
8583145427dSRiver Riddle       return failure();
859ef976337SRiver Riddle     MemRefDescriptor sourceMemRef(adaptor.getOperands()[0]);
8605c0c51a9SNicolas Vasilache 
861dcec2ca5SChristian Sigg     auto llvmTargetDescriptorTy = typeConverter->convertType(targetMemRefType)
8628de43b92SAlex Zinenko                                       .dyn_cast_or_null<LLVM::LLVMStructType>();
8638de43b92SAlex Zinenko     if (!llvmTargetDescriptorTy)
8643145427dSRiver Riddle       return failure();
8655c0c51a9SNicolas Vasilache 
86630e6033bSNicolas Vasilache     // Only contiguous source buffers supported atm.
86730e6033bSNicolas Vasilache     auto sourceStrides = computeContiguousStrides(sourceMemRefType);
86830e6033bSNicolas Vasilache     if (!sourceStrides)
86930e6033bSNicolas Vasilache       return failure();
87030e6033bSNicolas Vasilache     auto targetStrides = computeContiguousStrides(targetMemRefType);
87130e6033bSNicolas Vasilache     if (!targetStrides)
87230e6033bSNicolas Vasilache       return failure();
87330e6033bSNicolas Vasilache     // Only support static strides for now, regardless of contiguity.
87430e6033bSNicolas Vasilache     if (llvm::any_of(*targetStrides, [](int64_t stride) {
87530e6033bSNicolas Vasilache           return ShapedType::isDynamicStrideOrOffset(stride);
87630e6033bSNicolas Vasilache         }))
8773145427dSRiver Riddle       return failure();
8785c0c51a9SNicolas Vasilache 
8792230bf99SAlex Zinenko     auto int64Ty = IntegerType::get(rewriter.getContext(), 64);
8805c0c51a9SNicolas Vasilache 
8815c0c51a9SNicolas Vasilache     // Create descriptor.
8825c0c51a9SNicolas Vasilache     auto desc = MemRefDescriptor::undef(rewriter, loc, llvmTargetDescriptorTy);
8833a577f54SChristian Sigg     Type llvmTargetElementTy = desc.getElementPtrType();
8845c0c51a9SNicolas Vasilache     // Set allocated ptr.
885e62a6956SRiver Riddle     Value allocated = sourceMemRef.allocatedPtr(rewriter, loc);
8865c0c51a9SNicolas Vasilache     allocated =
8875c0c51a9SNicolas Vasilache         rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, allocated);
8885c0c51a9SNicolas Vasilache     desc.setAllocatedPtr(rewriter, loc, allocated);
8895c0c51a9SNicolas Vasilache     // Set aligned ptr.
890e62a6956SRiver Riddle     Value ptr = sourceMemRef.alignedPtr(rewriter, loc);
8915c0c51a9SNicolas Vasilache     ptr = rewriter.create<LLVM::BitcastOp>(loc, llvmTargetElementTy, ptr);
8925c0c51a9SNicolas Vasilache     desc.setAlignedPtr(rewriter, loc, ptr);
8935c0c51a9SNicolas Vasilache     // Fill offset 0.
8945c0c51a9SNicolas Vasilache     auto attr = rewriter.getIntegerAttr(rewriter.getIndexType(), 0);
8955c0c51a9SNicolas Vasilache     auto zero = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, attr);
8965c0c51a9SNicolas Vasilache     desc.setOffset(rewriter, loc, zero);
8975c0c51a9SNicolas Vasilache 
8985c0c51a9SNicolas Vasilache     // Fill size and stride descriptors in memref.
8995c0c51a9SNicolas Vasilache     for (auto indexedSize : llvm::enumerate(targetMemRefType.getShape())) {
9005c0c51a9SNicolas Vasilache       int64_t index = indexedSize.index();
9015c0c51a9SNicolas Vasilache       auto sizeAttr =
9025c0c51a9SNicolas Vasilache           rewriter.getIntegerAttr(rewriter.getIndexType(), indexedSize.value());
9035c0c51a9SNicolas Vasilache       auto size = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, sizeAttr);
9045c0c51a9SNicolas Vasilache       desc.setSize(rewriter, loc, index, size);
90530e6033bSNicolas Vasilache       auto strideAttr = rewriter.getIntegerAttr(rewriter.getIndexType(),
90630e6033bSNicolas Vasilache                                                 (*targetStrides)[index]);
9075c0c51a9SNicolas Vasilache       auto stride = rewriter.create<LLVM::ConstantOp>(loc, int64Ty, strideAttr);
9085c0c51a9SNicolas Vasilache       desc.setStride(rewriter, loc, index, stride);
9095c0c51a9SNicolas Vasilache     }
9105c0c51a9SNicolas Vasilache 
911563879b6SRahul Joshi     rewriter.replaceOp(castOp, {desc});
9123145427dSRiver Riddle     return success();
9135c0c51a9SNicolas Vasilache   }
9145c0c51a9SNicolas Vasilache };
9155c0c51a9SNicolas Vasilache 
916563879b6SRahul Joshi class VectorPrintOpConversion : public ConvertOpToLLVMPattern<vector::PrintOp> {
917d9b500d3SAart Bik public:
918563879b6SRahul Joshi   using ConvertOpToLLVMPattern<vector::PrintOp>::ConvertOpToLLVMPattern;
919d9b500d3SAart Bik 
920d9b500d3SAart Bik   // Proof-of-concept lowering implementation that relies on a small
921d9b500d3SAart Bik   // runtime support library, which only needs to provide a few
922d9b500d3SAart Bik   // printing methods (single value for all data types, opening/closing
923d9b500d3SAart Bik   // bracket, comma, newline). The lowering fully unrolls a vector
924d9b500d3SAart Bik   // in terms of these elementary printing operations. The advantage
925d9b500d3SAart Bik   // of this approach is that the library can remain unaware of all
926d9b500d3SAart Bik   // low-level implementation details of vectors while still supporting
927d9b500d3SAart Bik   // output of any shaped and dimensioned vector. Due to full unrolling,
928d9b500d3SAart Bik   // this approach is less suited for very large vectors though.
929d9b500d3SAart Bik   //
9309db53a18SRiver Riddle   // TODO: rely solely on libc in future? something else?
931d9b500d3SAart Bik   //
9323145427dSRiver Riddle   LogicalResult
933ef976337SRiver Riddle   matchAndRewrite(vector::PrintOp printOp, OpAdaptor adaptor,
934d9b500d3SAart Bik                   ConversionPatternRewriter &rewriter) const override {
935d9b500d3SAart Bik     Type printType = printOp.getPrintType();
936d9b500d3SAart Bik 
937dcec2ca5SChristian Sigg     if (typeConverter->convertType(printType) == nullptr)
9383145427dSRiver Riddle       return failure();
939d9b500d3SAart Bik 
940b8880f5fSAart Bik     // Make sure element type has runtime support.
941b8880f5fSAart Bik     PrintConversion conversion = PrintConversion::None;
942d9b500d3SAart Bik     VectorType vectorType = printType.dyn_cast<VectorType>();
943d9b500d3SAart Bik     Type eltType = vectorType ? vectorType.getElementType() : printType;
944d9b500d3SAart Bik     Operation *printer;
945b8880f5fSAart Bik     if (eltType.isF32()) {
946e332c22cSNicolas Vasilache       printer =
947e332c22cSNicolas Vasilache           LLVM::lookupOrCreatePrintF32Fn(printOp->getParentOfType<ModuleOp>());
948b8880f5fSAart Bik     } else if (eltType.isF64()) {
949e332c22cSNicolas Vasilache       printer =
950e332c22cSNicolas Vasilache           LLVM::lookupOrCreatePrintF64Fn(printOp->getParentOfType<ModuleOp>());
95154759cefSAart Bik     } else if (eltType.isIndex()) {
952e332c22cSNicolas Vasilache       printer =
953e332c22cSNicolas Vasilache           LLVM::lookupOrCreatePrintU64Fn(printOp->getParentOfType<ModuleOp>());
954b8880f5fSAart Bik     } else if (auto intTy = eltType.dyn_cast<IntegerType>()) {
955b8880f5fSAart Bik       // Integers need a zero or sign extension on the operand
956b8880f5fSAart Bik       // (depending on the source type) as well as a signed or
957b8880f5fSAart Bik       // unsigned print method. Up to 64-bit is supported.
958b8880f5fSAart Bik       unsigned width = intTy.getWidth();
959b8880f5fSAart Bik       if (intTy.isUnsigned()) {
96054759cefSAart Bik         if (width <= 64) {
961b8880f5fSAart Bik           if (width < 64)
962b8880f5fSAart Bik             conversion = PrintConversion::ZeroExt64;
963e332c22cSNicolas Vasilache           printer = LLVM::lookupOrCreatePrintU64Fn(
964e332c22cSNicolas Vasilache               printOp->getParentOfType<ModuleOp>());
965b8880f5fSAart Bik         } else {
9663145427dSRiver Riddle           return failure();
967b8880f5fSAart Bik         }
968b8880f5fSAart Bik       } else {
969b8880f5fSAart Bik         assert(intTy.isSignless() || intTy.isSigned());
97054759cefSAart Bik         if (width <= 64) {
971b8880f5fSAart Bik           // Note that we *always* zero extend booleans (1-bit integers),
972b8880f5fSAart Bik           // so that true/false is printed as 1/0 rather than -1/0.
973b8880f5fSAart Bik           if (width == 1)
97454759cefSAart Bik             conversion = PrintConversion::ZeroExt64;
97554759cefSAart Bik           else if (width < 64)
976b8880f5fSAart Bik             conversion = PrintConversion::SignExt64;
977e332c22cSNicolas Vasilache           printer = LLVM::lookupOrCreatePrintI64Fn(
978e332c22cSNicolas Vasilache               printOp->getParentOfType<ModuleOp>());
979b8880f5fSAart Bik         } else {
980b8880f5fSAart Bik           return failure();
981b8880f5fSAart Bik         }
982b8880f5fSAart Bik       }
983b8880f5fSAart Bik     } else {
984b8880f5fSAart Bik       return failure();
985b8880f5fSAart Bik     }
986d9b500d3SAart Bik 
987d9b500d3SAart Bik     // Unroll vector into elementary print calls.
988b8880f5fSAart Bik     int64_t rank = vectorType ? vectorType.getRank() : 0;
989*cc311a15SMichal Terepeta     Type type = vectorType ? vectorType : eltType;
990*cc311a15SMichal Terepeta     emitRanks(rewriter, printOp, adaptor.source(), type, printer, rank,
991b8880f5fSAart Bik               conversion);
992e332c22cSNicolas Vasilache     emitCall(rewriter, printOp->getLoc(),
993e332c22cSNicolas Vasilache              LLVM::lookupOrCreatePrintNewlineFn(
994e332c22cSNicolas Vasilache                  printOp->getParentOfType<ModuleOp>()));
995563879b6SRahul Joshi     rewriter.eraseOp(printOp);
9963145427dSRiver Riddle     return success();
997d9b500d3SAart Bik   }
998d9b500d3SAart Bik 
999d9b500d3SAart Bik private:
1000b8880f5fSAart Bik   enum class PrintConversion {
100130e6033bSNicolas Vasilache     // clang-format off
1002b8880f5fSAart Bik     None,
1003b8880f5fSAart Bik     ZeroExt64,
1004b8880f5fSAart Bik     SignExt64
100530e6033bSNicolas Vasilache     // clang-format on
1006b8880f5fSAart Bik   };
1007b8880f5fSAart Bik 
1008d9b500d3SAart Bik   void emitRanks(ConversionPatternRewriter &rewriter, Operation *op,
1009*cc311a15SMichal Terepeta                  Value value, Type type, Operation *printer, int64_t rank,
1010*cc311a15SMichal Terepeta                  PrintConversion conversion) const {
1011*cc311a15SMichal Terepeta     VectorType vectorType = type.dyn_cast<VectorType>();
1012d9b500d3SAart Bik     Location loc = op->getLoc();
1013*cc311a15SMichal Terepeta     if (!vectorType) {
1014*cc311a15SMichal Terepeta       assert(rank == 0 && "The scalar case expects rank == 0");
1015b8880f5fSAart Bik       switch (conversion) {
1016b8880f5fSAart Bik       case PrintConversion::ZeroExt64:
1017a54f4eaeSMogball         value = rewriter.create<arith::ExtUIOp>(
10182230bf99SAlex Zinenko             loc, value, IntegerType::get(rewriter.getContext(), 64));
1019b8880f5fSAart Bik         break;
1020b8880f5fSAart Bik       case PrintConversion::SignExt64:
1021a54f4eaeSMogball         value = rewriter.create<arith::ExtSIOp>(
10222230bf99SAlex Zinenko             loc, value, IntegerType::get(rewriter.getContext(), 64));
1023b8880f5fSAart Bik         break;
1024b8880f5fSAart Bik       case PrintConversion::None:
1025b8880f5fSAart Bik         break;
1026c9eeeb38Saartbik       }
1027d9b500d3SAart Bik       emitCall(rewriter, loc, printer, value);
1028d9b500d3SAart Bik       return;
1029d9b500d3SAart Bik     }
1030d9b500d3SAart Bik 
1031e332c22cSNicolas Vasilache     emitCall(rewriter, loc,
1032e332c22cSNicolas Vasilache              LLVM::lookupOrCreatePrintOpenFn(op->getParentOfType<ModuleOp>()));
1033e332c22cSNicolas Vasilache     Operation *printComma =
1034e332c22cSNicolas Vasilache         LLVM::lookupOrCreatePrintCommaFn(op->getParentOfType<ModuleOp>());
1035*cc311a15SMichal Terepeta 
1036*cc311a15SMichal Terepeta     if (rank <= 1) {
1037*cc311a15SMichal Terepeta       auto reducedType = vectorType.getElementType();
1038*cc311a15SMichal Terepeta       auto llvmType = typeConverter->convertType(reducedType);
1039*cc311a15SMichal Terepeta       int64_t dim = rank == 0 ? 1 : vectorType.getDimSize(0);
1040*cc311a15SMichal Terepeta       for (int64_t d = 0; d < dim; ++d) {
1041*cc311a15SMichal Terepeta         Value nestedVal = extractOne(rewriter, *getTypeConverter(), loc, value,
1042*cc311a15SMichal Terepeta                                      llvmType, /*rank=*/0, /*pos=*/d);
1043*cc311a15SMichal Terepeta         emitRanks(rewriter, op, nestedVal, reducedType, printer, /*rank=*/0,
1044*cc311a15SMichal Terepeta                   conversion);
1045*cc311a15SMichal Terepeta         if (d != dim - 1)
1046*cc311a15SMichal Terepeta           emitCall(rewriter, loc, printComma);
1047*cc311a15SMichal Terepeta       }
1048*cc311a15SMichal Terepeta       emitCall(
1049*cc311a15SMichal Terepeta           rewriter, loc,
1050*cc311a15SMichal Terepeta           LLVM::lookupOrCreatePrintCloseFn(op->getParentOfType<ModuleOp>()));
1051*cc311a15SMichal Terepeta       return;
1052*cc311a15SMichal Terepeta     }
1053*cc311a15SMichal Terepeta 
1054d9b500d3SAart Bik     int64_t dim = vectorType.getDimSize(0);
1055d9b500d3SAart Bik     for (int64_t d = 0; d < dim; ++d) {
1056*cc311a15SMichal Terepeta       auto reducedType = reducedVectorTypeFront(vectorType);
1057*cc311a15SMichal Terepeta       auto llvmType = typeConverter->convertType(reducedType);
1058dcec2ca5SChristian Sigg       Value nestedVal = extractOne(rewriter, *getTypeConverter(), loc, value,
1059dcec2ca5SChristian Sigg                                    llvmType, rank, d);
1060b8880f5fSAart Bik       emitRanks(rewriter, op, nestedVal, reducedType, printer, rank - 1,
1061b8880f5fSAart Bik                 conversion);
1062d9b500d3SAart Bik       if (d != dim - 1)
1063d9b500d3SAart Bik         emitCall(rewriter, loc, printComma);
1064d9b500d3SAart Bik     }
1065e332c22cSNicolas Vasilache     emitCall(rewriter, loc,
1066e332c22cSNicolas Vasilache              LLVM::lookupOrCreatePrintCloseFn(op->getParentOfType<ModuleOp>()));
1067d9b500d3SAart Bik   }
1068d9b500d3SAart Bik 
1069d9b500d3SAart Bik   // Helper to emit a call.
1070d9b500d3SAart Bik   static void emitCall(ConversionPatternRewriter &rewriter, Location loc,
1071d9b500d3SAart Bik                        Operation *ref, ValueRange params = ValueRange()) {
1072faf1c224SChris Lattner     rewriter.create<LLVM::CallOp>(loc, TypeRange(), SymbolRefAttr::get(ref),
1073faf1c224SChris Lattner                                   params);
1074d9b500d3SAart Bik   }
1075d9b500d3SAart Bik };
1076d9b500d3SAart Bik 
1077df186507SBenjamin Kramer } // namespace
1078df186507SBenjamin Kramer 
10795c0c51a9SNicolas Vasilache /// Populate the given list with patterns that convert from Vector to LLVM.
10805c0c51a9SNicolas Vasilache void mlir::populateVectorToLLVMConversionPatterns(
1081dc4e913bSChris Lattner     LLVMTypeConverter &converter, RewritePatternSet &patterns,
108265a3f289SMatthias Springer     bool reassociateFPReductions) {
108365678d93SNicolas Vasilache   MLIRContext *ctx = converter.getDialect()->getContext();
1084eda2ebd7SNicolas Vasilache   patterns.add<VectorFMAOpNDRewritePattern>(ctx);
1085eda2ebd7SNicolas Vasilache   populateVectorInsertExtractStridedSliceTransforms(patterns);
1086dc4e913bSChris Lattner   patterns.add<VectorReductionOpConversion>(converter, reassociateFPReductions);
10878345b86dSNicolas Vasilache   patterns
1088dc4e913bSChris Lattner       .add<VectorBitCastOpConversion, VectorShuffleOpConversion,
1089dc4e913bSChris Lattner            VectorExtractElementOpConversion, VectorExtractOpConversion,
1090dc4e913bSChris Lattner            VectorFMAOp1DConversion, VectorInsertElementOpConversion,
1091dc4e913bSChris Lattner            VectorInsertOpConversion, VectorPrintOpConversion,
109219dbb230Saartbik            VectorTypeCastOpConversion,
1093dc4e913bSChris Lattner            VectorLoadStoreConversion<vector::LoadOp, vector::LoadOpAdaptor>,
1094ee66e43aSDiego Caballero            VectorLoadStoreConversion<vector::MaskedLoadOp,
1095ee66e43aSDiego Caballero                                      vector::MaskedLoadOpAdaptor>,
1096dc4e913bSChris Lattner            VectorLoadStoreConversion<vector::StoreOp, vector::StoreOpAdaptor>,
1097ee66e43aSDiego Caballero            VectorLoadStoreConversion<vector::MaskedStoreOp,
1098ee66e43aSDiego Caballero                                      vector::MaskedStoreOpAdaptor>,
1099dc4e913bSChris Lattner            VectorGatherOpConversion, VectorScatterOpConversion,
1100d1a9e9a7SMatthias Springer            VectorExpandLoadOpConversion, VectorCompressStoreOpConversion>(
1101d1a9e9a7SMatthias Springer           converter);
1102d1a9e9a7SMatthias Springer   // Transfer ops with rank > 1 are handled by VectorToSCF.
1103d1a9e9a7SMatthias Springer   populateVectorTransferLoweringPatterns(patterns, /*maxTransferRank=*/1);
11045c0c51a9SNicolas Vasilache }
11055c0c51a9SNicolas Vasilache 
110663b683a8SNicolas Vasilache void mlir::populateVectorToLLVMMatrixConversionPatterns(
1107dc4e913bSChris Lattner     LLVMTypeConverter &converter, RewritePatternSet &patterns) {
1108dc4e913bSChris Lattner   patterns.add<VectorMatmulOpConversion>(converter);
1109dc4e913bSChris Lattner   patterns.add<VectorFlatTransposeOpConversion>(converter);
111063b683a8SNicolas Vasilache }
1111