-
Notifications
You must be signed in to change notification settings - Fork 13.5k
[WIP][C++20][Modules] Lazily, but fully load 'HeaderFileInfo' table into memory. #140867
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
@llvm/pr-subscribers-clang-modules @llvm/pr-subscribers-clang Author: Michael Park (mpark) ChangesThis is a WIP prototype in trying to solve #140860. The approach explored here is to fully load the on-disk hash tables in each of the PCMs into memory, so that we perform The behavior is still somewhat lazy, where the loading doesn't happen until the first The following test case takes 14s before this change, and 0.18s with the change. #/usr/bin/env bash
CLANG=${CLANG:-clang++}
NUM_MODULES=${NUM_MODULES:-1000}
NUM_HEADERS=${NUM_HEADERS:-10000}
mkdir build && cd build
for i in $(seq 1 $NUM_MODULES); do > m${i}.h; done
seq 1 $NUM_MODULES | xargs -I {} -P $(nproc) bash -c "$CLANG -std=c++20 -fmodule-header m{}.h"
for i in $(seq 1 $NUM_HEADERS); do > h${i}.h; done
> a.cpp
for i in $(seq 1 $NUM_MODULES); do echo "import \"m${i}.h\";" >> a.cpp; done
for i in $(seq 1 $NUM_HEADERS); do echo "#include \"h${i}.h\"" >> a.cpp; done
echo "int main() {}" >> a.cpp
time $CLANG -std=c++20 -Wno-experimental-header-units -E a.cpp -o /dev/null \
$(for i in $(seq 1 $NUM_MODULES); do echo -n "-fmodule-file=m${i}.pcm "; done) Theoretically, this would do more work in scenarios where there are only a few modules, each with large header search tables. I tested this out with another script. This time, it produces 10 header units, each with 10,000 header includes in each of them. The main file
Other Considerations
Full diff: https://github.com/llvm/llvm-project/pull/140867.diff 3 Files Affected:
diff --git a/clang/include/clang/Serialization/ASTReader.h b/clang/include/clang/Serialization/ASTReader.h
index 57b0266af26bb..9b63ad1a7cde7 100644
--- a/clang/include/clang/Serialization/ASTReader.h
+++ b/clang/include/clang/Serialization/ASTReader.h
@@ -654,6 +654,10 @@ class ASTReader
/// Map from the TU to its lexical contents from each module file.
std::vector<std::pair<ModuleFile*, LexicalContents>> TULexicalDecls;
+ unsigned HeaderFileInfoIdx = 0;
+
+ llvm::DenseMap<FileEntryRef, HeaderFileInfo> HeaderFileInfoLookup;
+
/// Map from a DeclContext to its lookup tables.
llvm::DenseMap<const DeclContext *,
serialization::reader::DeclContextLookupTable> Lookups;
diff --git a/clang/lib/Serialization/ASTReader.cpp b/clang/lib/Serialization/ASTReader.cpp
index d068f5e163176..15ea6b25d1d92 100644
--- a/clang/lib/Serialization/ASTReader.cpp
+++ b/clang/lib/Serialization/ASTReader.cpp
@@ -4155,6 +4155,7 @@ llvm::Error ASTReader::ReadASTBlock(ModuleFile &F,
if (Record[0]) {
F.HeaderFileInfoTable = HeaderFileInfoLookupTable::Create(
(const unsigned char *)F.HeaderFileInfoTableData + Record[0],
+ (const unsigned char *)F.HeaderFileInfoTableData + sizeof(uint32_t),
(const unsigned char *)F.HeaderFileInfoTableData,
HeaderFileInfoTrait(*this, F));
@@ -6831,43 +6832,59 @@ std::optional<bool> ASTReader::isPreprocessedEntityInFileID(unsigned Index,
return false;
}
-namespace {
-
- /// Visitor used to search for information about a header file.
- class HeaderFileInfoVisitor {
- FileEntryRef FE;
- std::optional<HeaderFileInfo> HFI;
-
- public:
- explicit HeaderFileInfoVisitor(FileEntryRef FE) : FE(FE) {}
-
- bool operator()(ModuleFile &M) {
- HeaderFileInfoLookupTable *Table
- = static_cast<HeaderFileInfoLookupTable *>(M.HeaderFileInfoTable);
- if (!Table)
- return false;
+static void mergeHeaderFileInfoModuleBits(HeaderFileInfo &HFI,
+ bool isModuleHeader,
+ bool isTextualModuleHeader) {
+ HFI.isModuleHeader |= isModuleHeader;
+ if (HFI.isModuleHeader)
+ HFI.isTextualModuleHeader = false;
+ else
+ HFI.isTextualModuleHeader |= isTextualModuleHeader;
+}
- // Look in the on-disk hash table for an entry for this file name.
- HeaderFileInfoLookupTable::iterator Pos = Table->find(FE);
- if (Pos == Table->end())
- return false;
+/// Merge the header file info provided by \p OtherHFI into the current
+/// header file info (\p HFI)
+static void mergeHeaderFileInfo(HeaderFileInfo &HFI,
+ const HeaderFileInfo &OtherHFI) {
+ assert(OtherHFI.External && "expected to merge external HFI");
- HFI = *Pos;
- return true;
- }
+ HFI.isImport |= OtherHFI.isImport;
+ HFI.isPragmaOnce |= OtherHFI.isPragmaOnce;
+ mergeHeaderFileInfoModuleBits(HFI, OtherHFI.isModuleHeader,
+ OtherHFI.isTextualModuleHeader);
- std::optional<HeaderFileInfo> getHeaderFileInfo() const { return HFI; }
- };
+ if (!HFI.LazyControllingMacro.isValid())
+ HFI.LazyControllingMacro = OtherHFI.LazyControllingMacro;
-} // namespace
+ HFI.DirInfo = OtherHFI.DirInfo;
+ HFI.External = (!HFI.IsValid || HFI.External);
+ HFI.IsValid = true;
+}
HeaderFileInfo ASTReader::GetHeaderFileInfo(FileEntryRef FE) {
- HeaderFileInfoVisitor Visitor(FE);
- ModuleMgr.visit(Visitor);
- if (std::optional<HeaderFileInfo> HFI = Visitor.getHeaderFileInfo())
- return *HFI;
-
- return HeaderFileInfo();
+ for (auto Iter = ModuleMgr.begin() + HeaderFileInfoIdx, End = ModuleMgr.end();
+ Iter != End; ++Iter) {
+ if (auto *Table =
+ static_cast<HeaderFileInfoLookupTable *>(Iter->HeaderFileInfoTable)) {
+ auto& Info = Table->getInfoObj();
+ for (auto Iter = Table->data_begin(), End = Table->data_end();
+ Iter != End; ++Iter) {
+ const auto *Item = Iter.getItem();
+ // Determine the length of the key and the data.
+ const auto& [KeyLen, DataLen] = HeaderFileInfoTrait::ReadKeyDataLength(Item);
+ // Read the key.
+ const auto &Key = Info.ReadKey(Item, KeyLen);
+ if (auto EKey = Info.getFile(Key)) {
+ auto Data = Info.ReadData(Key, Item + KeyLen, DataLen);
+ auto [Iter, Inserted] = HeaderFileInfoLookup.try_emplace(*EKey, Data);
+ if (!Inserted)
+ mergeHeaderFileInfo(Iter->second, Data);
+ }
+ }
+ }
+ }
+ HeaderFileInfoIdx = ModuleMgr.size();
+ return HeaderFileInfoLookup.lookup(FE);
}
void ASTReader::ReadPragmaDiagnosticMappings(DiagnosticsEngine &Diag) {
diff --git a/clang/lib/Serialization/ASTReaderInternals.h b/clang/lib/Serialization/ASTReaderInternals.h
index 4a7794889b039..d78d9fee6042d 100644
--- a/clang/lib/Serialization/ASTReaderInternals.h
+++ b/clang/lib/Serialization/ASTReaderInternals.h
@@ -402,13 +402,12 @@ class HeaderFileInfoTrait {
data_type ReadData(internal_key_ref,const unsigned char *d, unsigned DataLen);
-private:
OptionalFileEntryRef getFile(const internal_key_type &Key);
};
/// The on-disk hash table used for known header files.
using HeaderFileInfoLookupTable =
- llvm::OnDiskChainedHashTable<HeaderFileInfoTrait>;
+ llvm::OnDiskIterableChainedHashTable<HeaderFileInfoTrait>;
} // namespace reader
|
✅ With the latest revision this PR passed the C/C++ code formatter. |
FWIW I tried running this patch through my |
Ah, I see. Thank you for trying it out! |
I didn't take a profile, but |
Gotcha. I'm planning to try an approach where we use |
This is a WIP prototype in trying to solve #140860.
The approach explored here is to fully load the on-disk hash tables in each of the PCMs into memory, so that we perform
N
(# of includes) hash table look-ups, rather thanN
(# of includes) *M
(# of loaded modules) look-ups.The behavior is still somewhat lazy, where the loading doesn't happen until the first
GetHeaderFileInfo
request. We keep track of the modules that have already been processed, so that only newly added modules get added to the in-memory hash table.The following test case takes 14s before this change, and 0.18s with the change.
Theoretically, this would do more work in scenarios where there are only a few modules, each with large header search tables. I tested this out with another script. This time, it produces 10 header units, each with 10,000 header includes in each of them. The main file
import
s the 10 header units. This loads 100,010 entries into the in-memory hash table, but still only takes 0.15s. However, I'm not sure whether this would be acceptable, and if not, what might be a better strategy here.Other Considerations
MultiOnDiskHashTable
to pull together all of the hash tables, since it would handle merging and loading into memory for performance reasons. It turns out to be kind of a pain to use withHeaderFileInfoTrait
. More importantly, we can't really afford to key by the internal key type since that only hashes on the size of the file and the hash collision gets pretty bad. Moreover, the merging and condensing strategy seems rather simple.-fmodules-eager-load-header-search-table