mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2026-01-31 01:35:20 +01:00
Add a top-level STRTAB block containing a string table blob, and start storing strings for module codes FUNCTION, GLOBALVAR, ALIAS, IFUNC and COMDAT in the string table. This change allows us to share names between globals and comdats as well as between modules, and improves the efficiency of loading bitcode files by no longer using a bit encoding for symbol names. Once we start writing the irsymtab to the bitcode file we will also be able to share strings between it and the module. On my machine, link time for Chromium for Linux with ThinLTO decreases by about 7% for no-op incremental builds or about 1% for full builds. Total bitcode file size decreases by about 3%. As discussed on llvm-dev: http://lists.llvm.org/pipermail/llvm-dev/2017-April/111732.html Differential Revision: https://reviews.llvm.org/D31838 llvm-svn: 300464
110 lines
4.5 KiB
C++
110 lines
4.5 KiB
C++
//===-- llvm/Bitcode/BitcodeWriter.h - Bitcode writers ----*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This header defines interfaces to write LLVM bitcode files/streams.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_BITCODE_BITCODEWRITER_H
|
|
#define LLVM_BITCODE_BITCODEWRITER_H
|
|
|
|
#include "llvm/IR/ModuleSummaryIndex.h"
|
|
#include "llvm/MC/StringTableBuilder.h"
|
|
#include <string>
|
|
|
|
namespace llvm {
|
|
class BitstreamWriter;
|
|
class Module;
|
|
class raw_ostream;
|
|
|
|
class BitcodeWriter {
|
|
SmallVectorImpl<char> &Buffer;
|
|
std::unique_ptr<BitstreamWriter> Stream;
|
|
|
|
StringTableBuilder StrtabBuilder{StringTableBuilder::RAW};
|
|
bool WroteStrtab = false;
|
|
|
|
void writeBlob(unsigned Block, unsigned Record, StringRef Blob);
|
|
|
|
public:
|
|
/// Create a BitcodeWriter that writes to Buffer.
|
|
BitcodeWriter(SmallVectorImpl<char> &Buffer);
|
|
|
|
~BitcodeWriter();
|
|
|
|
/// Write the bitcode file's string table. This must be called exactly once
|
|
/// after all modules have been written.
|
|
void writeStrtab();
|
|
|
|
/// Copy the string table for another module into this bitcode file. This
|
|
/// should be called after copying the module itself into the bitcode file.
|
|
void copyStrtab(StringRef Strtab);
|
|
|
|
/// Write the specified module to the buffer specified at construction time.
|
|
///
|
|
/// If \c ShouldPreserveUseListOrder, encode the use-list order for each \a
|
|
/// Value in \c M. These will be reconstructed exactly when \a M is
|
|
/// deserialized.
|
|
///
|
|
/// If \c Index is supplied, the bitcode will contain the summary index
|
|
/// (currently for use in ThinLTO optimization).
|
|
///
|
|
/// \p GenerateHash enables hashing the Module and including the hash in the
|
|
/// bitcode (currently for use in ThinLTO incremental build).
|
|
///
|
|
/// If \p ModHash is non-null, when GenerateHash is true, the resulting
|
|
/// hash is written into ModHash. When GenerateHash is false, that value
|
|
/// is used as the hash instead of computing from the generated bitcode.
|
|
/// Can be used to produce the same module hash for a minimized bitcode
|
|
/// used just for the thin link as in the regular full bitcode that will
|
|
/// be used in the backend.
|
|
void writeModule(const Module *M, bool ShouldPreserveUseListOrder = false,
|
|
const ModuleSummaryIndex *Index = nullptr,
|
|
bool GenerateHash = false, ModuleHash *ModHash = nullptr);
|
|
};
|
|
|
|
/// \brief Write the specified module to the specified raw output stream.
|
|
///
|
|
/// For streams where it matters, the given stream should be in "binary"
|
|
/// mode.
|
|
///
|
|
/// If \c ShouldPreserveUseListOrder, encode the use-list order for each \a
|
|
/// Value in \c M. These will be reconstructed exactly when \a M is
|
|
/// deserialized.
|
|
///
|
|
/// If \c Index is supplied, the bitcode will contain the summary index
|
|
/// (currently for use in ThinLTO optimization).
|
|
///
|
|
/// \p GenerateHash enables hashing the Module and including the hash in the
|
|
/// bitcode (currently for use in ThinLTO incremental build).
|
|
///
|
|
/// If \p ModHash is non-null, when GenerateHash is true, the resulting
|
|
/// hash is written into ModHash. When GenerateHash is false, that value
|
|
/// is used as the hash instead of computing from the generated bitcode.
|
|
/// Can be used to produce the same module hash for a minimized bitcode
|
|
/// used just for the thin link as in the regular full bitcode that will
|
|
/// be used in the backend.
|
|
void WriteBitcodeToFile(const Module *M, raw_ostream &Out,
|
|
bool ShouldPreserveUseListOrder = false,
|
|
const ModuleSummaryIndex *Index = nullptr,
|
|
bool GenerateHash = false,
|
|
ModuleHash *ModHash = nullptr);
|
|
|
|
/// Write the specified module summary index to the given raw output stream,
|
|
/// where it will be written in a new bitcode block. This is used when
|
|
/// writing the combined index file for ThinLTO. When writing a subset of the
|
|
/// index for a distributed backend, provide the \p ModuleToSummariesForIndex
|
|
/// map.
|
|
void WriteIndexToFile(const ModuleSummaryIndex &Index, raw_ostream &Out,
|
|
const std::map<std::string, GVSummaryMapTy>
|
|
*ModuleToSummariesForIndex = nullptr);
|
|
} // End llvm namespace
|
|
|
|
#endif
|