| //===- Pattern.cpp - Conversion pattern to the LLVM dialect ---------------===// |
| // |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| // See https://llvm.org/LICENSE.txt for license information. |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
| // |
| //===----------------------------------------------------------------------===// |
| |
| #include "mlir/Conversion/LLVMCommon/Pattern.h" |
| #include "mlir/Dialect/LLVMIR/FunctionCallUtils.h" |
| #include "mlir/Dialect/LLVMIR/LLVMDialect.h" |
| #include "mlir/Dialect/LLVMIR/LLVMTypes.h" |
| #include "mlir/IR/AffineMap.h" |
| #include "mlir/IR/BuiltinAttributes.h" |
| |
| using namespace mlir; |
| |
| //===----------------------------------------------------------------------===// |
| // ConvertToLLVMPattern |
| //===----------------------------------------------------------------------===// |
| |
| ConvertToLLVMPattern::ConvertToLLVMPattern( |
| StringRef rootOpName, MLIRContext *context, |
| const LLVMTypeConverter &typeConverter, PatternBenefit benefit) |
| : ConversionPattern(typeConverter, rootOpName, benefit, context) {} |
| |
| const LLVMTypeConverter *ConvertToLLVMPattern::getTypeConverter() const { |
| return static_cast<const LLVMTypeConverter *>( |
| ConversionPattern::getTypeConverter()); |
| } |
| |
| LLVM::LLVMDialect &ConvertToLLVMPattern::getDialect() const { |
| return *getTypeConverter()->getDialect(); |
| } |
| |
| Type ConvertToLLVMPattern::getIndexType() const { |
| return getTypeConverter()->getIndexType(); |
| } |
| |
| Type ConvertToLLVMPattern::getIntPtrType(unsigned addressSpace) const { |
| return IntegerType::get(&getTypeConverter()->getContext(), |
| getTypeConverter()->getPointerBitwidth(addressSpace)); |
| } |
| |
| Type ConvertToLLVMPattern::getVoidType() const { |
| return LLVM::LLVMVoidType::get(&getTypeConverter()->getContext()); |
| } |
| |
| Type ConvertToLLVMPattern::getPtrType(unsigned addressSpace) const { |
| return LLVM::LLVMPointerType::get(&getTypeConverter()->getContext(), |
| addressSpace); |
| } |
| |
| Type ConvertToLLVMPattern::getVoidPtrType() const { return getPtrType(); } |
| |
| Value ConvertToLLVMPattern::createIndexAttrConstant(OpBuilder &builder, |
| Location loc, |
| Type resultType, |
| int64_t value) { |
| return builder.create<LLVM::ConstantOp>(loc, resultType, |
| builder.getIndexAttr(value)); |
| } |
| |
| Value ConvertToLLVMPattern::getStridedElementPtr( |
| ConversionPatternRewriter &rewriter, Location loc, MemRefType type, |
| Value memRefDesc, ValueRange indices, |
| LLVM::GEPNoWrapFlags noWrapFlags) const { |
| return LLVM::getStridedElementPtr(rewriter, loc, *getTypeConverter(), type, |
| memRefDesc, indices, noWrapFlags); |
| } |
| |
| // Check if the MemRefType `type` is supported by the lowering. We currently |
| // only support memrefs with identity maps. |
| bool ConvertToLLVMPattern::isConvertibleAndHasIdentityMaps( |
| MemRefType type) const { |
| if (!type.getLayout().isIdentity()) |
| return false; |
| return static_cast<bool>(typeConverter->convertType(type)); |
| } |
| |
| Type ConvertToLLVMPattern::getElementPtrType(MemRefType type) const { |
| auto addressSpace = getTypeConverter()->getMemRefAddressSpace(type); |
| if (failed(addressSpace)) |
| return {}; |
| return LLVM::LLVMPointerType::get(type.getContext(), *addressSpace); |
| } |
| |
| void ConvertToLLVMPattern::getMemRefDescriptorSizes( |
| Location loc, MemRefType memRefType, ValueRange dynamicSizes, |
| ConversionPatternRewriter &rewriter, SmallVectorImpl<Value> &sizes, |
| SmallVectorImpl<Value> &strides, Value &size, bool sizeInBytes) const { |
| assert(isConvertibleAndHasIdentityMaps(memRefType) && |
| "layout maps must have been normalized away"); |
| assert(count(memRefType.getShape(), ShapedType::kDynamic) == |
| static_cast<ssize_t>(dynamicSizes.size()) && |
| "dynamicSizes size doesn't match dynamic sizes count in memref shape"); |
| |
| sizes.reserve(memRefType.getRank()); |
| unsigned dynamicIndex = 0; |
| Type indexType = getIndexType(); |
| for (int64_t size : memRefType.getShape()) { |
| sizes.push_back( |
| size == ShapedType::kDynamic |
| ? dynamicSizes[dynamicIndex++] |
| : createIndexAttrConstant(rewriter, loc, indexType, size)); |
| } |
| |
| // Strides: iterate sizes in reverse order and multiply. |
| int64_t stride = 1; |
| Value runningStride = createIndexAttrConstant(rewriter, loc, indexType, 1); |
| strides.resize(memRefType.getRank()); |
| for (auto i = memRefType.getRank(); i-- > 0;) { |
| strides[i] = runningStride; |
| |
| int64_t staticSize = memRefType.getShape()[i]; |
| bool useSizeAsStride = stride == 1; |
| if (staticSize == ShapedType::kDynamic) |
| stride = ShapedType::kDynamic; |
| if (stride != ShapedType::kDynamic) |
| stride *= staticSize; |
| |
| if (useSizeAsStride) |
| runningStride = sizes[i]; |
| else if (stride == ShapedType::kDynamic) |
| runningStride = |
| rewriter.create<LLVM::MulOp>(loc, runningStride, sizes[i]); |
| else |
| runningStride = createIndexAttrConstant(rewriter, loc, indexType, stride); |
| } |
| if (sizeInBytes) { |
| // Buffer size in bytes. |
| Type elementType = typeConverter->convertType(memRefType.getElementType()); |
| auto elementPtrType = LLVM::LLVMPointerType::get(rewriter.getContext()); |
| Value nullPtr = rewriter.create<LLVM::ZeroOp>(loc, elementPtrType); |
| Value gepPtr = rewriter.create<LLVM::GEPOp>( |
| loc, elementPtrType, elementType, nullPtr, runningStride); |
| size = rewriter.create<LLVM::PtrToIntOp>(loc, getIndexType(), gepPtr); |
| } else { |
| size = runningStride; |
| } |
| } |
| |
| Value ConvertToLLVMPattern::getSizeInBytes( |
| Location loc, Type type, ConversionPatternRewriter &rewriter) const { |
| // Compute the size of an individual element. This emits the MLIR equivalent |
| // of the following sizeof(...) implementation in LLVM IR: |
| // %0 = getelementptr %elementType* null, %indexType 1 |
| // %1 = ptrtoint %elementType* %0 to %indexType |
| // which is a common pattern of getting the size of a type in bytes. |
| Type llvmType = typeConverter->convertType(type); |
| auto convertedPtrType = LLVM::LLVMPointerType::get(rewriter.getContext()); |
| auto nullPtr = rewriter.create<LLVM::ZeroOp>(loc, convertedPtrType); |
| auto gep = rewriter.create<LLVM::GEPOp>(loc, convertedPtrType, llvmType, |
| nullPtr, ArrayRef<LLVM::GEPArg>{1}); |
| return rewriter.create<LLVM::PtrToIntOp>(loc, getIndexType(), gep); |
| } |
| |
| Value ConvertToLLVMPattern::getNumElements( |
| Location loc, MemRefType memRefType, ValueRange dynamicSizes, |
| ConversionPatternRewriter &rewriter) const { |
| assert(count(memRefType.getShape(), ShapedType::kDynamic) == |
| static_cast<ssize_t>(dynamicSizes.size()) && |
| "dynamicSizes size doesn't match dynamic sizes count in memref shape"); |
| |
| Type indexType = getIndexType(); |
| Value numElements = memRefType.getRank() == 0 |
| ? createIndexAttrConstant(rewriter, loc, indexType, 1) |
| : nullptr; |
| unsigned dynamicIndex = 0; |
| |
| // Compute the total number of memref elements. |
| for (int64_t staticSize : memRefType.getShape()) { |
| if (numElements) { |
| Value size = |
| staticSize == ShapedType::kDynamic |
| ? dynamicSizes[dynamicIndex++] |
| : createIndexAttrConstant(rewriter, loc, indexType, staticSize); |
| numElements = rewriter.create<LLVM::MulOp>(loc, numElements, size); |
| } else { |
| numElements = |
| staticSize == ShapedType::kDynamic |
| ? dynamicSizes[dynamicIndex++] |
| : createIndexAttrConstant(rewriter, loc, indexType, staticSize); |
| } |
| } |
| return numElements; |
| } |
| |
| /// Creates and populates the memref descriptor struct given all its fields. |
| MemRefDescriptor ConvertToLLVMPattern::createMemRefDescriptor( |
| Location loc, MemRefType memRefType, Value allocatedPtr, Value alignedPtr, |
| ArrayRef<Value> sizes, ArrayRef<Value> strides, |
| ConversionPatternRewriter &rewriter) const { |
| auto structType = typeConverter->convertType(memRefType); |
| auto memRefDescriptor = MemRefDescriptor::poison(rewriter, loc, structType); |
| |
| // Field 1: Allocated pointer, used for malloc/free. |
| memRefDescriptor.setAllocatedPtr(rewriter, loc, allocatedPtr); |
| |
| // Field 2: Actual aligned pointer to payload. |
| memRefDescriptor.setAlignedPtr(rewriter, loc, alignedPtr); |
| |
| // Field 3: Offset in aligned pointer. |
| Type indexType = getIndexType(); |
| memRefDescriptor.setOffset( |
| rewriter, loc, createIndexAttrConstant(rewriter, loc, indexType, 0)); |
| |
| // Fields 4: Sizes. |
| for (const auto &en : llvm::enumerate(sizes)) |
| memRefDescriptor.setSize(rewriter, loc, en.index(), en.value()); |
| |
| // Field 5: Strides. |
| for (const auto &en : llvm::enumerate(strides)) |
| memRefDescriptor.setStride(rewriter, loc, en.index(), en.value()); |
| |
| return memRefDescriptor; |
| } |
| |
| LogicalResult ConvertToLLVMPattern::copyUnrankedDescriptors( |
| OpBuilder &builder, Location loc, TypeRange origTypes, |
| SmallVectorImpl<Value> &operands, bool toDynamic) const { |
| assert(origTypes.size() == operands.size() && |
| "expected as may original types as operands"); |
| |
| // Find operands of unranked memref type and store them. |
| SmallVector<UnrankedMemRefDescriptor> unrankedMemrefs; |
| SmallVector<unsigned> unrankedAddressSpaces; |
| for (unsigned i = 0, e = operands.size(); i < e; ++i) { |
| if (auto memRefType = dyn_cast<UnrankedMemRefType>(origTypes[i])) { |
| unrankedMemrefs.emplace_back(operands[i]); |
| FailureOr<unsigned> addressSpace = |
| getTypeConverter()->getMemRefAddressSpace(memRefType); |
| if (failed(addressSpace)) |
| return failure(); |
| unrankedAddressSpaces.emplace_back(*addressSpace); |
| } |
| } |
| |
| if (unrankedMemrefs.empty()) |
| return success(); |
| |
| // Compute allocation sizes. |
| SmallVector<Value> sizes; |
| UnrankedMemRefDescriptor::computeSizes(builder, loc, *getTypeConverter(), |
| unrankedMemrefs, unrankedAddressSpaces, |
| sizes); |
| |
| // Get frequently used types. |
| Type indexType = getTypeConverter()->getIndexType(); |
| |
| // Find the malloc and free, or declare them if necessary. |
| auto module = builder.getInsertionPoint()->getParentOfType<ModuleOp>(); |
| FailureOr<LLVM::LLVMFuncOp> freeFunc, mallocFunc; |
| if (toDynamic) { |
| mallocFunc = LLVM::lookupOrCreateMallocFn(builder, module, indexType); |
| if (failed(mallocFunc)) |
| return failure(); |
| } |
| if (!toDynamic) { |
| freeFunc = LLVM::lookupOrCreateFreeFn(builder, module); |
| if (failed(freeFunc)) |
| return failure(); |
| } |
| |
| unsigned unrankedMemrefPos = 0; |
| for (unsigned i = 0, e = operands.size(); i < e; ++i) { |
| Type type = origTypes[i]; |
| if (!isa<UnrankedMemRefType>(type)) |
| continue; |
| Value allocationSize = sizes[unrankedMemrefPos++]; |
| UnrankedMemRefDescriptor desc(operands[i]); |
| |
| // Allocate memory, copy, and free the source if necessary. |
| Value memory = |
| toDynamic |
| ? builder |
| .create<LLVM::CallOp>(loc, mallocFunc.value(), allocationSize) |
| .getResult() |
| : builder.create<LLVM::AllocaOp>(loc, getPtrType(), |
| IntegerType::get(getContext(), 8), |
| allocationSize, |
| /*alignment=*/0); |
| Value source = desc.memRefDescPtr(builder, loc); |
| builder.create<LLVM::MemcpyOp>(loc, memory, source, allocationSize, false); |
| if (!toDynamic) |
| builder.create<LLVM::CallOp>(loc, freeFunc.value(), source); |
| |
| // Create a new descriptor. The same descriptor can be returned multiple |
| // times, attempting to modify its pointer can lead to memory leaks |
| // (allocated twice and overwritten) or double frees (the caller does not |
| // know if the descriptor points to the same memory). |
| Type descriptorType = getTypeConverter()->convertType(type); |
| if (!descriptorType) |
| return failure(); |
| auto updatedDesc = |
| UnrankedMemRefDescriptor::poison(builder, loc, descriptorType); |
| Value rank = desc.rank(builder, loc); |
| updatedDesc.setRank(builder, loc, rank); |
| updatedDesc.setMemRefDescPtr(builder, loc, memory); |
| |
| operands[i] = updatedDesc; |
| } |
| |
| return success(); |
| } |
| |
| //===----------------------------------------------------------------------===// |
| // Detail methods |
| //===----------------------------------------------------------------------===// |
| |
| void LLVM::detail::setNativeProperties(Operation *op, |
| IntegerOverflowFlags overflowFlags) { |
| if (auto iface = dyn_cast<IntegerOverflowFlagsInterface>(op)) |
| iface.setOverflowFlags(overflowFlags); |
| } |
| |
| /// Replaces the given operation "op" with a new operation of type "targetOp" |
| /// and given operands. |
| LogicalResult LLVM::detail::oneToOneRewrite( |
| Operation *op, StringRef targetOp, ValueRange operands, |
| ArrayRef<NamedAttribute> targetAttrs, |
| const LLVMTypeConverter &typeConverter, ConversionPatternRewriter &rewriter, |
| IntegerOverflowFlags overflowFlags) { |
| unsigned numResults = op->getNumResults(); |
| |
| SmallVector<Type> resultTypes; |
| if (numResults != 0) { |
| resultTypes.push_back( |
| typeConverter.packOperationResults(op->getResultTypes())); |
| if (!resultTypes.back()) |
| return failure(); |
| } |
| |
| // Create the operation through state since we don't know its C++ type. |
| Operation *newOp = |
| rewriter.create(op->getLoc(), rewriter.getStringAttr(targetOp), operands, |
| resultTypes, targetAttrs); |
| |
| setNativeProperties(newOp, overflowFlags); |
| |
| // If the operation produced 0 or 1 result, return them immediately. |
| if (numResults == 0) |
| return rewriter.eraseOp(op), success(); |
| if (numResults == 1) |
| return rewriter.replaceOp(op, newOp->getResult(0)), success(); |
| |
| // Otherwise, it had been converted to an operation producing a structure. |
| // Extract individual results from the structure and return them as list. |
| SmallVector<Value, 4> results; |
| results.reserve(numResults); |
| for (unsigned i = 0; i < numResults; ++i) { |
| results.push_back(rewriter.create<LLVM::ExtractValueOp>( |
| op->getLoc(), newOp->getResult(0), i)); |
| } |
| rewriter.replaceOp(op, results); |
| return success(); |
| } |
| |
| LogicalResult LLVM::detail::intrinsicRewrite( |
| Operation *op, StringRef intrinsic, ValueRange operands, |
| const LLVMTypeConverter &typeConverter, RewriterBase &rewriter) { |
| auto loc = op->getLoc(); |
| |
| if (!llvm::all_of(operands, [](Value value) { |
| return LLVM::isCompatibleType(value.getType()); |
| })) |
| return failure(); |
| |
| unsigned numResults = op->getNumResults(); |
| Type resType; |
| if (numResults != 0) |
| resType = typeConverter.packOperationResults(op->getResultTypes()); |
| |
| auto callIntrOp = rewriter.create<LLVM::CallIntrinsicOp>( |
| loc, resType, rewriter.getStringAttr(intrinsic), operands); |
| // Propagate attributes. |
| callIntrOp->setAttrs(op->getAttrDictionary()); |
| |
| if (numResults <= 1) { |
| // Directly replace the original op. |
| rewriter.replaceOp(op, callIntrOp); |
| return success(); |
| } |
| |
| // Extract individual results from packed structure and use them as |
| // replacements. |
| SmallVector<Value, 4> results; |
| results.reserve(numResults); |
| Value intrRes = callIntrOp.getResults(); |
| for (unsigned i = 0; i < numResults; ++i) |
| results.push_back(rewriter.create<LLVM::ExtractValueOp>(loc, intrRes, i)); |
| rewriter.replaceOp(op, results); |
| |
| return success(); |
| } |
| |
| static unsigned getBitWidth(Type type) { |
| if (type.isIntOrFloat()) |
| return type.getIntOrFloatBitWidth(); |
| |
| auto vec = cast<VectorType>(type); |
| assert(!vec.isScalable() && "scalable vectors are not supported"); |
| return vec.getNumElements() * getBitWidth(vec.getElementType()); |
| } |
| |
| static Value createI32Constant(OpBuilder &builder, Location loc, |
| int32_t value) { |
| Type i32 = builder.getI32Type(); |
| return builder.create<LLVM::ConstantOp>(loc, i32, value); |
| } |
| |
| SmallVector<Value> mlir::LLVM::decomposeValue(OpBuilder &builder, Location loc, |
| Value src, Type dstType) { |
| Type srcType = src.getType(); |
| if (srcType == dstType) |
| return {src}; |
| |
| unsigned srcBitWidth = getBitWidth(srcType); |
| unsigned dstBitWidth = getBitWidth(dstType); |
| if (srcBitWidth == dstBitWidth) { |
| Value cast = builder.create<LLVM::BitcastOp>(loc, dstType, src); |
| return {cast}; |
| } |
| |
| if (dstBitWidth > srcBitWidth) { |
| auto smallerInt = builder.getIntegerType(srcBitWidth); |
| if (srcType != smallerInt) |
| src = builder.create<LLVM::BitcastOp>(loc, smallerInt, src); |
| |
| auto largerInt = builder.getIntegerType(dstBitWidth); |
| Value res = builder.create<LLVM::ZExtOp>(loc, largerInt, src); |
| return {res}; |
| } |
| assert(srcBitWidth % dstBitWidth == 0 && |
| "src bit width must be a multiple of dst bit width"); |
| int64_t numElements = srcBitWidth / dstBitWidth; |
| auto vecType = VectorType::get(numElements, dstType); |
| |
| src = builder.create<LLVM::BitcastOp>(loc, vecType, src); |
| |
| SmallVector<Value> res; |
| for (auto i : llvm::seq(numElements)) { |
| Value idx = createI32Constant(builder, loc, i); |
| Value elem = builder.create<LLVM::ExtractElementOp>(loc, src, idx); |
| res.emplace_back(elem); |
| } |
| |
| return res; |
| } |
| |
| Value mlir::LLVM::composeValue(OpBuilder &builder, Location loc, ValueRange src, |
| Type dstType) { |
| assert(!src.empty() && "src range must not be empty"); |
| if (src.size() == 1) { |
| Value res = src.front(); |
| if (res.getType() == dstType) |
| return res; |
| |
| unsigned srcBitWidth = getBitWidth(res.getType()); |
| unsigned dstBitWidth = getBitWidth(dstType); |
| if (dstBitWidth < srcBitWidth) { |
| auto largerInt = builder.getIntegerType(srcBitWidth); |
| if (res.getType() != largerInt) |
| res = builder.create<LLVM::BitcastOp>(loc, largerInt, res); |
| |
| auto smallerInt = builder.getIntegerType(dstBitWidth); |
| res = builder.create<LLVM::TruncOp>(loc, smallerInt, res); |
| } |
| |
| if (res.getType() != dstType) |
| res = builder.create<LLVM::BitcastOp>(loc, dstType, res); |
| |
| return res; |
| } |
| |
| int64_t numElements = src.size(); |
| auto srcType = VectorType::get(numElements, src.front().getType()); |
| Value res = builder.create<LLVM::PoisonOp>(loc, srcType); |
| for (auto &&[i, elem] : llvm::enumerate(src)) { |
| Value idx = createI32Constant(builder, loc, i); |
| res = builder.create<LLVM::InsertElementOp>(loc, srcType, res, elem, idx); |
| } |
| |
| if (res.getType() != dstType) |
| res = builder.create<LLVM::BitcastOp>(loc, dstType, res); |
| |
| return res; |
| } |
| |
| Value mlir::LLVM::getStridedElementPtr(OpBuilder &builder, Location loc, |
| const LLVMTypeConverter &converter, |
| MemRefType type, Value memRefDesc, |
| ValueRange indices, |
| LLVM::GEPNoWrapFlags noWrapFlags) { |
| auto [strides, offset] = type.getStridesAndOffset(); |
| |
| MemRefDescriptor memRefDescriptor(memRefDesc); |
| // Use a canonical representation of the start address so that later |
| // optimizations have a longer sequence of instructions to CSE. |
| // If we don't do that we would sprinkle the memref.offset in various |
| // position of the different address computations. |
| Value base = memRefDescriptor.bufferPtr(builder, loc, converter, type); |
| |
| LLVM::IntegerOverflowFlags intOverflowFlags = |
| LLVM::IntegerOverflowFlags::none; |
| if (LLVM::bitEnumContainsAny(noWrapFlags, LLVM::GEPNoWrapFlags::nusw)) { |
| intOverflowFlags = intOverflowFlags | LLVM::IntegerOverflowFlags::nsw; |
| } |
| if (LLVM::bitEnumContainsAny(noWrapFlags, LLVM::GEPNoWrapFlags::nuw)) { |
| intOverflowFlags = intOverflowFlags | LLVM::IntegerOverflowFlags::nuw; |
| } |
| |
| Type indexType = converter.getIndexType(); |
| Value index; |
| for (int i = 0, e = indices.size(); i < e; ++i) { |
| Value increment = indices[i]; |
| if (strides[i] != 1) { // Skip if stride is 1. |
| Value stride = |
| ShapedType::isDynamic(strides[i]) |
| ? memRefDescriptor.stride(builder, loc, i) |
| : builder.create<LLVM::ConstantOp>( |
| loc, indexType, builder.getIndexAttr(strides[i])); |
| increment = |
| builder.create<LLVM::MulOp>(loc, increment, stride, intOverflowFlags); |
| } |
| index = index ? builder.create<LLVM::AddOp>(loc, index, increment, |
| intOverflowFlags) |
| : increment; |
| } |
| |
| Type elementPtrType = memRefDescriptor.getElementPtrType(); |
| return index ? builder.create<LLVM::GEPOp>( |
| loc, elementPtrType, |
| converter.convertType(type.getElementType()), base, index, |
| noWrapFlags) |
| : base; |
| } |
