1cde4d5a6SJacques Pienaar //===- ModuleTranslation.cpp - MLIR to LLVM conversion --------------------===//
25d7231d8SStephan Herhut //
35d7231d8SStephan Herhut // Copyright 2019 The MLIR Authors.
45d7231d8SStephan Herhut //
55d7231d8SStephan Herhut // Licensed under the Apache License, Version 2.0 (the "License");
65d7231d8SStephan Herhut // you may not use this file except in compliance with the License.
75d7231d8SStephan Herhut // You may obtain a copy of the License at
85d7231d8SStephan Herhut //
95d7231d8SStephan Herhut //   http://www.apache.org/licenses/LICENSE-2.0
105d7231d8SStephan Herhut //
115d7231d8SStephan Herhut // Unless required by applicable law or agreed to in writing, software
125d7231d8SStephan Herhut // distributed under the License is distributed on an "AS IS" BASIS,
135d7231d8SStephan Herhut // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
145d7231d8SStephan Herhut // See the License for the specific language governing permissions and
155d7231d8SStephan Herhut // limitations under the License.
165d7231d8SStephan Herhut // =============================================================================
175d7231d8SStephan Herhut //
185d7231d8SStephan Herhut // This file implements the translation between an MLIR LLVM dialect module and
195d7231d8SStephan Herhut // the corresponding LLVMIR module. It only handles core LLVM IR operations.
205d7231d8SStephan Herhut //
215d7231d8SStephan Herhut //===----------------------------------------------------------------------===//
225d7231d8SStephan Herhut 
235d7231d8SStephan Herhut #include "mlir/Target/LLVMIR/ModuleTranslation.h"
245d7231d8SStephan Herhut 
25ba0fa925SRiver Riddle #include "mlir/Dialect/LLVMIR/LLVMDialect.h"
265d7231d8SStephan Herhut #include "mlir/IR/Attributes.h"
275d7231d8SStephan Herhut #include "mlir/IR/Module.h"
285d7231d8SStephan Herhut #include "mlir/Support/LLVM.h"
295d7231d8SStephan Herhut 
305d7231d8SStephan Herhut #include "llvm/ADT/SetVector.h"
315d7231d8SStephan Herhut #include "llvm/IR/BasicBlock.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"
365d7231d8SStephan Herhut #include "llvm/IR/Module.h"
375d7231d8SStephan Herhut #include "llvm/Transforms/Utils/Cloning.h"
385d7231d8SStephan Herhut 
395d7231d8SStephan Herhut namespace mlir {
405d7231d8SStephan Herhut namespace LLVM {
415d7231d8SStephan Herhut 
425d7231d8SStephan Herhut // Create an LLVM IR constant of `llvmType` from the MLIR attribute `attr`.
435d7231d8SStephan Herhut // This currently supports integer, floating point, splat and dense element
445d7231d8SStephan Herhut // attributes and combinations thereof.  In case of error, report it to `loc`
455d7231d8SStephan Herhut // and return nullptr.
465d7231d8SStephan Herhut llvm::Constant *ModuleTranslation::getLLVMConstant(llvm::Type *llvmType,
475d7231d8SStephan Herhut                                                    Attribute attr,
485d7231d8SStephan Herhut                                                    Location loc) {
4933a3a91bSChristian Sigg   if (!attr)
5033a3a91bSChristian Sigg     return llvm::UndefValue::get(llvmType);
515d7231d8SStephan Herhut   if (auto intAttr = attr.dyn_cast<IntegerAttr>())
525d7231d8SStephan Herhut     return llvm::ConstantInt::get(llvmType, intAttr.getValue());
535d7231d8SStephan Herhut   if (auto floatAttr = attr.dyn_cast<FloatAttr>())
545d7231d8SStephan Herhut     return llvm::ConstantFP::get(llvmType, floatAttr.getValue());
559b9c647cSRiver Riddle   if (auto funcAttr = attr.dyn_cast<FlatSymbolRefAttr>())
565d7231d8SStephan Herhut     return functionMapping.lookup(funcAttr.getValue());
575d7231d8SStephan Herhut   if (auto splatAttr = attr.dyn_cast<SplatElementsAttr>()) {
582f13df13SMLIR Team     auto *sequentialType = cast<llvm::SequentialType>(llvmType);
592f13df13SMLIR Team     auto elementType = sequentialType->getElementType();
602f13df13SMLIR Team     uint64_t numElements = sequentialType->getNumElements();
612f13df13SMLIR Team     auto *child = getLLVMConstant(elementType, splatAttr.getSplatValue(), loc);
622f13df13SMLIR Team     if (llvmType->isVectorTy())
632f13df13SMLIR Team       return llvm::ConstantVector::getSplat(numElements, child);
642f13df13SMLIR Team     if (llvmType->isArrayTy()) {
652f13df13SMLIR Team       auto arrayType = llvm::ArrayType::get(elementType, numElements);
662f13df13SMLIR Team       SmallVector<llvm::Constant *, 8> constants(numElements, child);
672f13df13SMLIR Team       return llvm::ConstantArray::get(arrayType, constants);
682f13df13SMLIR Team     }
695d7231d8SStephan Herhut   }
70d906f84bSRiver Riddle   if (auto elementsAttr = attr.dyn_cast<ElementsAttr>()) {
712f13df13SMLIR Team     auto *sequentialType = cast<llvm::SequentialType>(llvmType);
722f13df13SMLIR Team     auto elementType = sequentialType->getElementType();
732f13df13SMLIR Team     uint64_t numElements = sequentialType->getNumElements();
745d7231d8SStephan Herhut     SmallVector<llvm::Constant *, 8> constants;
755d7231d8SStephan Herhut     constants.reserve(numElements);
76d906f84bSRiver Riddle     for (auto n : elementsAttr.getValues<Attribute>()) {
772f13df13SMLIR Team       constants.push_back(getLLVMConstant(elementType, n, loc));
785d7231d8SStephan Herhut       if (!constants.back())
795d7231d8SStephan Herhut         return nullptr;
805d7231d8SStephan Herhut     }
812f13df13SMLIR Team     if (llvmType->isVectorTy())
825d7231d8SStephan Herhut       return llvm::ConstantVector::get(constants);
832f13df13SMLIR Team     if (llvmType->isArrayTy()) {
842f13df13SMLIR Team       auto arrayType = llvm::ArrayType::get(elementType, numElements);
852f13df13SMLIR Team       return llvm::ConstantArray::get(arrayType, constants);
862f13df13SMLIR Team     }
875d7231d8SStephan Herhut   }
88cb348dffSStephan Herhut   if (auto stringAttr = attr.dyn_cast<StringAttr>()) {
89cb348dffSStephan Herhut     return llvm::ConstantDataArray::get(
90cb348dffSStephan Herhut         llvmModule->getContext(), ArrayRef<char>{stringAttr.getValue().data(),
91cb348dffSStephan Herhut                                                  stringAttr.getValue().size()});
92cb348dffSStephan Herhut   }
93a4c3a645SRiver Riddle   emitError(loc, "unsupported constant value");
945d7231d8SStephan Herhut   return nullptr;
955d7231d8SStephan Herhut }
965d7231d8SStephan Herhut 
975d7231d8SStephan Herhut // Convert MLIR integer comparison predicate to LLVM IR comparison predicate.
98ec82e1c9SAlex Zinenko static llvm::CmpInst::Predicate getLLVMCmpPredicate(ICmpPredicate p) {
995d7231d8SStephan Herhut   switch (p) {
100ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::eq:
1015d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_EQ;
102ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ne:
1035d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_NE;
104ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::slt:
1055d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SLT;
106ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::sle:
1075d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SLE;
108ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::sgt:
1095d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SGT;
110ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::sge:
1115d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_SGE;
112ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ult:
1135d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_ULT;
114ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ule:
1155d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_ULE;
116ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::ugt:
1175d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_UGT;
118ec82e1c9SAlex Zinenko   case LLVM::ICmpPredicate::uge:
1195d7231d8SStephan Herhut     return llvm::CmpInst::Predicate::ICMP_UGE;
1205d7231d8SStephan Herhut   }
121e6365f3dSJacques Pienaar   llvm_unreachable("incorrect comparison predicate");
1225d7231d8SStephan Herhut }
1235d7231d8SStephan Herhut 
12448fdc8d7SNagy Mostafa static llvm::CmpInst::Predicate getLLVMCmpPredicate(FCmpPredicate p) {
12548fdc8d7SNagy Mostafa   switch (p) {
12648fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::_false:
12748fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_FALSE;
12848fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::oeq:
12948fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OEQ;
13048fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ogt:
13148fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OGT;
13248fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::oge:
13348fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OGE;
13448fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::olt:
13548fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OLT;
13648fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ole:
13748fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_OLE;
13848fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::one:
13948fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ONE;
14048fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ord:
14148fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ORD;
14248fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ueq:
14348fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UEQ;
14448fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ugt:
14548fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UGT;
14648fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::uge:
14748fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UGE;
14848fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ult:
14948fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ULT;
15048fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::ule:
15148fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_ULE;
15248fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::une:
15348fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UNE;
15448fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::uno:
15548fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_UNO;
15648fdc8d7SNagy Mostafa   case LLVM::FCmpPredicate::_true:
15748fdc8d7SNagy Mostafa     return llvm::CmpInst::Predicate::FCMP_TRUE;
15848fdc8d7SNagy Mostafa   }
159e6365f3dSJacques Pienaar   llvm_unreachable("incorrect comparison predicate");
16048fdc8d7SNagy Mostafa }
16148fdc8d7SNagy Mostafa 
1625d7231d8SStephan Herhut // A helper to look up remapped operands in the value remapping table.
1635d7231d8SStephan Herhut template <typename Range>
1645d7231d8SStephan Herhut SmallVector<llvm::Value *, 8> ModuleTranslation::lookupValues(Range &&values) {
1655d7231d8SStephan Herhut   SmallVector<llvm::Value *, 8> remapped;
1665d7231d8SStephan Herhut   remapped.reserve(llvm::size(values));
1675d7231d8SStephan Herhut   for (Value *v : values) {
1685d7231d8SStephan Herhut     remapped.push_back(valueMapping.lookup(v));
1695d7231d8SStephan Herhut   }
1705d7231d8SStephan Herhut   return remapped;
1715d7231d8SStephan Herhut }
1725d7231d8SStephan Herhut 
1735d7231d8SStephan Herhut // Given a single MLIR operation, create the corresponding LLVM IR operation
1745d7231d8SStephan Herhut // using the `builder`.  LLVM IR Builder does not have a generic interface so
1755d7231d8SStephan Herhut // this has to be a long chain of `if`s calling different functions with a
1765d7231d8SStephan Herhut // different number of arguments.
177baa1ec22SAlex Zinenko LogicalResult ModuleTranslation::convertOperation(Operation &opInst,
1785d7231d8SStephan Herhut                                                   llvm::IRBuilder<> &builder) {
1795d7231d8SStephan Herhut   auto extractPosition = [](ArrayAttr attr) {
1805d7231d8SStephan Herhut     SmallVector<unsigned, 4> position;
1815d7231d8SStephan Herhut     position.reserve(attr.size());
1825d7231d8SStephan Herhut     for (Attribute v : attr)
1835d7231d8SStephan Herhut       position.push_back(v.cast<IntegerAttr>().getValue().getZExtValue());
1845d7231d8SStephan Herhut     return position;
1855d7231d8SStephan Herhut   };
1865d7231d8SStephan Herhut 
187ba0fa925SRiver Riddle #include "mlir/Dialect/LLVMIR/LLVMConversions.inc"
1885d7231d8SStephan Herhut 
1895d7231d8SStephan Herhut   // Emit function calls.  If the "callee" attribute is present, this is a
1905d7231d8SStephan Herhut   // direct function call and we also need to look up the remapped function
1915d7231d8SStephan Herhut   // itself.  Otherwise, this is an indirect call and the callee is the first
1925d7231d8SStephan Herhut   // operand, look it up as a normal value.  Return the llvm::Value representing
1935d7231d8SStephan Herhut   // the function result, which may be of llvm::VoidTy type.
1945d7231d8SStephan Herhut   auto convertCall = [this, &builder](Operation &op) -> llvm::Value * {
1955d7231d8SStephan Herhut     auto operands = lookupValues(op.getOperands());
1965d7231d8SStephan Herhut     ArrayRef<llvm::Value *> operandsRef(operands);
1979b9c647cSRiver Riddle     if (auto attr = op.getAttrOfType<FlatSymbolRefAttr>("callee")) {
1985d7231d8SStephan Herhut       return builder.CreateCall(functionMapping.lookup(attr.getValue()),
1995d7231d8SStephan Herhut                                 operandsRef);
2005d7231d8SStephan Herhut     } else {
2015d7231d8SStephan Herhut       return builder.CreateCall(operandsRef.front(), operandsRef.drop_front());
2025d7231d8SStephan Herhut     }
2035d7231d8SStephan Herhut   };
2045d7231d8SStephan Herhut 
2055d7231d8SStephan Herhut   // Emit calls.  If the called function has a result, remap the corresponding
2065d7231d8SStephan Herhut   // value.  Note that LLVM IR dialect CallOp has either 0 or 1 result.
207d5b60ee8SRiver Riddle   if (isa<LLVM::CallOp>(opInst)) {
2085d7231d8SStephan Herhut     llvm::Value *result = convertCall(opInst);
2095d7231d8SStephan Herhut     if (opInst.getNumResults() != 0) {
2105d7231d8SStephan Herhut       valueMapping[opInst.getResult(0)] = result;
211baa1ec22SAlex Zinenko       return success();
2125d7231d8SStephan Herhut     }
2135d7231d8SStephan Herhut     // Check that LLVM call returns void for 0-result functions.
214baa1ec22SAlex Zinenko     return success(result->getType()->isVoidTy());
2155d7231d8SStephan Herhut   }
2165d7231d8SStephan Herhut 
2175d7231d8SStephan Herhut   // Emit branches.  We need to look up the remapped blocks and ignore the block
2185d7231d8SStephan Herhut   // arguments that were transformed into PHI nodes.
219c5ecf991SRiver Riddle   if (auto brOp = dyn_cast<LLVM::BrOp>(opInst)) {
2205d7231d8SStephan Herhut     builder.CreateBr(blockMapping[brOp.getSuccessor(0)]);
221baa1ec22SAlex Zinenko     return success();
2225d7231d8SStephan Herhut   }
223c5ecf991SRiver Riddle   if (auto condbrOp = dyn_cast<LLVM::CondBrOp>(opInst)) {
2245d7231d8SStephan Herhut     builder.CreateCondBr(valueMapping.lookup(condbrOp.getOperand(0)),
2255d7231d8SStephan Herhut                          blockMapping[condbrOp.getSuccessor(0)],
2265d7231d8SStephan Herhut                          blockMapping[condbrOp.getSuccessor(1)]);
227baa1ec22SAlex Zinenko     return success();
2285d7231d8SStephan Herhut   }
2295d7231d8SStephan Herhut 
2302dd38b09SAlex Zinenko   // Emit addressof.  We need to look up the global value referenced by the
2312dd38b09SAlex Zinenko   // operation and store it in the MLIR-to-LLVM value mapping.  This does not
2322dd38b09SAlex Zinenko   // emit any LLVM instruction.
2332dd38b09SAlex Zinenko   if (auto addressOfOp = dyn_cast<LLVM::AddressOfOp>(opInst)) {
2342dd38b09SAlex Zinenko     LLVM::GlobalOp global = addressOfOp.getGlobal();
2352dd38b09SAlex Zinenko     // The verifier should not have allowed this.
2362dd38b09SAlex Zinenko     assert(global && "referencing an undefined global");
2372dd38b09SAlex Zinenko 
2382dd38b09SAlex Zinenko     valueMapping[addressOfOp.getResult()] = globalsMapping.lookup(global);
2392dd38b09SAlex Zinenko     return success();
2402dd38b09SAlex Zinenko   }
2412dd38b09SAlex Zinenko 
242baa1ec22SAlex Zinenko   return opInst.emitError("unsupported or non-LLVM operation: ")
243baa1ec22SAlex Zinenko          << opInst.getName();
2445d7231d8SStephan Herhut }
2455d7231d8SStephan Herhut 
2465d7231d8SStephan Herhut // Convert block to LLVM IR.  Unless `ignoreArguments` is set, emit PHI nodes
2475d7231d8SStephan Herhut // to define values corresponding to the MLIR block arguments.  These nodes
2485d7231d8SStephan Herhut // are not connected to the source basic blocks, which may not exist yet.
249baa1ec22SAlex Zinenko LogicalResult ModuleTranslation::convertBlock(Block &bb, bool ignoreArguments) {
2505d7231d8SStephan Herhut   llvm::IRBuilder<> builder(blockMapping[&bb]);
2515d7231d8SStephan Herhut 
2525d7231d8SStephan Herhut   // Before traversing operations, make block arguments available through
2535d7231d8SStephan Herhut   // value remapping and PHI nodes, but do not add incoming edges for the PHI
2545d7231d8SStephan Herhut   // nodes just yet: those values may be defined by this or following blocks.
2555d7231d8SStephan Herhut   // This step is omitted if "ignoreArguments" is set.  The arguments of the
2565d7231d8SStephan Herhut   // first block have been already made available through the remapping of
2575d7231d8SStephan Herhut   // LLVM function arguments.
2585d7231d8SStephan Herhut   if (!ignoreArguments) {
2595d7231d8SStephan Herhut     auto predecessors = bb.getPredecessors();
2605d7231d8SStephan Herhut     unsigned numPredecessors =
2615d7231d8SStephan Herhut         std::distance(predecessors.begin(), predecessors.end());
2625d7231d8SStephan Herhut     for (auto *arg : bb.getArguments()) {
2635d7231d8SStephan Herhut       auto wrappedType = arg->getType().dyn_cast<LLVM::LLVMType>();
264baa1ec22SAlex Zinenko       if (!wrappedType)
265baa1ec22SAlex Zinenko         return emitError(bb.front().getLoc(),
266a4c3a645SRiver Riddle                          "block argument does not have an LLVM type");
2675d7231d8SStephan Herhut       llvm::Type *type = wrappedType.getUnderlyingType();
2685d7231d8SStephan Herhut       llvm::PHINode *phi = builder.CreatePHI(type, numPredecessors);
2695d7231d8SStephan Herhut       valueMapping[arg] = phi;
2705d7231d8SStephan Herhut     }
2715d7231d8SStephan Herhut   }
2725d7231d8SStephan Herhut 
2735d7231d8SStephan Herhut   // Traverse operations.
2745d7231d8SStephan Herhut   for (auto &op : bb) {
275baa1ec22SAlex Zinenko     if (failed(convertOperation(op, builder)))
276baa1ec22SAlex Zinenko       return failure();
2775d7231d8SStephan Herhut   }
2785d7231d8SStephan Herhut 
279baa1ec22SAlex Zinenko   return success();
2805d7231d8SStephan Herhut }
2815d7231d8SStephan Herhut 
282d5e627f8SAlex Zinenko // Convert the LLVM dialect linkage type to LLVM IR linkage type.
283d5e627f8SAlex Zinenko llvm::GlobalVariable::LinkageTypes convertLinkageType(LLVM::Linkage linkage) {
284d5e627f8SAlex Zinenko   switch (linkage) {
285d5e627f8SAlex Zinenko   case LLVM::Linkage::Private:
286d5e627f8SAlex Zinenko     return llvm::GlobalValue::PrivateLinkage;
287d5e627f8SAlex Zinenko   case LLVM::Linkage::Internal:
288d5e627f8SAlex Zinenko     return llvm::GlobalValue::InternalLinkage;
289d5e627f8SAlex Zinenko   case LLVM::Linkage::AvailableExternally:
290d5e627f8SAlex Zinenko     return llvm::GlobalValue::AvailableExternallyLinkage;
291d5e627f8SAlex Zinenko   case LLVM::Linkage::Linkonce:
292d5e627f8SAlex Zinenko     return llvm::GlobalValue::LinkOnceAnyLinkage;
293d5e627f8SAlex Zinenko   case LLVM::Linkage::Weak:
294d5e627f8SAlex Zinenko     return llvm::GlobalValue::WeakAnyLinkage;
295d5e627f8SAlex Zinenko   case LLVM::Linkage::Common:
296d5e627f8SAlex Zinenko     return llvm::GlobalValue::CommonLinkage;
297d5e627f8SAlex Zinenko   case LLVM::Linkage::Appending:
298d5e627f8SAlex Zinenko     return llvm::GlobalValue::AppendingLinkage;
299d5e627f8SAlex Zinenko   case LLVM::Linkage::ExternWeak:
300d5e627f8SAlex Zinenko     return llvm::GlobalValue::ExternalWeakLinkage;
301d5e627f8SAlex Zinenko   case LLVM::Linkage::LinkonceODR:
302d5e627f8SAlex Zinenko     return llvm::GlobalValue::LinkOnceODRLinkage;
303d5e627f8SAlex Zinenko   case LLVM::Linkage::WeakODR:
304d5e627f8SAlex Zinenko     return llvm::GlobalValue::WeakODRLinkage;
305d5e627f8SAlex Zinenko   case LLVM::Linkage::External:
306d5e627f8SAlex Zinenko     return llvm::GlobalValue::ExternalLinkage;
307d5e627f8SAlex Zinenko   }
308d5e627f8SAlex Zinenko   llvm_unreachable("unknown linkage type");
309d5e627f8SAlex Zinenko }
310d5e627f8SAlex Zinenko 
311c335d9d3SAlex Zinenko // Create named global variables that correspond to llvm.mlir.global
312c335d9d3SAlex Zinenko // definitions.
313b9ff2dd8SAlex Zinenko void ModuleTranslation::convertGlobals() {
314*44fc7d72STres Popp   for (auto op : getModuleBody(mlirModule).getOps<LLVM::GlobalOp>()) {
315250a11aeSJames Molloy     llvm::Type *type = op.getType().getUnderlyingType();
316250a11aeSJames Molloy     llvm::Constant *cst = llvm::UndefValue::get(type);
317250a11aeSJames Molloy     if (op.getValueOrNull()) {
31868451df2SAlex Zinenko       // String attributes are treated separately because they cannot appear as
31968451df2SAlex Zinenko       // in-function constants and are thus not supported by getLLVMConstant.
32033a3a91bSChristian Sigg       if (auto strAttr = op.getValueOrNull().dyn_cast_or_null<StringAttr>()) {
3212dd38b09SAlex Zinenko         cst = llvm::ConstantDataArray::getString(
32268451df2SAlex Zinenko             llvmModule->getContext(), strAttr.getValue(), /*AddNull=*/false);
3232dd38b09SAlex Zinenko         type = cst->getType();
3242dd38b09SAlex Zinenko       } else {
32533a3a91bSChristian Sigg         cst = getLLVMConstant(type, op.getValueOrNull(), op.getLoc());
32668451df2SAlex Zinenko       }
327250a11aeSJames Molloy     } else if (Block *initializer = op.getInitializerBlock()) {
328250a11aeSJames Molloy       llvm::IRBuilder<> builder(llvmModule->getContext());
329250a11aeSJames Molloy       for (auto &op : initializer->without_terminator()) {
330250a11aeSJames Molloy         if (failed(convertOperation(op, builder)) ||
331250a11aeSJames Molloy             !isa<llvm::Constant>(valueMapping.lookup(op.getResult(0)))) {
332250a11aeSJames Molloy           emitError(op.getLoc(), "unemittable constant value");
333250a11aeSJames Molloy           return;
334250a11aeSJames Molloy         }
335250a11aeSJames Molloy       }
336250a11aeSJames Molloy       ReturnOp ret = cast<ReturnOp>(initializer->getTerminator());
337250a11aeSJames Molloy       cst = cast<llvm::Constant>(valueMapping.lookup(ret.getOperand(0)));
338250a11aeSJames Molloy     }
33968451df2SAlex Zinenko 
340d5e627f8SAlex Zinenko     auto linkage = convertLinkageType(op.linkage());
341d5e627f8SAlex Zinenko     bool anyExternalLinkage =
342d5e627f8SAlex Zinenko         (linkage == llvm::GlobalVariable::ExternalLinkage ||
343d5e627f8SAlex Zinenko          linkage == llvm::GlobalVariable::ExternalWeakLinkage);
344e79bfefbSMLIR Team     auto addrSpace = op.addr_space().getLimitedValue();
345e79bfefbSMLIR Team     auto *var = new llvm::GlobalVariable(
346d5e627f8SAlex Zinenko         *llvmModule, type, op.constant(), linkage,
347d5e627f8SAlex Zinenko         anyExternalLinkage ? nullptr : cst, op.sym_name(),
348d5e627f8SAlex Zinenko         /*InsertBefore=*/nullptr, llvm::GlobalValue::NotThreadLocal, addrSpace);
349e79bfefbSMLIR Team 
3502dd38b09SAlex Zinenko     globalsMapping.try_emplace(op, var);
351b9ff2dd8SAlex Zinenko   }
352b9ff2dd8SAlex Zinenko }
353b9ff2dd8SAlex Zinenko 
3545d7231d8SStephan Herhut // Get the SSA value passed to the current block from the terminator operation
3555d7231d8SStephan Herhut // of its predecessor.
3565d7231d8SStephan Herhut static Value *getPHISourceValue(Block *current, Block *pred,
3575d7231d8SStephan Herhut                                 unsigned numArguments, unsigned index) {
3585d7231d8SStephan Herhut   auto &terminator = *pred->getTerminator();
359d5b60ee8SRiver Riddle   if (isa<LLVM::BrOp>(terminator)) {
3605d7231d8SStephan Herhut     return terminator.getOperand(index);
3615d7231d8SStephan Herhut   }
3625d7231d8SStephan Herhut 
3635d7231d8SStephan Herhut   // For conditional branches, we need to check if the current block is reached
3645d7231d8SStephan Herhut   // through the "true" or the "false" branch and take the relevant operands.
365c5ecf991SRiver Riddle   auto condBranchOp = dyn_cast<LLVM::CondBrOp>(terminator);
3665d7231d8SStephan Herhut   assert(condBranchOp &&
3675d7231d8SStephan Herhut          "only branch operations can be terminators of a block that "
3685d7231d8SStephan Herhut          "has successors");
3695d7231d8SStephan Herhut   assert((condBranchOp.getSuccessor(0) != condBranchOp.getSuccessor(1)) &&
3705d7231d8SStephan Herhut          "successors with arguments in LLVM conditional branches must be "
3715d7231d8SStephan Herhut          "different blocks");
3725d7231d8SStephan Herhut 
3735d7231d8SStephan Herhut   return condBranchOp.getSuccessor(0) == current
3745d7231d8SStephan Herhut              ? terminator.getSuccessorOperand(0, index)
3755d7231d8SStephan Herhut              : terminator.getSuccessorOperand(1, index);
3765d7231d8SStephan Herhut }
3775d7231d8SStephan Herhut 
3785e7959a3SAlex Zinenko void ModuleTranslation::connectPHINodes(LLVMFuncOp func) {
3795d7231d8SStephan Herhut   // Skip the first block, it cannot be branched to and its arguments correspond
3805d7231d8SStephan Herhut   // to the arguments of the LLVM function.
3815d7231d8SStephan Herhut   for (auto it = std::next(func.begin()), eit = func.end(); it != eit; ++it) {
3825d7231d8SStephan Herhut     Block *bb = &*it;
3835d7231d8SStephan Herhut     llvm::BasicBlock *llvmBB = blockMapping.lookup(bb);
3845d7231d8SStephan Herhut     auto phis = llvmBB->phis();
3855d7231d8SStephan Herhut     auto numArguments = bb->getNumArguments();
3865d7231d8SStephan Herhut     assert(numArguments == std::distance(phis.begin(), phis.end()));
3875d7231d8SStephan Herhut     for (auto &numberedPhiNode : llvm::enumerate(phis)) {
3885d7231d8SStephan Herhut       auto &phiNode = numberedPhiNode.value();
3895d7231d8SStephan Herhut       unsigned index = numberedPhiNode.index();
3905d7231d8SStephan Herhut       for (auto *pred : bb->getPredecessors()) {
3915d7231d8SStephan Herhut         phiNode.addIncoming(valueMapping.lookup(getPHISourceValue(
3925d7231d8SStephan Herhut                                 bb, pred, numArguments, index)),
3935d7231d8SStephan Herhut                             blockMapping.lookup(pred));
3945d7231d8SStephan Herhut       }
3955d7231d8SStephan Herhut     }
3965d7231d8SStephan Herhut   }
3975d7231d8SStephan Herhut }
3985d7231d8SStephan Herhut 
3995d7231d8SStephan Herhut // TODO(mlir-team): implement an iterative version
4005d7231d8SStephan Herhut static void topologicalSortImpl(llvm::SetVector<Block *> &blocks, Block *b) {
4015d7231d8SStephan Herhut   blocks.insert(b);
4025d7231d8SStephan Herhut   for (Block *bb : b->getSuccessors()) {
4035d7231d8SStephan Herhut     if (blocks.count(bb) == 0)
4045d7231d8SStephan Herhut       topologicalSortImpl(blocks, bb);
4055d7231d8SStephan Herhut   }
4065d7231d8SStephan Herhut }
4075d7231d8SStephan Herhut 
4085d7231d8SStephan Herhut // Sort function blocks topologically.
4095e7959a3SAlex Zinenko static llvm::SetVector<Block *> topologicalSort(LLVMFuncOp f) {
4105d7231d8SStephan Herhut   // For each blocks that has not been visited yet (i.e. that has no
4115d7231d8SStephan Herhut   // predecessors), add it to the list and traverse its successors in DFS
4125d7231d8SStephan Herhut   // preorder.
4135d7231d8SStephan Herhut   llvm::SetVector<Block *> blocks;
4145d7231d8SStephan Herhut   for (Block &b : f.getBlocks()) {
4155d7231d8SStephan Herhut     if (blocks.count(&b) == 0)
4165d7231d8SStephan Herhut       topologicalSortImpl(blocks, &b);
4175d7231d8SStephan Herhut   }
4185d7231d8SStephan Herhut   assert(blocks.size() == f.getBlocks().size() && "some blocks are not sorted");
4195d7231d8SStephan Herhut 
4205d7231d8SStephan Herhut   return blocks;
4215d7231d8SStephan Herhut }
4225d7231d8SStephan Herhut 
4235e7959a3SAlex Zinenko LogicalResult ModuleTranslation::convertOneFunction(LLVMFuncOp func) {
4245d7231d8SStephan Herhut   // Clear the block and value mappings, they are only relevant within one
4255d7231d8SStephan Herhut   // function.
4265d7231d8SStephan Herhut   blockMapping.clear();
4275d7231d8SStephan Herhut   valueMapping.clear();
428c33862b0SRiver Riddle   llvm::Function *llvmFunc = functionMapping.lookup(func.getName());
4295d7231d8SStephan Herhut   // Add function arguments to the value remapping table.
4305d7231d8SStephan Herhut   // If there was noalias info then we decorate each argument accordingly.
4315d7231d8SStephan Herhut   unsigned int argIdx = 0;
4325d7231d8SStephan Herhut   for (const auto &kvp : llvm::zip(func.getArguments(), llvmFunc->args())) {
4335d7231d8SStephan Herhut     llvm::Argument &llvmArg = std::get<1>(kvp);
4345d7231d8SStephan Herhut     BlockArgument *mlirArg = std::get<0>(kvp);
4355d7231d8SStephan Herhut 
4365d7231d8SStephan Herhut     if (auto attr = func.getArgAttrOfType<BoolAttr>(argIdx, "llvm.noalias")) {
4375d7231d8SStephan Herhut       // NB: Attribute already verified to be boolean, so check if we can indeed
4385d7231d8SStephan Herhut       // attach the attribute to this argument, based on its type.
4395d7231d8SStephan Herhut       auto argTy = mlirArg->getType().dyn_cast<LLVM::LLVMType>();
440baa1ec22SAlex Zinenko       if (!argTy.getUnderlyingType()->isPointerTy())
441baa1ec22SAlex Zinenko         return func.emitError(
4425d7231d8SStephan Herhut             "llvm.noalias attribute attached to LLVM non-pointer argument");
4435d7231d8SStephan Herhut       if (attr.getValue())
4445d7231d8SStephan Herhut         llvmArg.addAttr(llvm::Attribute::AttrKind::NoAlias);
4455d7231d8SStephan Herhut     }
4465d7231d8SStephan Herhut     valueMapping[mlirArg] = &llvmArg;
4475d7231d8SStephan Herhut     argIdx++;
4485d7231d8SStephan Herhut   }
4495d7231d8SStephan Herhut 
4505d7231d8SStephan Herhut   // First, create all blocks so we can jump to them.
4515d7231d8SStephan Herhut   llvm::LLVMContext &llvmContext = llvmFunc->getContext();
4525d7231d8SStephan Herhut   for (auto &bb : func) {
4535d7231d8SStephan Herhut     auto *llvmBB = llvm::BasicBlock::Create(llvmContext);
4545d7231d8SStephan Herhut     llvmBB->insertInto(llvmFunc);
4555d7231d8SStephan Herhut     blockMapping[&bb] = llvmBB;
4565d7231d8SStephan Herhut   }
4575d7231d8SStephan Herhut 
4585d7231d8SStephan Herhut   // Then, convert blocks one by one in topological order to ensure defs are
4595d7231d8SStephan Herhut   // converted before uses.
4605d7231d8SStephan Herhut   auto blocks = topologicalSort(func);
4615d7231d8SStephan Herhut   for (auto indexedBB : llvm::enumerate(blocks)) {
4625d7231d8SStephan Herhut     auto *bb = indexedBB.value();
463baa1ec22SAlex Zinenko     if (failed(convertBlock(*bb, /*ignoreArguments=*/indexedBB.index() == 0)))
464baa1ec22SAlex Zinenko       return failure();
4655d7231d8SStephan Herhut   }
4665d7231d8SStephan Herhut 
4675d7231d8SStephan Herhut   // Finally, after all blocks have been traversed and values mapped, connect
4685d7231d8SStephan Herhut   // the PHI nodes to the results of preceding blocks.
4695d7231d8SStephan Herhut   connectPHINodes(func);
470baa1ec22SAlex Zinenko   return success();
4715d7231d8SStephan Herhut }
4725d7231d8SStephan Herhut 
473*44fc7d72STres Popp LogicalResult ModuleTranslation::checkSupportedModuleOps(Operation *m) {
474*44fc7d72STres Popp   for (Operation &o : getModuleBody(m).getOperations())
4754dde19f0SAlex Zinenko     if (!isa<LLVM::LLVMFuncOp>(&o) && !isa<LLVM::GlobalOp>(&o) &&
476*44fc7d72STres Popp         !o.isKnownTerminator())
4774dde19f0SAlex Zinenko       return o.emitOpError("unsupported module-level operation");
4784dde19f0SAlex Zinenko   return success();
4794dde19f0SAlex Zinenko }
4804dde19f0SAlex Zinenko 
481baa1ec22SAlex Zinenko LogicalResult ModuleTranslation::convertFunctions() {
4825d7231d8SStephan Herhut   // Declare all functions first because there may be function calls that form a
4835d7231d8SStephan Herhut   // call graph with cycles.
484*44fc7d72STres Popp   for (auto function : getModuleBody(mlirModule).getOps<LLVMFuncOp>()) {
4855e7959a3SAlex Zinenko     llvm::FunctionCallee llvmFuncCst = llvmModule->getOrInsertFunction(
4865e7959a3SAlex Zinenko         function.getName(),
4875e7959a3SAlex Zinenko         llvm::cast<llvm::FunctionType>(function.getType().getUnderlyingType()));
4885d7231d8SStephan Herhut     assert(isa<llvm::Function>(llvmFuncCst.getCallee()));
489c33862b0SRiver Riddle     functionMapping[function.getName()] =
4905d7231d8SStephan Herhut         cast<llvm::Function>(llvmFuncCst.getCallee());
4915d7231d8SStephan Herhut   }
4925d7231d8SStephan Herhut 
4935d7231d8SStephan Herhut   // Convert functions.
494*44fc7d72STres Popp   for (auto function : getModuleBody(mlirModule).getOps<LLVMFuncOp>()) {
4955d7231d8SStephan Herhut     // Ignore external functions.
4965d7231d8SStephan Herhut     if (function.isExternal())
4975d7231d8SStephan Herhut       continue;
4985d7231d8SStephan Herhut 
499baa1ec22SAlex Zinenko     if (failed(convertOneFunction(function)))
500baa1ec22SAlex Zinenko       return failure();
5015d7231d8SStephan Herhut   }
5025d7231d8SStephan Herhut 
503baa1ec22SAlex Zinenko   return success();
5045d7231d8SStephan Herhut }
5055d7231d8SStephan Herhut 
506*44fc7d72STres Popp std::unique_ptr<llvm::Module>
507*44fc7d72STres Popp ModuleTranslation::prepareLLVMModule(Operation *m) {
508*44fc7d72STres Popp   auto *dialect = m->getContext()->getRegisteredDialect<LLVM::LLVMDialect>();
5095d7231d8SStephan Herhut   assert(dialect && "LLVM dialect must be registered");
5105d7231d8SStephan Herhut 
511bc5c7378SRiver Riddle   auto llvmModule = llvm::CloneModule(dialect->getLLVMModule());
5125d7231d8SStephan Herhut   if (!llvmModule)
5135d7231d8SStephan Herhut     return nullptr;
5145d7231d8SStephan Herhut 
5155d7231d8SStephan Herhut   llvm::LLVMContext &llvmContext = llvmModule->getContext();
5165d7231d8SStephan Herhut   llvm::IRBuilder<> builder(llvmContext);
5175d7231d8SStephan Herhut 
5185d7231d8SStephan Herhut   // Inject declarations for `malloc` and `free` functions that can be used in
5195d7231d8SStephan Herhut   // memref allocation/deallocation coming from standard ops lowering.
5205d7231d8SStephan Herhut   llvmModule->getOrInsertFunction("malloc", builder.getInt8PtrTy(),
5215d7231d8SStephan Herhut                                   builder.getInt64Ty());
5225d7231d8SStephan Herhut   llvmModule->getOrInsertFunction("free", builder.getVoidTy(),
5235d7231d8SStephan Herhut                                   builder.getInt8PtrTy());
5245d7231d8SStephan Herhut 
5255d7231d8SStephan Herhut   return llvmModule;
5265d7231d8SStephan Herhut }
5275d7231d8SStephan Herhut 
5285d7231d8SStephan Herhut } // namespace LLVM
5295d7231d8SStephan Herhut } // namespace mlir
530