[Beignet] [PATCH 19/22 V3] Add the bit code linker into the module pass.
junyan.he at inbox.com
junyan.he at inbox.com
Mon Sep 1 02:16:22 PDT 2014
From: Junyan He <junyan.he at linux.intel.com>
The bit code linker will load the beignet.bc as a
lib module and link the module of the kernel together.
Then we will filter out all the dead bit code by create
an InternalizePass for the module.
After this stage, the ir will include the bitcode just
used by the cl kernel.
Signed-off-by: Junyan He <junyan.he at linux.intel.com>
---
backend/src/llvm/llvm_bitcode_link.cpp | 215 +++++++++++++++++++++++++++++++++
backend/src/llvm/llvm_gen_backend.hpp | 3 +
2 files changed, 218 insertions(+)
create mode 100644 backend/src/llvm/llvm_bitcode_link.cpp
diff --git a/backend/src/llvm/llvm_bitcode_link.cpp b/backend/src/llvm/llvm_bitcode_link.cpp
new file mode 100644
index 0000000..ada0795
--- /dev/null
+++ b/backend/src/llvm/llvm_bitcode_link.cpp
@@ -0,0 +1,215 @@
+/*
+ * Copyright © 2012 Intel Corporation
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+ *
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library. If not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <iostream>
+#include <sstream>
+#include <set>
+#include "llvm/IR/Function.h"
+#include "llvm/IR/Instructions.h"
+#include "llvm/IR/Module.h"
+#include "llvm/IRReader/IRReader.h"
+#include "llvm/PassManager.h"
+#include "llvm/Pass.h"
+#include "llvm/IR/IRBuilder.h"
+#include "llvm/Support/FileSystem.h"
+#include "llvm/Support/MemoryBuffer.h"
+#include "llvm/Bitcode/ReaderWriter.h"
+#include "llvm/Transforms/IPO.h"
+#include "llvm/Transforms/Utils/Cloning.h"
+#include "llvm/Support/SourceMgr.h"
+
+#include "sys/cvar.hpp"
+#include "src/GBEConfig.h"
+#include "llvm/llvm_gen_backend.hpp"
+#if LLVM_VERSION_MINOR >= 5
+#include "llvm/Linker/Linker.h"
+#else
+#include "llvm/Linker.h"
+#endif
+
+using namespace llvm;
+
+SVAR(OCL_BITCODE_LIB_PATH, OCL_BITCODE_BIN);
+
+namespace gbe
+{
+ static Module* createOclBitCodeModule(LLVMContext& ctx)
+ {
+ std::string bitCodeFiles = OCL_BITCODE_LIB_PATH;
+ std::istringstream bitCodeFilePath(bitCodeFiles);
+ std::string FilePath;
+ bool findBC = false;
+ Module* oclLib = NULL;
+ SMDiagnostic Err;
+
+ while (std::getline(bitCodeFilePath, FilePath, ':')) {
+ if(access(FilePath.c_str(), R_OK) == 0) {
+ findBC = true;
+ break;
+ }
+ }
+ assert(findBC);
+
+ oclLib = getLazyIRFileModule(FilePath, Err, ctx);
+ if (!oclLib) {
+ printf("Fatal Error: ocl lib can not be opened\n");
+ return NULL;
+ }
+
+ return oclLib;
+ }
+
+ static bool materializedFuncCall(Module& src, Module& lib, llvm::Function &KF, std::set<std::string>& MFS)
+ {
+ bool fromSrc = false;
+ for (llvm::Function::iterator B = KF.begin(), BE = KF.end(); B != BE; B++) {
+ for (BasicBlock::iterator instI = B->begin(),
+ instE = B->end(); instI != instE; ++instI) {
+ llvm::CallInst* call = dyn_cast<llvm::CallInst>(instI);
+ if (!call) {
+ continue;
+ }
+
+ if (call->getCalledFunction()->getIntrinsicID() != 0)
+ continue;
+
+ Value *Callee = call->getCalledValue();
+ const std::string fnName = Callee->getName();
+
+ if (!MFS.insert(fnName).second) {
+ continue;
+ }
+
+ fromSrc = false;
+ llvm::Function *newMF = lib.getFunction(fnName);
+ if (!newMF) {
+ newMF = src.getFunction(fnName);
+ if (!newMF) {
+ printf("Can not find the lib: %s\n", fnName.c_str());
+ return false;
+ }
+ fromSrc = true;
+ }
+
+ std::string ErrInfo;// = "Not Materializable";
+ if (!fromSrc && newMF->isMaterializable()) {
+ if (newMF->Materialize(&ErrInfo)) {
+ printf("Can not materialize the function: %s, because %s\n", fnName.c_str(), ErrInfo.c_str());
+ return false;
+ }
+ }
+
+ if (!materializedFuncCall(src, lib, *newMF, MFS))
+ return false;
+
+ }
+ }
+
+ return true;
+ }
+
+
+ Module* runBitCodeLinker(Module *mod)
+ {
+ LLVMContext& ctx = mod->getContext();
+ std::set<std::string> materializedFuncs;
+ Module* clonedLib = createOclBitCodeModule(ctx);
+ assert(clonedLib && "Can not create the beignet bitcode\n");
+
+ std::vector<const char *> kernels;
+ std::vector<const char *> builtinFuncs;
+ /* Add the memset and memcpy functions here. */
+ builtinFuncs.push_back("__gen_memcpy_gg");
+ builtinFuncs.push_back("__gen_memcpy_gp");
+ builtinFuncs.push_back("__gen_memcpy_gl");
+ builtinFuncs.push_back("__gen_memcpy_pg");
+ builtinFuncs.push_back("__gen_memcpy_pp");
+ builtinFuncs.push_back("__gen_memcpy_pl");
+ builtinFuncs.push_back("__gen_memcpy_lg");
+ builtinFuncs.push_back("__gen_memcpy_lp");
+ builtinFuncs.push_back("__gen_memcpy_ll");
+ builtinFuncs.push_back("__gen_memset_p");
+ builtinFuncs.push_back("__gen_memset_g");
+ builtinFuncs.push_back("__gen_memset_l");
+
+ for (Module::iterator SF = mod->begin(), E = mod->end(); SF != E; ++SF) {
+ if (SF->isDeclaration()) continue;
+ if (!isKernelFunction(*SF)) continue;
+ kernels.push_back(SF->getName().data());
+
+ if (!materializedFuncCall(*mod, *clonedLib, *SF, materializedFuncs)) {
+ delete clonedLib;
+ return NULL;
+ }
+ }
+
+ if (kernels.empty()) {
+ printf("One module without kernel function!\n");
+ delete clonedLib;
+ return NULL;
+ }
+
+ for (auto &f : builtinFuncs) {
+ const std::string fnName(f);
+ if (!materializedFuncs.insert(fnName).second) {
+ continue;
+ }
+
+ llvm::Function *newMF = clonedLib->getFunction(fnName);
+ if (!newMF) {
+ printf("Can not find the function: %s\n", fnName.c_str());
+ delete clonedLib;
+ return NULL;
+ }
+ std::string ErrInfo;// = "Not Materializable";
+ if (newMF->isMaterializable()) {
+ if (newMF->Materialize(&ErrInfo)) {
+ printf("Can not materialize the function: %s, because %s\n", fnName.c_str(), ErrInfo.c_str());
+ delete clonedLib;
+ return NULL;
+ }
+ }
+
+ if (!materializedFuncCall(*mod, *clonedLib, *newMF, materializedFuncs)) {
+ delete clonedLib;
+ return NULL;
+ }
+
+ kernels.push_back(f);
+ }
+
+ /* We use beignet's bitcode as dst because it will have a lot of
+ lazy functions which will not be loaded. */
+ if(Linker::LinkModules(clonedLib, mod, Linker::DestroySource, NULL)) {
+ delete clonedLib;
+ printf("Fatal Error: link the bitcode error\n");
+ return NULL;
+ }
+
+ llvm::PassManager passes;
+
+ passes.add(createInternalizePass(kernels));
+ passes.add(createGlobalDCEPass());
+
+ passes.run(*clonedLib);
+
+ return clonedLib;
+ }
+
+} // end namespace
diff --git a/backend/src/llvm/llvm_gen_backend.hpp b/backend/src/llvm/llvm_gen_backend.hpp
index cc5cdad..ee44a8a 100644
--- a/backend/src/llvm/llvm_gen_backend.hpp
+++ b/backend/src/llvm/llvm_gen_backend.hpp
@@ -98,6 +98,9 @@ namespace gbe
/*! Passer the printf function call. */
llvm::FunctionPass* createPrintfParserPass();
+ /*! Add all the function call of ocl to our bitcode. */
+ llvm::Module* runBitCodeLinker(llvm::Module *mod);
+
void* getPrintfInfo(llvm::CallInst* inst);
} /* namespace gbe */
--
1.8.3.2
More information about the Beignet
mailing list