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"
2065fcddffSRiver 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"
35*047400edSNicolas Vasilache #include "llvm/IR/InlineAsm.h"
365d7231d8SStephan Herhut #include "llvm/IR/LLVMContext.h"
3799d03f03SGeorge Mitenkov #include "llvm/IR/MDBuilder.h"
385d7231d8SStephan Herhut #include "llvm/IR/Module.h"
39d9067dcaSKiran Chandramohan #include "llvm/Transforms/Utils/BasicBlockUtils.h"
405d7231d8SStephan Herhut #include "llvm/Transforms/Utils/Cloning.h"
415d7231d8SStephan Herhut 
422666b973SRiver Riddle using namespace mlir;
432666b973SRiver Riddle using namespace mlir::LLVM;
44c33d6970SRiver Riddle using namespace mlir::LLVM::detail;
455d7231d8SStephan Herhut 
46eb67bd78SAlex Zinenko #include "mlir/Dialect/LLVMIR/LLVMConversionEnumsToLLVM.inc"
47eb67bd78SAlex Zinenko 
48a922e231SAlex Zinenko /// Builds a constant of a sequential LLVM type `type`, potentially containing
49a922e231SAlex Zinenko /// other sequential types recursively, from the individual constant values
50a922e231SAlex Zinenko /// provided in `constants`. `shape` contains the number of elements in nested
51a922e231SAlex Zinenko /// sequential types. Reports errors at `loc` and returns nullptr on error.
52a4a42160SAlex Zinenko static llvm::Constant *
53a4a42160SAlex Zinenko buildSequentialConstant(ArrayRef<llvm::Constant *> &constants,
54a4a42160SAlex Zinenko                         ArrayRef<int64_t> shape, llvm::Type *type,
55a4a42160SAlex Zinenko                         Location loc) {
56a4a42160SAlex Zinenko   if (shape.empty()) {
57a4a42160SAlex Zinenko     llvm::Constant *result = constants.front();
58a4a42160SAlex Zinenko     constants = constants.drop_front();
59a4a42160SAlex Zinenko     return result;
60a4a42160SAlex Zinenko   }
61a4a42160SAlex Zinenko 
6268b03aeeSEli Friedman   llvm::Type *elementType;
6368b03aeeSEli Friedman   if (auto *arrayTy = dyn_cast<llvm::ArrayType>(type)) {
6468b03aeeSEli Friedman     elementType = arrayTy->getElementType();
6568b03aeeSEli Friedman   } else if (auto *vectorTy = dyn_cast<llvm::VectorType>(type)) {
6668b03aeeSEli Friedman     elementType = vectorTy->getElementType();
6768b03aeeSEli Friedman   } else {
68a4a42160SAlex Zinenko     emitError(loc) << "expected sequential LLVM types wrapping a scalar";
69a4a42160SAlex Zinenko     return nullptr;
70a4a42160SAlex Zinenko   }
71a4a42160SAlex Zinenko 
72a4a42160SAlex Zinenko   SmallVector<llvm::Constant *, 8> nested;
73a4a42160SAlex Zinenko   nested.reserve(shape.front());
74a4a42160SAlex Zinenko   for (int64_t i = 0; i < shape.front(); ++i) {
75a4a42160SAlex Zinenko     nested.push_back(buildSequentialConstant(constants, shape.drop_front(),
76a4a42160SAlex Zinenko                                              elementType, loc));
77a4a42160SAlex Zinenko     if (!nested.back())
78a4a42160SAlex Zinenko       return nullptr;
79a4a42160SAlex Zinenko   }
80a4a42160SAlex Zinenko 
81a4a42160SAlex Zinenko   if (shape.size() == 1 && type->isVectorTy())
82a4a42160SAlex Zinenko     return llvm::ConstantVector::get(nested);
83a4a42160SAlex Zinenko   return llvm::ConstantArray::get(
84a4a42160SAlex Zinenko       llvm::ArrayType::get(elementType, shape.front()), nested);
85a4a42160SAlex Zinenko }
86a4a42160SAlex Zinenko 
87fc817b09SKazuaki Ishizaki /// Returns the first non-sequential type nested in sequential types.
88a4a42160SAlex Zinenko static llvm::Type *getInnermostElementType(llvm::Type *type) {
8968b03aeeSEli Friedman   do {
9068b03aeeSEli Friedman     if (auto *arrayTy = dyn_cast<llvm::ArrayType>(type)) {
9168b03aeeSEli Friedman       type = arrayTy->getElementType();
9268b03aeeSEli Friedman     } else if (auto *vectorTy = dyn_cast<llvm::VectorType>(type)) {
9368b03aeeSEli Friedman       type = vectorTy->getElementType();
9468b03aeeSEli Friedman     } else {
95a4a42160SAlex Zinenko       return type;
96a4a42160SAlex Zinenko     }
9768b03aeeSEli Friedman   } while (1);
9868b03aeeSEli Friedman }
99a4a42160SAlex Zinenko 
1002666b973SRiver Riddle /// Create an LLVM IR constant of `llvmType` from the MLIR attribute `attr`.
1012666b973SRiver Riddle /// This currently supports integer, floating point, splat and dense element
1022666b973SRiver Riddle /// attributes and combinations thereof.  In case of error, report it to `loc`
1032666b973SRiver Riddle /// and return nullptr.
1045d7231d8SStephan Herhut llvm::Constant *ModuleTranslation::getLLVMConstant(llvm::Type *llvmType,
1055d7231d8SStephan Herhut                                                    Attribute attr,
1065d7231d8SStephan Herhut                                                    Location loc) {
10733a3a91bSChristian Sigg   if (!attr)
10833a3a91bSChristian Sigg     return llvm::UndefValue::get(llvmType);
109a4a42160SAlex Zinenko   if (llvmType->isStructTy()) {
110a4a42160SAlex Zinenko     emitError(loc, "struct types are not supported in constants");
111a4a42160SAlex Zinenko     return nullptr;
112a4a42160SAlex Zinenko   }
113ac9d742bSStephan Herhut   // For integer types, we allow a mismatch in sizes as the index type in
114ac9d742bSStephan Herhut   // MLIR might have a different size than the index type in the LLVM module.
1155d7231d8SStephan Herhut   if (auto intAttr = attr.dyn_cast<IntegerAttr>())
116ac9d742bSStephan Herhut     return llvm::ConstantInt::get(
117ac9d742bSStephan Herhut         llvmType,
118ac9d742bSStephan Herhut         intAttr.getValue().sextOrTrunc(llvmType->getIntegerBitWidth()));
1195d7231d8SStephan Herhut   if (auto floatAttr = attr.dyn_cast<FloatAttr>())
1205d7231d8SStephan Herhut     return llvm::ConstantFP::get(llvmType, floatAttr.getValue());
1219b9c647cSRiver Riddle   if (auto funcAttr = attr.dyn_cast<FlatSymbolRefAttr>())
122ff77397fSShraiysh Vaishay     return llvm::ConstantExpr::getBitCast(
123ff77397fSShraiysh Vaishay         functionMapping.lookup(funcAttr.getValue()), llvmType);
1245d7231d8SStephan Herhut   if (auto splatAttr = attr.dyn_cast<SplatElementsAttr>()) {
12568b03aeeSEli Friedman     llvm::Type *elementType;
12668b03aeeSEli Friedman     uint64_t numElements;
12768b03aeeSEli Friedman     if (auto *arrayTy = dyn_cast<llvm::ArrayType>(llvmType)) {
12868b03aeeSEli Friedman       elementType = arrayTy->getElementType();
12968b03aeeSEli Friedman       numElements = arrayTy->getNumElements();
13068b03aeeSEli Friedman     } else {
1315cba1c63SChristopher Tetreault       auto *vectorTy = cast<llvm::FixedVectorType>(llvmType);
13268b03aeeSEli Friedman       elementType = vectorTy->getElementType();
13368b03aeeSEli Friedman       numElements = vectorTy->getNumElements();
13468b03aeeSEli Friedman     }
135d6ea8ff0SAlex Zinenko     // Splat value is a scalar. Extract it only if the element type is not
136d6ea8ff0SAlex Zinenko     // another sequence type. The recursion terminates because each step removes
137d6ea8ff0SAlex Zinenko     // one outer sequential type.
13868b03aeeSEli Friedman     bool elementTypeSequential =
139d891d738SRahul Joshi         isa<llvm::ArrayType, llvm::VectorType>(elementType);
140d6ea8ff0SAlex Zinenko     llvm::Constant *child = getLLVMConstant(
141d6ea8ff0SAlex Zinenko         elementType,
14268b03aeeSEli Friedman         elementTypeSequential ? splatAttr : splatAttr.getSplatValue(), loc);
143a4a42160SAlex Zinenko     if (!child)
144a4a42160SAlex Zinenko       return nullptr;
1452f13df13SMLIR Team     if (llvmType->isVectorTy())
146396a42d9SRiver Riddle       return llvm::ConstantVector::getSplat(
1470f95e731SAlex Zinenko           llvm::ElementCount::get(numElements, /*Scalable=*/false), child);
1482f13df13SMLIR Team     if (llvmType->isArrayTy()) {
149ac9d742bSStephan Herhut       auto *arrayType = llvm::ArrayType::get(elementType, numElements);
1502f13df13SMLIR Team       SmallVector<llvm::Constant *, 8> constants(numElements, child);
1512f13df13SMLIR Team       return llvm::ConstantArray::get(arrayType, constants);
1522f13df13SMLIR Team     }
1535d7231d8SStephan Herhut   }
154a4a42160SAlex Zinenko 
155d906f84bSRiver Riddle   if (auto elementsAttr = attr.dyn_cast<ElementsAttr>()) {
156a4a42160SAlex Zinenko     assert(elementsAttr.getType().hasStaticShape());
157a4a42160SAlex Zinenko     assert(elementsAttr.getNumElements() != 0 &&
158a4a42160SAlex Zinenko            "unexpected empty elements attribute");
159a4a42160SAlex Zinenko     assert(!elementsAttr.getType().getShape().empty() &&
160a4a42160SAlex Zinenko            "unexpected empty elements attribute shape");
161a4a42160SAlex Zinenko 
1625d7231d8SStephan Herhut     SmallVector<llvm::Constant *, 8> constants;
163a4a42160SAlex Zinenko     constants.reserve(elementsAttr.getNumElements());
164a4a42160SAlex Zinenko     llvm::Type *innermostType = getInnermostElementType(llvmType);
165d906f84bSRiver Riddle     for (auto n : elementsAttr.getValues<Attribute>()) {
166a4a42160SAlex Zinenko       constants.push_back(getLLVMConstant(innermostType, n, loc));
1675d7231d8SStephan Herhut       if (!constants.back())
1685d7231d8SStephan Herhut         return nullptr;
1695d7231d8SStephan Herhut     }
170a4a42160SAlex Zinenko     ArrayRef<llvm::Constant *> constantsRef = constants;
171a4a42160SAlex Zinenko     llvm::Constant *result = buildSequentialConstant(
172a4a42160SAlex Zinenko         constantsRef, elementsAttr.getType().getShape(), llvmType, loc);
173a4a42160SAlex Zinenko     assert(constantsRef.empty() && "did not consume all elemental constants");
174a4a42160SAlex Zinenko     return result;
1752f13df13SMLIR Team   }
176a4a42160SAlex Zinenko 
177cb348dffSStephan Herhut   if (auto stringAttr = attr.dyn_cast<StringAttr>()) {
178cb348dffSStephan Herhut     return llvm::ConstantDataArray::get(
179cb348dffSStephan Herhut         llvmModule->getContext(), ArrayRef<char>{stringAttr.getValue().data(),
180cb348dffSStephan Herhut                                                  stringAttr.getValue().size()});
181cb348dffSStephan Herhut   }
182a4c3a645SRiver Riddle   emitError(loc, "unsupported constant value");
1835d7231d8SStephan Herhut   return nullptr;
1845d7231d8SStephan Herhut }
1855d7231d8SStephan Herhut 
1862666b973SRiver Riddle /// Convert MLIR integer comparison predicate to LLVM IR comparison predicate.
187ec82e1c9SAlex Zinenko static llvm::CmpInst::Predicate getLLVMCmpPredicate(ICmpPredicate p) {
1885d7231d8SStephan Herhut   switch (p) {
189ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::eq:
1905d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_EQ;
191ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ne:
1925d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_NE;
193ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::slt:
1945d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SLT;
195ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::sle:
1965d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SLE;
197ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::sgt:
1985d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SGT;
199ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::sge:
2005d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SGE;
201ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ult:
2025d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_ULT;
203ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ule:
2045d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_ULE;
205ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ugt:
2065d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_UGT;
207ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::uge:
2085d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_UGE;
2095d7231d8SStephan Herhut   }
210e6365f3dSJacques Pienaar   llvm_unreachable("incorrect comparison predicate");
2115d7231d8SStephan Herhut }
2125d7231d8SStephan Herhut 
21348fdc8d7SNagy Mostafa static llvm::CmpInst::Predicate getLLVMCmpPredicate(FCmpPredicate p) {
21448fdc8d7SNagy Mostafa   switch (p) {
21548fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::_false:
21648fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_FALSE;
21748fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::oeq:
21848fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OEQ;
21948fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ogt:
22048fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OGT;
22148fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::oge:
22248fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OGE;
22348fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::olt:
22448fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OLT;
22548fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ole:
22648fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OLE;
22748fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::one:
22848fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ONE;
22948fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ord:
23048fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ORD;
23148fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ueq:
23248fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UEQ;
23348fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ugt:
23448fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UGT;
23548fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::uge:
23648fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UGE;
23748fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ult:
23848fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ULT;
23948fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ule:
24048fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ULE;
24148fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::une:
24248fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UNE;
24348fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::uno:
24448fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UNO;
24548fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::_true:
24648fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_TRUE;
24748fdc8d7SNagy Mostafa   }
248e6365f3dSJacques Pienaar   llvm_unreachable("incorrect comparison predicate");
24948fdc8d7SNagy Mostafa }
25048fdc8d7SNagy Mostafa 
25160a0c612SFrank Laub static llvm::AtomicRMWInst::BinOp getLLVMAtomicBinOp(AtomicBinOp op) {
25260a0c612SFrank Laub   switch (op) {
25360a0c612SFrank Laub   case LLVM::AtomicBinOp::xchg:
25460a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Xchg;
25560a0c612SFrank Laub   case LLVM::AtomicBinOp::add:
25660a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Add;
25760a0c612SFrank Laub   case LLVM::AtomicBinOp::sub:
25860a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Sub;
25960a0c612SFrank Laub   case LLVM::AtomicBinOp::_and:
26060a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::And;
26160a0c612SFrank Laub   case LLVM::AtomicBinOp::nand:
26260a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Nand;
26360a0c612SFrank Laub   case LLVM::AtomicBinOp::_or:
26460a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Or;
26560a0c612SFrank Laub   case LLVM::AtomicBinOp::_xor:
26660a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Xor;
26760a0c612SFrank Laub   case LLVM::AtomicBinOp::max:
26860a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Max;
26960a0c612SFrank Laub   case LLVM::AtomicBinOp::min:
27060a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::Min;
27160a0c612SFrank Laub   case LLVM::AtomicBinOp::umax:
27260a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::UMax;
27360a0c612SFrank Laub   case LLVM::AtomicBinOp::umin:
27460a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::UMin;
27560a0c612SFrank Laub   case LLVM::AtomicBinOp::fadd:
27660a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::FAdd;
27760a0c612SFrank Laub   case LLVM::AtomicBinOp::fsub:
27860a0c612SFrank Laub     return llvm::AtomicRMWInst::BinOp::FSub;
27960a0c612SFrank Laub   }
28060a0c612SFrank Laub   llvm_unreachable("incorrect atomic binary operator");
28160a0c612SFrank Laub }
28260a0c612SFrank Laub 
28360a0c612SFrank Laub static llvm::AtomicOrdering getLLVMAtomicOrdering(AtomicOrdering ordering) {
28460a0c612SFrank Laub   switch (ordering) {
28560a0c612SFrank Laub   case LLVM::AtomicOrdering::not_atomic:
28660a0c612SFrank Laub     return llvm::AtomicOrdering::NotAtomic;
28760a0c612SFrank Laub   case LLVM::AtomicOrdering::unordered:
28860a0c612SFrank Laub     return llvm::AtomicOrdering::Unordered;
28960a0c612SFrank Laub   case LLVM::AtomicOrdering::monotonic:
29060a0c612SFrank Laub     return llvm::AtomicOrdering::Monotonic;
29160a0c612SFrank Laub   case LLVM::AtomicOrdering::acquire:
29260a0c612SFrank Laub     return llvm::AtomicOrdering::Acquire;
29360a0c612SFrank Laub   case LLVM::AtomicOrdering::release:
29460a0c612SFrank Laub     return llvm::AtomicOrdering::Release;
29560a0c612SFrank Laub   case LLVM::AtomicOrdering::acq_rel:
29660a0c612SFrank Laub     return llvm::AtomicOrdering::AcquireRelease;
29760a0c612SFrank Laub   case LLVM::AtomicOrdering::seq_cst:
29860a0c612SFrank Laub     return llvm::AtomicOrdering::SequentiallyConsistent;
29960a0c612SFrank Laub   }
30060a0c612SFrank Laub   llvm_unreachable("incorrect atomic ordering");
30160a0c612SFrank Laub }
30260a0c612SFrank Laub 
303c33d6970SRiver Riddle ModuleTranslation::ModuleTranslation(Operation *module,
304c33d6970SRiver Riddle                                      std::unique_ptr<llvm::Module> llvmModule)
305c33d6970SRiver Riddle     : mlirModule(module), llvmModule(std::move(llvmModule)),
306c33d6970SRiver Riddle       debugTranslation(
30792a295ebSKiran Chandramohan           std::make_unique<DebugTranslation>(module, *this->llvmModule)),
3089f9f89d4SMehdi Amini       ompDialect(module->getContext()->getLoadedDialect("omp")),
309b2ab375dSAlex Zinenko       typeTranslator(this->llvmModule->getContext()) {
310c33d6970SRiver Riddle   assert(satisfiesLLVMModule(mlirModule) &&
311c33d6970SRiver Riddle          "mlirModule should honor LLVM's module semantics.");
312c33d6970SRiver Riddle }
313d9067dcaSKiran Chandramohan ModuleTranslation::~ModuleTranslation() {
314d9067dcaSKiran Chandramohan   if (ompBuilder)
315d9067dcaSKiran Chandramohan     ompBuilder->finalize();
316d9067dcaSKiran Chandramohan }
317d9067dcaSKiran Chandramohan 
318d9067dcaSKiran Chandramohan /// Get the SSA value passed to the current block from the terminator operation
319d9067dcaSKiran Chandramohan /// of its predecessor.
320d9067dcaSKiran Chandramohan static Value getPHISourceValue(Block *current, Block *pred,
321d9067dcaSKiran Chandramohan                                unsigned numArguments, unsigned index) {
322d9067dcaSKiran Chandramohan   Operation &terminator = *pred->getTerminator();
323d9067dcaSKiran Chandramohan   if (isa<LLVM::BrOp>(terminator))
324d9067dcaSKiran Chandramohan     return terminator.getOperand(index);
325d9067dcaSKiran Chandramohan 
326d9067dcaSKiran Chandramohan   // For conditional branches, we need to check if the current block is reached
327d9067dcaSKiran Chandramohan   // through the "true" or the "false" branch and take the relevant operands.
328d9067dcaSKiran Chandramohan   auto condBranchOp = dyn_cast<LLVM::CondBrOp>(terminator);
329d9067dcaSKiran Chandramohan   assert(condBranchOp &&
330d9067dcaSKiran Chandramohan          "only branch operations can be terminators of a block that "
331d9067dcaSKiran Chandramohan          "has successors");
332d9067dcaSKiran Chandramohan   assert((condBranchOp.getSuccessor(0) != condBranchOp.getSuccessor(1)) &&
333d9067dcaSKiran Chandramohan          "successors with arguments in LLVM conditional branches must be "
334d9067dcaSKiran Chandramohan          "different blocks");
335d9067dcaSKiran Chandramohan 
336d9067dcaSKiran Chandramohan   return condBranchOp.getSuccessor(0) == current
337d9067dcaSKiran Chandramohan              ? condBranchOp.trueDestOperands()[index]
338d9067dcaSKiran Chandramohan              : condBranchOp.falseDestOperands()[index];
339d9067dcaSKiran Chandramohan }
340d9067dcaSKiran Chandramohan 
341d9067dcaSKiran Chandramohan /// Connect the PHI nodes to the results of preceding blocks.
342d9067dcaSKiran Chandramohan template <typename T>
343d9067dcaSKiran Chandramohan static void
344d9067dcaSKiran Chandramohan connectPHINodes(T &func, const DenseMap<Value, llvm::Value *> &valueMapping,
345d9067dcaSKiran Chandramohan                 const DenseMap<Block *, llvm::BasicBlock *> &blockMapping) {
346d9067dcaSKiran Chandramohan   // Skip the first block, it cannot be branched to and its arguments correspond
347d9067dcaSKiran Chandramohan   // to the arguments of the LLVM function.
348d9067dcaSKiran Chandramohan   for (auto it = std::next(func.begin()), eit = func.end(); it != eit; ++it) {
349d9067dcaSKiran Chandramohan     Block *bb = &*it;
350d9067dcaSKiran Chandramohan     llvm::BasicBlock *llvmBB = blockMapping.lookup(bb);
351d9067dcaSKiran Chandramohan     auto phis = llvmBB->phis();
352d9067dcaSKiran Chandramohan     auto numArguments = bb->getNumArguments();
353d9067dcaSKiran Chandramohan     assert(numArguments == std::distance(phis.begin(), phis.end()));
354d9067dcaSKiran Chandramohan     for (auto &numberedPhiNode : llvm::enumerate(phis)) {
355d9067dcaSKiran Chandramohan       auto &phiNode = numberedPhiNode.value();
356d9067dcaSKiran Chandramohan       unsigned index = numberedPhiNode.index();
357d9067dcaSKiran Chandramohan       for (auto *pred : bb->getPredecessors()) {
358d9067dcaSKiran Chandramohan         phiNode.addIncoming(valueMapping.lookup(getPHISourceValue(
359d9067dcaSKiran Chandramohan                                 bb, pred, numArguments, index)),
360d9067dcaSKiran Chandramohan                             blockMapping.lookup(pred));
361d9067dcaSKiran Chandramohan       }
362d9067dcaSKiran Chandramohan     }
363d9067dcaSKiran Chandramohan   }
364d9067dcaSKiran Chandramohan }
365d9067dcaSKiran Chandramohan 
366d9067dcaSKiran Chandramohan /// Sort function blocks topologically.
367d9067dcaSKiran Chandramohan template <typename T>
368d9067dcaSKiran Chandramohan static llvm::SetVector<Block *> topologicalSort(T &f) {
369d4568ed7SGeorge Mitenkov   // For each block that has not been visited yet (i.e. that has no
370d4568ed7SGeorge Mitenkov   // predecessors), add it to the list as well as its successors.
371d9067dcaSKiran Chandramohan   llvm::SetVector<Block *> blocks;
372d9067dcaSKiran Chandramohan   for (Block &b : f) {
373d4568ed7SGeorge Mitenkov     if (blocks.count(&b) == 0) {
374d4568ed7SGeorge Mitenkov       llvm::ReversePostOrderTraversal<Block *> traversal(&b);
375d4568ed7SGeorge Mitenkov       blocks.insert(traversal.begin(), traversal.end());
376d4568ed7SGeorge Mitenkov     }
377d9067dcaSKiran Chandramohan   }
378d9067dcaSKiran Chandramohan   assert(blocks.size() == f.getBlocks().size() && "some blocks are not sorted");
379d9067dcaSKiran Chandramohan 
380d9067dcaSKiran Chandramohan   return blocks;
381d9067dcaSKiran Chandramohan }
382d9067dcaSKiran Chandramohan 
383d9067dcaSKiran Chandramohan /// Convert the OpenMP parallel Operation to LLVM IR.
384d9067dcaSKiran Chandramohan LogicalResult
385d9067dcaSKiran Chandramohan ModuleTranslation::convertOmpParallel(Operation &opInst,
386d9067dcaSKiran Chandramohan                                       llvm::IRBuilder<> &builder) {
387d9067dcaSKiran Chandramohan   using InsertPointTy = llvm::OpenMPIRBuilder::InsertPointTy;
388d9067dcaSKiran Chandramohan 
389d9067dcaSKiran Chandramohan   auto bodyGenCB = [&](InsertPointTy allocaIP, InsertPointTy codeGenIP,
390d9067dcaSKiran Chandramohan                        llvm::BasicBlock &continuationIP) {
391d9067dcaSKiran Chandramohan     llvm::LLVMContext &llvmContext = llvmModule->getContext();
392d9067dcaSKiran Chandramohan 
393d9067dcaSKiran Chandramohan     llvm::BasicBlock *codeGenIPBB = codeGenIP.getBlock();
394d9067dcaSKiran Chandramohan     llvm::Instruction *codeGenIPBBTI = codeGenIPBB->getTerminator();
395a71a0d6dSKiran Chandramohan     ompContinuationIPStack.push_back(&continuationIP);
396d9067dcaSKiran Chandramohan 
397793c29a2SSourabh Singh Tomar     // ParallelOp has only `1` region associated with it.
398793c29a2SSourabh Singh Tomar     auto &region = cast<omp::ParallelOp>(opInst).getRegion();
399d9067dcaSKiran Chandramohan     for (auto &bb : region) {
400d9067dcaSKiran Chandramohan       auto *llvmBB = llvm::BasicBlock::Create(
401d9067dcaSKiran Chandramohan           llvmContext, "omp.par.region", codeGenIP.getBlock()->getParent());
402d9067dcaSKiran Chandramohan       blockMapping[&bb] = llvmBB;
403d9067dcaSKiran Chandramohan     }
404d9067dcaSKiran Chandramohan 
405d9067dcaSKiran Chandramohan     // Then, convert blocks one by one in topological order to ensure
406d9067dcaSKiran Chandramohan     // defs are converted before uses.
407d9067dcaSKiran Chandramohan     llvm::SetVector<Block *> blocks = topologicalSort(region);
408d9067dcaSKiran Chandramohan     for (auto indexedBB : llvm::enumerate(blocks)) {
409d9067dcaSKiran Chandramohan       Block *bb = indexedBB.value();
410d9067dcaSKiran Chandramohan       llvm::BasicBlock *curLLVMBB = blockMapping[bb];
411a71a0d6dSKiran Chandramohan       if (bb->isEntryBlock()) {
412a71a0d6dSKiran Chandramohan         assert(codeGenIPBBTI->getNumSuccessors() == 1 &&
413a71a0d6dSKiran Chandramohan                "OpenMPIRBuilder provided entry block has multiple successors");
414a71a0d6dSKiran Chandramohan         assert(codeGenIPBBTI->getSuccessor(0) == &continuationIP &&
415a71a0d6dSKiran Chandramohan                "ContinuationIP is not the successor of OpenMPIRBuilder "
416a71a0d6dSKiran Chandramohan                "provided entry block");
417d9067dcaSKiran Chandramohan         codeGenIPBBTI->setSuccessor(0, curLLVMBB);
418a71a0d6dSKiran Chandramohan       }
419d9067dcaSKiran Chandramohan 
420d9067dcaSKiran Chandramohan       // TODO: Error not returned up the hierarchy
421e6c5e6efSKiran Chandramohan       if (failed(convertBlock(*bb, /*ignoreArguments=*/indexedBB.index() == 0)))
422d9067dcaSKiran Chandramohan         return;
423a71a0d6dSKiran Chandramohan     }
424d9067dcaSKiran Chandramohan 
425a71a0d6dSKiran Chandramohan     ompContinuationIPStack.pop_back();
426a71a0d6dSKiran Chandramohan 
427d9067dcaSKiran Chandramohan     // Finally, after all blocks have been traversed and values mapped,
428d9067dcaSKiran Chandramohan     // connect the PHI nodes to the results of preceding blocks.
429d9067dcaSKiran Chandramohan     connectPHINodes(region, valueMapping, blockMapping);
430d9067dcaSKiran Chandramohan   };
431d9067dcaSKiran Chandramohan 
432d9067dcaSKiran Chandramohan   // TODO: Perform appropriate actions according to the data-sharing
433d9067dcaSKiran Chandramohan   // attribute (shared, private, firstprivate, ...) of variables.
434d9067dcaSKiran Chandramohan   // Currently defaults to shared.
435d9067dcaSKiran Chandramohan   auto privCB = [&](InsertPointTy allocaIP, InsertPointTy codeGenIP,
436d9067dcaSKiran Chandramohan                     llvm::Value &vPtr,
437d9067dcaSKiran Chandramohan                     llvm::Value *&replacementValue) -> InsertPointTy {
438d9067dcaSKiran Chandramohan     replacementValue = &vPtr;
439d9067dcaSKiran Chandramohan 
440d9067dcaSKiran Chandramohan     return codeGenIP;
441d9067dcaSKiran Chandramohan   };
442d9067dcaSKiran Chandramohan 
443d9067dcaSKiran Chandramohan   // TODO: Perform finalization actions for variables. This has to be
444d9067dcaSKiran Chandramohan   // called for variables which have destructors/finalizers.
445d9067dcaSKiran Chandramohan   auto finiCB = [&](InsertPointTy codeGenIP) {};
446d9067dcaSKiran Chandramohan 
447d9067dcaSKiran Chandramohan   llvm::Value *ifCond = nullptr;
448660832c4SKiran Chandramohan   if (auto ifExprVar = cast<omp::ParallelOp>(opInst).if_expr_var())
449660832c4SKiran Chandramohan     ifCond = valueMapping.lookup(ifExprVar);
450d9067dcaSKiran Chandramohan   llvm::Value *numThreads = nullptr;
451660832c4SKiran Chandramohan   if (auto numThreadsVar = cast<omp::ParallelOp>(opInst).num_threads_var())
452660832c4SKiran Chandramohan     numThreads = valueMapping.lookup(numThreadsVar);
453e6c5e6efSKiran Chandramohan   llvm::omp::ProcBindKind pbKind = llvm::omp::OMP_PROC_BIND_default;
454e6c5e6efSKiran Chandramohan   if (auto bind = cast<omp::ParallelOp>(opInst).proc_bind_val())
455e6c5e6efSKiran Chandramohan     pbKind = llvm::omp::getProcBindKind(bind.getValue());
456660832c4SKiran Chandramohan   // TODO: Is the Parallel construct cancellable?
457d9067dcaSKiran Chandramohan   bool isCancellable = false;
4584d83aa47SJohannes Doerfert   // TODO: Determine the actual alloca insertion point, e.g., the function
4594d83aa47SJohannes Doerfert   // entry or the alloca insertion point as provided by the body callback
4604d83aa47SJohannes Doerfert   // above.
4614d83aa47SJohannes Doerfert   llvm::OpenMPIRBuilder::InsertPointTy allocaIP(builder.saveIP());
462e6c5e6efSKiran Chandramohan   builder.restoreIP(
463e5dba2d7SMichael Kruse       ompBuilder->createParallel(builder, allocaIP, bodyGenCB, privCB, finiCB,
464e6c5e6efSKiran Chandramohan                                  ifCond, numThreads, pbKind, isCancellable));
465d9067dcaSKiran Chandramohan   return success();
466d9067dcaSKiran Chandramohan }
467c33d6970SRiver Riddle 
4687ecee63eSKiran Kumar T P /// Given an OpenMP MLIR operation, create the corresponding LLVM IR
4697ecee63eSKiran Kumar T P /// (including OpenMP runtime calls).
4707ecee63eSKiran Kumar T P LogicalResult
4717ecee63eSKiran Kumar T P ModuleTranslation::convertOmpOperation(Operation &opInst,
4727ecee63eSKiran Kumar T P                                        llvm::IRBuilder<> &builder) {
4737ecee63eSKiran Kumar T P   if (!ompBuilder) {
4747ecee63eSKiran Kumar T P     ompBuilder = std::make_unique<llvm::OpenMPIRBuilder>(*llvmModule);
4757ecee63eSKiran Kumar T P     ompBuilder->initialize();
4767ecee63eSKiran Kumar T P   }
477ebf190fcSRiver Riddle   return llvm::TypeSwitch<Operation *, LogicalResult>(&opInst)
4787ecee63eSKiran Kumar T P       .Case([&](omp::BarrierOp) {
479e5dba2d7SMichael Kruse         ompBuilder->createBarrier(builder.saveIP(), llvm::omp::OMPD_barrier);
4807ecee63eSKiran Kumar T P         return success();
4817ecee63eSKiran Kumar T P       })
4827ecee63eSKiran Kumar T P       .Case([&](omp::TaskwaitOp) {
483e5dba2d7SMichael Kruse         ompBuilder->createTaskwait(builder.saveIP());
4847ecee63eSKiran Kumar T P         return success();
4857ecee63eSKiran Kumar T P       })
4867ecee63eSKiran Kumar T P       .Case([&](omp::TaskyieldOp) {
487e5dba2d7SMichael Kruse         ompBuilder->createTaskyield(builder.saveIP());
4887ecee63eSKiran Kumar T P         return success();
4897ecee63eSKiran Kumar T P       })
490fa8fc9ffSKiran Kumar T P       .Case([&](omp::FlushOp) {
49141b09f4eSKazuaki Ishizaki         // No support in Openmp runtime function (__kmpc_flush) to accept
492fa8fc9ffSKiran Kumar T P         // the argument list.
493fa8fc9ffSKiran Kumar T P         // OpenMP standard states the following:
494fa8fc9ffSKiran Kumar T P         //  "An implementation may implement a flush with a list by ignoring
495fa8fc9ffSKiran Kumar T P         //   the list, and treating it the same as a flush without a list."
496fa8fc9ffSKiran Kumar T P         //
497fa8fc9ffSKiran Kumar T P         // The argument list is discarded so that, flush with a list is treated
498fa8fc9ffSKiran Kumar T P         // same as a flush without a list.
499e5dba2d7SMichael Kruse         ompBuilder->createFlush(builder.saveIP());
500fa8fc9ffSKiran Kumar T P         return success();
501fa8fc9ffSKiran Kumar T P       })
502a71a0d6dSKiran Chandramohan       .Case([&](omp::TerminatorOp) {
503a71a0d6dSKiran Chandramohan         builder.CreateBr(ompContinuationIPStack.back());
504a71a0d6dSKiran Chandramohan         return success();
505a71a0d6dSKiran Chandramohan       })
506d9067dcaSKiran Chandramohan       .Case(
507d9067dcaSKiran Chandramohan           [&](omp::ParallelOp) { return convertOmpParallel(opInst, builder); })
5087ecee63eSKiran Kumar T P       .Default([&](Operation *inst) {
5097ecee63eSKiran Kumar T P         return inst->emitError("unsupported OpenMP operation: ")
5107ecee63eSKiran Kumar T P                << inst->getName();
5117ecee63eSKiran Kumar T P       });
5127ecee63eSKiran Kumar T P }
5137ecee63eSKiran Kumar T P 
5142666b973SRiver Riddle /// Given a single MLIR operation, create the corresponding LLVM IR operation
5152666b973SRiver Riddle /// using the `builder`.  LLVM IR Builder does not have a generic interface so
5162666b973SRiver Riddle /// this has to be a long chain of `if`s calling different functions with a
5172666b973SRiver Riddle /// different number of arguments.
518baa1ec22SAlex Zinenko LogicalResult ModuleTranslation::convertOperation(Operation &opInst,
5195d7231d8SStephan Herhut                                                   llvm::IRBuilder<> &builder) {
5205d7231d8SStephan Herhut   auto extractPosition = [](ArrayAttr attr) {
5215d7231d8SStephan Herhut     SmallVector<unsigned, 4> position;
5225d7231d8SStephan Herhut     position.reserve(attr.size());
5235d7231d8SStephan Herhut     for (Attribute v : attr)
5245d7231d8SStephan Herhut       position.push_back(v.cast<IntegerAttr>().getValue().getZExtValue());
5255d7231d8SStephan Herhut     return position;
5265d7231d8SStephan Herhut   };
5275d7231d8SStephan Herhut 
528ba0fa925SRiver Riddle #include "mlir/Dialect/LLVMIR/LLVMConversions.inc"
5295d7231d8SStephan Herhut 
5305d7231d8SStephan Herhut   // Emit function calls.  If the "callee" attribute is present, this is a
5315d7231d8SStephan Herhut   // direct function call and we also need to look up the remapped function
5325d7231d8SStephan Herhut   // itself.  Otherwise, this is an indirect call and the callee is the first
5335d7231d8SStephan Herhut   // operand, look it up as a normal value.  Return the llvm::Value representing
5345d7231d8SStephan Herhut   // the function result, which may be of llvm::VoidTy type.
5355d7231d8SStephan Herhut   auto convertCall = [this, &builder](Operation &op) -> llvm::Value * {
5365d7231d8SStephan Herhut     auto operands = lookupValues(op.getOperands());
5375d7231d8SStephan Herhut     ArrayRef<llvm::Value *> operandsRef(operands);
5389b9c647cSRiver Riddle     if (auto attr = op.getAttrOfType<FlatSymbolRefAttr>("callee")) {
5395d7231d8SStephan Herhut       return builder.CreateCall(functionMapping.lookup(attr.getValue()),
5405d7231d8SStephan Herhut                                 operandsRef);
5415d7231d8SStephan Herhut     } else {
542133049d0SEli Friedman       auto *calleePtrType =
543133049d0SEli Friedman           cast<llvm::PointerType>(operandsRef.front()->getType());
544133049d0SEli Friedman       auto *calleeType =
545133049d0SEli Friedman           cast<llvm::FunctionType>(calleePtrType->getElementType());
546133049d0SEli Friedman       return builder.CreateCall(calleeType, operandsRef.front(),
547133049d0SEli Friedman                                 operandsRef.drop_front());
5485d7231d8SStephan Herhut     }
5495d7231d8SStephan Herhut   };
5505d7231d8SStephan Herhut 
5515d7231d8SStephan Herhut   // Emit calls.  If the called function has a result, remap the corresponding
5525d7231d8SStephan Herhut   // value.  Note that LLVM IR dialect CallOp has either 0 or 1 result.
553d5b60ee8SRiver Riddle   if (isa<LLVM::CallOp>(opInst)) {
5545d7231d8SStephan Herhut     llvm::Value *result = convertCall(opInst);
5555d7231d8SStephan Herhut     if (opInst.getNumResults() != 0) {
5565d7231d8SStephan Herhut       valueMapping[opInst.getResult(0)] = result;
557baa1ec22SAlex Zinenko       return success();
5585d7231d8SStephan Herhut     }
5595d7231d8SStephan Herhut     // Check that LLVM call returns void for 0-result functions.
560baa1ec22SAlex Zinenko     return success(result->getType()->isVoidTy());
5615d7231d8SStephan Herhut   }
5625d7231d8SStephan Herhut 
563*047400edSNicolas Vasilache   if (auto inlineAsmOp = dyn_cast<LLVM::InlineAsmOp>(opInst)) {
564*047400edSNicolas Vasilache     // TODO: refactor function type creation which usually occurs in std-LLVM
565*047400edSNicolas Vasilache     // conversion.
566*047400edSNicolas Vasilache     SmallVector<LLVM::LLVMType, 8> operandTypes;
567*047400edSNicolas Vasilache     operandTypes.reserve(inlineAsmOp.operands().size());
568*047400edSNicolas Vasilache     for (auto t : inlineAsmOp.operands().getTypes())
569*047400edSNicolas Vasilache       operandTypes.push_back(t.cast<LLVM::LLVMType>());
570*047400edSNicolas Vasilache 
571*047400edSNicolas Vasilache     LLVM::LLVMType resultType;
572*047400edSNicolas Vasilache     if (inlineAsmOp.getNumResults() == 0) {
573*047400edSNicolas Vasilache       resultType = LLVM::LLVMType::getVoidTy(mlirModule->getContext());
574*047400edSNicolas Vasilache     } else {
575*047400edSNicolas Vasilache       assert(inlineAsmOp.getNumResults() == 1);
576*047400edSNicolas Vasilache       resultType = inlineAsmOp.getResultTypes()[0].cast<LLVM::LLVMType>();
577*047400edSNicolas Vasilache     }
578*047400edSNicolas Vasilache     auto ft = LLVM::LLVMType::getFunctionTy(resultType, operandTypes,
579*047400edSNicolas Vasilache                                             /*isVarArg=*/false);
580*047400edSNicolas Vasilache     llvm::InlineAsm *inlineAsmInst =
581*047400edSNicolas Vasilache         inlineAsmOp.asm_dialect().hasValue()
582*047400edSNicolas Vasilache             ? llvm::InlineAsm::get(
583*047400edSNicolas Vasilache                   static_cast<llvm::FunctionType *>(convertType(ft)),
584*047400edSNicolas Vasilache                   inlineAsmOp.asm_string(), inlineAsmOp.constraints(),
585*047400edSNicolas Vasilache                   inlineAsmOp.has_side_effects(), inlineAsmOp.is_align_stack(),
586*047400edSNicolas Vasilache                   convertAsmDialectToLLVM(*inlineAsmOp.asm_dialect()))
587*047400edSNicolas Vasilache             : llvm::InlineAsm::get(
588*047400edSNicolas Vasilache                   static_cast<llvm::FunctionType *>(convertType(ft)),
589*047400edSNicolas Vasilache                   inlineAsmOp.asm_string(), inlineAsmOp.constraints(),
590*047400edSNicolas Vasilache                   inlineAsmOp.has_side_effects(), inlineAsmOp.is_align_stack());
591*047400edSNicolas Vasilache     llvm::Value *result =
592*047400edSNicolas Vasilache         builder.CreateCall(inlineAsmInst, lookupValues(inlineAsmOp.operands()));
593*047400edSNicolas Vasilache     if (opInst.getNumResults() != 0)
594*047400edSNicolas Vasilache       valueMapping[opInst.getResult(0)] = result;
595*047400edSNicolas Vasilache     return success();
596*047400edSNicolas Vasilache   }
597*047400edSNicolas Vasilache 
598d242aa24SShraiysh Vaishay   if (auto invOp = dyn_cast<LLVM::InvokeOp>(opInst)) {
599d242aa24SShraiysh Vaishay     auto operands = lookupValues(opInst.getOperands());
600d242aa24SShraiysh Vaishay     ArrayRef<llvm::Value *> operandsRef(operands);
601133049d0SEli Friedman     if (auto attr = opInst.getAttrOfType<FlatSymbolRefAttr>("callee")) {
602d242aa24SShraiysh Vaishay       builder.CreateInvoke(functionMapping.lookup(attr.getValue()),
603d242aa24SShraiysh Vaishay                            blockMapping[invOp.getSuccessor(0)],
604d242aa24SShraiysh Vaishay                            blockMapping[invOp.getSuccessor(1)], operandsRef);
605133049d0SEli Friedman     } else {
606133049d0SEli Friedman       auto *calleePtrType =
607133049d0SEli Friedman           cast<llvm::PointerType>(operandsRef.front()->getType());
608133049d0SEli Friedman       auto *calleeType =
609133049d0SEli Friedman           cast<llvm::FunctionType>(calleePtrType->getElementType());
610d242aa24SShraiysh Vaishay       builder.CreateInvoke(
611133049d0SEli Friedman           calleeType, operandsRef.front(), blockMapping[invOp.getSuccessor(0)],
612d242aa24SShraiysh Vaishay           blockMapping[invOp.getSuccessor(1)], operandsRef.drop_front());
613133049d0SEli Friedman     }
614d242aa24SShraiysh Vaishay     return success();
615d242aa24SShraiysh Vaishay   }
616d242aa24SShraiysh Vaishay 
617d242aa24SShraiysh Vaishay   if (auto lpOp = dyn_cast<LLVM::LandingpadOp>(opInst)) {
618aec38c61SAlex Zinenko     llvm::Type *ty = convertType(lpOp.getType().cast<LLVMType>());
619d242aa24SShraiysh Vaishay     llvm::LandingPadInst *lpi =
620d242aa24SShraiysh Vaishay         builder.CreateLandingPad(ty, lpOp.getNumOperands());
621d242aa24SShraiysh Vaishay 
622d242aa24SShraiysh Vaishay     // Add clauses
623d242aa24SShraiysh Vaishay     for (auto operand : lookupValues(lpOp.getOperands())) {
624d242aa24SShraiysh Vaishay       // All operands should be constant - checked by verifier
625d242aa24SShraiysh Vaishay       if (auto constOperand = dyn_cast<llvm::Constant>(operand))
626d242aa24SShraiysh Vaishay         lpi->addClause(constOperand);
627d242aa24SShraiysh Vaishay     }
628ff77397fSShraiysh Vaishay     valueMapping[lpOp.getResult()] = lpi;
629d242aa24SShraiysh Vaishay     return success();
630d242aa24SShraiysh Vaishay   }
631d242aa24SShraiysh Vaishay 
6325d7231d8SStephan Herhut   // Emit branches.  We need to look up the remapped blocks and ignore the block
6335d7231d8SStephan Herhut   // arguments that were transformed into PHI nodes.
634c5ecf991SRiver Riddle   if (auto brOp = dyn_cast<LLVM::BrOp>(opInst)) {
635c0fd5e65SRiver Riddle     builder.CreateBr(blockMapping[brOp.getSuccessor()]);
636baa1ec22SAlex Zinenko     return success();
6375d7231d8SStephan Herhut   }
638c5ecf991SRiver Riddle   if (auto condbrOp = dyn_cast<LLVM::CondBrOp>(opInst)) {
63999d03f03SGeorge Mitenkov     auto weights = condbrOp.branch_weights();
64099d03f03SGeorge Mitenkov     llvm::MDNode *branchWeights = nullptr;
64199d03f03SGeorge Mitenkov     if (weights) {
64299d03f03SGeorge Mitenkov       // Map weight attributes to LLVM metadata.
64399d03f03SGeorge Mitenkov       auto trueWeight =
64499d03f03SGeorge Mitenkov           weights.getValue().getValue(0).cast<IntegerAttr>().getInt();
64599d03f03SGeorge Mitenkov       auto falseWeight =
64699d03f03SGeorge Mitenkov           weights.getValue().getValue(1).cast<IntegerAttr>().getInt();
64799d03f03SGeorge Mitenkov       branchWeights =
64899d03f03SGeorge Mitenkov           llvm::MDBuilder(llvmModule->getContext())
64999d03f03SGeorge Mitenkov               .createBranchWeights(static_cast<uint32_t>(trueWeight),
65099d03f03SGeorge Mitenkov                                    static_cast<uint32_t>(falseWeight));
65199d03f03SGeorge Mitenkov     }
6525d7231d8SStephan Herhut     builder.CreateCondBr(valueMapping.lookup(condbrOp.getOperand(0)),
6535d7231d8SStephan Herhut                          blockMapping[condbrOp.getSuccessor(0)],
65499d03f03SGeorge Mitenkov                          blockMapping[condbrOp.getSuccessor(1)], branchWeights);
655baa1ec22SAlex Zinenko     return success();
6565d7231d8SStephan Herhut   }
6575d7231d8SStephan Herhut 
6582dd38b09SAlex Zinenko   // Emit addressof.  We need to look up the global value referenced by the
6592dd38b09SAlex Zinenko   // operation and store it in the MLIR-to-LLVM value mapping.  This does not
6602dd38b09SAlex Zinenko   // emit any LLVM instruction.
6612dd38b09SAlex Zinenko   if (auto addressOfOp = dyn_cast<LLVM::AddressOfOp>(opInst)) {
6622dd38b09SAlex Zinenko     LLVM::GlobalOp global = addressOfOp.getGlobal();
663cba733edSAlex Zinenko     LLVM::LLVMFuncOp function = addressOfOp.getFunction();
6642dd38b09SAlex Zinenko 
665cba733edSAlex Zinenko     // The verifier should not have allowed this.
666cba733edSAlex Zinenko     assert((global || function) &&
667cba733edSAlex Zinenko            "referencing an undefined global or function");
668cba733edSAlex Zinenko 
669cba733edSAlex Zinenko     valueMapping[addressOfOp.getResult()] =
670cba733edSAlex Zinenko         global ? globalsMapping.lookup(global)
671cba733edSAlex Zinenko                : functionMapping.lookup(function.getName());
6722dd38b09SAlex Zinenko     return success();
6732dd38b09SAlex Zinenko   }
6742dd38b09SAlex Zinenko 
6759f9f89d4SMehdi Amini   if (ompDialect && opInst.getDialect() == ompDialect)
6767ecee63eSKiran Kumar T P     return convertOmpOperation(opInst, builder);
67792a295ebSKiran Chandramohan 
678baa1ec22SAlex Zinenko   return opInst.emitError("unsupported or non-LLVM operation: ")
679baa1ec22SAlex Zinenko          << opInst.getName();
6805d7231d8SStephan Herhut }
6815d7231d8SStephan Herhut 
6822666b973SRiver Riddle /// Convert block to LLVM IR.  Unless `ignoreArguments` is set, emit PHI nodes
6832666b973SRiver Riddle /// to define values corresponding to the MLIR block arguments.  These nodes
6842666b973SRiver Riddle /// are not connected to the source basic blocks, which may not exist yet.
685baa1ec22SAlex Zinenko LogicalResult ModuleTranslation::convertBlock(Block &bb, bool ignoreArguments) {
6865d7231d8SStephan Herhut   llvm::IRBuilder<> builder(blockMapping[&bb]);
687c33d6970SRiver Riddle   auto *subprogram = builder.GetInsertBlock()->getParent()->getSubprogram();
6885d7231d8SStephan Herhut 
6895d7231d8SStephan Herhut   // Before traversing operations, make block arguments available through
6905d7231d8SStephan Herhut   // value remapping and PHI nodes, but do not add incoming edges for the PHI
6915d7231d8SStephan Herhut   // nodes just yet: those values may be defined by this or following blocks.
6925d7231d8SStephan Herhut   // This step is omitted if "ignoreArguments" is set.  The arguments of the
6935d7231d8SStephan Herhut   // first block have been already made available through the remapping of
6945d7231d8SStephan Herhut   // LLVM function arguments.
6955d7231d8SStephan Herhut   if (!ignoreArguments) {
6965d7231d8SStephan Herhut     auto predecessors = bb.getPredecessors();
6975d7231d8SStephan Herhut     unsigned numPredecessors =
6985d7231d8SStephan Herhut         std::distance(predecessors.begin(), predecessors.end());
69935807bc4SRiver Riddle     for (auto arg : bb.getArguments()) {
7002bdf33ccSRiver Riddle       auto wrappedType = arg.getType().dyn_cast<LLVM::LLVMType>();
701baa1ec22SAlex Zinenko       if (!wrappedType)
702baa1ec22SAlex Zinenko         return emitError(bb.front().getLoc(),
703a4c3a645SRiver Riddle                          "block argument does not have an LLVM type");
704aec38c61SAlex Zinenko       llvm::Type *type = convertType(wrappedType);
7055d7231d8SStephan Herhut       llvm::PHINode *phi = builder.CreatePHI(type, numPredecessors);
7065d7231d8SStephan Herhut       valueMapping[arg] = phi;
7075d7231d8SStephan Herhut     }
7085d7231d8SStephan Herhut   }
7095d7231d8SStephan Herhut 
7105d7231d8SStephan Herhut   // Traverse operations.
7115d7231d8SStephan Herhut   for (auto &op : bb) {
712c33d6970SRiver Riddle     // Set the current debug location within the builder.
713c33d6970SRiver Riddle     builder.SetCurrentDebugLocation(
714c33d6970SRiver Riddle         debugTranslation->translateLoc(op.getLoc(), subprogram));
715c33d6970SRiver Riddle 
716baa1ec22SAlex Zinenko     if (failed(convertOperation(op, builder)))
717baa1ec22SAlex Zinenko       return failure();
7185d7231d8SStephan Herhut   }
7195d7231d8SStephan Herhut 
720baa1ec22SAlex Zinenko   return success();
7215d7231d8SStephan Herhut }
7225d7231d8SStephan Herhut 
7232666b973SRiver Riddle /// Create named global variables that correspond to llvm.mlir.global
7242666b973SRiver Riddle /// definitions.
725efa2d533SAlex Zinenko LogicalResult ModuleTranslation::convertGlobals() {
72644fc7d72STres Popp   for (auto op : getModuleBody(mlirModule).getOps<LLVM::GlobalOp>()) {
727aec38c61SAlex Zinenko     llvm::Type *type = convertType(op.getType());
728250a11aeSJames Molloy     llvm::Constant *cst = llvm::UndefValue::get(type);
729250a11aeSJames Molloy     if (op.getValueOrNull()) {
73068451df2SAlex Zinenko       // String attributes are treated separately because they cannot appear as
73168451df2SAlex Zinenko       // in-function constants and are thus not supported by getLLVMConstant.
73233a3a91bSChristian Sigg       if (auto strAttr = op.getValueOrNull().dyn_cast_or_null<StringAttr>()) {
7332dd38b09SAlex Zinenko         cst = llvm::ConstantDataArray::getString(
73468451df2SAlex Zinenko             llvmModule->getContext(), strAttr.getValue(), /*AddNull=*/false);
7352dd38b09SAlex Zinenko         type = cst->getType();
736efa2d533SAlex Zinenko       } else if (!(cst = getLLVMConstant(type, op.getValueOrNull(),
737efa2d533SAlex Zinenko                                          op.getLoc()))) {
738efa2d533SAlex Zinenko         return failure();
73968451df2SAlex Zinenko       }
740250a11aeSJames Molloy     } else if (Block *initializer = op.getInitializerBlock()) {
741250a11aeSJames Molloy       llvm::IRBuilder<> builder(llvmModule->getContext());
742250a11aeSJames Molloy       for (auto &op : initializer->without_terminator()) {
743250a11aeSJames Molloy         if (failed(convertOperation(op, builder)) ||
744efa2d533SAlex Zinenko             !isa<llvm::Constant>(valueMapping.lookup(op.getResult(0))))
745efa2d533SAlex Zinenko           return emitError(op.getLoc(), "unemittable constant value");
746250a11aeSJames Molloy       }
747250a11aeSJames Molloy       ReturnOp ret = cast<ReturnOp>(initializer->getTerminator());
748250a11aeSJames Molloy       cst = cast<llvm::Constant>(valueMapping.lookup(ret.getOperand(0)));
749250a11aeSJames Molloy     }
75068451df2SAlex Zinenko 
751eb67bd78SAlex Zinenko     auto linkage = convertLinkageToLLVM(op.linkage());
752d5e627f8SAlex Zinenko     bool anyExternalLinkage =
7537b5d4669SEric Schweitz         ((linkage == llvm::GlobalVariable::ExternalLinkage &&
7547b5d4669SEric Schweitz           isa<llvm::UndefValue>(cst)) ||
755d5e627f8SAlex Zinenko          linkage == llvm::GlobalVariable::ExternalWeakLinkage);
756431bb8b3SRiver Riddle     auto addrSpace = op.addr_space();
757e79bfefbSMLIR Team     auto *var = new llvm::GlobalVariable(
758d5e627f8SAlex Zinenko         *llvmModule, type, op.constant(), linkage,
759d5e627f8SAlex Zinenko         anyExternalLinkage ? nullptr : cst, op.sym_name(),
760d5e627f8SAlex Zinenko         /*InsertBefore=*/nullptr, llvm::GlobalValue::NotThreadLocal, addrSpace);
761e79bfefbSMLIR Team 
7622dd38b09SAlex Zinenko     globalsMapping.try_emplace(op, var);
763b9ff2dd8SAlex Zinenko   }
764efa2d533SAlex Zinenko 
765efa2d533SAlex Zinenko   return success();
766b9ff2dd8SAlex Zinenko }
767b9ff2dd8SAlex Zinenko 
7680a2131b7SAlex Zinenko /// Attempts to add an attribute identified by `key`, optionally with the given
7690a2131b7SAlex Zinenko /// `value` to LLVM function `llvmFunc`. Reports errors at `loc` if any. If the
7700a2131b7SAlex Zinenko /// attribute has a kind known to LLVM IR, create the attribute of this kind,
7710a2131b7SAlex Zinenko /// otherwise keep it as a string attribute. Performs additional checks for
7720a2131b7SAlex Zinenko /// attributes known to have or not have a value in order to avoid assertions
7730a2131b7SAlex Zinenko /// inside LLVM upon construction.
7740a2131b7SAlex Zinenko static LogicalResult checkedAddLLVMFnAttribute(Location loc,
7750a2131b7SAlex Zinenko                                                llvm::Function *llvmFunc,
7760a2131b7SAlex Zinenko                                                StringRef key,
7770a2131b7SAlex Zinenko                                                StringRef value = StringRef()) {
7780a2131b7SAlex Zinenko   auto kind = llvm::Attribute::getAttrKindFromName(key);
7790a2131b7SAlex Zinenko   if (kind == llvm::Attribute::None) {
7800a2131b7SAlex Zinenko     llvmFunc->addFnAttr(key, value);
7810a2131b7SAlex Zinenko     return success();
7820a2131b7SAlex Zinenko   }
7830a2131b7SAlex Zinenko 
7840a2131b7SAlex Zinenko   if (llvm::Attribute::doesAttrKindHaveArgument(kind)) {
7850a2131b7SAlex Zinenko     if (value.empty())
7860a2131b7SAlex Zinenko       return emitError(loc) << "LLVM attribute '" << key << "' expects a value";
7870a2131b7SAlex Zinenko 
7880a2131b7SAlex Zinenko     int result;
7890a2131b7SAlex Zinenko     if (!value.getAsInteger(/*Radix=*/0, result))
7900a2131b7SAlex Zinenko       llvmFunc->addFnAttr(
7910a2131b7SAlex Zinenko           llvm::Attribute::get(llvmFunc->getContext(), kind, result));
7920a2131b7SAlex Zinenko     else
7930a2131b7SAlex Zinenko       llvmFunc->addFnAttr(key, value);
7940a2131b7SAlex Zinenko     return success();
7950a2131b7SAlex Zinenko   }
7960a2131b7SAlex Zinenko 
7970a2131b7SAlex Zinenko   if (!value.empty())
7980a2131b7SAlex Zinenko     return emitError(loc) << "LLVM attribute '" << key
7990a2131b7SAlex Zinenko                           << "' does not expect a value, found '" << value
8000a2131b7SAlex Zinenko                           << "'";
8010a2131b7SAlex Zinenko 
8020a2131b7SAlex Zinenko   llvmFunc->addFnAttr(kind);
8030a2131b7SAlex Zinenko   return success();
8040a2131b7SAlex Zinenko }
8050a2131b7SAlex Zinenko 
8060a2131b7SAlex Zinenko /// Attaches the attributes listed in the given array attribute to `llvmFunc`.
8070a2131b7SAlex Zinenko /// Reports error to `loc` if any and returns immediately. Expects `attributes`
8080a2131b7SAlex Zinenko /// to be an array attribute containing either string attributes, treated as
8090a2131b7SAlex Zinenko /// value-less LLVM attributes, or array attributes containing two string
8100a2131b7SAlex Zinenko /// attributes, with the first string being the name of the corresponding LLVM
8110a2131b7SAlex Zinenko /// attribute and the second string beings its value. Note that even integer
8120a2131b7SAlex Zinenko /// attributes are expected to have their values expressed as strings.
8130a2131b7SAlex Zinenko static LogicalResult
8140a2131b7SAlex Zinenko forwardPassthroughAttributes(Location loc, Optional<ArrayAttr> attributes,
8150a2131b7SAlex Zinenko                              llvm::Function *llvmFunc) {
8160a2131b7SAlex Zinenko   if (!attributes)
8170a2131b7SAlex Zinenko     return success();
8180a2131b7SAlex Zinenko 
8190a2131b7SAlex Zinenko   for (Attribute attr : *attributes) {
8200a2131b7SAlex Zinenko     if (auto stringAttr = attr.dyn_cast<StringAttr>()) {
8210a2131b7SAlex Zinenko       if (failed(
8220a2131b7SAlex Zinenko               checkedAddLLVMFnAttribute(loc, llvmFunc, stringAttr.getValue())))
8230a2131b7SAlex Zinenko         return failure();
8240a2131b7SAlex Zinenko       continue;
8250a2131b7SAlex Zinenko     }
8260a2131b7SAlex Zinenko 
8270a2131b7SAlex Zinenko     auto arrayAttr = attr.dyn_cast<ArrayAttr>();
8280a2131b7SAlex Zinenko     if (!arrayAttr || arrayAttr.size() != 2)
8290a2131b7SAlex Zinenko       return emitError(loc)
8300a2131b7SAlex Zinenko              << "expected 'passthrough' to contain string or array attributes";
8310a2131b7SAlex Zinenko 
8320a2131b7SAlex Zinenko     auto keyAttr = arrayAttr[0].dyn_cast<StringAttr>();
8330a2131b7SAlex Zinenko     auto valueAttr = arrayAttr[1].dyn_cast<StringAttr>();
8340a2131b7SAlex Zinenko     if (!keyAttr || !valueAttr)
8350a2131b7SAlex Zinenko       return emitError(loc)
8360a2131b7SAlex Zinenko              << "expected arrays within 'passthrough' to contain two strings";
8370a2131b7SAlex Zinenko 
8380a2131b7SAlex Zinenko     if (failed(checkedAddLLVMFnAttribute(loc, llvmFunc, keyAttr.getValue(),
8390a2131b7SAlex Zinenko                                          valueAttr.getValue())))
8400a2131b7SAlex Zinenko       return failure();
8410a2131b7SAlex Zinenko   }
8420a2131b7SAlex Zinenko   return success();
8430a2131b7SAlex Zinenko }
8440a2131b7SAlex Zinenko 
8455e7959a3SAlex Zinenko LogicalResult ModuleTranslation::convertOneFunction(LLVMFuncOp func) {
8465d7231d8SStephan Herhut   // Clear the block and value mappings, they are only relevant within one
8475d7231d8SStephan Herhut   // function.
8485d7231d8SStephan Herhut   blockMapping.clear();
8495d7231d8SStephan Herhut   valueMapping.clear();
850c33862b0SRiver Riddle   llvm::Function *llvmFunc = functionMapping.lookup(func.getName());
851c33d6970SRiver Riddle 
852c33d6970SRiver Riddle   // Translate the debug information for this function.
853c33d6970SRiver Riddle   debugTranslation->translate(func, *llvmFunc);
854c33d6970SRiver Riddle 
8555d7231d8SStephan Herhut   // Add function arguments to the value remapping table.
8565d7231d8SStephan Herhut   // If there was noalias info then we decorate each argument accordingly.
8575d7231d8SStephan Herhut   unsigned int argIdx = 0;
858eeef50b1SFangrui Song   for (auto kvp : llvm::zip(func.getArguments(), llvmFunc->args())) {
8595d7231d8SStephan Herhut     llvm::Argument &llvmArg = std::get<1>(kvp);
860e62a6956SRiver Riddle     BlockArgument mlirArg = std::get<0>(kvp);
8615d7231d8SStephan Herhut 
86267cc5cecSStephan Herhut     if (auto attr = func.getArgAttrOfType<BoolAttr>(
86367cc5cecSStephan Herhut             argIdx, LLVMDialect::getNoAliasAttrName())) {
8645d7231d8SStephan Herhut       // NB: Attribute already verified to be boolean, so check if we can indeed
8655d7231d8SStephan Herhut       // attach the attribute to this argument, based on its type.
8662bdf33ccSRiver Riddle       auto argTy = mlirArg.getType().dyn_cast<LLVM::LLVMType>();
867aec38c61SAlex Zinenko       if (!argTy.isPointerTy())
868baa1ec22SAlex Zinenko         return func.emitError(
8695d7231d8SStephan Herhut             "llvm.noalias attribute attached to LLVM non-pointer argument");
8705d7231d8SStephan Herhut       if (attr.getValue())
8715d7231d8SStephan Herhut         llvmArg.addAttr(llvm::Attribute::AttrKind::NoAlias);
8725d7231d8SStephan Herhut     }
8732416e28cSStephan Herhut 
87467cc5cecSStephan Herhut     if (auto attr = func.getArgAttrOfType<IntegerAttr>(
87567cc5cecSStephan Herhut             argIdx, LLVMDialect::getAlignAttrName())) {
8762416e28cSStephan Herhut       // NB: Attribute already verified to be int, so check if we can indeed
8772416e28cSStephan Herhut       // attach the attribute to this argument, based on its type.
8782416e28cSStephan Herhut       auto argTy = mlirArg.getType().dyn_cast<LLVM::LLVMType>();
879aec38c61SAlex Zinenko       if (!argTy.isPointerTy())
8802416e28cSStephan Herhut         return func.emitError(
8812416e28cSStephan Herhut             "llvm.align attribute attached to LLVM non-pointer argument");
8822416e28cSStephan Herhut       llvmArg.addAttrs(
8832416e28cSStephan Herhut           llvm::AttrBuilder().addAlignmentAttr(llvm::Align(attr.getInt())));
8842416e28cSStephan Herhut     }
8852416e28cSStephan Herhut 
8865d7231d8SStephan Herhut     valueMapping[mlirArg] = &llvmArg;
8875d7231d8SStephan Herhut     argIdx++;
8885d7231d8SStephan Herhut   }
8895d7231d8SStephan Herhut 
890ff77397fSShraiysh Vaishay   // Check the personality and set it.
891ff77397fSShraiysh Vaishay   if (func.personality().hasValue()) {
892ff77397fSShraiysh Vaishay     llvm::Type *ty = llvm::Type::getInt8PtrTy(llvmFunc->getContext());
893ff77397fSShraiysh Vaishay     if (llvm::Constant *pfunc =
894ff77397fSShraiysh Vaishay             getLLVMConstant(ty, func.personalityAttr(), func.getLoc()))
895ff77397fSShraiysh Vaishay       llvmFunc->setPersonalityFn(pfunc);
896ff77397fSShraiysh Vaishay   }
897ff77397fSShraiysh Vaishay 
8985d7231d8SStephan Herhut   // First, create all blocks so we can jump to them.
8995d7231d8SStephan Herhut   llvm::LLVMContext &llvmContext = llvmFunc->getContext();
9005d7231d8SStephan Herhut   for (auto &bb : func) {
9015d7231d8SStephan Herhut     auto *llvmBB = llvm::BasicBlock::Create(llvmContext);
9025d7231d8SStephan Herhut     llvmBB->insertInto(llvmFunc);
9035d7231d8SStephan Herhut     blockMapping[&bb] = llvmBB;
9045d7231d8SStephan Herhut   }
9055d7231d8SStephan Herhut 
9065d7231d8SStephan Herhut   // Then, convert blocks one by one in topological order to ensure defs are
9075d7231d8SStephan Herhut   // converted before uses.
9085d7231d8SStephan Herhut   auto blocks = topologicalSort(func);
9095d7231d8SStephan Herhut   for (auto indexedBB : llvm::enumerate(blocks)) {
9105d7231d8SStephan Herhut     auto *bb = indexedBB.value();
911baa1ec22SAlex Zinenko     if (failed(convertBlock(*bb, /*ignoreArguments=*/indexedBB.index() == 0)))
912baa1ec22SAlex Zinenko       return failure();
9135d7231d8SStephan Herhut   }
9145d7231d8SStephan Herhut 
9155d7231d8SStephan Herhut   // Finally, after all blocks have been traversed and values mapped, connect
9165d7231d8SStephan Herhut   // the PHI nodes to the results of preceding blocks.
917d9067dcaSKiran Chandramohan   connectPHINodes(func, valueMapping, blockMapping);
918baa1ec22SAlex Zinenko   return success();
9195d7231d8SStephan Herhut }
9205d7231d8SStephan Herhut 
92144fc7d72STres Popp LogicalResult ModuleTranslation::checkSupportedModuleOps(Operation *m) {
92244fc7d72STres Popp   for (Operation &o : getModuleBody(m).getOperations())
923ee394e68SRahul Joshi     if (!isa<LLVM::LLVMFuncOp, LLVM::GlobalOp>(&o) && !o.isKnownTerminator())
9244dde19f0SAlex Zinenko       return o.emitOpError("unsupported module-level operation");
9254dde19f0SAlex Zinenko   return success();
9264dde19f0SAlex Zinenko }
9274dde19f0SAlex Zinenko 
928a084b94fSSean Silva LogicalResult ModuleTranslation::convertFunctionSignatures() {
9295d7231d8SStephan Herhut   // Declare all functions first because there may be function calls that form a
930a084b94fSSean Silva   // call graph with cycles, or global initializers that reference functions.
93144fc7d72STres Popp   for (auto function : getModuleBody(mlirModule).getOps<LLVMFuncOp>()) {
9325e7959a3SAlex Zinenko     llvm::FunctionCallee llvmFuncCst = llvmModule->getOrInsertFunction(
9335e7959a3SAlex Zinenko         function.getName(),
934aec38c61SAlex Zinenko         cast<llvm::FunctionType>(convertType(function.getType())));
9350a2131b7SAlex Zinenko     llvm::Function *llvmFunc = cast<llvm::Function>(llvmFuncCst.getCallee());
936ebbdecddSAlex Zinenko     llvmFunc->setLinkage(convertLinkageToLLVM(function.linkage()));
9370a2131b7SAlex Zinenko     functionMapping[function.getName()] = llvmFunc;
9380a2131b7SAlex Zinenko 
9390a2131b7SAlex Zinenko     // Forward the pass-through attributes to LLVM.
9400a2131b7SAlex Zinenko     if (failed(forwardPassthroughAttributes(function.getLoc(),
9410a2131b7SAlex Zinenko                                             function.passthrough(), llvmFunc)))
9420a2131b7SAlex Zinenko       return failure();
9435d7231d8SStephan Herhut   }
9445d7231d8SStephan Herhut 
945a084b94fSSean Silva   return success();
946a084b94fSSean Silva }
947a084b94fSSean Silva 
948a084b94fSSean Silva LogicalResult ModuleTranslation::convertFunctions() {
9495d7231d8SStephan Herhut   // Convert functions.
95044fc7d72STres Popp   for (auto function : getModuleBody(mlirModule).getOps<LLVMFuncOp>()) {
9515d7231d8SStephan Herhut     // Ignore external functions.
9525d7231d8SStephan Herhut     if (function.isExternal())
9535d7231d8SStephan Herhut       continue;
9545d7231d8SStephan Herhut 
955baa1ec22SAlex Zinenko     if (failed(convertOneFunction(function)))
956baa1ec22SAlex Zinenko       return failure();
9575d7231d8SStephan Herhut   }
9585d7231d8SStephan Herhut 
959baa1ec22SAlex Zinenko   return success();
9605d7231d8SStephan Herhut }
9615d7231d8SStephan Herhut 
962aec38c61SAlex Zinenko llvm::Type *ModuleTranslation::convertType(LLVMType type) {
963b2ab375dSAlex Zinenko   return typeTranslator.translateType(type);
964aec38c61SAlex Zinenko }
965aec38c61SAlex Zinenko 
966efadb6b8SAlex Zinenko /// A helper to look up remapped operands in the value remapping table.`
967efadb6b8SAlex Zinenko SmallVector<llvm::Value *, 8>
968efadb6b8SAlex Zinenko ModuleTranslation::lookupValues(ValueRange values) {
969efadb6b8SAlex Zinenko   SmallVector<llvm::Value *, 8> remapped;
970efadb6b8SAlex Zinenko   remapped.reserve(values.size());
971ff77397fSShraiysh Vaishay   for (Value v : values) {
972ff77397fSShraiysh Vaishay     assert(valueMapping.count(v) && "referencing undefined value");
973efadb6b8SAlex Zinenko     remapped.push_back(valueMapping.lookup(v));
974ff77397fSShraiysh Vaishay   }
975efadb6b8SAlex Zinenko   return remapped;
976efadb6b8SAlex Zinenko }
977efadb6b8SAlex Zinenko 
978db1c197bSAlex Zinenko std::unique_ptr<llvm::Module> ModuleTranslation::prepareLLVMModule(
979db1c197bSAlex Zinenko     Operation *m, llvm::LLVMContext &llvmContext, StringRef name) {
980f9dc2b70SMehdi Amini   m->getContext()->getOrLoadDialect<LLVM::LLVMDialect>();
981db1c197bSAlex Zinenko   auto llvmModule = std::make_unique<llvm::Module>(name, llvmContext);
982168213f9SAlex Zinenko   if (auto dataLayoutAttr =
983168213f9SAlex Zinenko           m->getAttr(LLVM::LLVMDialect::getDataLayoutAttrName()))
984168213f9SAlex Zinenko     llvmModule->setDataLayout(dataLayoutAttr.cast<StringAttr>().getValue());
9855dd5a083SNicolas Vasilache   if (auto targetTripleAttr =
9865dd5a083SNicolas Vasilache           m->getAttr(LLVM::LLVMDialect::getTargetTripleAttrName()))
9875dd5a083SNicolas Vasilache     llvmModule->setTargetTriple(targetTripleAttr.cast<StringAttr>().getValue());
9885d7231d8SStephan Herhut 
9895d7231d8SStephan Herhut   // Inject declarations for `malloc` and `free` functions that can be used in
9905d7231d8SStephan Herhut   // memref allocation/deallocation coming from standard ops lowering.
991db1c197bSAlex Zinenko   llvm::IRBuilder<> builder(llvmContext);
9925d7231d8SStephan Herhut   llvmModule->getOrInsertFunction("malloc", builder.getInt8PtrTy(),
9935d7231d8SStephan Herhut                                   builder.getInt64Ty());
9945d7231d8SStephan Herhut   llvmModule->getOrInsertFunction("free", builder.getVoidTy(),
9955d7231d8SStephan Herhut                                   builder.getInt8PtrTy());
9965d7231d8SStephan Herhut 
9975d7231d8SStephan Herhut   return llvmModule;
9985d7231d8SStephan Herhut }
999