Skip to content

Commit

Permalink
Add llvm-modextract tool.
Browse files Browse the repository at this point in the history
This program is for testing features that rely on multi-module bitcode files.
It takes a multi-module bitcode file, extracts one of the modules and writes
it to the output file.

Differential Revision: https://reviews.llvm.org/D26778

llvm-svn: 288201
  • Loading branch information
pcc committed Nov 29, 2016
1 parent 96e2915 commit cb6b920
Show file tree
Hide file tree
Showing 8 changed files with 122 additions and 1 deletion.
4 changes: 3 additions & 1 deletion llvm/include/llvm/Bitcode/BitcodeReader.h
Original file line number Diff line number Diff line change
Expand Up @@ -66,7 +66,9 @@ namespace llvm {
bool ShouldLazyLoadMetadata);

public:
ArrayRef<uint8_t> getBuffer() const { return Buffer; }
StringRef getBuffer() const {
return StringRef((const char *)Buffer.begin(), Buffer.size());
}

/// Read the bitcode module and prepare for lazy deserialization of function
/// bodies. If ShouldLazyLoadMetadata is true, lazily load metadata as well.
Expand Down
1 change: 1 addition & 0 deletions llvm/test/CMakeLists.txt
Original file line number Diff line number Diff line change
Expand Up @@ -48,6 +48,7 @@ set(LLVM_TEST_DEPENDS
llvm-lto2
llvm-mc
llvm-mcmarkup
llvm-modextract
llvm-nm
llvm-objdump
llvm-opt-report
Expand Down
1 change: 1 addition & 0 deletions llvm/test/lit.cfg
Original file line number Diff line number Diff line change
Expand Up @@ -298,6 +298,7 @@ for pattern in [r"\bbugpoint\b(?!-)",
r"\bllvm-lto2\b",
r"\bllvm-mc\b",
r"\bllvm-mcmarkup\b",
r"\bllvm-modextract\b",
r"\bllvm-nm\b",
r"\bllvm-objdump\b",
r"\bllvm-pdbdump\b",
Expand Down
12 changes: 12 additions & 0 deletions llvm/test/tools/llvm-modextract/single.ll
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
; RUN: llvm-as -o %t %s
; RUN: llvm-modextract -n 0 -o - %t | llvm-dis | FileCheck %s
; RUN: not llvm-modextract -n 1 -o - %t 2>&1 | FileCheck --check-prefix=ERROR %s
; RUN: llvm-modextract -b -n 0 -o - %t | llvm-dis | FileCheck %s
; RUN: not llvm-modextract -b -n 1 -o - %t 2>&1 | FileCheck --check-prefix=ERROR %s

; CHECK: define void @f()
; ERROR: llvm-modextract: error: module index out of range; bitcode file contains 1 module(s)

define void @f() {
ret void
}
1 change: 1 addition & 0 deletions llvm/tools/LLVMBuild.txt
Original file line number Diff line number Diff line change
Expand Up @@ -36,6 +36,7 @@ subdirectories =
llvm-lto
llvm-mc
llvm-mcmarkup
llvm-modextract
llvm-nm
llvm-objdump
llvm-pdbdump
Expand Down
10 changes: 10 additions & 0 deletions llvm/tools/llvm-modextract/CMakeLists.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
set(LLVM_LINK_COMPONENTS
IRReader
BitWriter
Core
Support
)

add_llvm_tool(llvm-modextract
llvm-modextract.cpp
)
22 changes: 22 additions & 0 deletions llvm/tools/llvm-modextract/LLVMBuild.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
;===- ./tools/llvm-modextract/LLVMBuild.txt --------------------*- Conf -*--===;
;
; The LLVM Compiler Infrastructure
;
; This file is distributed under the University of Illinois Open Source
; License. See LICENSE.TXT for details.
;
;===------------------------------------------------------------------------===;
;
; This is an LLVMBuild description file for the components in this subdirectory.
;
; For more information on the LLVMBuild system, please see:
;
; http://llvm.org/docs/LLVMBuild.html
;
;===------------------------------------------------------------------------===;

[component_0]
type = Tool
name = llvm-modextract
parent = Tools
required_libraries = BitReader BitWriter
72 changes: 72 additions & 0 deletions llvm/tools/llvm-modextract/llvm-modextract.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
//===-- llvm-modextract.cpp - LLVM module extractor utility ---------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This program is for testing features that rely on multi-module bitcode files.
// It takes a multi-module bitcode file, extracts one of the modules and writes
// it to the output file.
//
//===----------------------------------------------------------------------===//

#include "llvm/Bitcode/BitcodeReader.h"
#include "llvm/Bitcode/BitcodeWriter.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Error.h"
#include "llvm/Support/FileSystem.h"
#include "llvm/Support/ToolOutputFile.h"

using namespace llvm;

static cl::opt<bool>
BinaryExtract("b", cl::desc("Whether to perform binary extraction"));

static cl::opt<std::string> OutputFilename("o", cl::Required,
cl::desc("Output filename"),
cl::value_desc("filename"));

static cl::opt<std::string>
InputFilename(cl::Positional, cl::desc("<input bitcode>"), cl::init("-"));

static cl::opt<unsigned> ModuleIndex("n", cl::Required,
cl::desc("Index of module to extract"),
cl::value_desc("index"));

int main(int argc, char **argv) {
cl::ParseCommandLineOptions(argc, argv, "Module extractor");

ExitOnError ExitOnErr("llvm-modextract: error: ");

std::unique_ptr<MemoryBuffer> MB =
ExitOnErr(errorOrToExpected(MemoryBuffer::getFileOrSTDIN(InputFilename)));
std::vector<BitcodeModule> Ms = ExitOnErr(getBitcodeModuleList(*MB));

LLVMContext Context;
if (ModuleIndex >= Ms.size()) {
errs() << "llvm-modextract: error: module index out of range; bitcode file "
"contains "
<< Ms.size() << " module(s)\n";
return 1;
}

std::error_code EC;
std::unique_ptr<tool_output_file> Out(
new tool_output_file(OutputFilename, EC, sys::fs::F_None));
ExitOnErr(errorCodeToError(EC));

if (BinaryExtract) {
SmallVector<char, 0> Header;
BitcodeWriter Writer(Header);
Out->os() << Header << Ms[ModuleIndex].getBuffer();
return 0;
}

std::unique_ptr<Module> M = ExitOnErr(Ms[ModuleIndex].parseModule(Context));
WriteBitcodeToFile(M.get(), Out->os());

return 0;
}

0 comments on commit cb6b920

Please sign in to comment.