summaryrefslogtreecommitdiffstats
path: root/clang/lib/Serialization/MultiOnDiskHashTable.h
diff options
context:
space:
mode:
Diffstat (limited to 'clang/lib/Serialization/MultiOnDiskHashTable.h')
-rw-r--r--clang/lib/Serialization/MultiOnDiskHashTable.h323
1 files changed, 0 insertions, 323 deletions
diff --git a/clang/lib/Serialization/MultiOnDiskHashTable.h b/clang/lib/Serialization/MultiOnDiskHashTable.h
deleted file mode 100644
index 704c6343a1c..00000000000
--- a/clang/lib/Serialization/MultiOnDiskHashTable.h
+++ /dev/null
@@ -1,323 +0,0 @@
-//===--- MultiOnDiskHashTable.h - Merged set of hash tables -----*- C++ -*-===//
-//
-// The LLVM Compiler Infrastructure
-//
-// This file is distributed under the University of Illinois Open Source
-// License. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-//
-// This file provides a hash table data structure suitable for incremental and
-// distributed storage across a set of files.
-//
-// Multiple hash tables from different files are implicitly merged to improve
-// performance, and on reload the merged table will override those from other
-// files.
-//
-//===----------------------------------------------------------------------===//
-#ifndef LLVM_CLANG_LIB_SERIALIZATION_MULTIONDISKHASHTABLE_H
-#define LLVM_CLANG_LIB_SERIALIZATION_MULTIONDISKHASHTABLE_H
-
-#include "llvm/ADT/PointerUnion.h"
-#include "llvm/Support/EndianStream.h"
-#include "llvm/Support/OnDiskHashTable.h"
-
-namespace clang {
-namespace serialization {
-
-class ModuleFile;
-
-/// \brief A collection of on-disk hash tables, merged when relevant for performance.
-template<typename Info> class MultiOnDiskHashTable {
-public:
- /// A handle to a file, used when overriding tables.
- typedef typename Info::file_type file_type;
- /// A pointer to an on-disk representation of the hash table.
- typedef const unsigned char *storage_type;
-
- typedef typename Info::external_key_type external_key_type;
- typedef typename Info::internal_key_type internal_key_type;
- typedef typename Info::data_type data_type;
- typedef typename Info::data_type_builder data_type_builder;
- typedef unsigned hash_value_type;
-
-private:
- /// \brief A hash table stored on disk.
- struct OnDiskTable {
- typedef llvm::OnDiskIterableChainedHashTable<Info> HashTable;
-
- file_type File;
- HashTable Table;
-
- OnDiskTable(file_type File, unsigned NumBuckets, unsigned NumEntries,
- storage_type Buckets, storage_type Payload, storage_type Base,
- const Info &InfoObj)
- : File(File),
- Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
- };
-
- struct MergedTable {
- std::vector<file_type> Files;
- llvm::DenseMap<internal_key_type, data_type> Data;
- };
-
- typedef llvm::PointerUnion<OnDiskTable*, MergedTable*> Table;
- typedef llvm::TinyPtrVector<void*> TableVector;
-
- /// \brief The current set of on-disk and merged tables.
- /// We manually store the opaque value of the Table because TinyPtrVector
- /// can't cope with holding a PointerUnion directly.
- /// There can be at most one MergedTable in this vector, and if present,
- /// it is the first table.
- TableVector Tables;
-
- /// \brief Files corresponding to overridden tables that we've not yet
- /// discarded.
- llvm::TinyPtrVector<file_type> PendingOverrides;
-
- struct AsOnDiskTable {
- typedef OnDiskTable *result_type;
- result_type operator()(void *P) const {
- return Table::getFromOpaqueValue(P).template get<OnDiskTable *>();
- }
- };
- typedef llvm::mapped_iterator<TableVector::iterator, AsOnDiskTable>
- table_iterator;
- typedef llvm::iterator_range<table_iterator> table_range;
-
- /// \brief The current set of on-disk tables.
- table_range tables() {
- auto Begin = Tables.begin(), End = Tables.end();
- if (getMergedTable())
- ++Begin;
- return llvm::make_range(llvm::map_iterator(Begin, AsOnDiskTable()),
- llvm::map_iterator(End, AsOnDiskTable()));
- }
-
- MergedTable *getMergedTable() const {
- // If we already have a merged table, it's the first one.
- return Tables.empty() ? nullptr : Table::getFromOpaqueValue(*Tables.begin())
- .template dyn_cast<MergedTable*>();
- }
-
- /// \brief Delete all our current on-disk tables.
- void clear() {
- if (auto *M = getMergedTable())
- delete M;
- for (auto *T : tables())
- delete T;
- }
-
- void removeOverriddenTables() {
- llvm::DenseSet<file_type> Files;
- Files.insert(PendingOverrides.begin(), PendingOverrides.end());
- Tables.erase(
- std::remove_if(tables().begin().getCurrent(), Tables.end(), [&](void *T) -> bool {
- auto *ODT = Table::getFromOpaqueValue(T).template get<OnDiskTable*>();
- return Files.count(ODT->File);
- }), Tables.end());
- PendingOverrides.clear();
- }
-
- void condense() {
- MergedTable *Merged = getMergedTable();
- if (!Merged)
- Merged = new MergedTable;
-
- // Read in all the tables and merge them together.
- // FIXME: Be smarter about which tables we merge.
- for (auto *ODT : tables()) {
- auto &HT = ODT->Table;
- Info &InfoObj = HT.getInfoObj();
-
- for (auto I = HT.data_begin(), E = HT.data_end(); I != E; ++I) {
- auto *LocalPtr = I.getItem();
-
- // FIXME: Don't rely on the OnDiskHashTable format here.
- auto L = InfoObj.ReadKeyDataLength(LocalPtr);
- const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first);
- data_type_builder ValueBuilder(Merged->Data[Key]);
- InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second,
- ValueBuilder);
- }
-
- Merged->Files.push_back(ODT->File);
- delete ODT;
- }
-
- Tables.clear();
- Tables.push_back(Table(Merged).getOpaqueValue());
- }
-
- /// The generator is permitted to read our merged table.
- template<typename ReaderInfo, typename WriterInfo>
- friend class MultiOnDiskHashTableGenerator;
-
-public:
- MultiOnDiskHashTable() {}
- MultiOnDiskHashTable(MultiOnDiskHashTable &&O)
- : Tables(std::move(O.Tables)),
- PendingOverrides(std::move(O.PendingOverrides)) {
- O.Tables.clear();
- }
- MultiOnDiskHashTable &operator=(MultiOnDiskHashTable &&O) {
- if (&O == this)
- return *this;
- clear();
- Tables = std::move(O.Tables);
- O.Tables.clear();
- PendingOverrides = std::move(O.PendingOverrides);
- return *this;
- }
- ~MultiOnDiskHashTable() { clear(); }
-
- /// \brief Add the table \p Data loaded from file \p File.
- void add(file_type File, storage_type Data, Info InfoObj = Info()) {
- using namespace llvm::support;
- storage_type Ptr = Data;
-
- uint32_t BucketOffset = endian::readNext<uint32_t, little, unaligned>(Ptr);
-
- // Read the list of overridden files.
- uint32_t NumFiles = endian::readNext<uint32_t, little, unaligned>(Ptr);
- // FIXME: Add a reserve() to TinyPtrVector so that we don't need to make
- // an additional copy.
- llvm::SmallVector<file_type, 16> OverriddenFiles;
- OverriddenFiles.reserve(NumFiles);
- for (/**/; NumFiles != 0; --NumFiles)
- OverriddenFiles.push_back(InfoObj.ReadFileRef(Ptr));
- PendingOverrides.insert(PendingOverrides.end(), OverriddenFiles.begin(),
- OverriddenFiles.end());
-
- // Read the OnDiskChainedHashTable header.
- storage_type Buckets = Data + BucketOffset;
- auto NumBucketsAndEntries =
- OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
-
- // Register the table.
- Table NewTable = new OnDiskTable(File, NumBucketsAndEntries.first,
- NumBucketsAndEntries.second,
- Buckets, Ptr, Data, std::move(InfoObj));
- Tables.push_back(NewTable.getOpaqueValue());
- }
-
- /// \brief Find and read the lookup results for \p EKey.
- data_type find(const external_key_type &EKey) {
- data_type Result;
-
- if (!PendingOverrides.empty())
- removeOverriddenTables();
-
- if (Tables.size() > Info::MaxTables)
- condense();
-
- internal_key_type Key = Info::GetInternalKey(EKey);
- auto KeyHash = Info::ComputeHash(Key);
-
- if (MergedTable *M = getMergedTable()) {
- auto It = M->Data.find(Key);
- if (It != M->Data.end())
- Result = It->second;
- }
-
- data_type_builder ResultBuilder(Result);
-
- for (auto *ODT : tables()) {
- auto &HT = ODT->Table;
- auto It = HT.find_hashed(Key, KeyHash);
- if (It != HT.end())
- HT.getInfoObj().ReadDataInto(Key, It.getDataPtr(), It.getDataLen(),
- ResultBuilder);
- }
-
- return Result;
- }
-
- /// \brief Read all the lookup results into a single value. This only makes
- /// sense if merging values across keys is meaningful.
- data_type findAll() {
- data_type Result;
- data_type_builder ResultBuilder(Result);
-
- if (!PendingOverrides.empty())
- removeOverriddenTables();
-
- if (MergedTable *M = getMergedTable()) {
- for (auto &KV : M->Data)
- Info::MergeDataInto(KV.second, ResultBuilder);
- }
-
- for (auto *ODT : tables()) {
- auto &HT = ODT->Table;
- Info &InfoObj = HT.getInfoObj();
- for (auto I = HT.data_begin(), E = HT.data_end(); I != E; ++I) {
- auto *LocalPtr = I.getItem();
-
- // FIXME: Don't rely on the OnDiskHashTable format here.
- auto L = InfoObj.ReadKeyDataLength(LocalPtr);
- const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first);
- InfoObj.ReadDataInto(Key, LocalPtr + L.first, L.second, ResultBuilder);
- }
- }
-
- return Result;
- }
-};
-
-/// \brief Writer for the on-disk hash table.
-template<typename ReaderInfo, typename WriterInfo>
-class MultiOnDiskHashTableGenerator {
- typedef MultiOnDiskHashTable<ReaderInfo> BaseTable;
- typedef llvm::OnDiskChainedHashTableGenerator<WriterInfo> Generator;
-
- Generator Gen;
-
-public:
- MultiOnDiskHashTableGenerator() : Gen() {}
-
- void insert(typename WriterInfo::key_type_ref Key,
- typename WriterInfo::data_type_ref Data, WriterInfo &Info) {
- Gen.insert(Key, Data, Info);
- }
-
- void emit(llvm::SmallVectorImpl<char> &Out, WriterInfo &Info,
- const BaseTable *Base) {
- using namespace llvm::support;
- llvm::raw_svector_ostream OutStream(Out);
-
- // Write our header information.
- {
- endian::Writer<little> Writer(OutStream);
-
- // Reserve four bytes for the bucket offset.
- Writer.write<uint32_t>(0);
-
- if (auto *Merged = Base ? Base->getMergedTable() : nullptr) {
- // Write list of overridden files.
- Writer.write<uint32_t>(Merged->Files.size());
- for (const auto &F : Merged->Files)
- Info.EmitFileRef(OutStream, F);
-
- // Add all merged entries from Base to the generator.
- for (auto &KV : Merged->Data) {
- if (!Gen.contains(KV.first, Info))
- Gen.insert(KV.first, Info.ImportData(KV.second), Info);
- }
- } else {
- Writer.write<uint32_t>(0);
- }
- }
-
- // Write the table itself.
- uint32_t BucketOffset = Gen.Emit(OutStream, Info);
-
- // Replace the first four bytes with the bucket offset.
- endian::write32le(Out.data(), BucketOffset);
- }
-};
-
-} // end namespace clang::serialization
-} // end namespace clang
-
-
-#endif
OpenPOWER on IntegriCloud