1cde4d5a6SJacques Pienaar //===- ModuleTranslation.cpp - MLIR to LLVM conversion --------------------===// 25d7231d8SStephan Herhut // 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 65d7231d8SStephan Herhut // 756222a06SMehdi Amini //===----------------------------------------------------------------------===// 85d7231d8SStephan Herhut // 95d7231d8SStephan Herhut // This file implements the translation between an MLIR LLVM dialect module and 105d7231d8SStephan Herhut // the corresponding LLVMIR module. It only handles core LLVM IR operations. 115d7231d8SStephan Herhut // 125d7231d8SStephan Herhut //===----------------------------------------------------------------------===// 135d7231d8SStephan Herhut 145d7231d8SStephan Herhut #include "mlir/Target/LLVMIR/ModuleTranslation.h" 155d7231d8SStephan Herhut 16c33d6970SRiver Riddle #include "DebugTranslation.h" 17ba0fa925SRiver Riddle #include "mlir/Dialect/LLVMIR/LLVMDialect.h" 1892a295ebSKiran Chandramohan #include "mlir/Dialect/OpenMP/OpenMPDialect.h" 195d7231d8SStephan Herhut #include "mlir/IR/Attributes.h" 20*65fcddffSRiver Riddle #include "mlir/IR/BuiltinOps.h" 21d4568ed7SGeorge Mitenkov #include "mlir/IR/RegionGraphTraits.h" 22a4a42160SAlex Zinenko #include "mlir/IR/StandardTypes.h" 235d7231d8SStephan Herhut #include "mlir/Support/LLVM.h" 24ec1f4e7cSAlex Zinenko #include "mlir/Target/LLVMIR/TypeTranslation.h" 25ebf190fcSRiver Riddle #include "llvm/ADT/TypeSwitch.h" 265d7231d8SStephan Herhut 27d4568ed7SGeorge Mitenkov #include "llvm/ADT/PostOrderIterator.h" 285d7231d8SStephan Herhut #include "llvm/ADT/SetVector.h" 2992a295ebSKiran Chandramohan #include "llvm/Frontend/OpenMP/OMPIRBuilder.h" 305d7231d8SStephan Herhut #include "llvm/IR/BasicBlock.h" 31d9067dcaSKiran Chandramohan #include "llvm/IR/CFG.h" 325d7231d8SStephan Herhut #include "llvm/IR/Constants.h" 335d7231d8SStephan Herhut #include "llvm/IR/DerivedTypes.h" 345d7231d8SStephan Herhut #include "llvm/IR/IRBuilder.h" 355d7231d8SStephan Herhut #include "llvm/IR/LLVMContext.h" 3699d03f03SGeorge Mitenkov #include "llvm/IR/MDBuilder.h" 375d7231d8SStephan Herhut #include "llvm/IR/Module.h" 38d9067dcaSKiran Chandramohan #include "llvm/Transforms/Utils/BasicBlockUtils.h" 395d7231d8SStephan Herhut #include "llvm/Transforms/Utils/Cloning.h" 405d7231d8SStephan Herhut 412666b973SRiver Riddle using namespace mlir; 422666b973SRiver Riddle using namespace mlir::LLVM; 43c33d6970SRiver Riddle using namespace mlir::LLVM::detail; 445d7231d8SStephan Herhut 45eb67bd78SAlex Zinenko #include "mlir/Dialect/LLVMIR/LLVMConversionEnumsToLLVM.inc" 46eb67bd78SAlex Zinenko 47a922e231SAlex Zinenko /// Builds a constant of a sequential LLVM type `type`, potentially containing 48a922e231SAlex Zinenko /// other sequential types recursively, from the individual constant values 49a922e231SAlex Zinenko /// provided in `constants`. `shape` contains the number of elements in nested 50a922e231SAlex Zinenko /// sequential types. Reports errors at `loc` and returns nullptr on error. 51a4a42160SAlex Zinenko static llvm::Constant * 52a4a42160SAlex Zinenko buildSequentialConstant(ArrayRef<llvm::Constant *> &constants, 53a4a42160SAlex Zinenko ArrayRef<int64_t> shape, llvm::Type *type, 54a4a42160SAlex Zinenko Location loc) { 55a4a42160SAlex Zinenko if (shape.empty()) { 56a4a42160SAlex Zinenko llvm::Constant *result = constants.front(); 57a4a42160SAlex Zinenko constants = constants.drop_front(); 58a4a42160SAlex Zinenko return result; 59a4a42160SAlex Zinenko } 60a4a42160SAlex Zinenko 6168b03aeeSEli Friedman llvm::Type *elementType; 6268b03aeeSEli Friedman if (auto *arrayTy = dyn_cast<llvm::ArrayType>(type)) { 6368b03aeeSEli Friedman elementType = arrayTy->getElementType(); 6468b03aeeSEli Friedman } else if (auto *vectorTy = dyn_cast<llvm::VectorType>(type)) { 6568b03aeeSEli Friedman elementType = vectorTy->getElementType(); 6668b03aeeSEli Friedman } else { 67a4a42160SAlex Zinenko emitError(loc) << "expected sequential LLVM types wrapping a scalar"; 68a4a42160SAlex Zinenko return nullptr; 69a4a42160SAlex Zinenko } 70a4a42160SAlex Zinenko 71a4a42160SAlex Zinenko SmallVector<llvm::Constant *, 8> nested; 72a4a42160SAlex Zinenko nested.reserve(shape.front()); 73a4a42160SAlex Zinenko for (int64_t i = 0; i < shape.front(); ++i) { 74a4a42160SAlex Zinenko nested.push_back(buildSequentialConstant(constants, shape.drop_front(), 75a4a42160SAlex Zinenko elementType, loc)); 76a4a42160SAlex Zinenko if (!nested.back()) 77a4a42160SAlex Zinenko return nullptr; 78a4a42160SAlex Zinenko } 79a4a42160SAlex Zinenko 80a4a42160SAlex Zinenko if (shape.size() == 1 && type->isVectorTy()) 81a4a42160SAlex Zinenko return llvm::ConstantVector::get(nested); 82a4a42160SAlex Zinenko return llvm::ConstantArray::get( 83a4a42160SAlex Zinenko llvm::ArrayType::get(elementType, shape.front()), nested); 84a4a42160SAlex Zinenko } 85a4a42160SAlex Zinenko 86fc817b09SKazuaki Ishizaki /// Returns the first non-sequential type nested in sequential types. 87a4a42160SAlex Zinenko static llvm::Type *getInnermostElementType(llvm::Type *type) { 8868b03aeeSEli Friedman do { 8968b03aeeSEli Friedman if (auto *arrayTy = dyn_cast<llvm::ArrayType>(type)) { 9068b03aeeSEli Friedman type = arrayTy->getElementType(); 9168b03aeeSEli Friedman } else if (auto *vectorTy = dyn_cast<llvm::VectorType>(type)) { 9268b03aeeSEli Friedman type = vectorTy->getElementType(); 9368b03aeeSEli Friedman } else { 94a4a42160SAlex Zinenko return type; 95a4a42160SAlex Zinenko } 9668b03aeeSEli Friedman } while (1); 9768b03aeeSEli Friedman } 98a4a42160SAlex Zinenko 992666b973SRiver Riddle /// Create an LLVM IR constant of `llvmType` from the MLIR attribute `attr`. 1002666b973SRiver Riddle /// This currently supports integer, floating point, splat and dense element 1012666b973SRiver Riddle /// attributes and combinations thereof. In case of error, report it to `loc` 1022666b973SRiver Riddle /// and return nullptr. 1035d7231d8SStephan Herhut llvm::Constant *ModuleTranslation::getLLVMConstant(llvm::Type *llvmType, 1045d7231d8SStephan Herhut Attribute attr, 1055d7231d8SStephan Herhut Location loc) { 10633a3a91bSChristian Sigg if (!attr) 10733a3a91bSChristian Sigg return llvm::UndefValue::get(llvmType); 108a4a42160SAlex Zinenko if (llvmType->isStructTy()) { 109a4a42160SAlex Zinenko emitError(loc, "struct types are not supported in constants"); 110a4a42160SAlex Zinenko return nullptr; 111a4a42160SAlex Zinenko } 112ac9d742bSStephan Herhut // For integer types, we allow a mismatch in sizes as the index type in 113ac9d742bSStephan Herhut // MLIR might have a different size than the index type in the LLVM module. 1145d7231d8SStephan Herhut if (auto intAttr = attr.dyn_cast<IntegerAttr>()) 115ac9d742bSStephan Herhut return llvm::ConstantInt::get( 116ac9d742bSStephan Herhut llvmType, 117ac9d742bSStephan Herhut intAttr.getValue().sextOrTrunc(llvmType->getIntegerBitWidth())); 1185d7231d8SStephan Herhut if (auto floatAttr = attr.dyn_cast<FloatAttr>()) 1195d7231d8SStephan Herhut return llvm::ConstantFP::get(llvmType, floatAttr.getValue()); 1209b9c647cSRiver Riddle if (auto funcAttr = attr.dyn_cast<FlatSymbolRefAttr>()) 121ff77397fSShraiysh Vaishay return llvm::ConstantExpr::getBitCast( 122ff77397fSShraiysh Vaishay functionMapping.lookup(funcAttr.getValue()), llvmType); 1235d7231d8SStephan Herhut if (auto splatAttr = attr.dyn_cast<SplatElementsAttr>()) { 12468b03aeeSEli Friedman llvm::Type *elementType; 12568b03aeeSEli Friedman uint64_t numElements; 12668b03aeeSEli Friedman if (auto *arrayTy = dyn_cast<llvm::ArrayType>(llvmType)) { 12768b03aeeSEli Friedman elementType = arrayTy->getElementType(); 12868b03aeeSEli Friedman numElements = arrayTy->getNumElements(); 12968b03aeeSEli Friedman } else { 1305cba1c63SChristopher Tetreault auto *vectorTy = cast<llvm::FixedVectorType>(llvmType); 13168b03aeeSEli Friedman elementType = vectorTy->getElementType(); 13268b03aeeSEli Friedman numElements = vectorTy->getNumElements(); 13368b03aeeSEli Friedman } 134d6ea8ff0SAlex Zinenko // Splat value is a scalar. Extract it only if the element type is not 135d6ea8ff0SAlex Zinenko // another sequence type. The recursion terminates because each step removes 136d6ea8ff0SAlex Zinenko // one outer sequential type. 13768b03aeeSEli Friedman bool elementTypeSequential = 138d891d738SRahul Joshi isa<llvm::ArrayType, llvm::VectorType>(elementType); 139d6ea8ff0SAlex Zinenko llvm::Constant *child = getLLVMConstant( 140d6ea8ff0SAlex Zinenko elementType, 14168b03aeeSEli Friedman elementTypeSequential ? splatAttr : splatAttr.getSplatValue(), loc); 142a4a42160SAlex Zinenko if (!child) 143a4a42160SAlex Zinenko return nullptr; 1442f13df13SMLIR Team if (llvmType->isVectorTy()) 145396a42d9SRiver Riddle return llvm::ConstantVector::getSplat( 1460f95e731SAlex Zinenko llvm::ElementCount::get(numElements, /*Scalable=*/false), child); 1472f13df13SMLIR Team if (llvmType->isArrayTy()) { 148ac9d742bSStephan Herhut auto *arrayType = llvm::ArrayType::get(elementType, numElements); 1492f13df13SMLIR Team SmallVector<llvm::Constant *, 8> constants(numElements, child); 1502f13df13SMLIR Team return llvm::ConstantArray::get(arrayType, constants); 1512f13df13SMLIR Team } 1525d7231d8SStephan Herhut } 153a4a42160SAlex Zinenko 154d906f84bSRiver Riddle if (auto elementsAttr = attr.dyn_cast<ElementsAttr>()) { 155a4a42160SAlex Zinenko assert(elementsAttr.getType().hasStaticShape()); 156a4a42160SAlex Zinenko assert(elementsAttr.getNumElements() != 0 && 157a4a42160SAlex Zinenko "unexpected empty elements attribute"); 158a4a42160SAlex Zinenko assert(!elementsAttr.getType().getShape().empty() && 159a4a42160SAlex Zinenko "unexpected empty elements attribute shape"); 160a4a42160SAlex Zinenko 1615d7231d8SStephan Herhut SmallVector<llvm::Constant *, 8> constants; 162a4a42160SAlex Zinenko constants.reserve(elementsAttr.getNumElements()); 163a4a42160SAlex Zinenko llvm::Type *innermostType = getInnermostElementType(llvmType); 164d906f84bSRiver Riddle for (auto n : elementsAttr.getValues<Attribute>()) { 165a4a42160SAlex Zinenko constants.push_back(getLLVMConstant(innermostType, n, loc)); 1665d7231d8SStephan Herhut if (!constants.back()) 1675d7231d8SStephan Herhut return nullptr; 1685d7231d8SStephan Herhut } 169a4a42160SAlex Zinenko ArrayRef<llvm::Constant *> constantsRef = constants; 170a4a42160SAlex Zinenko llvm::Constant *result = buildSequentialConstant( 171a4a42160SAlex Zinenko constantsRef, elementsAttr.getType().getShape(), llvmType, loc); 172a4a42160SAlex Zinenko assert(constantsRef.empty() && "did not consume all elemental constants"); 173a4a42160SAlex Zinenko return result; 1742f13df13SMLIR Team } 175a4a42160SAlex Zinenko 176cb348dffSStephan Herhut if (auto stringAttr = attr.dyn_cast<StringAttr>()) { 177cb348dffSStephan Herhut return llvm::ConstantDataArray::get( 178cb348dffSStephan Herhut llvmModule->getContext(), ArrayRef<char>{stringAttr.getValue().data(), 179cb348dffSStephan Herhut stringAttr.getValue().size()}); 180cb348dffSStephan Herhut } 181a4c3a645SRiver Riddle emitError(loc, "unsupported constant value"); 1825d7231d8SStephan Herhut return nullptr; 1835d7231d8SStephan Herhut } 1845d7231d8SStephan Herhut 1852666b973SRiver Riddle /// Convert MLIR integer comparison predicate to LLVM IR comparison predicate. 186ec82e1c9SAlex Zinenko static llvm::CmpInst::Predicate getLLVMCmpPredicate(ICmpPredicate p) { 1875d7231d8SStephan Herhut switch (p) { 188ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::eq: 1895d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_EQ; 190ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::ne: 1915d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_NE; 192ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::slt: 1935d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_SLT; 194ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::sle: 1955d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_SLE; 196ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::sgt: 1975d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_SGT; 198ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::sge: 1995d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_SGE; 200ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::ult: 2015d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_ULT; 202ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::ule: 2035d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_ULE; 204ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::ugt: 2055d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_UGT; 206ec82e1c9SAlex Zinenko case LLVM::ICmpPredicate::uge: 2075d7231d8SStephan Herhut return llvm::CmpInst::Predicate::ICMP_UGE; 2085d7231d8SStephan Herhut } 209e6365f3dSJacques Pienaar llvm_unreachable("incorrect comparison predicate"); 2105d7231d8SStephan Herhut } 2115d7231d8SStephan Herhut 21248fdc8d7SNagy Mostafa static llvm::CmpInst::Predicate getLLVMCmpPredicate(FCmpPredicate p) { 21348fdc8d7SNagy Mostafa switch (p) { 21448fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::_false: 21548fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_FALSE; 21648fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::oeq: 21748fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_OEQ; 21848fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::ogt: 21948fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_OGT; 22048fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::oge: 22148fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_OGE; 22248fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::olt: 22348fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_OLT; 22448fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::ole: 22548fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_OLE; 22648fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::one: 22748fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_ONE; 22848fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::ord: 22948fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_ORD; 23048fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::ueq: 23148fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_UEQ; 23248fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::ugt: 23348fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_UGT; 23448fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::uge: 23548fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_UGE; 23648fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::ult: 23748fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_ULT; 23848fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::ule: 23948fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_ULE; 24048fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::une: 24148fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_UNE; 24248fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::uno: 24348fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_UNO; 24448fdc8d7SNagy Mostafa case LLVM::FCmpPredicate::_true: 24548fdc8d7SNagy Mostafa return llvm::CmpInst::Predicate::FCMP_TRUE; 24648fdc8d7SNagy Mostafa } 247e6365f3dSJacques Pienaar llvm_unreachable("incorrect comparison predicate"); 24848fdc8d7SNagy Mostafa } 24948fdc8d7SNagy Mostafa 25060a0c612SFrank Laub static llvm::AtomicRMWInst::BinOp getLLVMAtomicBinOp(AtomicBinOp op) { 25160a0c612SFrank Laub switch (op) { 25260a0c612SFrank Laub case LLVM::AtomicBinOp::xchg: 25360a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Xchg; 25460a0c612SFrank Laub case LLVM::AtomicBinOp::add: 25560a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Add; 25660a0c612SFrank Laub case LLVM::AtomicBinOp::sub: 25760a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Sub; 25860a0c612SFrank Laub case LLVM::AtomicBinOp::_and: 25960a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::And; 26060a0c612SFrank Laub case LLVM::AtomicBinOp::nand: 26160a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Nand; 26260a0c612SFrank Laub case LLVM::AtomicBinOp::_or: 26360a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Or; 26460a0c612SFrank Laub case LLVM::AtomicBinOp::_xor: 26560a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Xor; 26660a0c612SFrank Laub case LLVM::AtomicBinOp::max: 26760a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Max; 26860a0c612SFrank Laub case LLVM::AtomicBinOp::min: 26960a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::Min; 27060a0c612SFrank Laub case LLVM::AtomicBinOp::umax: 27160a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::UMax; 27260a0c612SFrank Laub case LLVM::AtomicBinOp::umin: 27360a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::UMin; 27460a0c612SFrank Laub case LLVM::AtomicBinOp::fadd: 27560a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::FAdd; 27660a0c612SFrank Laub case LLVM::AtomicBinOp::fsub: 27760a0c612SFrank Laub return llvm::AtomicRMWInst::BinOp::FSub; 27860a0c612SFrank Laub } 27960a0c612SFrank Laub llvm_unreachable("incorrect atomic binary operator"); 28060a0c612SFrank Laub } 28160a0c612SFrank Laub 28260a0c612SFrank Laub static llvm::AtomicOrdering getLLVMAtomicOrdering(AtomicOrdering ordering) { 28360a0c612SFrank Laub switch (ordering) { 28460a0c612SFrank Laub case LLVM::AtomicOrdering::not_atomic: 28560a0c612SFrank Laub return llvm::AtomicOrdering::NotAtomic; 28660a0c612SFrank Laub case LLVM::AtomicOrdering::unordered: 28760a0c612SFrank Laub return llvm::AtomicOrdering::Unordered; 28860a0c612SFrank Laub case LLVM::AtomicOrdering::monotonic: 28960a0c612SFrank Laub return llvm::AtomicOrdering::Monotonic; 29060a0c612SFrank Laub case LLVM::AtomicOrdering::acquire: 29160a0c612SFrank Laub return llvm::AtomicOrdering::Acquire; 29260a0c612SFrank Laub case LLVM::AtomicOrdering::release: 29360a0c612SFrank Laub return llvm::AtomicOrdering::Release; 29460a0c612SFrank Laub case LLVM::AtomicOrdering::acq_rel: 29560a0c612SFrank Laub return llvm::AtomicOrdering::AcquireRelease; 29660a0c612SFrank Laub case LLVM::AtomicOrdering::seq_cst: 29760a0c612SFrank Laub return llvm::AtomicOrdering::SequentiallyConsistent; 29860a0c612SFrank Laub } 29960a0c612SFrank Laub llvm_unreachable("incorrect atomic ordering"); 30060a0c612SFrank Laub } 30160a0c612SFrank Laub 302c33d6970SRiver Riddle ModuleTranslation::ModuleTranslation(Operation *module, 303c33d6970SRiver Riddle std::unique_ptr<llvm::Module> llvmModule) 304c33d6970SRiver Riddle : mlirModule(module), llvmModule(std::move(llvmModule)), 305c33d6970SRiver Riddle debugTranslation( 30692a295ebSKiran Chandramohan std::make_unique<DebugTranslation>(module, *this->llvmModule)), 3079f9f89d4SMehdi Amini ompDialect(module->getContext()->getLoadedDialect("omp")), 308b2ab375dSAlex Zinenko typeTranslator(this->llvmModule->getContext()) { 309c33d6970SRiver Riddle assert(satisfiesLLVMModule(mlirModule) && 310c33d6970SRiver Riddle "mlirModule should honor LLVM's module semantics."); 311c33d6970SRiver Riddle } 312d9067dcaSKiran Chandramohan ModuleTranslation::~ModuleTranslation() { 313d9067dcaSKiran Chandramohan if (ompBuilder) 314d9067dcaSKiran Chandramohan ompBuilder->finalize(); 315d9067dcaSKiran Chandramohan } 316d9067dcaSKiran Chandramohan 317d9067dcaSKiran Chandramohan /// Get the SSA value passed to the current block from the terminator operation 318d9067dcaSKiran Chandramohan /// of its predecessor. 319d9067dcaSKiran Chandramohan static Value getPHISourceValue(Block *current, Block *pred, 320d9067dcaSKiran Chandramohan unsigned numArguments, unsigned index) { 321d9067dcaSKiran Chandramohan Operation &terminator = *pred->getTerminator(); 322d9067dcaSKiran Chandramohan if (isa<LLVM::BrOp>(terminator)) 323d9067dcaSKiran Chandramohan return terminator.getOperand(index); 324d9067dcaSKiran Chandramohan 325d9067dcaSKiran Chandramohan // For conditional branches, we need to check if the current block is reached 326d9067dcaSKiran Chandramohan // through the "true" or the "false" branch and take the relevant operands. 327d9067dcaSKiran Chandramohan auto condBranchOp = dyn_cast<LLVM::CondBrOp>(terminator); 328d9067dcaSKiran Chandramohan assert(condBranchOp && 329d9067dcaSKiran Chandramohan "only branch operations can be terminators of a block that " 330d9067dcaSKiran Chandramohan "has successors"); 331d9067dcaSKiran Chandramohan assert((condBranchOp.getSuccessor(0) != condBranchOp.getSuccessor(1)) && 332d9067dcaSKiran Chandramohan "successors with arguments in LLVM conditional branches must be " 333d9067dcaSKiran Chandramohan "different blocks"); 334d9067dcaSKiran Chandramohan 335d9067dcaSKiran Chandramohan return condBranchOp.getSuccessor(0) == current 336d9067dcaSKiran Chandramohan ? condBranchOp.trueDestOperands()[index] 337d9067dcaSKiran Chandramohan : condBranchOp.falseDestOperands()[index]; 338d9067dcaSKiran Chandramohan } 339d9067dcaSKiran Chandramohan 340d9067dcaSKiran Chandramohan /// Connect the PHI nodes to the results of preceding blocks. 341d9067dcaSKiran Chandramohan template <typename T> 342d9067dcaSKiran Chandramohan static void 343d9067dcaSKiran Chandramohan connectPHINodes(T &func, const DenseMap<Value, llvm::Value *> &valueMapping, 344d9067dcaSKiran Chandramohan const DenseMap<Block *, llvm::BasicBlock *> &blockMapping) { 345d9067dcaSKiran Chandramohan // Skip the first block, it cannot be branched to and its arguments correspond 346d9067dcaSKiran Chandramohan // to the arguments of the LLVM function. 347d9067dcaSKiran Chandramohan for (auto it = std::next(func.begin()), eit = func.end(); it != eit; ++it) { 348d9067dcaSKiran Chandramohan Block *bb = &*it; 349d9067dcaSKiran Chandramohan llvm::BasicBlock *llvmBB = blockMapping.lookup(bb); 350d9067dcaSKiran Chandramohan auto phis = llvmBB->phis(); 351d9067dcaSKiran Chandramohan auto numArguments = bb->getNumArguments(); 352d9067dcaSKiran Chandramohan assert(numArguments == std::distance(phis.begin(), phis.end())); 353d9067dcaSKiran Chandramohan for (auto &numberedPhiNode : llvm::enumerate(phis)) { 354d9067dcaSKiran Chandramohan auto &phiNode = numberedPhiNode.value(); 355d9067dcaSKiran Chandramohan unsigned index = numberedPhiNode.index(); 356d9067dcaSKiran Chandramohan for (auto *pred : bb->getPredecessors()) { 357d9067dcaSKiran Chandramohan phiNode.addIncoming(valueMapping.lookup(getPHISourceValue( 358d9067dcaSKiran Chandramohan bb, pred, numArguments, index)), 359d9067dcaSKiran Chandramohan blockMapping.lookup(pred)); 360d9067dcaSKiran Chandramohan } 361d9067dcaSKiran Chandramohan } 362d9067dcaSKiran Chandramohan } 363d9067dcaSKiran Chandramohan } 364d9067dcaSKiran Chandramohan 365d9067dcaSKiran Chandramohan /// Sort function blocks topologically. 366d9067dcaSKiran Chandramohan template <typename T> 367d9067dcaSKiran Chandramohan static llvm::SetVector<Block *> topologicalSort(T &f) { 368d4568ed7SGeorge Mitenkov // For each block that has not been visited yet (i.e. that has no 369d4568ed7SGeorge Mitenkov // predecessors), add it to the list as well as its successors. 370d9067dcaSKiran Chandramohan llvm::SetVector<Block *> blocks; 371d9067dcaSKiran Chandramohan for (Block &b : f) { 372d4568ed7SGeorge Mitenkov if (blocks.count(&b) == 0) { 373d4568ed7SGeorge Mitenkov llvm::ReversePostOrderTraversal<Block *> traversal(&b); 374d4568ed7SGeorge Mitenkov blocks.insert(traversal.begin(), traversal.end()); 375d4568ed7SGeorge Mitenkov } 376d9067dcaSKiran Chandramohan } 377d9067dcaSKiran Chandramohan assert(blocks.size() == f.getBlocks().size() && "some blocks are not sorted"); 378d9067dcaSKiran Chandramohan 379d9067dcaSKiran Chandramohan return blocks; 380d9067dcaSKiran Chandramohan } 381d9067dcaSKiran Chandramohan 382d9067dcaSKiran Chandramohan /// Convert the OpenMP parallel Operation to LLVM IR. 383d9067dcaSKiran Chandramohan LogicalResult 384d9067dcaSKiran Chandramohan ModuleTranslation::convertOmpParallel(Operation &opInst, 385d9067dcaSKiran Chandramohan llvm::IRBuilder<> &builder) { 386d9067dcaSKiran Chandramohan using InsertPointTy = llvm::OpenMPIRBuilder::InsertPointTy; 387d9067dcaSKiran Chandramohan 388d9067dcaSKiran Chandramohan auto bodyGenCB = [&](InsertPointTy allocaIP, InsertPointTy codeGenIP, 389d9067dcaSKiran Chandramohan llvm::BasicBlock &continuationIP) { 390d9067dcaSKiran Chandramohan llvm::LLVMContext &llvmContext = llvmModule->getContext(); 391d9067dcaSKiran Chandramohan 392d9067dcaSKiran Chandramohan llvm::BasicBlock *codeGenIPBB = codeGenIP.getBlock(); 393d9067dcaSKiran Chandramohan llvm::Instruction *codeGenIPBBTI = codeGenIPBB->getTerminator(); 394a71a0d6dSKiran Chandramohan ompContinuationIPStack.push_back(&continuationIP); 395d9067dcaSKiran Chandramohan 396793c29a2SSourabh Singh Tomar // ParallelOp has only `1` region associated with it. 397793c29a2SSourabh Singh Tomar auto ®ion = cast<omp::ParallelOp>(opInst).getRegion(); 398d9067dcaSKiran Chandramohan for (auto &bb : region) { 399d9067dcaSKiran Chandramohan auto *llvmBB = llvm::BasicBlock::Create( 400d9067dcaSKiran Chandramohan llvmContext, "omp.par.region", codeGenIP.getBlock()->getParent()); 401d9067dcaSKiran Chandramohan blockMapping[&bb] = llvmBB; 402d9067dcaSKiran Chandramohan } 403d9067dcaSKiran Chandramohan 404d9067dcaSKiran Chandramohan // Then, convert blocks one by one in topological order to ensure 405d9067dcaSKiran Chandramohan // defs are converted before uses. 406d9067dcaSKiran Chandramohan llvm::SetVector<Block *> blocks = topologicalSort(region); 407d9067dcaSKiran Chandramohan for (auto indexedBB : llvm::enumerate(blocks)) { 408d9067dcaSKiran Chandramohan Block *bb = indexedBB.value(); 409d9067dcaSKiran Chandramohan llvm::BasicBlock *curLLVMBB = blockMapping[bb]; 410a71a0d6dSKiran Chandramohan if (bb->isEntryBlock()) { 411a71a0d6dSKiran Chandramohan assert(codeGenIPBBTI->getNumSuccessors() == 1 && 412a71a0d6dSKiran Chandramohan "OpenMPIRBuilder provided entry block has multiple successors"); 413a71a0d6dSKiran Chandramohan assert(codeGenIPBBTI->getSuccessor(0) == &continuationIP && 414a71a0d6dSKiran Chandramohan "ContinuationIP is not the successor of OpenMPIRBuilder " 415a71a0d6dSKiran Chandramohan "provided entry block"); 416d9067dcaSKiran Chandramohan codeGenIPBBTI->setSuccessor(0, curLLVMBB); 417a71a0d6dSKiran Chandramohan } 418d9067dcaSKiran Chandramohan 419d9067dcaSKiran Chandramohan // TODO: Error not returned up the hierarchy 420e6c5e6efSKiran Chandramohan if (failed(convertBlock(*bb, /*ignoreArguments=*/indexedBB.index() == 0))) 421d9067dcaSKiran Chandramohan return; 422a71a0d6dSKiran Chandramohan } 423d9067dcaSKiran Chandramohan 424a71a0d6dSKiran Chandramohan ompContinuationIPStack.pop_back(); 425a71a0d6dSKiran Chandramohan 426d9067dcaSKiran Chandramohan // Finally, after all blocks have been traversed and values mapped, 427d9067dcaSKiran Chandramohan // connect the PHI nodes to the results of preceding blocks. 428d9067dcaSKiran Chandramohan connectPHINodes(region, valueMapping, blockMapping); 429d9067dcaSKiran Chandramohan }; 430d9067dcaSKiran Chandramohan 431d9067dcaSKiran Chandramohan // TODO: Perform appropriate actions according to the data-sharing 432d9067dcaSKiran Chandramohan // attribute (shared, private, firstprivate, ...) of variables. 433d9067dcaSKiran Chandramohan // Currently defaults to shared. 434d9067dcaSKiran Chandramohan auto privCB = [&](InsertPointTy allocaIP, InsertPointTy codeGenIP, 435d9067dcaSKiran Chandramohan llvm::Value &vPtr, 436d9067dcaSKiran Chandramohan llvm::Value *&replacementValue) -> InsertPointTy { 437d9067dcaSKiran Chandramohan replacementValue = &vPtr; 438d9067dcaSKiran Chandramohan 439d9067dcaSKiran Chandramohan return codeGenIP; 440d9067dcaSKiran Chandramohan }; 441d9067dcaSKiran Chandramohan 442d9067dcaSKiran Chandramohan // TODO: Perform finalization actions for variables. This has to be 443d9067dcaSKiran Chandramohan // called for variables which have destructors/finalizers. 444d9067dcaSKiran Chandramohan auto finiCB = [&](InsertPointTy codeGenIP) {}; 445d9067dcaSKiran Chandramohan 446d9067dcaSKiran Chandramohan llvm::Value *ifCond = nullptr; 447660832c4SKiran Chandramohan if (auto ifExprVar = cast<omp::ParallelOp>(opInst).if_expr_var()) 448660832c4SKiran Chandramohan ifCond = valueMapping.lookup(ifExprVar); 449d9067dcaSKiran Chandramohan llvm::Value *numThreads = nullptr; 450660832c4SKiran Chandramohan if (auto numThreadsVar = cast<omp::ParallelOp>(opInst).num_threads_var()) 451660832c4SKiran Chandramohan numThreads = valueMapping.lookup(numThreadsVar); 452e6c5e6efSKiran Chandramohan llvm::omp::ProcBindKind pbKind = llvm::omp::OMP_PROC_BIND_default; 453e6c5e6efSKiran Chandramohan if (auto bind = cast<omp::ParallelOp>(opInst).proc_bind_val()) 454e6c5e6efSKiran Chandramohan pbKind = llvm::omp::getProcBindKind(bind.getValue()); 455660832c4SKiran Chandramohan // TODO: Is the Parallel construct cancellable? 456d9067dcaSKiran Chandramohan bool isCancellable = false; 4574d83aa47SJohannes Doerfert // TODO: Determine the actual alloca insertion point, e.g., the function 4584d83aa47SJohannes Doerfert // entry or the alloca insertion point as provided by the body callback 4594d83aa47SJohannes Doerfert // above. 4604d83aa47SJohannes Doerfert llvm::OpenMPIRBuilder::InsertPointTy allocaIP(builder.saveIP()); 461e6c5e6efSKiran Chandramohan builder.restoreIP( 462e5dba2d7SMichael Kruse ompBuilder->createParallel(builder, allocaIP, bodyGenCB, privCB, finiCB, 463e6c5e6efSKiran Chandramohan ifCond, numThreads, pbKind, isCancellable)); 464d9067dcaSKiran Chandramohan return success(); 465d9067dcaSKiran Chandramohan } 466c33d6970SRiver Riddle 4677ecee63eSKiran Kumar T P /// Given an OpenMP MLIR operation, create the corresponding LLVM IR 4687ecee63eSKiran Kumar T P /// (including OpenMP runtime calls). 4697ecee63eSKiran Kumar T P LogicalResult 4707ecee63eSKiran Kumar T P ModuleTranslation::convertOmpOperation(Operation &opInst, 4717ecee63eSKiran Kumar T P llvm::IRBuilder<> &builder) { 4727ecee63eSKiran Kumar T P if (!ompBuilder) { 4737ecee63eSKiran Kumar T P ompBuilder = std::make_unique<llvm::OpenMPIRBuilder>(*llvmModule); 4747ecee63eSKiran Kumar T P ompBuilder->initialize(); 4757ecee63eSKiran Kumar T P } 476ebf190fcSRiver Riddle return llvm::TypeSwitch<Operation *, LogicalResult>(&opInst) 4777ecee63eSKiran Kumar T P .Case([&](omp::BarrierOp) { 478e5dba2d7SMichael Kruse ompBuilder->createBarrier(builder.saveIP(), llvm::omp::OMPD_barrier); 4797ecee63eSKiran Kumar T P return success(); 4807ecee63eSKiran Kumar T P }) 4817ecee63eSKiran Kumar T P .Case([&](omp::TaskwaitOp) { 482e5dba2d7SMichael Kruse ompBuilder->createTaskwait(builder.saveIP()); 4837ecee63eSKiran Kumar T P return success(); 4847ecee63eSKiran Kumar T P }) 4857ecee63eSKiran Kumar T P .Case([&](omp::TaskyieldOp) { 486e5dba2d7SMichael Kruse ompBuilder->createTaskyield(builder.saveIP()); 4877ecee63eSKiran Kumar T P return success(); 4887ecee63eSKiran Kumar T P }) 489fa8fc9ffSKiran Kumar T P .Case([&](omp::FlushOp) { 49041b09f4eSKazuaki Ishizaki // No support in Openmp runtime function (__kmpc_flush) to accept 491fa8fc9ffSKiran Kumar T P // the argument list. 492fa8fc9ffSKiran Kumar T P // OpenMP standard states the following: 493fa8fc9ffSKiran Kumar T P // "An implementation may implement a flush with a list by ignoring 494fa8fc9ffSKiran Kumar T P // the list, and treating it the same as a flush without a list." 495fa8fc9ffSKiran Kumar T P // 496fa8fc9ffSKiran Kumar T P // The argument list is discarded so that, flush with a list is treated 497fa8fc9ffSKiran Kumar T P // same as a flush without a list. 498e5dba2d7SMichael Kruse ompBuilder->createFlush(builder.saveIP()); 499fa8fc9ffSKiran Kumar T P return success(); 500fa8fc9ffSKiran Kumar T P }) 501a71a0d6dSKiran Chandramohan .Case([&](omp::TerminatorOp) { 502a71a0d6dSKiran Chandramohan builder.CreateBr(ompContinuationIPStack.back()); 503a71a0d6dSKiran Chandramohan return success(); 504a71a0d6dSKiran Chandramohan }) 505d9067dcaSKiran Chandramohan .Case( 506d9067dcaSKiran Chandramohan [&](omp::ParallelOp) { return convertOmpParallel(opInst, builder); }) 5077ecee63eSKiran Kumar T P .Default([&](Operation *inst) { 5087ecee63eSKiran Kumar T P return inst->emitError("unsupported OpenMP operation: ") 5097ecee63eSKiran Kumar T P << inst->getName(); 5107ecee63eSKiran Kumar T P }); 5117ecee63eSKiran Kumar T P } 5127ecee63eSKiran Kumar T P 5132666b973SRiver Riddle /// Given a single MLIR operation, create the corresponding LLVM IR operation 5142666b973SRiver Riddle /// using the `builder`. LLVM IR Builder does not have a generic interface so 5152666b973SRiver Riddle /// this has to be a long chain of `if`s calling different functions with a 5162666b973SRiver Riddle /// different number of arguments. 517baa1ec22SAlex Zinenko LogicalResult ModuleTranslation::convertOperation(Operation &opInst, 5185d7231d8SStephan Herhut llvm::IRBuilder<> &builder) { 5195d7231d8SStephan Herhut auto extractPosition = [](ArrayAttr attr) { 5205d7231d8SStephan Herhut SmallVector<unsigned, 4> position; 5215d7231d8SStephan Herhut position.reserve(attr.size()); 5225d7231d8SStephan Herhut for (Attribute v : attr) 5235d7231d8SStephan Herhut position.push_back(v.cast<IntegerAttr>().getValue().getZExtValue()); 5245d7231d8SStephan Herhut return position; 5255d7231d8SStephan Herhut }; 5265d7231d8SStephan Herhut 527ba0fa925SRiver Riddle #include "mlir/Dialect/LLVMIR/LLVMConversions.inc" 5285d7231d8SStephan Herhut 5295d7231d8SStephan Herhut // Emit function calls. If the "callee" attribute is present, this is a 5305d7231d8SStephan Herhut // direct function call and we also need to look up the remapped function 5315d7231d8SStephan Herhut // itself. Otherwise, this is an indirect call and the callee is the first 5325d7231d8SStephan Herhut // operand, look it up as a normal value. Return the llvm::Value representing 5335d7231d8SStephan Herhut // the function result, which may be of llvm::VoidTy type. 5345d7231d8SStephan Herhut auto convertCall = [this, &builder](Operation &op) -> llvm::Value * { 5355d7231d8SStephan Herhut auto operands = lookupValues(op.getOperands()); 5365d7231d8SStephan Herhut ArrayRef<llvm::Value *> operandsRef(operands); 5379b9c647cSRiver Riddle if (auto attr = op.getAttrOfType<FlatSymbolRefAttr>("callee")) { 5385d7231d8SStephan Herhut return builder.CreateCall(functionMapping.lookup(attr.getValue()), 5395d7231d8SStephan Herhut operandsRef); 5405d7231d8SStephan Herhut } else { 541133049d0SEli Friedman auto *calleePtrType = 542133049d0SEli Friedman cast<llvm::PointerType>(operandsRef.front()->getType()); 543133049d0SEli Friedman auto *calleeType = 544133049d0SEli Friedman cast<llvm::FunctionType>(calleePtrType->getElementType()); 545133049d0SEli Friedman return builder.CreateCall(calleeType, operandsRef.front(), 546133049d0SEli Friedman operandsRef.drop_front()); 5475d7231d8SStephan Herhut } 5485d7231d8SStephan Herhut }; 5495d7231d8SStephan Herhut 5505d7231d8SStephan Herhut // Emit calls. If the called function has a result, remap the corresponding 5515d7231d8SStephan Herhut // value. Note that LLVM IR dialect CallOp has either 0 or 1 result. 552d5b60ee8SRiver Riddle if (isa<LLVM::CallOp>(opInst)) { 5535d7231d8SStephan Herhut llvm::Value *result = convertCall(opInst); 5545d7231d8SStephan Herhut if (opInst.getNumResults() != 0) { 5555d7231d8SStephan Herhut valueMapping[opInst.getResult(0)] = result; 556baa1ec22SAlex Zinenko return success(); 5575d7231d8SStephan Herhut } 5585d7231d8SStephan Herhut // Check that LLVM call returns void for 0-result functions. 559baa1ec22SAlex Zinenko return success(result->getType()->isVoidTy()); 5605d7231d8SStephan Herhut } 5615d7231d8SStephan Herhut 562d242aa24SShraiysh Vaishay if (auto invOp = dyn_cast<LLVM::InvokeOp>(opInst)) { 563d242aa24SShraiysh Vaishay auto operands = lookupValues(opInst.getOperands()); 564d242aa24SShraiysh Vaishay ArrayRef<llvm::Value *> operandsRef(operands); 565133049d0SEli Friedman if (auto attr = opInst.getAttrOfType<FlatSymbolRefAttr>("callee")) { 566d242aa24SShraiysh Vaishay builder.CreateInvoke(functionMapping.lookup(attr.getValue()), 567d242aa24SShraiysh Vaishay blockMapping[invOp.getSuccessor(0)], 568d242aa24SShraiysh Vaishay blockMapping[invOp.getSuccessor(1)], operandsRef); 569133049d0SEli Friedman } else { 570133049d0SEli Friedman auto *calleePtrType = 571133049d0SEli Friedman cast<llvm::PointerType>(operandsRef.front()->getType()); 572133049d0SEli Friedman auto *calleeType = 573133049d0SEli Friedman cast<llvm::FunctionType>(calleePtrType->getElementType()); 574d242aa24SShraiysh Vaishay builder.CreateInvoke( 575133049d0SEli Friedman calleeType, operandsRef.front(), blockMapping[invOp.getSuccessor(0)], 576d242aa24SShraiysh Vaishay blockMapping[invOp.getSuccessor(1)], operandsRef.drop_front()); 577133049d0SEli Friedman } 578d242aa24SShraiysh Vaishay return success(); 579d242aa24SShraiysh Vaishay } 580d242aa24SShraiysh Vaishay 581d242aa24SShraiysh Vaishay if (auto lpOp = dyn_cast<LLVM::LandingpadOp>(opInst)) { 582aec38c61SAlex Zinenko llvm::Type *ty = convertType(lpOp.getType().cast<LLVMType>()); 583d242aa24SShraiysh Vaishay llvm::LandingPadInst *lpi = 584d242aa24SShraiysh Vaishay builder.CreateLandingPad(ty, lpOp.getNumOperands()); 585d242aa24SShraiysh Vaishay 586d242aa24SShraiysh Vaishay // Add clauses 587d242aa24SShraiysh Vaishay for (auto operand : lookupValues(lpOp.getOperands())) { 588d242aa24SShraiysh Vaishay // All operands should be constant - checked by verifier 589d242aa24SShraiysh Vaishay if (auto constOperand = dyn_cast<llvm::Constant>(operand)) 590d242aa24SShraiysh Vaishay lpi->addClause(constOperand); 591d242aa24SShraiysh Vaishay } 592ff77397fSShraiysh Vaishay valueMapping[lpOp.getResult()] = lpi; 593d242aa24SShraiysh Vaishay return success(); 594d242aa24SShraiysh Vaishay } 595d242aa24SShraiysh Vaishay 5965d7231d8SStephan Herhut // Emit branches. We need to look up the remapped blocks and ignore the block 5975d7231d8SStephan Herhut // arguments that were transformed into PHI nodes. 598c5ecf991SRiver Riddle if (auto brOp = dyn_cast<LLVM::BrOp>(opInst)) { 599c0fd5e65SRiver Riddle builder.CreateBr(blockMapping[brOp.getSuccessor()]); 600baa1ec22SAlex Zinenko return success(); 6015d7231d8SStephan Herhut } 602c5ecf991SRiver Riddle if (auto condbrOp = dyn_cast<LLVM::CondBrOp>(opInst)) { 60399d03f03SGeorge Mitenkov auto weights = condbrOp.branch_weights(); 60499d03f03SGeorge Mitenkov llvm::MDNode *branchWeights = nullptr; 60599d03f03SGeorge Mitenkov if (weights) { 60699d03f03SGeorge Mitenkov // Map weight attributes to LLVM metadata. 60799d03f03SGeorge Mitenkov auto trueWeight = 60899d03f03SGeorge Mitenkov weights.getValue().getValue(0).cast<IntegerAttr>().getInt(); 60999d03f03SGeorge Mitenkov auto falseWeight = 61099d03f03SGeorge Mitenkov weights.getValue().getValue(1).cast<IntegerAttr>().getInt(); 61199d03f03SGeorge Mitenkov branchWeights = 61299d03f03SGeorge Mitenkov llvm::MDBuilder(llvmModule->getContext()) 61399d03f03SGeorge Mitenkov .createBranchWeights(static_cast<uint32_t>(trueWeight), 61499d03f03SGeorge Mitenkov static_cast<uint32_t>(falseWeight)); 61599d03f03SGeorge Mitenkov } 6165d7231d8SStephan Herhut builder.CreateCondBr(valueMapping.lookup(condbrOp.getOperand(0)), 6175d7231d8SStephan Herhut blockMapping[condbrOp.getSuccessor(0)], 61899d03f03SGeorge Mitenkov blockMapping[condbrOp.getSuccessor(1)], branchWeights); 619baa1ec22SAlex Zinenko return success(); 6205d7231d8SStephan Herhut } 6215d7231d8SStephan Herhut 6222dd38b09SAlex Zinenko // Emit addressof. We need to look up the global value referenced by the 6232dd38b09SAlex Zinenko // operation and store it in the MLIR-to-LLVM value mapping. This does not 6242dd38b09SAlex Zinenko // emit any LLVM instruction. 6252dd38b09SAlex Zinenko if (auto addressOfOp = dyn_cast<LLVM::AddressOfOp>(opInst)) { 6262dd38b09SAlex Zinenko LLVM::GlobalOp global = addressOfOp.getGlobal(); 627cba733edSAlex Zinenko LLVM::LLVMFuncOp function = addressOfOp.getFunction(); 6282dd38b09SAlex Zinenko 629cba733edSAlex Zinenko // The verifier should not have allowed this. 630cba733edSAlex Zinenko assert((global || function) && 631cba733edSAlex Zinenko "referencing an undefined global or function"); 632cba733edSAlex Zinenko 633cba733edSAlex Zinenko valueMapping[addressOfOp.getResult()] = 634cba733edSAlex Zinenko global ? globalsMapping.lookup(global) 635cba733edSAlex Zinenko : functionMapping.lookup(function.getName()); 6362dd38b09SAlex Zinenko return success(); 6372dd38b09SAlex Zinenko } 6382dd38b09SAlex Zinenko 6399f9f89d4SMehdi Amini if (ompDialect && opInst.getDialect() == ompDialect) 6407ecee63eSKiran Kumar T P return convertOmpOperation(opInst, builder); 64192a295ebSKiran Chandramohan 642baa1ec22SAlex Zinenko return opInst.emitError("unsupported or non-LLVM operation: ") 643baa1ec22SAlex Zinenko << opInst.getName(); 6445d7231d8SStephan Herhut } 6455d7231d8SStephan Herhut 6462666b973SRiver Riddle /// Convert block to LLVM IR. Unless `ignoreArguments` is set, emit PHI nodes 6472666b973SRiver Riddle /// to define values corresponding to the MLIR block arguments. These nodes 6482666b973SRiver Riddle /// are not connected to the source basic blocks, which may not exist yet. 649baa1ec22SAlex Zinenko LogicalResult ModuleTranslation::convertBlock(Block &bb, bool ignoreArguments) { 6505d7231d8SStephan Herhut llvm::IRBuilder<> builder(blockMapping[&bb]); 651c33d6970SRiver Riddle auto *subprogram = builder.GetInsertBlock()->getParent()->getSubprogram(); 6525d7231d8SStephan Herhut 6535d7231d8SStephan Herhut // Before traversing operations, make block arguments available through 6545d7231d8SStephan Herhut // value remapping and PHI nodes, but do not add incoming edges for the PHI 6555d7231d8SStephan Herhut // nodes just yet: those values may be defined by this or following blocks. 6565d7231d8SStephan Herhut // This step is omitted if "ignoreArguments" is set. The arguments of the 6575d7231d8SStephan Herhut // first block have been already made available through the remapping of 6585d7231d8SStephan Herhut // LLVM function arguments. 6595d7231d8SStephan Herhut if (!ignoreArguments) { 6605d7231d8SStephan Herhut auto predecessors = bb.getPredecessors(); 6615d7231d8SStephan Herhut unsigned numPredecessors = 6625d7231d8SStephan Herhut std::distance(predecessors.begin(), predecessors.end()); 66335807bc4SRiver Riddle for (auto arg : bb.getArguments()) { 6642bdf33ccSRiver Riddle auto wrappedType = arg.getType().dyn_cast<LLVM::LLVMType>(); 665baa1ec22SAlex Zinenko if (!wrappedType) 666baa1ec22SAlex Zinenko return emitError(bb.front().getLoc(), 667a4c3a645SRiver Riddle "block argument does not have an LLVM type"); 668aec38c61SAlex Zinenko llvm::Type *type = convertType(wrappedType); 6695d7231d8SStephan Herhut llvm::PHINode *phi = builder.CreatePHI(type, numPredecessors); 6705d7231d8SStephan Herhut valueMapping[arg] = phi; 6715d7231d8SStephan Herhut } 6725d7231d8SStephan Herhut } 6735d7231d8SStephan Herhut 6745d7231d8SStephan Herhut // Traverse operations. 6755d7231d8SStephan Herhut for (auto &op : bb) { 676c33d6970SRiver Riddle // Set the current debug location within the builder. 677c33d6970SRiver Riddle builder.SetCurrentDebugLocation( 678c33d6970SRiver Riddle debugTranslation->translateLoc(op.getLoc(), subprogram)); 679c33d6970SRiver Riddle 680baa1ec22SAlex Zinenko if (failed(convertOperation(op, builder))) 681baa1ec22SAlex Zinenko return failure(); 6825d7231d8SStephan Herhut } 6835d7231d8SStephan Herhut 684baa1ec22SAlex Zinenko return success(); 6855d7231d8SStephan Herhut } 6865d7231d8SStephan Herhut 6872666b973SRiver Riddle /// Create named global variables that correspond to llvm.mlir.global 6882666b973SRiver Riddle /// definitions. 689efa2d533SAlex Zinenko LogicalResult ModuleTranslation::convertGlobals() { 69044fc7d72STres Popp for (auto op : getModuleBody(mlirModule).getOps<LLVM::GlobalOp>()) { 691aec38c61SAlex Zinenko llvm::Type *type = convertType(op.getType()); 692250a11aeSJames Molloy llvm::Constant *cst = llvm::UndefValue::get(type); 693250a11aeSJames Molloy if (op.getValueOrNull()) { 69468451df2SAlex Zinenko // String attributes are treated separately because they cannot appear as 69568451df2SAlex Zinenko // in-function constants and are thus not supported by getLLVMConstant. 69633a3a91bSChristian Sigg if (auto strAttr = op.getValueOrNull().dyn_cast_or_null<StringAttr>()) { 6972dd38b09SAlex Zinenko cst = llvm::ConstantDataArray::getString( 69868451df2SAlex Zinenko llvmModule->getContext(), strAttr.getValue(), /*AddNull=*/false); 6992dd38b09SAlex Zinenko type = cst->getType(); 700efa2d533SAlex Zinenko } else if (!(cst = getLLVMConstant(type, op.getValueOrNull(), 701efa2d533SAlex Zinenko op.getLoc()))) { 702efa2d533SAlex Zinenko return failure(); 70368451df2SAlex Zinenko } 704250a11aeSJames Molloy } else if (Block *initializer = op.getInitializerBlock()) { 705250a11aeSJames Molloy llvm::IRBuilder<> builder(llvmModule->getContext()); 706250a11aeSJames Molloy for (auto &op : initializer->without_terminator()) { 707250a11aeSJames Molloy if (failed(convertOperation(op, builder)) || 708efa2d533SAlex Zinenko !isa<llvm::Constant>(valueMapping.lookup(op.getResult(0)))) 709efa2d533SAlex Zinenko return emitError(op.getLoc(), "unemittable constant value"); 710250a11aeSJames Molloy } 711250a11aeSJames Molloy ReturnOp ret = cast<ReturnOp>(initializer->getTerminator()); 712250a11aeSJames Molloy cst = cast<llvm::Constant>(valueMapping.lookup(ret.getOperand(0))); 713250a11aeSJames Molloy } 71468451df2SAlex Zinenko 715eb67bd78SAlex Zinenko auto linkage = convertLinkageToLLVM(op.linkage()); 716d5e627f8SAlex Zinenko bool anyExternalLinkage = 7177b5d4669SEric Schweitz ((linkage == llvm::GlobalVariable::ExternalLinkage && 7187b5d4669SEric Schweitz isa<llvm::UndefValue>(cst)) || 719d5e627f8SAlex Zinenko linkage == llvm::GlobalVariable::ExternalWeakLinkage); 720431bb8b3SRiver Riddle auto addrSpace = op.addr_space(); 721e79bfefbSMLIR Team auto *var = new llvm::GlobalVariable( 722d5e627f8SAlex Zinenko *llvmModule, type, op.constant(), linkage, 723d5e627f8SAlex Zinenko anyExternalLinkage ? nullptr : cst, op.sym_name(), 724d5e627f8SAlex Zinenko /*InsertBefore=*/nullptr, llvm::GlobalValue::NotThreadLocal, addrSpace); 725e79bfefbSMLIR Team 7262dd38b09SAlex Zinenko globalsMapping.try_emplace(op, var); 727b9ff2dd8SAlex Zinenko } 728efa2d533SAlex Zinenko 729efa2d533SAlex Zinenko return success(); 730b9ff2dd8SAlex Zinenko } 731b9ff2dd8SAlex Zinenko 7320a2131b7SAlex Zinenko /// Attempts to add an attribute identified by `key`, optionally with the given 7330a2131b7SAlex Zinenko /// `value` to LLVM function `llvmFunc`. Reports errors at `loc` if any. If the 7340a2131b7SAlex Zinenko /// attribute has a kind known to LLVM IR, create the attribute of this kind, 7350a2131b7SAlex Zinenko /// otherwise keep it as a string attribute. Performs additional checks for 7360a2131b7SAlex Zinenko /// attributes known to have or not have a value in order to avoid assertions 7370a2131b7SAlex Zinenko /// inside LLVM upon construction. 7380a2131b7SAlex Zinenko static LogicalResult checkedAddLLVMFnAttribute(Location loc, 7390a2131b7SAlex Zinenko llvm::Function *llvmFunc, 7400a2131b7SAlex Zinenko StringRef key, 7410a2131b7SAlex Zinenko StringRef value = StringRef()) { 7420a2131b7SAlex Zinenko auto kind = llvm::Attribute::getAttrKindFromName(key); 7430a2131b7SAlex Zinenko if (kind == llvm::Attribute::None) { 7440a2131b7SAlex Zinenko llvmFunc->addFnAttr(key, value); 7450a2131b7SAlex Zinenko return success(); 7460a2131b7SAlex Zinenko } 7470a2131b7SAlex Zinenko 7480a2131b7SAlex Zinenko if (llvm::Attribute::doesAttrKindHaveArgument(kind)) { 7490a2131b7SAlex Zinenko if (value.empty()) 7500a2131b7SAlex Zinenko return emitError(loc) << "LLVM attribute '" << key << "' expects a value"; 7510a2131b7SAlex Zinenko 7520a2131b7SAlex Zinenko int result; 7530a2131b7SAlex Zinenko if (!value.getAsInteger(/*Radix=*/0, result)) 7540a2131b7SAlex Zinenko llvmFunc->addFnAttr( 7550a2131b7SAlex Zinenko llvm::Attribute::get(llvmFunc->getContext(), kind, result)); 7560a2131b7SAlex Zinenko else 7570a2131b7SAlex Zinenko llvmFunc->addFnAttr(key, value); 7580a2131b7SAlex Zinenko return success(); 7590a2131b7SAlex Zinenko } 7600a2131b7SAlex Zinenko 7610a2131b7SAlex Zinenko if (!value.empty()) 7620a2131b7SAlex Zinenko return emitError(loc) << "LLVM attribute '" << key 7630a2131b7SAlex Zinenko << "' does not expect a value, found '" << value 7640a2131b7SAlex Zinenko << "'"; 7650a2131b7SAlex Zinenko 7660a2131b7SAlex Zinenko llvmFunc->addFnAttr(kind); 7670a2131b7SAlex Zinenko return success(); 7680a2131b7SAlex Zinenko } 7690a2131b7SAlex Zinenko 7700a2131b7SAlex Zinenko /// Attaches the attributes listed in the given array attribute to `llvmFunc`. 7710a2131b7SAlex Zinenko /// Reports error to `loc` if any and returns immediately. Expects `attributes` 7720a2131b7SAlex Zinenko /// to be an array attribute containing either string attributes, treated as 7730a2131b7SAlex Zinenko /// value-less LLVM attributes, or array attributes containing two string 7740a2131b7SAlex Zinenko /// attributes, with the first string being the name of the corresponding LLVM 7750a2131b7SAlex Zinenko /// attribute and the second string beings its value. Note that even integer 7760a2131b7SAlex Zinenko /// attributes are expected to have their values expressed as strings. 7770a2131b7SAlex Zinenko static LogicalResult 7780a2131b7SAlex Zinenko forwardPassthroughAttributes(Location loc, Optional<ArrayAttr> attributes, 7790a2131b7SAlex Zinenko llvm::Function *llvmFunc) { 7800a2131b7SAlex Zinenko if (!attributes) 7810a2131b7SAlex Zinenko return success(); 7820a2131b7SAlex Zinenko 7830a2131b7SAlex Zinenko for (Attribute attr : *attributes) { 7840a2131b7SAlex Zinenko if (auto stringAttr = attr.dyn_cast<StringAttr>()) { 7850a2131b7SAlex Zinenko if (failed( 7860a2131b7SAlex Zinenko checkedAddLLVMFnAttribute(loc, llvmFunc, stringAttr.getValue()))) 7870a2131b7SAlex Zinenko return failure(); 7880a2131b7SAlex Zinenko continue; 7890a2131b7SAlex Zinenko } 7900a2131b7SAlex Zinenko 7910a2131b7SAlex Zinenko auto arrayAttr = attr.dyn_cast<ArrayAttr>(); 7920a2131b7SAlex Zinenko if (!arrayAttr || arrayAttr.size() != 2) 7930a2131b7SAlex Zinenko return emitError(loc) 7940a2131b7SAlex Zinenko << "expected 'passthrough' to contain string or array attributes"; 7950a2131b7SAlex Zinenko 7960a2131b7SAlex Zinenko auto keyAttr = arrayAttr[0].dyn_cast<StringAttr>(); 7970a2131b7SAlex Zinenko auto valueAttr = arrayAttr[1].dyn_cast<StringAttr>(); 7980a2131b7SAlex Zinenko if (!keyAttr || !valueAttr) 7990a2131b7SAlex Zinenko return emitError(loc) 8000a2131b7SAlex Zinenko << "expected arrays within 'passthrough' to contain two strings"; 8010a2131b7SAlex Zinenko 8020a2131b7SAlex Zinenko if (failed(checkedAddLLVMFnAttribute(loc, llvmFunc, keyAttr.getValue(), 8030a2131b7SAlex Zinenko valueAttr.getValue()))) 8040a2131b7SAlex Zinenko return failure(); 8050a2131b7SAlex Zinenko } 8060a2131b7SAlex Zinenko return success(); 8070a2131b7SAlex Zinenko } 8080a2131b7SAlex Zinenko 8095e7959a3SAlex Zinenko LogicalResult ModuleTranslation::convertOneFunction(LLVMFuncOp func) { 8105d7231d8SStephan Herhut // Clear the block and value mappings, they are only relevant within one 8115d7231d8SStephan Herhut // function. 8125d7231d8SStephan Herhut blockMapping.clear(); 8135d7231d8SStephan Herhut valueMapping.clear(); 814c33862b0SRiver Riddle llvm::Function *llvmFunc = functionMapping.lookup(func.getName()); 815c33d6970SRiver Riddle 816c33d6970SRiver Riddle // Translate the debug information for this function. 817c33d6970SRiver Riddle debugTranslation->translate(func, *llvmFunc); 818c33d6970SRiver Riddle 8195d7231d8SStephan Herhut // Add function arguments to the value remapping table. 8205d7231d8SStephan Herhut // If there was noalias info then we decorate each argument accordingly. 8215d7231d8SStephan Herhut unsigned int argIdx = 0; 822eeef50b1SFangrui Song for (auto kvp : llvm::zip(func.getArguments(), llvmFunc->args())) { 8235d7231d8SStephan Herhut llvm::Argument &llvmArg = std::get<1>(kvp); 824e62a6956SRiver Riddle BlockArgument mlirArg = std::get<0>(kvp); 8255d7231d8SStephan Herhut 82667cc5cecSStephan Herhut if (auto attr = func.getArgAttrOfType<BoolAttr>( 82767cc5cecSStephan Herhut argIdx, LLVMDialect::getNoAliasAttrName())) { 8285d7231d8SStephan Herhut // NB: Attribute already verified to be boolean, so check if we can indeed 8295d7231d8SStephan Herhut // attach the attribute to this argument, based on its type. 8302bdf33ccSRiver Riddle auto argTy = mlirArg.getType().dyn_cast<LLVM::LLVMType>(); 831aec38c61SAlex Zinenko if (!argTy.isPointerTy()) 832baa1ec22SAlex Zinenko return func.emitError( 8335d7231d8SStephan Herhut "llvm.noalias attribute attached to LLVM non-pointer argument"); 8345d7231d8SStephan Herhut if (attr.getValue()) 8355d7231d8SStephan Herhut llvmArg.addAttr(llvm::Attribute::AttrKind::NoAlias); 8365d7231d8SStephan Herhut } 8372416e28cSStephan Herhut 83867cc5cecSStephan Herhut if (auto attr = func.getArgAttrOfType<IntegerAttr>( 83967cc5cecSStephan Herhut argIdx, LLVMDialect::getAlignAttrName())) { 8402416e28cSStephan Herhut // NB: Attribute already verified to be int, so check if we can indeed 8412416e28cSStephan Herhut // attach the attribute to this argument, based on its type. 8422416e28cSStephan Herhut auto argTy = mlirArg.getType().dyn_cast<LLVM::LLVMType>(); 843aec38c61SAlex Zinenko if (!argTy.isPointerTy()) 8442416e28cSStephan Herhut return func.emitError( 8452416e28cSStephan Herhut "llvm.align attribute attached to LLVM non-pointer argument"); 8462416e28cSStephan Herhut llvmArg.addAttrs( 8472416e28cSStephan Herhut llvm::AttrBuilder().addAlignmentAttr(llvm::Align(attr.getInt()))); 8482416e28cSStephan Herhut } 8492416e28cSStephan Herhut 8505d7231d8SStephan Herhut valueMapping[mlirArg] = &llvmArg; 8515d7231d8SStephan Herhut argIdx++; 8525d7231d8SStephan Herhut } 8535d7231d8SStephan Herhut 854ff77397fSShraiysh Vaishay // Check the personality and set it. 855ff77397fSShraiysh Vaishay if (func.personality().hasValue()) { 856ff77397fSShraiysh Vaishay llvm::Type *ty = llvm::Type::getInt8PtrTy(llvmFunc->getContext()); 857ff77397fSShraiysh Vaishay if (llvm::Constant *pfunc = 858ff77397fSShraiysh Vaishay getLLVMConstant(ty, func.personalityAttr(), func.getLoc())) 859ff77397fSShraiysh Vaishay llvmFunc->setPersonalityFn(pfunc); 860ff77397fSShraiysh Vaishay } 861ff77397fSShraiysh Vaishay 8625d7231d8SStephan Herhut // First, create all blocks so we can jump to them. 8635d7231d8SStephan Herhut llvm::LLVMContext &llvmContext = llvmFunc->getContext(); 8645d7231d8SStephan Herhut for (auto &bb : func) { 8655d7231d8SStephan Herhut auto *llvmBB = llvm::BasicBlock::Create(llvmContext); 8665d7231d8SStephan Herhut llvmBB->insertInto(llvmFunc); 8675d7231d8SStephan Herhut blockMapping[&bb] = llvmBB; 8685d7231d8SStephan Herhut } 8695d7231d8SStephan Herhut 8705d7231d8SStephan Herhut // Then, convert blocks one by one in topological order to ensure defs are 8715d7231d8SStephan Herhut // converted before uses. 8725d7231d8SStephan Herhut auto blocks = topologicalSort(func); 8735d7231d8SStephan Herhut for (auto indexedBB : llvm::enumerate(blocks)) { 8745d7231d8SStephan Herhut auto *bb = indexedBB.value(); 875baa1ec22SAlex Zinenko if (failed(convertBlock(*bb, /*ignoreArguments=*/indexedBB.index() == 0))) 876baa1ec22SAlex Zinenko return failure(); 8775d7231d8SStephan Herhut } 8785d7231d8SStephan Herhut 8795d7231d8SStephan Herhut // Finally, after all blocks have been traversed and values mapped, connect 8805d7231d8SStephan Herhut // the PHI nodes to the results of preceding blocks. 881d9067dcaSKiran Chandramohan connectPHINodes(func, valueMapping, blockMapping); 882baa1ec22SAlex Zinenko return success(); 8835d7231d8SStephan Herhut } 8845d7231d8SStephan Herhut 88544fc7d72STres Popp LogicalResult ModuleTranslation::checkSupportedModuleOps(Operation *m) { 88644fc7d72STres Popp for (Operation &o : getModuleBody(m).getOperations()) 887ee394e68SRahul Joshi if (!isa<LLVM::LLVMFuncOp, LLVM::GlobalOp>(&o) && !o.isKnownTerminator()) 8884dde19f0SAlex Zinenko return o.emitOpError("unsupported module-level operation"); 8894dde19f0SAlex Zinenko return success(); 8904dde19f0SAlex Zinenko } 8914dde19f0SAlex Zinenko 892a084b94fSSean Silva LogicalResult ModuleTranslation::convertFunctionSignatures() { 8935d7231d8SStephan Herhut // Declare all functions first because there may be function calls that form a 894a084b94fSSean Silva // call graph with cycles, or global initializers that reference functions. 89544fc7d72STres Popp for (auto function : getModuleBody(mlirModule).getOps<LLVMFuncOp>()) { 8965e7959a3SAlex Zinenko llvm::FunctionCallee llvmFuncCst = llvmModule->getOrInsertFunction( 8975e7959a3SAlex Zinenko function.getName(), 898aec38c61SAlex Zinenko cast<llvm::FunctionType>(convertType(function.getType()))); 8990a2131b7SAlex Zinenko llvm::Function *llvmFunc = cast<llvm::Function>(llvmFuncCst.getCallee()); 900ebbdecddSAlex Zinenko llvmFunc->setLinkage(convertLinkageToLLVM(function.linkage())); 9010a2131b7SAlex Zinenko functionMapping[function.getName()] = llvmFunc; 9020a2131b7SAlex Zinenko 9030a2131b7SAlex Zinenko // Forward the pass-through attributes to LLVM. 9040a2131b7SAlex Zinenko if (failed(forwardPassthroughAttributes(function.getLoc(), 9050a2131b7SAlex Zinenko function.passthrough(), llvmFunc))) 9060a2131b7SAlex Zinenko return failure(); 9075d7231d8SStephan Herhut } 9085d7231d8SStephan Herhut 909a084b94fSSean Silva return success(); 910a084b94fSSean Silva } 911a084b94fSSean Silva 912a084b94fSSean Silva LogicalResult ModuleTranslation::convertFunctions() { 9135d7231d8SStephan Herhut // Convert functions. 91444fc7d72STres Popp for (auto function : getModuleBody(mlirModule).getOps<LLVMFuncOp>()) { 9155d7231d8SStephan Herhut // Ignore external functions. 9165d7231d8SStephan Herhut if (function.isExternal()) 9175d7231d8SStephan Herhut continue; 9185d7231d8SStephan Herhut 919baa1ec22SAlex Zinenko if (failed(convertOneFunction(function))) 920baa1ec22SAlex Zinenko return failure(); 9215d7231d8SStephan Herhut } 9225d7231d8SStephan Herhut 923baa1ec22SAlex Zinenko return success(); 9245d7231d8SStephan Herhut } 9255d7231d8SStephan Herhut 926aec38c61SAlex Zinenko llvm::Type *ModuleTranslation::convertType(LLVMType type) { 927b2ab375dSAlex Zinenko return typeTranslator.translateType(type); 928aec38c61SAlex Zinenko } 929aec38c61SAlex Zinenko 930efadb6b8SAlex Zinenko /// A helper to look up remapped operands in the value remapping table.` 931efadb6b8SAlex Zinenko SmallVector<llvm::Value *, 8> 932efadb6b8SAlex Zinenko ModuleTranslation::lookupValues(ValueRange values) { 933efadb6b8SAlex Zinenko SmallVector<llvm::Value *, 8> remapped; 934efadb6b8SAlex Zinenko remapped.reserve(values.size()); 935ff77397fSShraiysh Vaishay for (Value v : values) { 936ff77397fSShraiysh Vaishay assert(valueMapping.count(v) && "referencing undefined value"); 937efadb6b8SAlex Zinenko remapped.push_back(valueMapping.lookup(v)); 938ff77397fSShraiysh Vaishay } 939efadb6b8SAlex Zinenko return remapped; 940efadb6b8SAlex Zinenko } 941efadb6b8SAlex Zinenko 942db1c197bSAlex Zinenko std::unique_ptr<llvm::Module> ModuleTranslation::prepareLLVMModule( 943db1c197bSAlex Zinenko Operation *m, llvm::LLVMContext &llvmContext, StringRef name) { 944f9dc2b70SMehdi Amini m->getContext()->getOrLoadDialect<LLVM::LLVMDialect>(); 945db1c197bSAlex Zinenko auto llvmModule = std::make_unique<llvm::Module>(name, llvmContext); 946168213f9SAlex Zinenko if (auto dataLayoutAttr = 947168213f9SAlex Zinenko m->getAttr(LLVM::LLVMDialect::getDataLayoutAttrName())) 948168213f9SAlex Zinenko llvmModule->setDataLayout(dataLayoutAttr.cast<StringAttr>().getValue()); 9495d7231d8SStephan Herhut 9505d7231d8SStephan Herhut // Inject declarations for `malloc` and `free` functions that can be used in 9515d7231d8SStephan Herhut // memref allocation/deallocation coming from standard ops lowering. 952db1c197bSAlex Zinenko llvm::IRBuilder<> builder(llvmContext); 9535d7231d8SStephan Herhut llvmModule->getOrInsertFunction("malloc", builder.getInt8PtrTy(), 9545d7231d8SStephan Herhut builder.getInt64Ty()); 9555d7231d8SStephan Herhut llvmModule->getOrInsertFunction("free", builder.getVoidTy(), 9565d7231d8SStephan Herhut builder.getInt8PtrTy()); 9575d7231d8SStephan Herhut 9585d7231d8SStephan Herhut return llvmModule; 9595d7231d8SStephan Herhut } 960