mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 12:12:47 +01:00
ae65e281f3
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
92 lines
3.1 KiB
C++
92 lines
3.1 KiB
C++
//===- llvm-cat.cpp - LLVM module concatenation utility -------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This program is for testing features that rely on multi-module bitcode files.
|
|
// It takes a list of input modules and uses them to create a multi-module
|
|
// bitcode file.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/ADT/SmallVector.h"
|
|
#include "llvm/Bitcode/BitcodeReader.h"
|
|
#include "llvm/Bitcode/BitcodeWriter.h"
|
|
#include "llvm/IR/LLVMContext.h"
|
|
#include "llvm/IR/Module.h"
|
|
#include "llvm/IRReader/IRReader.h"
|
|
#include "llvm/Support/CommandLine.h"
|
|
#include "llvm/Support/Error.h"
|
|
#include "llvm/Support/FileSystem.h"
|
|
#include "llvm/Support/MemoryBuffer.h"
|
|
#include "llvm/Support/SourceMgr.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include <algorithm>
|
|
#include <memory>
|
|
#include <string>
|
|
#include <system_error>
|
|
#include <vector>
|
|
|
|
using namespace llvm;
|
|
|
|
static cl::opt<bool>
|
|
BinaryCat("b", cl::desc("Whether to perform binary concatenation"));
|
|
|
|
static cl::opt<std::string> OutputFilename("o", cl::Required,
|
|
cl::desc("Output filename"),
|
|
cl::value_desc("filename"));
|
|
|
|
static cl::list<std::string> InputFilenames(cl::Positional, cl::ZeroOrMore,
|
|
cl::desc("<input files>"));
|
|
|
|
int main(int argc, char **argv) {
|
|
cl::ParseCommandLineOptions(argc, argv, "Module concatenation");
|
|
|
|
ExitOnError ExitOnErr("llvm-cat: ");
|
|
LLVMContext Context;
|
|
|
|
SmallVector<char, 0> Buffer;
|
|
BitcodeWriter Writer(Buffer);
|
|
if (BinaryCat) {
|
|
for (const auto &InputFilename : InputFilenames) {
|
|
std::unique_ptr<MemoryBuffer> MB = ExitOnErr(
|
|
errorOrToExpected(MemoryBuffer::getFileOrSTDIN(InputFilename)));
|
|
std::vector<BitcodeModule> Mods = ExitOnErr(getBitcodeModuleList(*MB));
|
|
for (auto &BitcodeMod : Mods) {
|
|
Buffer.insert(Buffer.end(), BitcodeMod.getBuffer().begin(),
|
|
BitcodeMod.getBuffer().end());
|
|
Writer.copyStrtab(BitcodeMod.getStrtab());
|
|
}
|
|
}
|
|
} else {
|
|
// The string table does not own strings added to it, some of which are
|
|
// owned by the modules; keep them alive until we write the string table.
|
|
std::vector<std::unique_ptr<Module>> OwnedMods;
|
|
for (const auto &InputFilename : InputFilenames) {
|
|
SMDiagnostic Err;
|
|
std::unique_ptr<Module> M = parseIRFile(InputFilename, Err, Context);
|
|
if (!M) {
|
|
Err.print(argv[0], errs());
|
|
return 1;
|
|
}
|
|
Writer.writeModule(*M);
|
|
OwnedMods.push_back(std::move(M));
|
|
}
|
|
Writer.writeStrtab();
|
|
}
|
|
|
|
std::error_code EC;
|
|
raw_fd_ostream OS(OutputFilename, EC, sys::fs::OpenFlags::F_None);
|
|
if (EC) {
|
|
errs() << argv[0] << ": cannot open " << OutputFilename << " for writing: "
|
|
<< EC.message();
|
|
return 1;
|
|
}
|
|
|
|
OS.write(Buffer.data(), Buffer.size());
|
|
return 0;
|
|
}
|